scholarly journals Three Representation Types for Systems of Forms and Linear Maps

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 455
Author(s):  
Abdullah Alazemi ◽  
Milica Anđelić ◽  
Carlos M. da Fonseca ◽  
Vyacheslav Futorny ◽  
Vladimir V. Sergeichuk

We consider systems of bilinear forms and linear maps as representations of a graph with undirected and directed edges. Its vertices represent vector spaces; its undirected and directed edges represent bilinear forms and linear maps, respectively. We prove that if the problem of classifying representations of a graph has not been solved, then it is equivalent to the problem of classifying representations of pairs of linear maps or pairs consisting of a bilinear form and a linear map. Thus, there are only two essentially different unsolved classification problems for systems of forms and linear maps.

1989 ◽  
Vol 39 (1) ◽  
pp. 49-58 ◽  
Author(s):  
C.-S. Lin

In this paper we shall define a generalised A-quadratic form and prove that in some way this form and an A-bilinear form are equivalent to each other. Our result characterises that of Vukman in the sense that we use any n vectors for a fixed n ≥ 2, instead of any two vectors. Consequently, a new generalisation of an inner product space among vector spaces is obtained. This also leads to a new relationship between a 2-inner product space and a 2-normed space.


2021 ◽  
Vol 23 (07) ◽  
pp. 700-708
Author(s):  

Linear functions are commonly referred to as “linear map”, “linear operator” or “linear transformation”. In some cases, the term “homomorphism” will be used, which refers to functions from one kind of set that respect any structures on the sets; The two structures on vector spaces, scalar multiplication, and addition, are respected by linear maps from vector spaces. A linear function is commonly written with a capital L to indicate its linearity, but because we’re only looking at very specific functions, we may alternatively express it with merely f. Matrices are a helpful tool for linear transformation calculations. It’s important to understand how to find the matrix of a linear transformation as well as the properties of matrices.


2013 ◽  
Vol 63 (4) ◽  
Author(s):  
Beata Rothkegel

AbstractIn the paper we formulate a criterion for the nonsingularity of a bilinear form on a direct sum of finitely many invertible ideals of a domain. We classify these forms up to isometry and, in the case of a Dedekind domain, up to similarity.


Author(s):  
O. Jenkinson ◽  
M. Pollicott ◽  
P. Vytnova

AbstractIommi and Kiwi (J Stat Phys 135:535–546, 2009) showed that the Lyapunov spectrum of an expanding map need not be concave, and posed various problems concerning the possible number of inflection points. In this paper we answer a conjecture in Iommi and Kiwi (2009) by proving that the Lyapunov spectrum of a two branch piecewise linear map has at most two points of inflection. We then answer a question in Iommi and Kiwi (2009) by proving that there exist finite branch piecewise linear maps whose Lyapunov spectra have arbitrarily many points of inflection. This approach is used to exhibit a countable branch piecewise linear map whose Lyapunov spectrum has infinitely many points of inflection.


2020 ◽  
Vol 32 (4) ◽  
pp. 995-1026
Author(s):  
Carme Cascante ◽  
Joaquín M. Ortega

AbstractIn this paper, we show that if {b\in L^{2}(\mathbb{R}^{n})}, then the bilinear form defined on the product of the non-homogeneous Sobolev spaces {H_{s}^{2}(\mathbb{R}^{n})\times H_{s}^{2}(\mathbb{R}^{n})}, {0<s<1}, by(f,g)\in H_{s}^{2}(\mathbb{R}^{n})\times H_{s}^{2}(\mathbb{R}^{n})\to\int_{% \mathbb{R}^{n}}(\mathrm{Id}-\Delta)^{\frac{s}{2}}(fg)(\mathbf{x})b(\mathbf{x})% \mathop{}\!d\mathbf{x}is continuous if and only if the positive measure {\lvert b(\mathbf{x})\rvert^{2}\mathop{}\!d\mathbf{x}} is a trace measure for {H_{s}^{2}(\mathbb{R}^{n})}.


1972 ◽  
Vol 24 (3) ◽  
pp. 520-529 ◽  
Author(s):  
Man-Duen Choi

The objective of this paper is to give some concrete distinctions between positive linear maps and completely positive linear maps on C*-algebras of operators.Herein, C*-algebras possess an identity and are written in German type . Capital letters A, B, C stand for operators, script letters for vector spaces, small letters x, y, z for vectors. Capital Greek letters Φ, Ψ stand for linear maps on C*-algebras, small Greek letters α, β, γ for complex numbers.We denote by the collection of all n × n complex matrices. () = ⊗ is the C*-algebra of n × n matrices over .


Filomat ◽  
2018 ◽  
Vol 32 (13) ◽  
pp. 4543-4554 ◽  
Author(s):  
H. Ghahramani ◽  
Z. Pan

Let U be a unital *-algebra and ? : U ? U be a linear map behaving like a derivation or an anti-derivation at the following orthogonality conditions on elements of U: xy = 0, xy* = 0, xy = yx = 0 and xy* = y*x = 0. We characterize the map ? when U is a zero product determined algebra. Special characterizations are obtained when our results are applied to properly infinite W*-algebras and unital simple C*-algebras with a non-trivial idempotent.


Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 600
Author(s):  
Jiaqing Jiang ◽  
Kun Wang ◽  
Xin Wang

Completely positive and trace-preserving maps characterize physically implementable quantum operations. On the other hand, general linear maps, such as positive but not completely positive maps, which can not be physically implemented, are fundamental ingredients in quantum information, both in theoretical and practical perspectives. This raises the question of how well one can simulate or approximate the action of a general linear map by physically implementable operations. In this work, we introduce a systematic framework to resolve this task using the quasiprobability decomposition technique. We decompose a target linear map into a linear combination of physically implementable operations and introduce the physical implementability measure as the least amount of negative portion that the quasiprobability must pertain, which directly quantifies the cost of simulating a given map using physically implementable quantum operations. We show this measure is efficiently computable by semidefinite programs and prove several properties of this measure, such as faithfulness, additivity, and unitary invariance. We derive lower and upper bounds in terms of the Choi operator's trace norm and obtain analytic expressions for several linear maps of practical interests. Furthermore, we endow this measure with an operational meaning within the quantum error mitigation scenario: it establishes the lower bound of the sampling cost achievable via the quasiprobability decomposition technique. In particular, for parallel quantum noises, we show that global error mitigation has no advantage over local error mitigation.


Author(s):  
Sadayuki Yamamuro

AbstractThe aim of this note is to investigate the structure of general surjectivity problem for a continuous linear map between locally convex spaces. We shall do so by using the method introduced in Yamamuro (1980). Its basic notion is that of calibrations which has been introduced in Yamamuro (1975), studied in detail in Yamamuro (1979) and appliced to several problems in Yamamuro (1978) and Yamamuro (1979a).


Sign in / Sign up

Export Citation Format

Share Document