Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-11-05 (gpt-6.1-sol)
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.

A root system of rank at most 16 with 480 roots, all of squared norm 2, is D16 or E8 plus E8

Statement

Let Φ be a finite reduced crystallographic root system in a finite-dimensional positive-definite real inner-product space. Suppose every α∈Φ has ⟨α,α⟩=2, the rank of Φ is at most 16, and ∣Φ∣=480. Then Φ has rank 16 and is isomorphic to exactly one of the two root systems D16 and E8⊕E8. The integer lattice generated by its roots is isometric to the standard D16 lattice or the standard E8⊕E8 lattice, respectively.

Facts & Assumptions

Given: A finite root set Φ in a positive-definite real inner-product space, with every root of squared norm 2 and with rank at most 16.

[F1]

A reduced crystallographic root system is a finite spanning set of nonzero vectors closed under its root reflections, with integral Cartan integers and no scalar multiples other than opposite roots (Reduced crystallographic Euclidean root system).

[F2]

The connected components of the nonorthogonality graph of a reduced crystallographic root system are its unique irreducible components (Unique irreducible decomposition).

[F3]

Every nonempty irreducible reduced crystallographic root system is isomorphic to exactly one of An (n≥1), Bn (n≥2), Cn (n≥3), Dn (n≥4), E6,E7,E8,F4, or G2; the low-rank identifications include B1=C1=A1, B2=C2, D3=A3, and D2=A1⊔A1. The subscript is the rank. A base is a basis of simple roots in which every root has integral coordinates all of one sign. Its Dynkin diagram has one vertex per simple root and aijaji edges between vertices i,j, where aij=2⟨αj,αi⟩/⟨αi,αi⟩ is the Cartan integer; a multiple-edge arrow points to the shorter root. Among the listed types, the diagrams with only single edges are An (a path on n vertices), Dn for n≥4 (a trivalent diagram with arms of lengths 1,1,n−3), and E6,E7,E8 (trivalent diagrams with arms (1,2,2), (1,2,3), (1,2,4), respectively). Thus a rank-8 irreducible system with only single-edge diagrams has type A8, D8, or E8 (Classification of irreducible root systems).

[F4]

The rank is the dimension of the real span of the roots. A root-system isomorphism is a linear isomorphism carrying the root set onto the target root set and preserving every Cartan integer (Rank and isomorphism of root systems).

[F5]

The standard coordinate set is E8=D8∪(D8+h8), where D8={z∈Z8:∑izi∈2Z} and h8=(1/2,…,1/2); E8 is an even, integral, full lattice (E8 ⊕ E8 and D16+ rank-16 lattice models, The E8 and D16+ models are positive even unimodular lattices).

[L1]

The root lattice of a finite root set Ψ is Q(Ψ):=span⁡ZΨ, the additive subgroup of all finite integer combinations of its roots.

[L2]

In the coordinates of [F5], let Φ8:={x∈E8:∥x∥2=2}, W7:={x∈R8:x7+x8=0}, W6:={x∈R8:x6+x8=0, x7+x8=0}, and Φj:=Φ8∩Wj for j=6,7.

Proof

technique · direct
1.1F1F3algebra

The hypothesis gives ⟨γ,γ⟩=2 for every root γ, so for roots α,β the Cartan integer 2⟨β,α⟩/⟨α,α⟩ equals ⟨β,α⟩∈Z by [F1]. For nonparallel roots, α+β and α−β are nonzero, so positive definiteness and bilinearity give 0<⟨α±β,α±β⟩=4±2⟨β,α⟩; hence −2<⟨β,α⟩<2. This integer is therefore −1, 0, or 1. In any base, distinct simple roots are nonparallel and each has self-inner-product 2, so their Cartan integers are both zero or both equal to the same 1 or −1; their product is therefore 0 or 1, and the diagram has only single edges. By [F3], every irreducible component has type An, Dn, E6, E7, or E8.

1.2F1F2F3F4L1algebra

For n≥1, in Hn:={x∈Rn+1:∑i=1n+1xi=0} define ΨAn:={ei−ej:i≠j}, where e1,…,en+1 is the standard basis of Rn+1. For n≥4, in Rn define ΨDn:={±ei±ej:i<j}. In each set all roots have squared norm 2, pairings are integers, and the only roots on the line through a root α are ±α. For ΨAn, reflection in ei−ej exchanges coordinates i,j. For ΨDn, reflection in ei−ej exchanges those coordinates and reflection in ei+ej exchanges and negates them. These maps preserve the respective root sets, so both are reduced crystallographic root systems. The vectors αi=ei−ei+1 for 1≤i≤n form a basis of Hn for ΨAn: in a zero linear combination, coordinates 1,…,n successively force each coefficient to vanish. Every root ei−ej with i<j is αi+⋯+αj−1. For ΨDn take αi=ei−ei+1 for 1≤i<n and αn=en−1+en; coordinates 1,…,n−2 in a zero linear combination force the first n−2 coefficients to vanish, and coordinates n−1,n then force the last two to vanish. These n independent vectors form a basis of Rn. For i<j, ei−ej=∑k=ij−1αk; for i<j<n, ei+ej=∑k=ij−1αk+2∑k=jn−2αk+αn−1+αn; and for i<n, ei+en=∑k=in−2αk+αn, with empty sums taken as zero. Thus in both models every root has one sign of integral simple-root coordinates. Distinct basis roots in ΨAn have inner product −1 for consecutive indices and 0 otherwise. In ΨDn the inner product is −1 for consecutive indices 1≤i≤n−3 and for the pairs (n−2,n−1) and (n−2,n), and is 0 for every other distinct pair. Thus the diagrams are a path for ΨAn and the trivalent diagram with arms of lengths 1,1,n−3 for ΨDn; both diagrams are connected. Because each simple-root basis is connected and spans its space, every root is nonorthogonal to at least one basis root, so the nonorthogonality graph is connected and both systems are irreducible by [F2]. By [F3], these coordinate systems realize the types An and Dn used in its classification; their root counts are therefore the counts of those types, since a root-system isomorphism is a bijection on root sets [F4]. The counts are ∣An∣=2(n+12)=n(n+1) and ∣Dn∣=4(n2)=2n(n−1). The Dn roots generate Dn={z∈Zn:∑izi∈2Z}: for z∈Dn, the coefficients ci=∑j≤izj for i≤n−2, cn=(∑j≤nzj)/2, and cn−1=cn−zn are integers and give z=∑i=1n−1ci(ei−ei+1)+cn(en−1+en).

2.1step 1.2algebra

For systems whose components have only types A,D, set g(1)=2, g(2)=6, g(3)=12, and g(r)=2r(r−1) for r≥4. Step 1.2 shows that every component of rank r has at most g(r) roots: for r≤3 the listed type is Ar using the low-rank identifications in [F3], and for r≥4 the Ar count r(r+1) is at most the Dr count 2r(r−1). The function g is increasing and strictly superadditive. For a,b≥4, g(a+b)−g(a)−g(b)=4ab>0. By symmetry take a≤b; the small cases a,b≤3 are g(2)>2g(1), g(3)>g(1)+g(2), g(4)>g(1)+g(3), g(4)>2g(2), g(5)>g(2)+g(3), and g(6)>2g(3). For a=1,2,3 and b≥4, the differences are respectively 4b−2, 8b−2, and 12b, all positive. Consequently, components of total rank s with types only A,D have at most g(s) roots, with strict inequality if there is more than one component.

2.2F2F3F5step 1.2L1L2algebra

In Φ8 the integer-coordinate roots are precisely ±ei±ej and number 4(82)=112. A half-integer vector has norm squared at least 8/4=2, with equality exactly when every coordinate is ±1/2; the sum-even condition permits exactly the sign patterns with an even number of minus signs, hence 27=128 roots. Thus ∣Φ8∣=240. The roots ei−ei+1 for 1≤i≤7 and e7+e8 are linearly independent: in a zero linear combination, coordinates 1 through 6 successively force the first six coefficients to vanish, and coordinates 7,8 then force the last two to vanish. Thus they form a basis of R8. Because E8 is integral by [F5], for norm-2 roots α,β the integer ⟨β,α⟩ is integral and reflection sends β to β−⟨β,α⟩α∈E8 while preserving norm; the resulting vector is again in Φ8. All roots are nonzero and have the same norm, so the set is reduced. It is finite by the coordinate count, hence is a reduced crystallographic root system. The eight displayed basis roots have a connected nonorthogonality graph: consecutive differences pair to −1, and e7+e8 pairs to −1 with e6−e7. Every root is nonorthogonal to at least one of these basis roots, since they span R8 and every root is nonzero. Therefore the full nonorthogonality graph is connected, and [F2] makes Φ8 irreducible. Its rank is 8; the irreducible types of rank 8 with only single-edge diagrams other than E8 are A8 and D8, whose root counts 72 and 112 from step 1.2 are smaller than 240, so [F3] identifies Φ8 as type E8. Finally D8⊆Q(Φ8) and h8∈Φ8, so Q(Φ8)=D8∪(D8+h8)=E8.

3.1F1L2step 2.2algebra

The seven roots u1=e1−e2,u2=e2−e3,u3=e3−e4,u4=e4−e5,u5=e5−e6,u6=e7−e8 and v:=(−e1+e2+e3+e4+e5+e6+e7−e8)/2 lie in Φ7. They are independent: summing coordinates 1 through 6 in a zero linear relation kills all ui terms and gives 2 times the coefficient of v, so that coefficient is zero; coordinates 1 through 5 then successively force the coefficients of u1,…,u5 to vanish, and coordinate 7 forces the coefficient of u6 to vanish. The six roots w1=e1−e2,w2=e2−e3,w3=e3−e4,w4=e4−e5,w5=e1+e2 and v lie in Φ6. In a zero linear relation, coordinate 6 forces the coefficient of v to vanish; then w1,…,w4 are independent and span the sum-zero subspace of the first five coordinates, while w5 has coordinate sum 2, so all five remaining coefficients vanish. These independent sets span W7 and W6, respectively. Each Φj is finite, consists of nonzero equal-length roots, inherits integrality and reducedness from Φ8, and spans Wj. If α,β∈Φj, reflection sαβ remains in Φ8 by step 2.2 and in Wj because α is orthogonal to every normal vector defining Wj; hence each is a root system. Counting in the 112 integer and 128 half-integer roots gives ∣Φ7∣=62+64=126 (integer roots are supported in the first six coordinates or on the pair 7,8 with opposite signs; half-roots have opposite signs in positions 7,8 and an odd number of minus signs among the first six) and ∣Φ6∣=40+32=72 (integer roots are supported in the first five coordinates; half-roots have x6=x7=−x8 and the first-five sign parity is then forced).

4.1F2F3step 1.2step 2.1step 2.2step 3.1algebra

The rank-6 system Φ6 cannot have only A or D components, because step 2.1 bounds these by g(6)=60 roots; it has no component of rank greater than 6, so its 72 roots force one irreducible E6 component occupying all six ranks. If the rank-7 system Φ7 had no E7 component, it would have at most g(7)=84 roots from A,D components or 72+g(1)=74 roots if it contained E6, both below 126; hence it is type E7. Thus the coordinate root counts of types E6,E7,E8 are 72,126,240.

5.1F2F3step 1.2step 2.1step 4.1algebra

By [F2], Φ is the orthogonal union of its irreducible components, each with a diagram having only single edges. If all components have type A or D, step 2.1 gives at most g(16)=480 roots, with equality only for a single D16 component. If exactly one exceptional component occurs, the maximum totals including all remaining A,D components are 72+g(10)=252 for E6, 126+g(9)=270 for E7, and 240+g(8)=352 for E8. With two exceptional components the maximal possibilities are E6+E6 with 144+g(4)=168, E6+E7 with 198+g(3)=210, E6+E8 with 312+g(2)=318, E7+E7 with 252+g(2)=258, E7+E8 with 366+g(1)=368, and E8+E8 with 480 and no remaining rank; three exceptional components exceed rank 16. Thus 480 roots occur only for D16 or E8⊕E8, and both have rank 16.

6.1F2F3F4step 1.2step 2.2step 5.1L1∎

In the D16 case, the standard roots ±ei±ej generate the even-coordinate-sum lattice D16 by step 1.2. In the E8⊕E8 case, the orthogonal root components each generate E8 by step 2.2, so their root lattice is E8⊕E8. A root-system isomorphism preserves integer spans and, because all roots have norm squared 2, preserves their inner products; therefore the root lattice Q(Φ) is isometric to the corresponding standard coordinate lattice. The two root-system types are distinct because D16 is irreducible while E8⊕E8 has two irreducible components.

Depends on

Dependency tree · 2 levels

Sources