Regular Polytopes in the Poincare Ball
Bounding spheres for every regular hyperbolic polytope, and the eight honeycombs that come out of them.
We want to draw honeycombs of hyperbolic space by Coxeter polytopes, and as before that means writing a polytope down: not knowing that one exists, but producing the actual numbers.
A previous note did this in the plane. We take the same two choices - regular polytopes, centred at the origin, in the Poincare ball - for the same reason. Hyperplanes of the ball are spheres orthogonal to the boundary, or flat disks through the centre, and centring the polytope kills the second case: no face passes through the origin, so every face is an honest sphere.
Almost all of that argument carries over, because none of it was two-dimensional: it was about two spheres, and two spheres span a plane in any dimension and meet each other the same way inside it. What changes is the dual. In the plane, saying that the exterior points form the dual polygon was saying very little, a -gon’s dual being a -gon. Here a dodecahedron is bounded by spheres centred on an icosahedron.
A Plane is a Point Outside the Ball
The correspondence is the same, and it is worth one picture before we lean on it.
A sphere of centre and radius meets the unit sphere at right angles exactly when , by Pythagoras on the two radii and the line of centres - nothing in that argument mentions dimension. So the radius is not a second choice: , which is the length of the tangent from to the ball.
In the plane the two tangents from touched the circle at two points, and those were the ends of the geodesic. Here the tangent lines from form a cone, and it touches the sphere along a whole circle - which is exactly where the sphere centred at meets the boundary, and so is the ideal boundary of the plane that sphere carries.
So a hyperbolic polytope centred at the origin is a finite set of points outside the ball, one per face, and everything that follows is about locating that set.
Both relations are the Minkowski inner product wearing Euclidean clothes. A plane of the ball model corresponds to a unit spacelike vector in , and writing the sphere is Under that dictionary says exactly , and the relation above says exactly . So the elementary sphere geometry here is the linear algebra of the hyperboloid model, and one may work in whichever is more comfortable.
The Exterior Points are a Copy of the Dual
Let be a regular polytope with dihedral angle , centred at the origin, and let be the exterior points of its faces.
The argument that placed them in the plane was about the origin, and it is unchanged here. The isometries of fixing the centre of the ball are exactly the Euclidean rotations and reflections about it, so the symmetry group of acts on the exterior points as an ordinary Euclidean symmetry group. It carries faces to faces transitively, so the form a single orbit and all lie at one distance from the origin; and the reflection in the plane through the origin and a face’s centre fixes that face, hence its sphere, hence its centre, so each lies along the direction of its own face’s centre.
Those directions are exactly the vertex directions of the dual polytope. So the exterior points are a Euclidean copy of at circumradius : a cube is bounded by spheres centred on an octahedron, a dodecahedron by spheres centred on an icosahedron, a tetrahedron by spheres centred on another tetrahedron.
The directions are settled before we start, then, and the only freedom left is how far out along them the points sit. That single number is , and finding it is the rest of the problem.
The Scale
To find it we need the dihedral angle in a form we can compute with, and the dihedral angle is a two-dimensional measurement: two faces of meet along an edge, and is the angle between them measured in a plane cutting that edge at right angles. So we should cut.
Take the plane through the origin spanned by two adjacent face directions and . Three things happen at once, and together they put us back in the previous note’s picture exactly:
- passes through the centre of the ball, so it meets the ball in a flat unit disk - and a plane through the centre is a hyperbolic plane, so that disk is a copy of the Poincare disk.
- contains both sphere centres and , so it cuts each face sphere in a full circle, and each such circle is orthogonal to the boundary of the disk because its sphere was orthogonal to the boundary of the ball.
- The two spheres cross on a circle, and meets that circle. At such a point contains both radii, so it contains both tangent planes’ normals, and the angle between the two circles in is the angle between the two spheres. No correction: the slice measures itself.
So we are looking at two circles in a Poincare disk, meeting at , each orthogonal to the boundary. That is the previous note’s configuration, and it needs the previous note’s relation: the law of cosines on the triangle made of the two radii and the line of centres, remembering that its apex angle is and not , since is measured between the tangents and each radius is perpendicular to its own. Substituting ,
Now fill in what the slice supplies. Both circles have the same radius, and orthogonality makes it . Their centres are two adjacent vertices of the dual at circumradius , so the only thing still missing is how far apart two adjacent directions are. Write for the angle they subtend at the origin - it is a fact about the dual alone, and the one place a particular solid will enter this calculation. Then the distance between the centres is the dual’s edge,
Putting those in leaves one equation in the single unknown ,
and collecting the terms finishes it:
A regular hyperbolic polytope with dihedral angle , centred at the origin of the Poincare ball, is bounded by spheres centred at , 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 happens to have. Nothing in the derivation ever knew the dimension; the slice is what let us borrow it whole.
If one prefers the polytope’s own measurements, let be its in-radius, the distance from the centre to a face. Then and being the dual’s edge length at circumradius . For the dodecahedron that is the in-radius which an earlier note computes by hyperbolic trigonometry - two routes to the same number, and this one never uses a hyperbolic triangle.
The Five Solids
Only one number in the theorem knows which polytope we mean, and it is . So we need, for each Platonic solid, the directions of its face centres and the angle between two adjacent ones. Those directions are the dual’s vertices, and the duals are Platonic solids again, so it is a short list of coordinates:
| solid | face directions (before normalising) |
|---|---|
| tetrahedron | and the three with two signs flipped |
| cube | and cyclic |
| octahedron | |
| dodecahedron | and cyclic |
| icosahedron | together with and cyclic |
Taking the dot product of two adjacent ones gives , and is the corresponding chord. For the dodecahedron, say, two adjacent icosahedral directions are and , whose dot product is against a norm of , so . The whole table:
| solid | dual | ||||
|---|---|---|---|---|---|
| tetrahedron | tetrahedron | ||||
| cube | octahedron | ||||
| octahedron | cube | ||||
| dodecahedron | icosahedron | ||||
| icosahedron | dodecahedron |
The last column is the one that does the work. Written in terms of the theorem becomes
so the five families differ in exactly one constant: , , , , .
The cube is the case to look at, since collapses it as far as it will go: , and is just . The bounding spheres of a hyperbolic cube have radius .
Where Each Family Lives
Each formula is only good on an interval of , and the two ends are quite different from each other - and both differ from the plane, where the family always ran from an ideal polygon at 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 have flattened into planes and the solid has shrunk to a point. That angle is the dihedral angle of the Euclidean solid, and not by coincidence - the dihedral angle between two faces is supplementary to the angle between their outward normals, which is exactly . Nor is the coincidence surprising once one sees why: a very small region of is very nearly Euclidean, so as the solid shrinks its angles must approach the Euclidean ones. That is what the family runs out of - not room, but size.
For the cube , so there is no right-angled hyperbolic cube. Push the dihedral angle up towards a right angle and the cube shrinks away in front of you, reaching nothing at the same moment it would have reached .
The ideal end. Going the other way the solid grows and its vertices reach the sphere at infinity, but not at . Look at a vertex where faces meet: a small sphere around it cuts the solid in a spherical -gon whose angles are the dihedral angles. A spherical polygon has angle sum greater than a flat one, and it degenerates precisely when the two agree, :
So the ideal end depends only on the vertex degree, and the solid runs out of room while its angles are still substantial. The tetrahedron, cube and dodecahedron are all trivalent and turn ideal at ; the octahedron is -valent, at ; the icosahedron is -valent, at . Below those the vertices have passed beyond infinity and there is no polytope in any more.
| solid | ideal | Euclidean | |
|---|---|---|---|
| tetrahedron | 3 | ||
| cube | 3 | ||
| octahedron | 4 | ||
| dodecahedron | 3 | ||
| icosahedron | 5 |
Those intervals are short. The cube has to live in and the tetrahedron barely , which is already a hint that not much is going to fit inside them.
Which Ones Tile
A polytope tiles face-to-face exactly when a whole number of copies close up around each edge. If of them do, they share the of angle around that edge equally, so
and the honeycomb is the regular one with Schlafli symbol , where is the cell. When it happens, the theorem hands over the coordinates at once: with ,
and the cell is the part of the ball outside the spheres of radius centred at , one for each face direction in the table above. That is the whole recipe; everything left is bookkeeping about which are allowed.
Since the only angles at which anything tiles are , and each solid lives on one interval, the classification is a matter of which of those angles land in which interval.
Eight crossings, and no more are possible:
The regular honeycombs of whose cells are Platonic solids are exactly
The four on the top row are the four compact regular honeycombs of hyperbolic -space, and it is worth appreciating how little went into producing them: one formula for a radius, two endpoints for an interval, and a count of which fit inside.
Two of these deserve a remark. has , five dodecahedra around each edge - the universal cover of Seifert-Weber dodecahedral space, whose gluing identifies opposite faces with a twist. And is the right-angled dodecahedron, the only member of any of these families with a right dihedral angle at all, which is why it turns up so often.
Which of Them Are Reflection Groups
Reflection in a face plane is a symmetry of for every . What the parity of decides is whether the cell is a Coxeter polytope, meaning all its dihedral angles are for a whole number . Since , that happens exactly when is even, which picks out five of the eight:
Of these only has compact cells, so the right-angled dodecahedron is the only compact regular polytope in whose reflections generate a discrete group.
The three left out - , and - are no less real as honeycombs; their cells simply are not chambers of a reflection group, having a dihedral angle of or that no mirror pair produces. Seifert-Weber is the case to hold onto: five dodecahedra close up around an edge with a twist, and the cells fit whether or not any mirror performs that twist.
Generalising Further
The dictionary and the angle relation used here are completely general - they say nothing about regularity, and hold for any collection of planes at all. What regularity bought was that a single and a single reduced everything to one equation with one unknown.
Without it the problem becomes a genuine system: one equation per adjacent pair, with the unit conditions , to be solved for the poles. That is the Gram matrix picture of a Coxeter polytope, and whether a solution exists is Andreev’s theorem rather than a range check. A note for another day.