ADEG-Polyhedra: Finite Hyperbolic Coxeter Polyhedra
- ADEG-polyhedra are finite-volume hyperbolic Coxeter polyhedra characterized by mutually intersecting facets and dihedral angles exclusively in {π/2, π/3, π/6} with at least one π/6 angle.
- They extend the ADE family by incorporating the G₂ angle type, resulting in a finite set of 24 explicitly classified polyhedra with dimensions capped at 11.
- The classification employs Coxeter diagrams, affine subdiagrams, and admissible configurations, highlighting exceptional cases like the 9-dimensional Pₛₜₐᵣ with 14 facets.
ADEG-polyhedra are a class of finite-volume hyperbolic Coxeter polyhedra characterized by three conditions: all facets are mutually intersecting, all dihedral angles belong to , and at least one dihedral angle is . They extend Prokhorov’s ADE-polyhedra by adjoining the angle type, and the resulting family is unexpectedly rigid: the classification in hyperbolic space is finite, explicit, and bounded in dimension. The current classification theorem states that there are exactly $24$ ADEG-polyhedra, all of finite volume, all with , and combinatorially each is either a triangle or tetrahedron, a doubly-truncated simplex in , a pyramid, or the exceptional polyhedron with $14$ facets (Bredon, 7 Jul 2025).
1. Definition and Coxeter-hyperbolic framework
The ambient model is the hyperboloid model
with Lorentzian form
0
A finite-volume hyperbolic polyhedron is written as
1
where each 2 is a unit spacelike outward normal to a bounding hyperplane. Its Gram matrix is
3
with diagonal entries 4, and off-diagonal entries determined by whether the corresponding facets meet at angle 5, are parallel, or are ultraparallel (Bredon, 7 Jul 2025).
For ADEG-polyhedra, the diagrammatic condition is especially simple. In the Coxeter diagram, nodes correspond to facets, unlabeled simple edges encode angle 6, absence of an edge encodes 7, and an edge labeled 8 encodes 9. Because every pair of facets intersects in 0, ADEG diagrams contain no 1-edges. The phrase “mutually intersecting facets” is understood in 2, not only in the interior of 3. This excludes both parallel and ultraparallel facet pairs.
The name “ADEG” reflects the root-system types appearing in the spherical and affine subdiagrams of the corresponding Coxeter diagrams: only 4, 5, 6, and 7 occur. The defining 8 angle is what distinguishes ADEG-polyhedra from the earlier ADE case, where only 9 and 0 are allowed (Bredon, 7 Jul 2025).
2. Angle restrictions in high dimension
A central structural result is that large-dimensional hyperbolic Coxeter polyhedra cannot have arbitrarily small non-right dihedral angles. More precisely, if 1 and 2 is a finite-volume Coxeter polyhedron, then every non-zero dihedral angle is of the form 3 with 4. Under the stronger hypothesis that all facets are mutually intersecting, the same conclusion already holds for all 5. There is also an ideal analogue: if 6 and 7 is an ideal Coxeter polyhedron, then every non-zero dihedral angle is 8 with 9 (Bredon, 7 Jul 2025).
These propositions isolate the angle set $24$0 as a natural extremal regime. The restriction is not merely combinatorial: it arises from the interaction between high-dimensional affine subdiagrams, finite-volume criteria, and the behavior of $24$1-faces. In particular, once a diagram contains an edge $24$2 with $24$3, the codimension-$24$4 face associated to that $24$5 subdiagram forces affine structure incompatible with finite volume in the relevant dimensions.
The paper is careful about terminology here. “Non-zero dihedral angle” includes the right angle $24$6; the excluded phenomenon is the limiting zero-angle behavior associated with ideal tangency or parallelism. This distinction matters because ADEG-polyhedra, by definition, have no parallel or disjoint facets at all (Bredon, 7 Jul 2025).
3. Constructive method via $24$7-faces and admissible configurations
The classification is driven by a constructive procedure tailored to the angle set $24$8. Every ADEG-polyhedron of dimension $24$9 contains a 0-subdiagram 1, because at least one 2-angle is present. By Allcock’s theorem on faces of Coxeter polyhedra, the corresponding codimension-3 face 4 is itself a Coxeter polyhedron, and in the ADEG setting 5 is necessarily an ADE- or ADEG-polyhedron in dimension 6 (Bredon, 7 Jul 2025).
A key lemma states that if 7 and 8 is ADEG, then its Coxeter diagram contains an affine subdiagram of type 9. More precisely, there is an affine rank-0 subdiagram
1
corresponding to a non-simple ideal vertex 2. Since facets are pairwise intersecting, there are no affine components of rank 3, so no 4 components occur.
The remaining facets are encoded by vectors 5 of squared norm 6. Their incidence with the affine components is recorded by coefficients 7 and 8, constrained by the allowed angles. For each affine component one defines
9
and the collinearity of the ideal vectors forces
0
The decisive compatibility formula is Prokhorov’s relation
1
where each 2 is an explicit quadratic expression in the coefficients 3 with constants determined by the relevant root system. An admissible pair 4 is then one for which the common-5 condition holds and
6
corresponding exactly to the permitted angles 7 (Bredon, 7 Jul 2025).
This reduces classification to a finite search. One starts from lower-dimensional ADE or ADEG 8-faces, chooses a possible affine rank-9 subdiagram containing $14$0, solves the admissibility constraints for extra vectors, and then discards candidates obstructed by superhyperbolicity, forbidden affine configurations, failure of Vinberg’s finite-volume criterion, or inconsistency of the induced $14$1-faces. The procedure is inductive but finite because the lower-dimensional ADE and ADEG cases are already classified.
4. Complete classification
The classification theorem states that every ADEG-polyhedron is one of the $14$2 Coxeter polyhedra listed in the paper’s table. In particular, every ADEG-polyhedron is non-compact for $14$3, non-simple for $14$4, and satisfies $14$5. Combinatorially, it is either a triangle or a tetrahedron, a doubly-truncated simplex in $14$6, a pyramid, or the exceptional polyhedron $14$7 (Bredon, 7 Jul 2025).
The dimension-by-dimension discussion highlights the following families:
| Dimension | Families singled out |
|---|---|
| $14$8 | hyperbolic Coxeter triangles with at least one angle $14$9 |
| 0 | non-compact ADEG-tetrahedra |
| 1 | one pyramid and two doubly-truncated 2-simplices |
| 3 | a single pyramid |
| 4 | pyramids over products of two or three simplices |
| 5 | one pyramid and 6 |
| 7 | a single pyramid |
The paper also states that no ADEG-polyhedra exist in dimensions 8, 9, 00, or 01. Combined with the angle bounds, this gives a notably rigid picture: once the pairwise-intersection condition and the angle set 02 are imposed, hyperbolic Coxeter polyhedra become a finite exceptional family rather than an open-ended classification problem.
Simple ADEG-polyhedra occur only in the lowest dimensions. Using prior classification results for simple hyperbolic Coxeter polyhedra with mutually intersecting facets, the paper concludes that the simple ADEG examples are exactly the triangles and tetrahedra. All higher-dimensional ADEG-polyhedra are non-simple (Bredon, 7 Jul 2025).
5. Exceptional cases and the polyhedron 03
Besides the well-known simplices and pyramid families, the classification contains three exceptional polyhedra: two doubly-truncated simplices in 04, already known from Im Hof’s work, and the new polyhedron 05 (Bredon, 7 Jul 2025).
The polyhedron 06 has dimension 07, 08 facets, and 09 vertices, of which 10 are ideal. Its 11-vector is
12
Its Coxeter diagram has a highly symmetric form: four disjoint copies of the 13-node chain 14 are arranged in parallel, a left extra node is joined by simple edges to the leftmost node of each row, and a right extra node is joined similarly to the rightmost node of each row. This makes 15 neither a simplex nor a pyramid, and it is not one of the two known doubly-truncated 16-simplices.
The paper further notes that all 17-faces of 18 have the same combinatorial structure, namely that of a pyramid over a product of three simplices of type 19. In arithmetic terms, the associated reflection group 20 is arithmetic over 21, and is commensurable with both the reflection group of Prokhorov’s 22-dimensional ADE-polyhedron 23 and the minimal-covolume cusped hyperbolic Coxeter simplex group in dimension 24. Its volume is of the form
25
The two doubly-truncated 26-simplices are also exceptional in a precise sense. They are the only higher-dimensional ADEG-polyhedra besides 27 that are neither pyramids nor simplices, and both arise from admissible configurations recovered in the 28 stage of the inductive construction (Bredon, 7 Jul 2025).
6. Relation to ADE-polyhedra and terminological scope
ADEG-polyhedra are best understood as a strict enlargement of the ADE family. In the ADE case, only 29 and 30 occur, and the relevant spherical and affine diagram types are 31, 32, and 33. ADEG-polyhedra add the 34 component, equivalently the angle 35, while preserving the requirement that all facets intersect pairwise. This produces a class that is still finite-volume and classifiable, but admits genuinely new non-simple behavior, including the 36-dimensional example 37 (Bredon, 7 Jul 2025).
The classification also depends heavily on earlier structure theorems. Vinberg’s finite-volume criterion is used in diagrammatic form to control spherical and affine subdiagrams; Allcock’s theorem identifies codimension-38 39-faces as Coxeter polyhedra in their own right; and prior classifications of simple polyhedra with mutually intersecting facets and of ADE-polyhedra supply the lower-dimensional input for the induction. A plausible implication is that ADEG-polyhedra occupy a boundary position between the tractable ADE regime and the much less classifiable general theory of hyperbolic Coxeter polyhedra.
The term “ADEG-polyhedra” is specific to this hyperbolic Coxeter setting. Nearby polyhedral literatures in the same source set do not define such a class: the almost-regular spherical-polyhedra literature does not use the term (Rasheed et al., 2015), and the quasi-Euclidean classification of alcoved polyhedra likewise does not identify a named ADEG subclass (Puente, 2020). Within current usage, the direct technical meaning of ADEG-polyhedra is therefore the hyperbolic one given above.