How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The roots form a reduced crystallographic Euclidean root system
Statement
Assume the Axiom of Choice. Let be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra , root set and Killing form (Root and root space, Killing form). Let be the real span of the roots and the real span of the coroots (Coroot of a Lie-algebra root). Then:
(i) every is real valued on , and restriction is a linear isomorphism ;
(ii) is a real form of , that is , and the Killing form restricted to is positive definite;
(iii) the formula where is the vector with for all (Killing-dual vector of a root), defines a positive definite inner product on , and for all roots
(iv) with this inner product, is a reduced crystallographic Euclidean root system in the sense of Reduced crystallographic Euclidean root system, and for every root the abstract reflection of that definition agrees with the reflection of Root reflection defined by a coroot;
(v) if is the base of a positive system of (Positive systems and simple roots), then is a basis of and is a basis of , hence also a basis of over .
Facts & Assumptions
Given: The Axiom of Choice, such and the Killing form of Killing form.
The Axiom of Choice is assumed; it enters only through the root-space suppliers [L1], [L2] and [L6], whose contracts carry the assumption (The Axiom of Choice).
is finite and ; the root spaces are the eigenspaces of the with , and , the zero eigenspace (Root-space decomposition, Root and root space).
Every root space is one-dimensional, and , so the roots span ; in particular contains a basis of (Root spaces of a complex semisimple Lie algebra are one-dimensional, The center is the common kernel of the roots inside the Cartan subalgebra).
is nondegenerate, the map , , is an isomorphism, and for a root the Killing-dual vector satisfies ; the coroot satisfies (Orthogonality of root spaces and nondegeneracy on the Cartan subalgebra, Killing-dual vector of a root, The Killing length of a root is nonzero, Coroot of a Lie-algebra root).
For the coroots, is an integer for all roots (Cartan integers are integers).
on , every with is diagonalisable, and the trace of an endomorphism whose characteristic polynomial factors as equals (Killing form, Toral and maximal toral subalgebras, If in , then : trace is the sum of the eigenvalues counted with algebraic multiplicity).
For roots the reflected functional is again a root, , and the only scalar multiples of that are roots are and (Root reflections preserve the root set, Root reflection defined by a coroot, Roots of a complex semisimple Lie algebra form a reduced crystallographic root system, The only scalar multiples of a root that are roots are plus or minus the root).
For a reduced crystallographic root system the base of a positive system is a basis of the ambient space (Reduced crystallographic Euclidean root system, Positive systems and simple roots, Simple roots form a signed integral basis).
Proof
By [L1] and [L2], is finite, for every , and with the zero eigenspace; hence for the operator is diagonalisable on with eigenvalues , each occurring on the one-dimensional space , together with the eigenvalue on .
The roots span over : a proper subspace of has nonzero annihilator in , so if did not span there would be with for every , contradicting [L2].
Fix and put . Since , [L4] gives for every root . Applying the trace formula of [L5] to and using step 1.1 yields The final sum is a positive integer because it contains the term ; division by therefore gives Thus is a nonzero real multiple of .
By [L3] the map , with for all , is a -linear isomorphism; since the are the images of the roots, step 1.2 shows that spans over , and step 2.1 shows that the coroots have the same complex span. Hence spans over .
Every is real valued on , because a real linear combination of coroots satisfies by [L4]; consequently, for , [L5] and step 1.1 give , and if then for all , so by [L2]; thus is positive definite.
The form is positive definite by step 4.1; in particular , because a vector in the intersection has for every root by step 4.1 and then by [L2]; moreover is a -subspace of containing the spanning set of step 3.1, hence equals , so and .
Let , say with real ; then for every by step 4.1, so restriction is a real linear map , and it is injective because a functional vanishing on vanishes on the -span of , which is by step 5.1; since by [L2] and step 5.1, the injection is an isomorphism, and spans the real space . This proves (i).
For define , where is characterised by for all ; this is bilinear, symmetric and positive definite by step 4.1, so it is an inner product on . This proves the first assertion of (iii).
For roots we have and by [L3], [L4] and step 7.1; this is the crystallographic identity in (iii), and it identifies the abstract reflection with of [L6].
The set is finite, consists of nonzero vectors and spans by step 6.1; the reflection identity of step 8.1 shows that for every , because is a root for all roots by [L6] and is involutive, so ; the crystallographic integrality condition is step 8.1; and reducedness holds because the only scalar multiples of a root that are roots are and , both of which lie in , by [L6]; hence is a reduced crystallographic Euclidean root system whose reflections are exactly the reflections of [L6]. This proves (iv).
Let be the base of a positive system of ; by [L7] it is a basis of , so under the isomorphism , , of step 6.1 the vectors form a basis of , and since is a nonzero real multiple of by [L3], the coroots also form a basis of ; because by step 5.1, that basis is a -basis of as well, which proves (v) and completes the proof.
Depends on
- Root-space decomposition
- Roots of a complex semisimple Lie algebra form a reduced crystallographic root system
- Root spaces of a complex semisimple Lie algebra are one-dimensional
- The center is the common kernel of the roots inside the Cartan subalgebra
- Orthogonality of root spaces and nondegeneracy on the Cartan subalgebra
- Killing form
- Killing-dual vector of a root
- The Killing length of a root is nonzero
- Coroot of a Lie-algebra root
- Cartan integers are integers
- Root reflections preserve the root set
- The only scalar multiples of a root that are roots are plus or minus the root
- Root reflection defined by a coroot
- Root and root space
- If $\chi_T(x)=\prod_{i<n}(x-\lambda_i)$ in $F[x]$, then $\operatorname{tr}(T)=\sum_{i<n}\lambda_i$: trace is the sum of the eigenvalues counted with algebraic multiplicity
- Toral and maximal toral subalgebras
- Reduced crystallographic Euclidean root system
- Positive systems and simple roots
- Simple roots form a signed integral basis
- The Axiom of Choice
Used by
- Integral, dominant, and strictly dominant weights Definition
- Positive and negative nilpotent subalgebras and the Borel Definition
- Root order on weights Definition
- Standard and dual representations of slₙ Example
- Chevalley basis and real structure constants Lemma
- Simple reflections preserve weight multiplicities Lemma
- Simple-root integrability bounds the dominant cyclic module Lemma
- Dominant weights in fundamental coordinates Proposition
- Finite-dimensional modules decompose into weight spaces Proposition
- Classification of real forms by Vogan diagrams Theorem
- Compact roots form a reduced crystallographic root system Theorem
- Vogan and Satake diagrams give equivalent real form classifications Theorem
Dependency tree · two levels
49 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)