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 , the rank of is at most , and . Then has rank and is isomorphic to exactly one of the two root systems and . The integer lattice generated by its roots is isometric to the standard lattice or the standard lattice, respectively.
Facts & Assumptions
Given: A finite root set in a positive-definite real inner-product space, with every root of squared norm and with rank at most .
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).
The connected components of the nonorthogonality graph of a reduced crystallographic root system are its unique irreducible components (Unique irreducible decomposition).
Every nonempty irreducible reduced crystallographic root system is isomorphic to exactly one of (), (), (), (), , or ; the low-rank identifications include , , , and . 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 edges between vertices , where is the Cartan integer; a multiple-edge arrow points to the shorter root. Among the listed types, the diagrams with only single edges are (a path on vertices), for (a trivalent diagram with arms of lengths ), and (trivalent diagrams with arms , , , respectively). Thus a rank-8 irreducible system with only single-edge diagrams has type , , or (Classification of irreducible root systems).
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).
The standard coordinate set is , where and ; is an even, integral, full lattice (E8 ⊕ E8 and D16+ rank-16 lattice models, The E8 and D16+ models are positive even unimodular lattices).
The root lattice of a finite root set is , the additive subgroup of all finite integer combinations of its roots.
In the coordinates of [F5], let , , , and for .
Proof
The hypothesis gives for every root , so for roots the Cartan integer equals by [F1]. For nonparallel roots, and are nonzero, so positive definiteness and bilinearity give ; hence . This integer is therefore , , or . In any base, distinct simple roots are nonparallel and each has self-inner-product , so their Cartan integers are both zero or both equal to the same or ; their product is therefore or , and the diagram has only single edges. By [F3], every irreducible component has type , , , , or .
For , in define , where is the standard basis of . For , in define . In each set all roots have squared norm , pairings are integers, and the only roots on the line through a root are . For , reflection in exchanges coordinates . For , reflection in exchanges those coordinates and reflection in exchanges and negates them. These maps preserve the respective root sets, so both are reduced crystallographic root systems. The vectors for form a basis of for : in a zero linear combination, coordinates successively force each coefficient to vanish. Every root with is . For take for and ; coordinates in a zero linear combination force the first coefficients to vanish, and coordinates then force the last two to vanish. These independent vectors form a basis of . For , ; for , ; and for , , with empty sums taken as zero. Thus in both models every root has one sign of integral simple-root coordinates. Distinct basis roots in have inner product for consecutive indices and otherwise. In the inner product is for consecutive indices and for the pairs and , and is for every other distinct pair. Thus the diagrams are a path for and the trivalent diagram with arms of lengths for ; 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 and 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 and . The roots generate : for , the coefficients for , , and are integers and give .
For systems whose components have only types , set , , , and for . Step 1.2 shows that every component of rank has at most roots: for the listed type is using the low-rank identifications in [F3], and for the count is at most the count . The function is increasing and strictly superadditive. For , . By symmetry take ; the small cases are , , , , , and . For and , the differences are respectively , , and , all positive. Consequently, components of total rank with types only have at most roots, with strict inequality if there is more than one component.
In the integer-coordinate roots are precisely and number . A half-integer vector has norm squared at least , with equality exactly when every coordinate is ; the sum-even condition permits exactly the sign patterns with an even number of minus signs, hence roots. Thus . The roots for and are linearly independent: in a zero linear combination, coordinates through successively force the first six coefficients to vanish, and coordinates then force the last two to vanish. Thus they form a basis of . Because is integral by [F5], for norm-2 roots the integer is integral and reflection sends to while preserving norm; the resulting vector is again in . 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 , and pairs to with . Every root is nonorthogonal to at least one of these basis roots, since they span and every root is nonzero. Therefore the full nonorthogonality graph is connected, and [F2] makes irreducible. Its rank is ; the irreducible types of rank with only single-edge diagrams other than are and , whose root counts and from step 1.2 are smaller than , so [F3] identifies as type . Finally and , so .
The seven roots and lie in . They are independent: summing coordinates through in a zero linear relation kills all terms and gives times the coefficient of , so that coefficient is zero; coordinates through then successively force the coefficients of to vanish, and coordinate forces the coefficient of to vanish. The six roots and lie in . In a zero linear relation, coordinate forces the coefficient of to vanish; then are independent and span the sum-zero subspace of the first five coordinates, while has coordinate sum , so all five remaining coefficients vanish. These independent sets span and , respectively. Each is finite, consists of nonzero equal-length roots, inherits integrality and reducedness from , and spans . If , reflection remains in by step 2.2 and in because is orthogonal to every normal vector defining ; hence each is a root system. Counting in the integer and half-integer roots gives (integer roots are supported in the first six coordinates or on the pair with opposite signs; half-roots have opposite signs in positions and an odd number of minus signs among the first six) and (integer roots are supported in the first five coordinates; half-roots have and the first-five sign parity is then forced).
The rank-6 system cannot have only or components, because step 2.1 bounds these by roots; it has no component of rank greater than , so its roots force one irreducible component occupying all six ranks. If the rank-7 system had no component, it would have at most roots from components or roots if it contained , both below ; hence it is type . Thus the coordinate root counts of types are .
By [F2], is the orthogonal union of its irreducible components, each with a diagram having only single edges. If all components have type or , step 2.1 gives at most roots, with equality only for a single component. If exactly one exceptional component occurs, the maximum totals including all remaining components are for , for , and for . With two exceptional components the maximal possibilities are with , with , with , with , with , and with and no remaining rank; three exceptional components exceed rank . Thus roots occur only for or , and both have rank .
In the case, the standard roots generate the even-coordinate-sum lattice by step 1.2. In the case, the orthogonal root components each generate by step 2.2, so their root lattice is . A root-system isomorphism preserves integer spans and, because all roots have norm squared , preserves their inner products; therefore the root lattice is isometric to the corresponding standard coordinate lattice. The two root-system types are distinct because is irreducible while has two irreducible components.