|
Koecher–Vinberg Theorem
In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras. It was proved independently by Max Koecher in 1957 and Ernest Vinberg in 1961. It provides a one-to-one correspondence between formally real Jordan algebras and so-called domains of positivity. Thus it links operator algebraic and convex order theoretic views on state spaces of physical systems. Statement A convex cone C is called ''regular'' if a=0 whenever both a and -a are in the closure \overline. A convex cone C in a vector space A with an inner product has a ''dual cone'' C^* = \. The cone is called ''self-dual'' when C=C^*. It is called ''homogeneous'' when to any two points a,b \in C there is a real linear transformation In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that pre . ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Operator Algebra
In functional analysis, a branch of mathematics, an operator algebra is an algebra of continuous linear operators on a topological vector space, with the multiplication given by the composition of mappings. The results obtained in the study of operator algebras are phrased in algebraic terms, while the techniques used are highly analytic.''Theory of Operator Algebras I'' By Masamichi Takesaki, Springer 2012, p vi Although the study of operator algebras is usually classified as a branch of functional analysis, it has direct applications to representation theory, differential geometry, quantum statistical mechanics, quantum information, and quantum field theory. Overview Operator algebras can be used to study arbitrary sets of operators with little algebraic relation ''simultaneously''. From this point of view, operator algebras can be regarded as a generalization of spectral theory of a single operator. In general operator algebras are non-commutative rings. An operator alge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jordan Algebra
In abstract algebra, a Jordan algebra is a nonassociative algebra over a field whose multiplication satisfies the following axioms: # xy = yx (commutative law) # (xy)(xx) = x(y(xx)) (). The product of two elements ''x'' and ''y'' in a Jordan algebra is also denoted ''x'' ∘ ''y'', particularly to avoid confusion with the product of a related associative algebra. The axioms imply that a Jordan algebra is power-associative, meaning that x^n = x \cdots x is independent of how we parenthesize this expression. They also imply that x^m (x^n y) = x^n(x^m y) for all positive integers ''m'' and ''n''. Thus, we may equivalently define a Jordan algebra to be a commutative, power-associative algebra such that for any element x, the operations of multiplying by powers x^n all commute. Jordan algebras were first introduced by to formalize the notion of an algebra of observables in quantum mechanics. They were originally called "r-number systems", but were renamed "Jordan algebras" by , ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Max Koecher
Max Koecher (; 20 January 1924 in Weimar – 7 February 1990, Lengerich (Westfalen), Lengerich) was a German mathematician. Biography Koecher studied mathematics and physics at the Georg-August-Universität in Göttingen. In 1951, he received his doctorate under Max Deuring with his work on Dirichlet series with functional equation where he introduced Koecher–Maass series. He qualified in 1954 at the Westfälische Wilhelms University in Münster. From 1962 to 1970, Koecher was department chair at the University of Munich. He retired in 1989. His main research area was the theory of Jordan algebras, where he introduced the Kantor–Koecher–Tits construction and the Koecher–Vinberg theorem. He discovered the Koecher boundedness principle in the theory of Siegel modular forms. References * * * External links *Max Koecher on Wikimedia Commons {{DEFAULTSORT:Koecher, Max 20th-century German mathematicians 1990 deaths 1924 births ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ernest Vinberg
Ernest Borisovich Vinberg (russian: Эрне́ст Бори́сович Ви́нберг; 26 July 1937 – 12 May 2020) was a Soviet and Russian mathematician, who worked on Lie groups and algebraic groups, discrete subgroups of Lie groups, invariant theory, and representation theory. He introduced Vinberg's algorithm and the Koecher–Vinberg theorem. He was a recipient of the 1997 Humboldt Prize. He was on the executive committee of the Moscow Mathematical Society. In 1983, he was an Invited Speaker with a talk on ''Discrete reflection groups in Lobachevsky spaces'' at the International Congress of Mathematicians in Warsaw. In 2010, he was elected an International Honorary Member of the American Academy of Arts and Sciences. Ernest Vinberg died from pneumonia caused by COVID-19 on 12 May 2020. Selected publications * * * editor and co-author: (contains ''Construction of the exceptional simple Lie algebras'') * with A. L. Onishchik:2012 pbk edition* with V. V. Gorbatsevi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
One-to-one Correspondence
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite sets. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jordan Algebra
In abstract algebra, a Jordan algebra is a nonassociative algebra over a field whose multiplication satisfies the following axioms: # xy = yx (commutative law) # (xy)(xx) = x(y(xx)) (). The product of two elements ''x'' and ''y'' in a Jordan algebra is also denoted ''x'' ∘ ''y'', particularly to avoid confusion with the product of a related associative algebra. The axioms imply that a Jordan algebra is power-associative, meaning that x^n = x \cdots x is independent of how we parenthesize this expression. They also imply that x^m (x^n y) = x^n(x^m y) for all positive integers ''m'' and ''n''. Thus, we may equivalently define a Jordan algebra to be a commutative, power-associative algebra such that for any element x, the operations of multiplying by powers x^n all commute. Jordan algebras were first introduced by to formalize the notion of an algebra of observables in quantum mechanics. They were originally called "r-number systems", but were renamed "Jordan algebras" by , ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Function
In mathematics, a real-valued function is called convex if the line segment between any two points on the graph of a function, graph of the function lies above the graph between the two points. Equivalently, a function is convex if its epigraph (mathematics), epigraph (the set of points on or above the graph of the function) is a convex set. A twice-differentiable function of a single variable is convex if and only if its second derivative is nonnegative on its entire domain. Well-known examples of convex functions of a single variable include the quadratic function x^2 and the exponential function e^x. In simple terms, a convex function refers to a function whose graph is shaped like a cup \cup, while a concave function's graph is shaped like a cap \cap. Convex functions play an important role in many areas of mathematics. They are especially important in the study of optimization problems where they are distinguished by a number of convenient properties. For instance, a st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order Theory
Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of order-theoretic terms can be found in the order theory glossary. Background and motivation Orders are everywhere in mathematics and related fields like computer science. The first order often discussed in primary school is the standard order on the natural numbers e.g. "2 is less than 3", "10 is greater than 5", or "Does Tom have fewer cookies than Sally?". This intuitive concept can be extended to orders on other sets of numbers, such as the integers and the reals. The idea of being greater than or less than another number is one of the basic intuitions of number systems (compare with numeral systems) in general (although one usually is also interested in the actual difference ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Cone
In linear algebra, a ''cone''—sometimes called a linear cone for distinguishing it from other sorts of cones—is a subset of a vector space that is closed under scalar multiplication; that is, is a cone if x\in C implies sx\in C for every . When the scalars are real numbers, or belong to an ordered field, one generally calls a cone a subset of a vector space that is closed under multiplication by a ''positive scalar''. In this context, a convex cone is a cone that is closed under addition, or, equivalently, a subset of a vector space that is closed under linear combinations with positive coefficients. It follows that convex cones are convex sets. In this article, only the case of scalars in an ordered field is considered. Definition A subset ''C'' of a vector space ''V'' over an ordered field ''F'' is a cone (or sometimes called a linear cone) if for each ''x'' in ''C'' and positive scalar ''α'' in ''F'', the product ''αx'' is in ''C''. Note that some authors define co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Space
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called ''vector axioms''. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space. Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities, such as forces and velocity, that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear eq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inner Product
In mathematics, an inner product space (or, rarely, a Hausdorff space, Hausdorff pre-Hilbert space) is a real vector space or a complex vector space with an operation (mathematics), operation called an inner product. The inner product of two vectors in the space is a Scalar (mathematics), scalar, often denoted with angle brackets such as in \langle a, b \rangle. Inner products allow formal definitions of intuitive geometric notions, such as lengths, angles, and orthogonality (zero inner product) of vectors. Inner product spaces generalize Euclidean vector spaces, in which the inner product is the dot product or ''scalar product'' of Cartesian coordinates. Inner product spaces of infinite Dimension (vector space), dimension are widely used in functional analysis. Inner product spaces over the Field (mathematics), field of complex numbers are sometimes referred to as unitary spaces. The first usage of the concept of a vector space with an inner product is due to Giuseppe Peano, in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Transformation
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a . In the case where V = W, a linear map is called a (linear) ''endomorphism''. Sometimes the term refers to this case, but the term "linear operator" can have different meanings for different conventions: for example, it can be used to emphasize that V and W are real vector spaces (not necessarily with V = W), or it can be used to emphasize that V is a function space, which is a common convention in functional analysis. Sometimes the term ''linear function'' has the same meaning as ''linear map ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
