---
title: 'ADEG-Polyhedra: Finite Hyperbolic Coxeter Polyhedra'
url: https://www.emergentmind.com/topics/adeg-polyhedra
type: topic
---

# ADEG-Polyhedra: Finite Hyperbolic Coxeter Polyhedra

ADEG-polyhedra are a class of finite-volume hyperbolic Coxeter polyhedra \(P\subset \mathbb H^n\) characterized by three conditions: all facets are mutually intersecting, all dihedral angles belong to \(\{\pi/2,\pi/3,\pi/6\}\), and at least one dihedral angle is \(\pi/6\). They extend Prokhorov’s ADE-polyhedra by adjoining the \(G_2\) 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 \(n\le 11\), and combinatorially each is either a triangle or tetrahedron, a doubly-truncated simplex in \(\mathbb H^5\), a pyramid, or the exceptional polyhedron \(P_\star\subset\mathbb H^9\) with \(14\) facets [2507.05153].

## 1. Definition and Coxeter-hyperbolic framework

The ambient model is the hyperboloid model
\[
\mathbb H^n=\{x\in\mathbb R^{n+1}\mid \langle x,x\rangle=-1,\ x_{n+1}>0\},
\]
with Lorentzian form
\[
\langle x,x\rangle=x_1^2+\cdots+x_n^2-x_{n+1}^2.
\]
A finite-volume hyperbolic polyhedron is written as
\[
P=\bigcap_{i=1}^N H^-_{v_i},
\]
where each \(v_i\) is a unit spacelike outward normal to a bounding hyperplane. Its Gram matrix is
\[
\mathrm{Gr}(P)=(\langle v_i,v_j\rangle)_{i,j},
\]
with diagonal entries \(1\), and off-diagonal entries determined by whether the corresponding facets meet at angle \(\pi/m_{ij}\), are parallel, or are ultraparallel [2507.05153].

For ADEG-polyhedra, the diagrammatic condition is especially simple. In the Coxeter diagram, nodes correspond to facets, unlabeled simple edges encode angle \(\pi/3\), absence of an edge encodes \(\pi/2\), and an edge labeled \(6\) encodes \(\pi/6\). Because every pair of facets intersects in \(\mathbb H^n\cup\partial\mathbb H^n\), ADEG diagrams contain no \(\infty\)-edges. The phrase “mutually intersecting facets” is understood in \(\mathbb H^n\cup\partial\mathbb H^n\), not only in the interior of \(\mathbb H^n\). 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 \(A\), \(D\), \(E\), and \(G_2\) occur. The defining \(\pi/6\) angle is what distinguishes ADEG-polyhedra from the earlier ADE case, where only \(\pi/2\) and \(\pi/3\) are allowed [2507.05153].

## 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 \(n\ge 32\) and \(P\subset\mathbb H^n\) is a finite-volume Coxeter polyhedron, then every non-zero dihedral angle is of the form \(\pi/m\) with \(m\le 6\). Under the stronger hypothesis that all facets are mutually intersecting, the same conclusion already holds for all \(n\ge 7\). There is also an ideal analogue: if \(n>3\) and \(P\subset\mathbb H^n\) is an ideal Coxeter polyhedron, then every non-zero dihedral angle is \(\pi/m\) with \(m\le 5\) [2507.05153].

These propositions isolate the angle set \(\{\pi/2,\pi/3,\pi/6\}\) 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 \(G_2^{(m)}\)-faces. In particular, once a diagram contains an edge \([m]\) with \(m\ge 7\), the codimension-\(2\) face associated to that \(G_2^{(m)}\) 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 \(\pi/2\); 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 [2507.05153].

## 3. Constructive method via \(G_2\)-faces and admissible configurations

The classification is driven by a constructive procedure tailored to the angle set \(\{\pi/2,\pi/3,\pi/6\}\). Every ADEG-polyhedron of dimension \(n\ge 5\) contains a \(G_2\)-subdiagram \([6]\), because at least one \(\pi/6\)-angle is present. By Allcock’s theorem on faces of Coxeter polyhedra, the corresponding codimension-\(2\) face \(F\) is itself a Coxeter polyhedron, and in the ADEG setting \(F\) is necessarily an ADE- or ADEG-polyhedron in dimension \(n-2\) [2507.05153].

A key lemma states that if \(n\ge 5\) and \(P\) is ADEG, then its Coxeter diagram contains an affine subdiagram of type \(\widetilde G_2\). More precisely, there is an affine rank-\((n-1)\) subdiagram
\[
\sigma_\infty=\sigma_1\cup\cdots\cup \sigma_m
=\widetilde G_2\cup \sigma_2\cup\cdots\cup\sigma_m,
\qquad m\ge 2,
\]
corresponding to a non-simple ideal vertex \(v_\infty\). Since facets are pairwise intersecting, there are no affine components of rank \(1\), so no \(\widetilde A_1\) components occur.

The remaining facets are encoded by vectors \(x,y\) of squared norm \(2\). Their incidence with the affine components is recorded by coefficients \(k_j^i=\langle x,e_j^i\rangle\) and \(l_j^i=\langle y,e_j^i\rangle\), constrained by the allowed angles. For each affine component one defines
\[
\Lambda_i=
\frac{\langle x,v_\infty^i\rangle}{\langle y,v_\infty^i\rangle},
\]
and the collinearity of the ideal vectors forces
\[
\Lambda_1=\Lambda_2=\cdots=\Lambda_m=:\Lambda.
\]
The decisive compatibility formula is Prokhorov’s relation
\[
\langle x,y\rangle=
\Lambda+\frac1\Lambda-(\Delta_1+\cdots+\Delta_m),
\]
where each \(\Delta_p\) is an explicit quadratic expression in the coefficients \(k_j^p,l_j^p\) with constants determined by the relevant root system. An admissible pair \(\{x,y\}\) is then one for which the common-\(\Lambda\) condition holds and
\[
\langle x,y\rangle\in\{0,-1,-\sqrt3\},
\]
corresponding exactly to the permitted angles \(\pi/2,\pi/3,\pi/6\) [2507.05153].

This reduces classification to a finite search. One starts from lower-dimensional ADE or ADEG \(G_2\)-faces, chooses a possible affine rank-\((n-1)\) subdiagram containing \(\widetilde G_2\), 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 \(G_2\)-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 \(24\) Coxeter polyhedra listed in the paper’s table. In particular, every ADEG-polyhedron is non-compact for \(n>2\), non-simple for \(n>3\), and satisfies \(n\le 11\). Combinatorially, it is either a triangle or a tetrahedron, a doubly-truncated simplex in \(\mathbb H^5\), a pyramid, or the exceptional polyhedron \(P_\star\subset\mathbb H^9\) [2507.05153].

The dimension-by-dimension discussion highlights the following families:

| Dimension | Families singled out |
|---|---|
| \(2\) | hyperbolic Coxeter triangles with at least one angle \(\pi/6\) |
| \(3\) | non-compact ADEG-tetrahedra |
| \(5\) | one pyramid and two doubly-truncated \(5\)-simplices |
| \(6\) | a single pyramid |
| \(7\) | pyramids over products of two or three simplices |
| \(9\) | one pyramid and \(P_\star\) |
| \(11\) | a single pyramid |

The paper also states that no ADEG-polyhedra exist in dimensions \(4\), \(8\), \(10\), or \(n\ge 12\). Combined with the angle bounds, this gives a notably rigid picture: once the pairwise-intersection condition and the angle set \(\{\pi/2,\pi/3,\pi/6\}\) 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 [2507.05153].

## 5. Exceptional cases and the polyhedron \(P_\star\)

Besides the well-known simplices and pyramid families, the classification contains three exceptional polyhedra: two doubly-truncated simplices in \(\mathbb H^5\), already known from Im Hof’s work, and the new polyhedron \(P_\star\subset\mathbb H^9\) [2507.05153].

The polyhedron \(P_\star\) has dimension \(9\), \(14\) facets, and \(134\) vertices, of which \(6\) are ideal. Its \(f\)-vector is
\[
f_\star=(134,671,1480,1909,1606,917,356,91,14).
\]
Its Coxeter diagram has a highly symmetric form: four disjoint copies of the \(3\)-node chain \([6,3]\) 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 \(P_\star\) neither a simplex nor a pyramid, and it is not one of the two known doubly-truncated \(5\)-simplices.

The paper further notes that all \(G_2\)-faces of \(P_\star\) have the same combinatorial structure, namely that of a pyramid over a product of three simplices of type \(\widetilde G_2\). In arithmetic terms, the associated reflection group \(\Gamma_\star\) is arithmetic over \(\mathbb Q\), and is commensurable with both the reflection group of Prokhorov’s \(9\)-dimensional ADE-polyhedron \(P_2\) and the minimal-covolume cusped hyperbolic Coxeter simplex group in dimension \(9\). Its volume is of the form
\[
\operatorname{vol}(P_\star)=q\cdot \frac{\zeta(5)}{22,295,347,200},
\qquad q\in\mathbb Q_{>1}.
\]

The two doubly-truncated \(5\)-simplices are also exceptional in a precise sense. They are the only higher-dimensional ADEG-polyhedra besides \(P_\star\) that are neither pyramids nor simplices, and both arise from admissible configurations recovered in the \(n=5\) stage of the inductive construction [2507.05153].

## 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 \(\pi/2\) and \(\pi/3\) occur, and the relevant spherical and affine diagram types are \(A\), \(D\), and \(E\). ADEG-polyhedra add the \(G_2\) component, equivalently the angle \(\pi/6\), 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 \(9\)-dimensional example \(P_\star\) [2507.05153].

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-\(2\) \(G_2\)-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 [1507.08374], and the quasi-Euclidean classification of alcoved polyhedra likewise does not identify a named ADEG subclass [2010.03818]. Within current usage, the direct technical meaning of ADEG-polyhedra is therefore the hyperbolic one given above.

Source: https://www.emergentmind.com/topics/adeg-polyhedra