October 2026
We study ordered orthogonal frames of roots and maximal orthogonal subsystems in the exceptional simply-laced root systems , , and . The central structural phenomenon is that sufficiently large orthogonal frames exhibit unique completion rigidity.
For , we construct a canonical projection from the root lattice modulo onto a six-dimensional symplectic vector space over . This map identifies the root lines with the nonzero vectors of , and Euclidean orthogonality with symplectic orthogonality. Consequently, maximal orthogonal subsystems of type correspond bijectively to Lagrangian subspaces, of which there are exactly . By a dimension-cardinality argument, any orthogonal set of root lines spans a full -dimensional Lagrangian subspace, establishing that every orthogonal frame of size at least four has a unique maximal completion in .
For , the orthogonal complement of every root line is isomorphic to . Slicing and incidence double-counting prove that contains exactly maximal subsystems of type . By reducing intersections through a common root line to the Lagrangian geometry, we prove that any two distinct subsystems share at most four root lines. This establishes that every orthogonal frame of size at least five has a unique maximal completion in .
These completion theorems yield exact, closed-form enumerations for all higher frame counts: and Furthermore, single-root slicing establishes the exact reduction We show that the two closed expressions agree for every , and that this agreement reflects the geometric compatibility between the ambient cross-polytopal decomposition of and its root-complement slicing.
Let be an irreducible, simply-laced root system in a Euclidean vector space , normalized so that An ordered orthogonal -frame in is an ordered sequence satisfying We denote by the number of such ordered orthogonal -frames.
For the infinite classical families and , uniform combinatorial formulas for are well understood. In contrast, for the exceptional root systems , , and , one naturally encounters a sequence of changing orthogonal complements. This permits direct computation of small frame counts, but obscures the global geometry of large orthogonal systems.
The purpose of this paper is to make the high-order structure explicit. The main phenomenon is a rigidity statement: sufficiently large orthogonal systems determine their maximal orthogonal completion uniquely.
To avoid ambiguities involving signs, we work primarily with root lines These correspond to one-dimensional root sublattices of type . A maximal orthogonal collection of root lines therefore determines a subsystem of type .
The main results are as follows.
The symplectic model of . We construct a canonical quotient whose kernel is the radical of the induced alternating form. The resulting symplectic space identifies the root lines of with the nonzero vectors of .
Lagrangian classification. The subsystems of correspond bijectively to the -dimensional totally isotropic subspaces of . There are exactly such Lagrangians.
Unique completion in . Every orthogonal set of at least four root lines spans a Lagrangian, and hence determines a unique subsystem.
slicing. The orthogonal complement of every root line in is an root system. Incidence double-counting therefore gives exactly maximal subsystems in .
Unique completion in . Any two distinct subsystems share at most four root lines. Consequently, every orthogonal system of at least five root lines is contained in a unique subsystem.
Closed frame formulas. For the high-order ranges, and
Compatibility with slicing. For every the two descriptions of agree:
We separate standard Lie-theoretic facts from the arguments developed here.
Classical background: the root counts , , ; the root-complement identifications; the standard Weyl-group facts; the isomorphism and the existence of the maximal and systems.
Arguments developed here: the root-lattice construction of the symplectic quotient; the dimension-cardinality proof of unique completion in ; the incidence derivation of the count in ; the intersection bound for systems; the resulting unique completion theorem in ; and the closed high-order frame formulas.
Definition 1. Let be a simply-laced root system. A root line of is a pair of opposite roots We denote the set of root lines by . Thus
Two root lines are orthogonal if This is independent of the choices of representatives.
Definition 2. An orthogonal -line system is a set of pairwise orthogonal root lines. We denote the number of unordered orthogonal -line systems by .
Lemma 3. For every simply-laced root system , or equivalently,
Proof. Given an unordered set of mutually orthogonal root lines, there are ways to order them and two choices of sign for each line. Thus every unordered system produces exactly ordered frames. ◻
Definition 4. A root subsystem is of type if it consists of mutually orthogonal root lines together with their opposite roots.
If has rank , then
Lemma 5. The maximum size of an orthogonal set of root lines in is .
Proof. Suppose there were five mutually orthogonal root lines in . They would generate an subsystem of rank . The classification of rank- subsystems in gives types , , and , none of which contains . Thus no such set exists. ◻
Proposition 6. For , Hence $$\begin{array}{c|ccccc} \toprule k&1&2&3&4&\geq5\\ \midrule N_k(E_6)&72&2\,160&25\,920&51\,840&0\\ M_k(E_6)&36&270&540&135&0\\ \bottomrule \end{array}$$
Proof. There are choices for the first root. The orthogonal complement of a root in is , containing roots.
Inside , the orthogonal complement of a root is , containing roots. The orthogonal complement of a root in is , containing roots. Thus The values of follow from 3. ◻
Remark 7. The value counts the maximal systems in .
The exceptional root system has roots and therefore root lines. We now construct its symplectic model directly from the root lattice.
Let be the root lattice. Let be its dual lattice. Since we have
Set The root-lattice form induces
Lemma 8. The form is alternating and has a one-dimensional radical.
Proof. Since is even, for all . Hence for all , so is alternating.
Now belongs to the radical precisely when for all . Equivalently, Thus Since , the radical has dimension one over . ◻
Let denote the unique nonzero radical vector. In terms of fundamental weights, one may take
Definition 9. The canonical symplectic space of is Thus The form descends to a nondegenerate alternating form
Consequently, is a six-dimensional symplectic vector space.
The symplectic group has order The Weyl group satisfies and classically
Let be the quotient map
Proposition 10. The map has the following properties.
For every root ,
For roots ,
The induced map is a bijection.
For root lines ,
Proof. For (i), suppose . Then Since , this gives Hence for every root . But every root in an irreducible simply-laced root system of rank at least has a root with inner product . This is a contradiction.
For (ii), suppose Then By definition of the radical, Taking gives Hence is even. Since the inner products of two roots in a simply-laced system belong to we obtain
If then equality holds in the Cauchy–Schwarz inequality, so
It remains to exclude In that case The orthogonal complement of a root in is a root system of type . Since is irreducible of rank at least two, every root of has a root adjacent to it, i.e., there exists such that Because , Therefore which is odd, contradicting Thus is impossible, and
For (iii), there are root lines and nonzero vectors. Part (ii) gives injectivity, hence bijectivity.
For (iv), For distinct root lines, the inner product cannot be , so it belongs to . Hence it is even precisely when it is zero. Thus ◻
Definition 11. A subspace is totally isotropic if Since , the largest possible dimension of a totally isotropic subspace is . A -dimensional totally isotropic subspace is called a Lagrangian.
Proposition 12. Under the bijection , maximal orthogonal sets of root lines in correspond bijectively to Lagrangian subspaces of . Consequently every maximal orthogonal subsystem is of type .
Proof. Let be Lagrangian. It contains nonzero vectors. By 10, these correspond to seven pairwise orthogonal root lines.
Conversely, let be a maximal orthogonal set of root lines. Its image under is pairwise symplectically orthogonal. Let Then is totally isotropic, so If , then lies in a Lagrangian and would be a strictly larger orthogonal system. Thus Hence is Lagrangian and contains exactly seven nonzero vectors. ◻
Theorem 13. There are exactly maximal subsystems in .
Proof. Count ordered bases of Lagrangian subspaces.
Choose an ordered isotropic basis There are choices for .
Once is chosen, must lie in but outside , giving choices.
Finally, must lie in but outside , giving choices.
Thus there are ordered isotropic bases.
Each Lagrangian has ordered bases. Therefore ◻
Theorem 14. Let be distinct subsystems of . Then More precisely,
Proof. Let be the corresponding Lagrangians. Since they are distinct, The common root lines correspond to the nonzero vectors of . Hence For this gives ◻
Remark 15. The Lagrangians are Fano planes inside the symplectic polar space . Two distinct Lagrangians can therefore meet in the empty set, a point, or a projective line containing three points. In particular, intersection size cannot occur.
Theorem 16 (Unique completion in ). Let be an orthogonal set of root lines in . If then is contained in a unique subsystem.
Proof. Set and Since is pairwise symplectically orthogonal, is totally isotropic and therefore But contains at least four distinct nonzero vectors. A two-dimensional vector space over has only nonzero vectors. Thus Hence is Lagrangian.
Any subsystem containing corresponds to a Lagrangian containing . Since is a vector space, Both spaces have dimension , so Thus the completion is unique. ◻
Corollary 17. For every the maximal subsystems partition the set of orthogonal -line systems in .
Theorem 18. For we have Equivalently,
Proof. Every maximal subsystem contains seven mutually orthogonal root lines. By 17, every orthogonal -line system with belongs to exactly one such subsystem. Therefore Applying 3, ◻
For , multiple Lagrangians may contain the same system.
For ,
For , each root has orthogonal roots, so and hence
For , there are two types of isotropic triples. Dependent triples have the form inside a Lagrangian plane. Their number is Independent triples are bases of Lagrangians, giving Thus and
Consequently, $$\begin{array}{c|ccccccc|c} \toprule k&1&2&3&4&5&6&7&\geq8\\ \midrule N_k(E_7) &126 &7\,560 &196\,560 &1\,814\,400 &10\,886\,400 &43\,545\,600 &87\,091\,200 &0 \\ M_k(E_7) &63 &945 &4\,095 &4\,725 &2\,835 &945 &135 &0 \\ \bottomrule \end{array}$$
The root system has roots and root lines.
Lemma 19. For every root line ,
Proof. The Weyl group acts transitively on roots. It is therefore enough to consider one root.
In the standard realization of , choose The roots orthogonal to form a rank- root system. The standard root-complement classification identifies it as . Since has roots, the complement has roots, as required for . ◻
Theorem 20. The root system contains exactly maximal subsystems of type .
Proof. Consider
There are root lines. Fix one line . By 19, An subsystem containing is obtained by choosing an subsystem in this complement. There are such systems. Hence
On the other hand, each subsystem contains exactly eight root lines, so Therefore ◻
Remark 21. The value also agrees with the classical coding-theoretic description of the lattice using the extended binary Hamming code. The double-counting argument above, however, obtains the number directly from the geometry.
Theorem 22. Let be distinct subsystems of . Then
Proof. Suppose and have a common root line . Then every other common root line lies in Removing the common line , the two systems determine two systems in this slice.
If , the two induced systems are distinct. By 14, they share at most three additional root lines. Therefore If the two systems have no common line, the bound is immediate. ◻
Remark 23. Computational enumeration suggests that intersection size does not occur among distinct maximal systems. This observation is not required for any result in this paper and is not promoted to a theorem. Determining the complete intersection distribution of the maximal systems is left as an open combinatorial question.
Theorem 24. Let be an orthogonal set of root lines in . If then is contained in a unique subsystem.
Proof. Existence follows by extending any orthogonal set to a maximal orthogonal set.
For uniqueness, suppose two distinct systems contain . Then Since , this gives contradicting 22. Hence the maximal completion is unique. ◻
Corollary 25. For every the maximal subsystems partition the set of orthogonal -line systems in .
Theorem 26. For the number of ordered orthogonal -frames in is Equivalently,
Proof. By 24, every orthogonal -line system with lies in a unique maximal system. Therefore Applying 3, ◻
Proposition 27. For every one has
Proof. Choose the first root of an ordered orthogonal -frame in . There are choices.
Once is chosen, all remaining roots lie in Thus the remaining entries form an ordered orthogonal -frame in . Conversely, every such frame together with produces an ordered orthogonal -frame in .
Hence ◻
Theorem 28. For every the slicing formula and the maximal-completion formula agree:
Proof. For we have Applying the high-order formula gives Therefore
On the other hand, and Thus Since and the two expressions are equal for every ◻
Remark 29. The equality is the numerical compatibility between the roots of , the maximal systems in an slice, and the maximal systems in . The equality is not merely an arithmetic coincidence: both sides count the same high-order orthogonal-frame structures through two different geometric decompositions.
The low-order values can be obtained directly by slicing.
For ,
For , Hence
For , so
For , and therefore
For , the unique-completion formula gives the remaining values.
Thus the complete spectrum is $$\begin{array}{c|ccccccccc} \toprule k&1&2&3&4&5&6&7&8&\geq9\\ \midrule N_k(E_8) &240 &30\,240 &1\,814\,400 &47\,174\,400 &435\,456\,000 &2\,612\,736\,000 &10\,450\,944\,000 &20\,901\,888\,000 &0 \\ M_k(E_8) &120 &3\,780 &37\,800 &122\,850 &113\,400 &56\,700 &16\,200 &2\,025 &0 \\ \bottomrule \end{array}$$
In particular, the high-order values satisfy for and simultaneously
For convenient comparison, we collect the complete ordered-frame and root-line spectra of all three exceptional systems.
The table satisfies throughout the identity
The preceding calculations exhibit three distinct regimes.
The maximal orthogonal rank is , despite the ambient rank being . The complete sequence is therefore obtained by a finite chain of orthogonal complements
The geometry is governed globally by the symplectic space The root lines become the nonzero vectors, and the systems become Lagrangian subspaces.
The threshold is explained purely by finite-dimensional linear algebra: four distinct nonzero vectors cannot lie in a two-dimensional -space, while every totally isotropic subspace has dimension at most three.
The geometry inherits this structure through root-complement slicing. Every root line determines an slice, and every system is obtained by adjoining the distinguished root line to an system in that slice.
The threshold follows from the intersection bound
It is important to distinguish two independent parameters that can occur in applications to Siegel modular forms.
The integer used throughout this paper denotes the frame size, namely the number of mutually orthogonal roots in an ordered orthogonal frame.
By contrast, the integer denotes the Siegel genus of an ambient Siegel modular form.
These quantities should not be identified. In particular, the appearance of in genus-four modular-form calculations is a statement about the role of four-fold orthogonal configurations in a particular modular-form setting; it does not mean that the frame size is itself a genus parameter.
The present paper concerns the root-theoretic quantities independently of any particular Siegel genus.
Several natural questions remain.
Determine the complete intersection distribution of the maximal subsystems of . The present argument proves only the upper bound for distinct systems. Computational evidence suggests that intersection size may be absent, but this is not proved here.
Give a direct intrinsic combinatorial model for the maximal systems analogous to the Lagrangian model for .
Determine whether analogous unique-completion phenomena occur in other exceptional or non-crystallographic root configurations.
Study the incidence structures obtained from the maximal orthogonal subsystems and their intersections, including their association schemes and possible connections with coding theory.
The exceptional systems , , and exhibit markedly different global orthogonal-frame geometries.
For , maximal orthogonal systems have size four and the complete spectrum is obtained by direct orthogonal-complement enumeration.
For , reduction modulo produces a canonical six-dimensional symplectic space. The root lines become its nonzero vectors, and maximal orthogonal systems become Lagrangian subspaces. This gives exactly maximal systems and proves unique completion beginning at frame size four.
For , every root complement is . This produces exactly maximal systems. Their intersection is bounded by four root lines, and hence frame size five is the threshold for unique completion.
The resulting high-order formulas are and For these agree exactly with the root-slicing identity
Thus the enumeration of high-order orthogonal frames is controlled not merely by successive branching of root systems, but by a rigid finite-geometric completion structure.
99
N. Bourbaki, Lie Groups and Lie Algebras, Chapters 4–6, Springer, Berlin, 2002.
R. W. Carter, Conjugacy classes in the Weyl group, Compositio Math. 25 (1972), 1–59.
J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Springer, New York, 1999.
E. B. Dynkin, Semisimple subalgebras of semisimple Lie algebras, Amer. Math. Soc. Transl. Ser. 2 6 (1957), 111–244.