Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 n1 there are root systems An,Bn (n2),Cn (n3),Dn (n4) in Euclidean space, and there are root systems E6,E7,E8,F4,G2 whose Dynkin diagrams are the diagrams of the classification list.

Facts & Assumptions

Given: The standard Euclidean spaces Rn with their standard inner products, unit coordinate vectors e1,,en, and the classification list with its diagram conventions.

[L1]

A reduced crystallographic root system is a finite spanning set Φ of nonzero vectors with sα(Φ)=Φ, integral Cartan integers 2(β,α)/(α,α), and RαΦ={±α} (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).

[L2]

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.

[L3]

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

technique · direct
1.1

(Type An.) In E={xRn+1:ixi=0} put Φ={eiej:ij}; it is finite, nonempty, spans E, and contains no zero vector. For α=eiej the reflection sα sends ei to ej, ej to ei and fixes every other coordinate vector, so it permutes Φ and ΦRα={±α}; the Cartan integers are 2(ekel,eiej)/2{0,±1,±2}. For the regular functional x(x,(n+1,n,,1)), the positive roots are eiej with i<j; each is k=ij1(ekek+1), and only the adjacent differences are indecomposable. Thus the simple roots are eiei+1 for 1in, whose Cartan matrix is An.

L1algebra
1.2

(Types Bn and Cn.) In Rn put ΦB={±ei}{±ei±ej:i<j} and ΦC={±2ei}{±ei±ej:i<j}. Both are finite, span Rn, omit 0, and are reduced. Reflections: sei negates the i-th coordinate, s2ei does the same, and sei±ej permutes or changes the signs of coordinates i,j and fixes the others, so each reflection permutes ΦB and ΦC. Integrality is checked directly from (ek,el)=δkl: for ΦB the Cartan integers lie in {0,±1,±2}, and for ΦC the values 2(β,2ei)/(2ei,2ei)=βi and 2(β,α)/(α,α) with α of the second kind are likewise integers in {0,±1,±2}. For a regular vector with t1>>tn>0, direct expansion of the positive roots eiej,ei+ej,ei for Bn, and eiej,ei+ej,2ei for Cn, shows that their simple roots are respectively e1e2,,en1en,en and e1e2,,en1en,2en; their Cartan matrices are Bn and Cn.

L1algebra
1.3

(Type Dn.) In Rn put ΦD={±ei±ej:i<j} for n4. It is finite, spans, is reduced, and each reflection sei±ej fixes the other coordinates or changes their signs, so it permutes ΦD; the Cartan integers are 0,±1,±2. For a regular vector with t1>>tn>0, direct expansion of the positive roots eiej,ei+ej shows that the simple roots are e1e2,,en2en1,en1en,en1+en; their Cartan matrix is Dn.

L1algebra
1.4

(Type G2.) In R2 let α,β satisfy (α,α)=6, (β,β)=2, (α,β)=3 and put ΦG={±α,±β,±(α+β),±(α+2β),±(α+3β),±(2α+3β)}; the twelve vectors are distinct and nonzero. Direct computation gives (α,α+β)=3, (α,α+2β)=0, (α,α+3β)=3, (α,2α+3β)=3, (β,α+β)=1, (β,α+2β)=1, (β,α+3β)=3, (β,2α+3β)=0, from which the Cartan integers with denominator root α or β are seen to lie in {0,±1,±2,±3} and every root is reduced; the same formulae show sα permutes ΦG (it sends βα+β, α+ββ, α+3β2α+3β, 2α+3βα+3β, and fixes α+2β) and sβ permutes ΦG (it sends αα+3β, α+βα+2β, α+2βα+β, α+3βα, and fixes 2α+3β). These permutations put every root in the orbit of α or β: the long positive roots are α,α+3β,2α+3β and the short ones are β,α+β,α+2β; their negatives are reached by the corresponding simple reflection and conjugation. Since these permutations are orthogonal, swδ=wsδw1 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 α+β, (α+β)+β, (α+2β)+β, and α+(α+3β) into two positive roots. The coefficient pairs show that α,β cannot so decompose. Their Cartan matrix is (2132), which is the G2 diagram.

L1algebra
2.1

(Type F4.) In R4 put ΦF={±ei}{±ei±ej:i<j}{12i=14ϵiei:ϵi=±1}. It has 8+24+16=48 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 h=12ϵiei, of squared norm 1, use sh(x)=x2(x,h)h. A coordinate root maps to a half-root. For x=uei+vej, u,v{±1}, the inner product is 0 or ±1; in the latter case the reflection cancels the two occupied coordinates and leaves coefficients ±1 in the other two coordinates. For another half-root k, let m be the number of agreeing signs. Then (h,k)=(m2)/2. If m=0,4 the roots are opposite or equal and reflection negates k; if m=2 it fixes k; if m=1,3 it gives a coordinate root. Thus all reflections preserve ΦF. For a denominator root of norm 1, all inner products are half-integers, so its Cartan integers are integral. For a denominator root of norm 2 (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 ei+ej connects ei to ej. Every other root pairs nontrivially with a coordinate root. Hence the system is irreducible. By [L2], rank four permits A4,B4,C4,D4,F4; the first four constructions have respectively 20,32,32,24 roots. Thus the 48-root system has diagram F4.

L1L2L3step 1.1step 1.2step 1.3algebra
2.2

(Type E8.) Put Φ8={±ei±ej:i<j}{12i=18ϵiei:ϵi=±1, iϵi=1}. All roots have squared norm 2; the D8 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 h,k, the number m of agreeing signs is even and (h,k)=(m4)/2. For m=0,8 reflection negates k; for m=4 it fixes k; for m=2,6 the vector k(k,h)h has exactly two nonzero entries, both ±1, hence is an integer root. For a half-root h and integer root x=uei+vej, (x,h) is 0 or ±1. If it is zero reflection fixes x. Otherwise x(x,h)h is a half-root: its signs differ from those of h in six positions when (x,h)=1, and in two positions when (x,h)=1, so the parity remains even. All pairwise inner products are integers by these formulas and the integer-root calculation; with norm squared 2 this is crystallographic integrality. The integer roots form an irreducible spanning subset: their displayed D8 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 Φ8 is irreducible. It has 4(82)+27=240 roots. Equal root lengths force every diagram edge to be simple by [L1], so [L2] leaves A8,D8,E8. The first two have 72 and 112 roots by their explicit constructions; hence the diagram is E8.

L1L2L3step 1.1step 1.3algebra
3.1

(The two restrictions.) Let V7=(e7+e8), V6=V7(e6+e8), and Φi=Φ8Vi. Reflection in a root of Vi preserves Vi, so reflection closure, integrality and reducedness are inherited. In Φ7 the integer roots are the 60 roots ±ei±ej on the first six coordinates and ±(e7e8). Half-roots have ϵ7=ϵ8, giving two choices for the last pair and 32 odd-parity choices on the first six coordinates: 64 half-roots, thus 126 roots in all. The integer roots span V7. In Φ6, the last three coordinates obey x6=x7=x8. The integer roots are precisely the 40 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: 16+16=32 choices. Thus there are 72 roots. The integer roots span the first five coordinate directions, and any half-root adds the remaining direction of V6, proving spanning and rank six.

L1step 2.2algebra
4.1

(Irreducibility and identification of the restrictions.) The D6 integer roots on the first six coordinates of Φ7 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 ±(e7e8) pairs nontrivially with each half-root. Thus all roots lie in one part. The same argument for Φ6 uses the connected spanning D5 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 A6,D6,E6; the first two have 42,60 roots, whereas Φ6 has 72, giving E6. In rank seven the possibilities are A7,D7,E7, with the first two counts 56,84, whereas Φ7 has 126, giving E7.

L1L2L3step 1.1step 1.3step 3.1algebra
5.1

These constructions realize every positive-rank type stated, with the classical and G2 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 E=0, where the spanning and reflection axioms hold vacuously. No unsolved source exercise is used as a proof premise.

L1L2step 1.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1step 4.1algebra

Depends on

Used by

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