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.
Existence of each classified root system
Statement
Every type of the classification list of Classification of irreducible root systems is realized by a reduced crystallographic Euclidean root system with the indicated Dynkin diagram: for every there are root systems in Euclidean space, and there are root systems whose Dynkin diagrams are the diagrams of the classification list.
Facts & Assumptions
Given: The standard Euclidean spaces with their standard inner products, unit coordinate vectors , and the classification list with its diagram conventions.
A reduced crystallographic root system is a finite spanning set of nonzero vectors with , integral Cartan integers , and (Reduced crystallographic Euclidean root system). For a positive system, its simple roots form a basis and every root has integral coordinates of one sign in that basis (Simple roots form a signed integral basis); their Cartan matrix determines the Dynkin diagram (Dynkin diagram with edge multiplicity and arrow convention).
Every nonempty irreducible root system has one of the listed diagram types, and each diagram type determines its isomorphism class (Classification of irreducible root systems). In particular, isomorphic root systems have the same number of roots.
Reducibility means a partition into two nonempty mutually orthogonal root subsets (Reducible and irreducible root systems). Thus roots joined by a chain of nonzero inner products must belong to the same part of any such partition.
Proof
(Type .) In put ; it is finite, nonempty, spans , and contains no zero vector. For the reflection sends to , to and fixes every other coordinate vector, so it permutes and ; the Cartan integers are . For the regular functional , the positive roots are with ; each is , and only the adjacent differences are indecomposable. Thus the simple roots are for , whose Cartan matrix is .
(Types and .) In put and . Both are finite, span , omit , and are reduced. Reflections: negates the -th coordinate, does the same, and permutes or changes the signs of coordinates and fixes the others, so each reflection permutes and . Integrality is checked directly from : for the Cartan integers lie in , and for the values and with of the second kind are likewise integers in . For a regular vector with , direct expansion of the positive roots for , and for , shows that their simple roots are respectively and ; their Cartan matrices are and .
(Type .) In put for . It is finite, spans, is reduced, and each reflection fixes the other coordinates or changes their signs, so it permutes ; the Cartan integers are . For a regular vector with , direct expansion of the positive roots shows that the simple roots are ; their Cartan matrix is .
(Type .) In let satisfy , , and put ; the twelve vectors are distinct and nonzero. Direct computation gives , , , , , , , , from which the Cartan integers with denominator root or are seen to lie in and every root is reduced; the same formulae show permutes (it sends , , , , and fixes ) and permutes (it sends , , , , and fixes ). These permutations put every root in the orbit of or : the long positive roots are and the short ones are ; their negatives are reached by the corresponding simple reflection and conjugation. Since these permutations are orthogonal, proves reflection invariance for every root, and invariance of inner products reduces all Cartan integers to the two denominator roots already checked. Choosing a regular vector positive on the six displayed unnegated roots makes the only indecomposable positive roots, since the other four roots have the decompositions , , , and into two positive roots. The coefficient pairs show that cannot so decompose. Their Cartan matrix is , which is the diagram.
(Type .) In put . It has roots, spans, and is reduced by inspection of the coordinate supports and absolute values. Reflections in coordinate roots and in two-coordinate roots are signed coordinate permutations, hence preserve the set. For a half-root , of squared norm , use . A coordinate root maps to a half-root. For , , the inner product is or ; in the latter case the reflection cancels the two occupied coordinates and leaves coefficients in the other two coordinates. For another half-root , let be the number of agreeing signs. Then . If the roots are opposite or equal and reflection negates ; if it fixes ; if it gives a coordinate root. Thus all reflections preserve . For a denominator root of norm , all inner products are half-integers, so its Cartan integers are integral. For a denominator root of norm (a two-coordinate root), all inner products are integers, including those with half-roots; this checks the other denominators. The coordinate roots all lie in one part of any orthogonal partition, since connects to . Every other root pairs nontrivially with a coordinate root. Hence the system is irreducible. By [L2], rank four permits ; the first four constructions have respectively roots. Thus the 48-root system has diagram .
(Type .) Put . All roots have squared norm ; the subset spans, and reducedness is immediate. Reflections in its integer roots permute coordinates and change either zero or two signs, preserving both subsets. For two half-roots , the number of agreeing signs is even and . For reflection negates ; for it fixes ; for the vector has exactly two nonzero entries, both , hence is an integer root. For a half-root and integer root , is or . If it is zero reflection fixes . Otherwise is a half-root: its signs differ from those of in six positions when , and in two positions when , so the parity remains even. All pairwise inner products are integers by these formulas and the integer-root calculation; with norm squared this is crystallographic integrality. The integer roots form an irreducible spanning subset: their displayed base has a connected chain with a fork, so all its members lie in one part of any orthogonal partition; spanning then excludes a root in the other part. Thus is irreducible. It has roots. Equal root lengths force every diagram edge to be simple by [L1], so [L2] leaves . The first two have and roots by their explicit constructions; hence the diagram is .
(The two restrictions.) Let , , and . Reflection in a root of preserves , so reflection closure, integrality and reducedness are inherited. In the integer roots are the roots on the first six coordinates and . Half-roots have , giving two choices for the last pair and odd-parity choices on the first six coordinates: half-roots, thus roots in all. The integer roots span . In , the last three coordinates obey . The integer roots are precisely the two-coordinate roots on the first five coordinates. The half-roots have last signs or , with respectively odd or even parity among the first five signs: choices. Thus there are roots. The integer roots span the first five coordinate directions, and any half-root adds the remaining direction of , proving spanning and rank six.
(Irreducibility and identification of the restrictions.) The integer roots on the first six coordinates of cannot split between orthogonal parts: their connected standard base spans those six coordinates. Every half-root has nonzero projection on that span, so pairs nontrivially with at least one such root and lies in the same part. Each of pairs nontrivially with each half-root. Thus all roots lie in one part. The same argument for uses the connected spanning base on the first five coordinates, and the nonzero projection there of every half-root. Both restrictions are therefore irreducible. Their roots have equal length, so their diagrams are simply laced. In rank six [L2] leaves ; the first two have roots, whereas has , giving . In rank seven the possibilities are , with the first two counts , whereas has , giving .
These constructions realize every positive-rank type stated, with the classical and diagrams computed from simple roots and the exceptional diagrams identified using the independently established classification and explicit root counts. The additional empty rank-zero system allowed by the local convention is realized in , where the spanning and reflection axioms hold vacuously. No unsolved source exercise is used as a proof premise.
Depends on
Used by
- Positive roots and highest root of G₂ Example
- Simple roots and fundamental weights of Aₙ Example
- B and C are always isomorphic False statement
- Simple roots are pairwise orthogonal False statement
- Duality exchanges B and C Proposition
- Root systems of the classical complex Lie algebras Proposition
- Cartan-Killing classification of complex simple Lie algebras Theorem
Dependency tree · two levels
14 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., Chapter II (standard reference, not scraped)
- Pavel Etingof, MIT 18.745 Lie Groups and Lie Algebras I, Lectures 19-24 (standard reference, not scraped)