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.
Root systems of the classical complex Lie algebras
Statement
Let be the diagonal Cartan subalgebra of one of , , , (Split Cartan subalgebras of classical matrix Lie algebras), where in the special-linear and even-orthogonal cases and in the symplectic and odd-orthogonal cases, and let be the coordinate functionals, , where the -block is . Thus the full diagonal of is in the special-linear case, in the even cases, and in the odd case. Here a root means a nonzero simultaneous adjoint weight: its root space is . Then the roots and root spaces are:
- : the roots , , with root spaces ;
- : the roots , , with difference-root spaces from the -block and sum-root spaces from the symmetric - and -blocks, as specified below, and the roots , with root spaces and ;
- : the roots , , with root spaces spanned by the corresponding block matrix units;
- : the roots , , together with the roots , with root spaces spanned by the corresponding block matrix units.
In every case every root space is one-dimensional, and the listed root sets are reduced crystallographic Euclidean root systems in their real spans, of types , , , respectively, with the low-rank identifications , , , and .
Remarks
The low-rank identifications are checked directly in step 5.1. The later example collecting those coincidences is therefore explanatory rather than a logical prerequisite, which breaks the former circular dependency.
Facts & Assumptions
Given: One of the classical matrix Lie algebras , its diagonal subalgebra , the coordinate functionals , and the matrix units .
The algebras and their block decompositions are as in Classical complex matrix Lie algebras; for diagonal and matrix units one has , and the off-diagonal block units satisfy the symmetry conditions (symplectic), (orthogonal), with the odd case adding the and blocks.
The diagonal -block with the other blocks zero gives a Cartan subalgebra; for its diagonal coordinates sum to zero (Split Cartan subalgebras of classical matrix Lie algebras, Cartan subalgebra). The simultaneous eigenbasis needed below is constructed explicitly, without a semisimplicity premise.
A regular vector determines a positive system whose indecomposable positive roots form its base; the Cartan matrix and Dynkin diagram of a base are computed from the simple-root inner products, and the classified type names have their indicated diagrams (Positive systems and simple roots, Cartan matrix of a based root system, Dynkin diagram with edge multiplicity and arrow convention, Existence of each classified root system).
A root system in the sense used here is a reduced crystallographic root system (Reduced crystallographic Euclidean root system).
Proof
In , take the off-diagonal units and a basis of the trace-zero diagonal space. The former have weights and the latter weight zero, because . These form a basis. Distinct differences remain distinct on the sum-zero hyperplane: a difference of their coefficient vectors has coordinate sum zero, and if it vanishes on that hyperplane it is a constant vector, hence zero. No such difference weight is zero for .
For the even cases, write for the full block matrix with , , hence lower diagonal block . It has weight ; has weight zero. In the symplectic case let and have respectively only or nonzero, for . Their weights are and . Also allow or , with weights and . In the even orthogonal case replace the plus sign in the off-diagonal block units by minus and omit the diagonal units. Each assertion follows entry by entry from , since the paired entries have equal weights. These matrices are a basis by the independent block parameters in [L1].
In the odd orthogonal case embed the even orthogonal basis of step 1.2 in the last rows and columns. Add with , , and with , , all zero, with their forced negative-transpose entries as in [L1]. The two nonzero entries of have weight and those of weight , because the first full diagonal entry of is zero. Together with the embedded even basis these form a basis of the odd algebra.
The bases in steps 1.1–2.1 are simultaneous eigenbases. Their nonzero weights are exactly the lists in the statement and are pairwise distinct. For the non-special-linear cases this follows by comparing coefficient vectors in the independent coordinates; in the special-linear case it was checked in step 1.1. If a linear combination is an eigenvector of weight , comparison of each basis coefficient for every makes every nonzero coefficient have weight . Thus each listed nonzero weight space is exactly its displayed line, and there are no other nonzero weight spaces. The zero weight space is precisely the diagonal Cartan. This also treats and , where the lists are empty but the two single-coordinate root vectors remain.
Give the real weight span the standard Euclidean realization: for type , identify the difference functionals with in ; otherwise identify with the orthonormal in . The lists are finite, omit zero and are reduced. They span: adjacent differences span the type hyperplane, the coordinate roots span types , and span every coordinate direction in type for . Reflection in exchanges coordinates ; reflection in exchanges and negates them; reflection in or negates coordinate . Each operation preserves the appropriate list. For denominator roots of squared length two, the Cartan integer is the integer dot product. For denominator it is and for denominator it is , again integral. These computations verify every axiom of [L4], including the smallest allowed ranks. In particular, the squared norm four of a long type root is included in the denominator calculation.
The type labels can be verified from the displayed sets rather than imported from an existence interface. Choose positives and for , together with in type or in type . The proposed bases are for type ; the same for followed by for or for ; and for followed by for . They are bases in the sense of [L3]: for example ; in type , and ; in type , and . In type , the same difference formula holds, while for , and ; hence every positive root has nonnegative integral coordinates and each height-one is indecomposable. All and simple roots have squared length two; their nonzero off-diagonal inner products are , giving the chain and, for , the fork at . For the last pair has Cartan entries , , while for they are ; all other adjacent pairs give . By [L3] these are exactly the stable-range diagrams , with the required double-edge directions, so no coordinate information is borrowed from [L3]'s supplier proof. For the small ranks, and are up to scale. The map , carries to and scales the inner product by two. The two orthogonal pairs give . For , the orthogonal vectors , , form an orthonormal basis of the sum-zero hyperplane in . The isometry maps its twelve roots onto the twelve differences of coordinate vectors in , which are . Thus all stable and low-rank type identifications follow from explicit Cartan matrices and maps.
Depends on
- Classical complex matrix Lie algebras
- Split Cartan subalgebras of classical matrix Lie algebras
- Reduced crystallographic Euclidean root system
- Positive systems and simple roots
- Cartan matrix of a based root system
- Dynkin diagram with edge multiplicity and arrow convention
- Cartan subalgebra
- Existence of each classified root system
Used by
- Classical root systems in coordinates Example
- Exterior powers and fundamental weights of slₙ Example
- Low-rank Dynkin coincidences Example
- Standard and dual representations of slₙ Example
- Symmetric powers as highest-weight modules Example
- The adjoint representation and highest root Example
- The eight-dimensional adjoint representation of sl3 Example
- Weyl groups of Bₙ and Dₙ Example
- B and C are always isomorphic False statement
- Classical types correspond to sl, so and sp Proposition
Dependency tree · two levels
19 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
- Pavel Etingof, MIT 18.745 Lie Groups and Lie Algebras I, Lectures 19-24 (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter II (standard reference, not scraped)