WorksMathematics
Infinitely many convex polytopes with dihedral angles bounded above by
Abstract
For every , we construct infinitely many pairwise combinatorially distinct convex three-dimensional polytopes whose dihedral angles are all less than .
Introduction
Throughout this paper, dihedral angles are understood to be interior dihedral angles. As reported by Adiprasito [1], Gromov asked the following finiteness question:
Question 1.1. For a fixed dimension and , are there only finitely many combinatorial types of convex -polytopes whose dihedral angles are all less than ?
Classical results imply finiteness for ; see [3 Theorem 2]. Gromov discusses infinite families for small in [4 Section 1.1], attributing the initial observation to Adiprasito. The corresponding question about the threshold for finiteness appears as Problem 18 in [2 Page 196], attributed to Adiprasito.
We prove that is the optimal dihedral angle upper bound for every . More precisely, we establish the following results.
Theorem 1.2. For every and every positive integer , there exists a convex three-dimensional polytope with at least two-dimensional faces whose dihedral angles are all less than .
The following finiteness theorem (which directly answers Question 1.1 with the optimal ) follows from Theorem 1.2 and [3 Theorem 2].
Theorem 1.3. For any and , let be the collection of convex -dimensional polytopes with dihedral angles at most , modulo combinatorial equivalence. Then
(1) , and
(2) for any .
Proof. (1) By [3 Theorem 2], any member of is a direct product of simplices. Thus is finite. In particular, equals the partition number of , number of ways of writing as a sum of positive integers.
(2) For any , is witnessed by the direct product of the examples in Theorem 1.2 with .
We prove Theorem 1.2 in § 2.
AI disclosure. The authors used GPT-6 Astra to help develop the proof. The authors checked and rewrote the proof, and take full responsibility for its final form and correctness.
Acknowledgement. Jinmin Wang is partially supported by NSFC 12501169.
The construction in dimension three
In this section, we will construct infinitely many combinatorially distinct polytopes with uniformly bounded dihedral angles.
Below we will describe a special family of normal vectors that supplies our construction.
Fix a large transcendental real number and a large integer. Define
For , define
For suitable positive real values for , we construct a polytope , for , exactly enclosed bottom face , with unit outer normal vector , and faces given by
More precisely,
For a fixed , write
suppressing the dependence of these faces on . We will ensure that is bounded and that are exactly its faces, with outward unit normals , respectively.
The basic idea is an induction: we start from a tetrahedron enclosed by and . At each induction step, we cut with the plane near its “top vertex” incident with , and get . We then control all newly created dihedral angles and show that they all stay bounded. To proceed, we need some linear algebra preparations.
Lemma 2.1. Let and be defined as in (2). Then the following statements hold.
For distinct nonnegative integers and , the vectors are linearly independent.
(2) For every integer , the vectors are linearly independent.
Proof. (1) A direct computation shows that . This is a non-zero transcendental number by (1).
(2) We also have direct computation
which is non-zero.
A core ingredient of the construction is the following observation of a positive linear combination.
Lemma 2.2. For every integer ,
Proof. By (1), , thus we have
Recall that
It follows that
Therefore,
Rearranging gives the required recurrence.
The following lemma will provide the desired dihedral angle bounds.
Lemma 2.3. For integers with , we have
Proof. A direct computation shows
As and , the term only takes one of the three values:
In particular, we have
Furthermore, as , we have
As a consequence,
This concludes the proof. □
Proof of Theorem 1.2. We now present the construction. For two faces sharing an edge, write for their interior dihedral angle.
Base case. When , taking , , and , we introduce as in (2.3). Thus is a tetrahedron, with a unique vertex above the -plane. Its bottom face is and side faces are . The side dihedral angles are given by
for . By Lemma 2.3,
For bottom dihedral angles, we have
for . A direct computation shows
Hence are all acute.
Induction hypotheses. We will construct inductively the polytopes for such that the following properties hold.
has exactly faces, namely
The degree of each vertex of is three.
For , and share an edge if and only if .
For , and share an edge if and only if .
All dihedral angles of are smaller than .
has vertices and edges.
The base case verifies all these properties for .
Induction step. Suppose that and that has been constructed. We now construct out of . Let be the vertex of meeting three faces , guaranteed by Lemma 2.1. We cut the vertex away by a plane with normal vector .
Claim. The linear functional attains its maximum on uniquely at .
Indeed, by Lemma 2.2, is a positive linear combination of . Therefore, for any ,
Equality holds if and only if
that is, . This finishes the proof of the claim.
Set
where the maximum is taken for all vertices of that is not . Consequently, the plane strictly separates from every other vertex of . We define
in agreement with (3).
Every old edge survives, possibly shortened, and is adjacent precisely to . All old faces remain faces, and all old face adjacencies are preserved. Since , the bottom face is unchanged. This verifies (1)–(4).
The truncation removes one vertex and creates three vertices, adds three edges, and adds one face. Hence has vertices, edges, and faces, verifying (6).
The dihedral angles along surviving edges are unchanged. Each new edge lies in for some . By Lemma 2.3, its dihedral angle satisfies
Together with the induction hypothesis, this verifies (5) and completes the induction. □
References
(Zhenkun Li) Institute of Mathematics, Chinese Academy of Sciences Email address: [email protected]
(Jinmin Wang) Institute of Mathematics, Chinese Academy of Sciences Email address: [email protected]
(Jing Yu) Shanghai Center for Mathematical Sciences, Fudan University Email address: [email protected]
References
- [1]Karim Adiprasito. Scalar curvature and angles of polyhedra: test your intuition, 2022. Published July 11, 2022; available at https://kaguprasetya.com/2022/07/11/scalar-curvature-and-angles-of-polyhedra-test-your-intuition/.
- [2]Karim Adiprasito, Xavier Goaoc, and Zuzana Patáková. Discrete geometry. Oberwolfach Reports, 21(1):137–202, 2024.
- [3]H. S. M. Coxeter. Discrete groups generated by reflections. Ann. of Math. (2), 35(3):588–621, 1934.DOI
- [4]Misha Gromov. Convex polytopes, dihedral angles, mean curvature and scalar curvature. Discrete Comput. Geom., 72(2):849–875, 2024.arxiv.org/abs/2207.13346