Regular Polytopes in the Poincaré Ball
Getting the faces of every regular hyperbolic polytope from euclidean constructions.
A previous note constructed regular polygons in the hyperbolic plane: working in the Poincaré disk, each side is a circle orthogonal to the boundary circle, and one formula locates all of them at once. Beautifully, essentially the same construction works one dimension up, with regular polytopes in the Poincaré ball.
Almost everything carries over, because almost nothing in the argument was really two-dimensional. But the answers come out quite differently. In the plane, a regular -gon could have any angle smaller than the Euclidean value, and infinitely many regular tilings came out. Here the possible dihedral angles of each solid fill out only a short interval, and when we go looking for honeycombs, the count is finite: there are exactly eight.
A Plane is a Point Outside the Ball
Hyperplanes of the ball model come in two kinds, just like geodesics of the disk did: flat disks through the center, and spheres meeting the boundary at right angles. And the correspondence with exterior points works the same way. A sphere of center and radius meets the unit sphere at right angles exactly when
by the Pythagorean theorem on the two radii and the segment joining the centers, the same computation as in the plane: everything happens inside the plane spanned by those three segments, and that plane doesn’t care what dimension it sits in. So again the radius isn’t a second piece of data, is the length of a tangent from to the ball, and a plane of not through the center is named by a single point outside the ball.
In the disk, the tangent segment from swept around to trace out the geodesic circle. Here the tangent lines from form a whole cone, touching the unit sphere along a circle, and that circle is exactly where the sphere centered at crosses the boundary: the ideal boundary of the hyperbolic plane that names.
As before, we’ll center our polytope at the origin so that no face passes through the center, and then the polytope is a finite set of points outside the ball, one per face.
Both of the relations we use are Euclidean expressions of the Minkowski inner product. A plane of the ball model corresponds to a unit spacelike vector in , and writing , the sphere it bounds is Under this dictionary, says exactly that , and the angle relation of the next sections says exactly that . So the elementary sphere geometry here is the linear algebra of the hyperboloid model, and you can work in whichever you find more comfortable.
The Exterior Points are a Copy of the Dual
Now take a regular polytope in : all faces congruent regular polygons, all dihedral angles equal, its symmetry group taking any face to any other. Just as in the plane, the symmetry group is finite and so fixes a point, the center of , and we move that center to the origin of the ball. Then no face passes through the origin, and each face’s sphere has its own exterior point .
The disk model’s gift carries over too: the isometries of fixing the center of the ball are exactly the Euclidean rotations and reflections about it. So the symmetry group of acts on the points as a group of ordinary Euclidean symmetries. It takes faces to faces transitively, so it takes the to one another transitively: they form a single orbit, and in particular they all sit at one common distance from the origin. And each lies on the axis through its own face’s center, since the rotations about that axis fix the face and therefore fix .
But the face-center directions of a polytope are exactly the vertex directions of its dual. So the exterior points are a Euclidean copy of the dual polytope , scaled to circumradius : a cube is bounded by spheres centered on an octahedron, a dodecahedron by spheres centered on an icosahedron, a tetrahedron by spheres centered on another tetrahedron. This is where one dimension up gets more interesting than the plane, where the dual of a -gon was just another -gon.
So the directions are settled before we start: they’re a fact about which solid we chose. The only freedom left is how far out along them the points sit, and that single number is . Finding it is the rest of the problem.
The Scale
To find we need an equation relating it to the dihedral angle , and the dihedral angle is fundamentally a two-dimensional measurement: two faces meet along an edge, and is measured in a plane cutting that edge at right angles. So we should cut.
Take two adjacent faces of . Slice the whole picture with the Euclidean plane through the center of the ball and the centers of their two spheres.
Why does this work? Passing through the ball’s center, meets the ball in a flat unit disk: a copy of the Poincaré disk. Passing through the sphere centers, it meets each sphere in a great circle, so it shows the true angle at which the two spheres cross, and each circle is orthogonal to the boundary of the disk since its sphere was orthogonal to the boundary of the ball. And since the ball model is conformal, just like the disk one dimension down, that crossing angle is the dihedral angle .
So inside the slice we’re looking at the previous note’s picture exactly: two circles in a Poincaré disk, each orthogonal to the boundary, crossing at .
The previous note’s relation applies as it stands. The law of cosines on the triangle of the two radii and the segment joining the centers, remembering that the apex angle is the supplement and not itself, gives
Now fill in what the slice supplies. Both circles have the same radius, and orthogonality with the boundary makes it . Their centers are two adjacent vertices of the dual polytope at circumradius , so the only missing ingredient is the angle between two adjacent directions. Write for that angle: it’s a fact about the dual solid alone, and it’s the only place a particular choice of solid enters this calculation. Then the two centers sit at distance
apart, and substituting everything into the angle relation leaves one equation in the single unknown :
Collecting the terms finishes it:
A regular hyperbolic polytope with dihedral angle , centered at the origin of the Poincaré ball, is bounded by spheres centered at the points , where the are the vertex directions of its dual and with the angle between two adjacent . Each sphere has radius , and the polytope is the part of the ball outside all of them.
This is the plane’s theorem word for word, with replaced by whatever angle the dual solid serves up. The slice is what let us borrow it whole: the derivation only ever looked at two spheres at a time, and two crossing spheres, cut through their centers, are just two crossing circles.
If you prefer the polytope’s own measurements, let be the in-radius, the distance from the center to a face. Then , and the theorem becomes where is the dual’s edge length at circumradius . For the dodecahedron this is the in-radius that an earlier note computed by hyperbolic trigonometry: two routes to the same number, and this one never touches a hyperbolic triangle.
The Five Solids
Only one number in the theorem knows which polytope we’re building, and it’s . So for each Platonic solid we need the directions of its face centers, which are the vertices of its dual, and the angle between two adjacent ones. The duals are Platonic solids again, so this is a short list of coordinates:
| solid | face directions (before normalizing) |
|---|---|
| tetrahedron | and the three with two signs flipped |
| cube | and cyclic |
| octahedron | |
| dodecahedron | and cyclic |
| icosahedron | together with and cyclic |
Now dot two adjacent ones together. For the dodecahedron, say, two adjacent icosahedral directions are and : their dot product is , each has squared norm , and so
Doing this for all five solids fills out the table:
| solid | dual | ||
|---|---|---|---|
| tetrahedron | tetrahedron | ||
| cube | octahedron | ||
| octahedron | cube | ||
| dodecahedron | icosahedron | ||
| icosahedron | dodecahedron |
The cube’s row is the friendliest: makes the bounding radius
so a hyperbolic cube of dihedral angle is cut out by six spheres of radius , centered on an octahedron.
Where the Families End
Each solid’s formula is only good on an interval of dihedral angles, and the two ends of that interval are different in kind: one is a limit of the edges, the other of the vertices. Both also differ from the plane, where every family ran from an ideal polygon at all the way up to the Euclidean angle.
The Euclidean End
The denominator is positive exactly when , so the family stops at
where runs off to infinity: the spheres flatten into planes and the solid shrinks to a point, exactly as the polygons did. And this endpoint is a familiar number: the dihedral angle between two faces is supplementary to the angle between their outward normals, and the angle between adjacent normals is , so is the dihedral angle of the Euclidean solid. Of course it is: a very small region of is very nearly Euclidean, so as the solid shrinks its angles must approach the Euclidean ones.
For the cube, . So there is no right-angled hyperbolic cube: push the dihedral angle up toward a right angle and the cube shrinks away in front of you, vanishing at the same moment it would have reached .
The Ideal End
Going the other way the solid grows, and this end is stranger. The number we control is the dihedral angle, measured along an edge. But a polytope also has corners, and it turns out the corners give out first: the vertices escape to the sphere at infinity while the dihedral angle is still substantial, nowhere near . And this, too, is something we can just compute: we have every face of the polytope as an explicit sphere, so we can solve for the vertices and watch them leave.
Where is a vertex? On its axis, first of all: the rotations of about a vertex direction fix that vertex, so the vertex is a point for some , exactly the argument that put each on its face’s axis. And the vertex lies on each of the spheres bounding its adjacent faces. So let be an adjacent face direction and intersect the axis with that sphere:
which multiplies out to a quadratic in ,
where is the angle between a vertex direction and an adjacent face direction. Like , it’s a constant of the solid, read off the coordinate table, and it’s the second and last place the particular solid enters. (It’s also the same constant for a solid and its dual, since dualizing swaps face directions with vertex directions and so leaves the angle between them alone.)
This quadratic knows everything about the vertex. Its two roots multiply to , so the axis crosses the sphere at a pair of points that are inverses across the unit sphere, one inside the ball and one outside: that’s the orthogonality of the face sphere and the boundary sphere, showing up one last time. The vertex is the inner root. And the vertex exists exactly as long as the roots are real, so the discriminant runs the show:
At the two inverse points collide, and the only points that are their own inverses lie on the unit sphere itself: the vertex has arrived at infinity. (Below that the roots go complex and the axis misses the sphere entirely, but our families will end before we ever need this case.)
So the family turns ideal at , and the main formula converts this to the angle. For the cube, and give , so , and solving gives : the cube’s vertices reach infinity at , well before its dihedral angle would have run out at . The other solids go the same way:
| solid | ideal | Euclidean | |
|---|---|---|---|
| tetrahedron | |||
| cube | |||
| octahedron | |||
| dodecahedron | |||
| icosahedron |
The three cases of the discriminant are one statement in the hyperboloid model. The face planes at a vertex have poles with , and where those planes meet is decided by the signature of this Gram matrix: timelike for a vertex inside , lightlike for a vertex at infinity, spacelike for face planes with no common point in the space at all. The same calculation returns at the end of this note, where dropping regularity leaves nothing but the Gram matrix to work with.
These intervals are short. The cube gets to live in, and the tetrahedron barely : already a hint that not much is going to fit inside them.
Which Ones Tile
A polytope tiles face-to-face when copies of it fit together around every edge and every vertex. The edges give the numerical condition. If copies meet around an edge, they share the of dihedral angle equally, so
and the candidate honeycomb has Schläfli symbol , with the cell. Each solid lives on one short interval of dihedral angles, so the search is a finite check of which angles land in which interval, and running through the table there are exactly eight hits:
The regular honeycombs of whose cells are Platonic solids are exactly
The first four have inside the cell’s interval, and the second four land exactly on its ideal endpoint.
What about the vertices? Around a vertex, each cell presents a corner, and the corners fit together in a pattern of their own: faces of the cell meet at each of its vertices and cells wrap around each edge, so the arrangement of cells around a vertex is described by the symbol , the vertex figure. And now look at what the eight candidates serve up. The compact four have vertex figures , , and : the icosahedron, the octahedron, and the dodecahedron. Platonic solids, that is, patterns that wrap a sphere, which is exactly what must surround an ordinary point. The ideal four have vertex figures , , and : the triangular and square tilings of the Euclidean plane, wrapping a vertex at infinity, whose cross-section is flat1. The edge condition and the vertex condition pass together, and the split between them is the same split the discriminant found.
So let’s draw all eight. With the theorem hands over each cell explicitly,
the part of the ball outside the spheres of radius centered at :
Two of the eight deserve a remark. , with five dodecahedra around each edge, is the universal cover of the Seifert–Weber dodecahedral space, whose gluing identifies opposite faces of one dodecahedron with a turn. And is the right-angled dodecahedron: the only right dihedral angle anywhere in these five families, which is a large part of why it shows up so often in hyperbolic geometry.
Which Are Fundamental Domains of Reflection Groups
Reflection in a face plane is a symmetry of for every . The finer question is whether the cell is a fundamental domain for the group its own face reflections generate: whether the reflected copies of the cell tile without the group ever folding the cell onto itself. For that, the cell must be a Coxeter polytope, with every dihedral angle of the form : two mirrors meeting at for odd generate additional reflections cutting through the cell itself, so the true fundamental domain would be something smaller. Since , the cell is Coxeter exactly when is even, which picks out five of the eight:
Only one of these has compact cells. So the right-angled dodecahedron of is the only compact regular polytope in that’s the chamber of a reflection group. The odd three, , and , exist all the same: five dodecahedra genuinely close up around each edge of whether or not any mirror could have put them there.
Generalizing Further
Nothing in the sphere dictionary or the angle relation required regularity: they hold for any collection of planes whatsoever. What regularity did was collapse the unknowns, one , one , one , until the whole configuration hung on a single equation.
Drop the symmetry and the problem becomes a genuine system. In the language of the hyperboloid remark, each face has a pole with , each prescribed dihedral angle is an equation , and the poles are the unknowns. This is the Gram matrix picture of a hyperbolic polytope, and whether the system has a solution is no longer a range check: it’s Andreev’s theorem. A note for another day.
Footnotes
-
That these local conditions really do assemble into a global honeycomb is Poincaré’s polyhedron theorem, which we won’t prove here: this note’s business is producing the cells, and the theorem’s hypotheses are exactly what our formula lets us check. ↩