The smoothness of the real projective deformation spaces of orderable Coxeter 3-polytopes
Abstract.
A Coxeter polytope is a convex polytope in a real projective space equipped with linear reflections in its facets, such that the orbits of the polytope under the action of the group generated by the linear reflections tessellate a convex domain in the real projective space. Vinberg proved that the group generated by these reflections acts properly discontinuously on the interior of the convex domain, thus inducing a natural orbifold structure on the polytope.
In this paper, we consider labeled combinatorial polytopes associated to such orbifolds, and study the deformation space of Coxeter polytopes realizing . We prove that if is orderable and of normal type then the deformation space of real projective Coxeter 3-polytopes realizing is a smooth manifold. This result is achieved by analyzing a natural map of into a smooth manifold called the realization space.
Key words and phrases:
Real projective structure, orbifold, Coxeter group, Moduli space2020 Mathematics Subject Classification:
Primary 57M50; Secondary 53A20, 53C151. Introduction
Let be the real projective -sphere consisting of the open rays of from the origin. The group can then be viewed as the group of real projective automorphisms of . A real projective structure on a smooth -orbifold is an atlas of coordinate charts on valued in such that the changes of coordinates locally lie in . The deformation space of real projective structures on is the space of real projective structures modulo the isotopy equivalence.
Many real projective -orbifolds (i.e., -dimensional orbifolds with real projective structures) arise from proper actions of discrete subgroups on convex open domains . Those orbifolds whose underlying spaces are of the form are called convex real projective orbifolds. Finding discrete subgroups that act properly on convex open domains is directly related to constructing examples of convex real projective manifolds and orbifolds.
A large class of such discrete subgroups are the linear reflection groups (see Section 2.1). A linear reflection group is generated by linear reflections in the codimension-one faces (called facets) of a convex polytope in . The linear reflection groups have been studied and characterized by Vinberg [15], enabling the study of representations of abstract Coxeter groups as linear reflection groups acting on real projective spaces. For instance, those results are used in the study of convex cocompact representations of Coxeter groups [5] in .
These contexts motivate the study of orbifolds whose fundamental groups are Coxeter groups and the study of the real projective structures on such orbifolds, with holonomy representations given by linear reflection groups. More precisely, those real projective orbifolds arise from the following observation. If is a convex polyhedron and is the linear reflection group generated by reflections in the facets of , then the union and its interior are convex (see Theorem 3.2). Then the quotient space admits a natural orbifold structure where the stabilizer subgroups of the singular points are finite subgroups of . The underlying space of the real projective orbifold is homeomorphic to minus some of its faces, where a face of is removed if and only if its stabilizer subgroup in is infinite.
Following this observation, we define a class of orbifolds known as reflection orbifolds or Coxeter orbifolds. A Coxeter orbifold is an orbifold whose underlying space is a convex polyhedron in with certain faces of codimension removed. The singular locus of the orbifold is the union of the non-removed faces of codimension , i.e. the boundary of minus the removed faces.
The motivation of this paper is to study the deformation space of real projective structures on 3-dimensional Coxeter orbifolds, whence the removed faces are some vertices of the underlying polytope. However, to effectively analyze the topological structure of the deformation space, we avoid the direct use of orbifold terminologies. Instead, we associate each Coxeter orbifold with a combinatorial object called a labeled combinatorial polytope , which encodes the orbifold structure. Consequently, the study of the deformation space of real projective structures is reduced to considering the space of isomorphism classes of Coxeter polytopes realizing (see Sections 2.1 and 2.2 for precise definitions). We will also call the space the deformation space of Coxeter polytopes realizing . By making such replacements, the space can be identified with the solution space of certain polynomial equalities and inequalities using results of Vinberg [15].
A labeled combinatorial polytope is a CW-complex whose underlying space is a convex polyhedron . The cells of the CW-complex are the faces of across all dimensions, where the unique top-dimensional cell is itself, the facets of are the -dimensional cells, and the ridges are the -dimensional cells, and so on. We index the facets of by , and assign to each ridge an integer label .
A Coxeter polytope realizing is a convex polyhedron equipped with linear reflections in its facets, such that is combinatorially equivalent to and the linear reflections generate a discrete subgroup such that the translates for tessellate a convex domain of (see Definition 2.2 for the precise definition). Each Coxeter polytope realizing gives rise to a convex real projective structure on the Coxeter orbifold associated to . In this way, the deformation space is embedded in the deformation space of the real projective structures on the Coxeter orbifold associated to .
As a part of this field, Marquis [8] studied labeled combinatorial polytopes whose underlying spaces are truncation polytopes, which are the polytopes obtained from a 3-simplex (i.e. a tetrahedron) by successively truncating vertices (Figure 1 illustrates a truncation process.). Marquis [8] proved that the deformation space is a union of for some . See [4] for the analogous result for higher-dimensional truncation polytopes. These motivate the following generalized question:
Question 1.1.
What can be determined about the local and global structures of the deformation space of Coxeter 3-orbifolds under suitable combinatorial conditions?
There have been several results answering the above question. For example, Choi-Hodgson-Lee [2] and Choi-Lee [3] found some classes of Coxeter 3-orbifolds admitting a (unique) hyperbolic structure, such that the point in the deformation space corresponding to the hyperbolic structure admits a neighborhood homeomorphic to an open cell.
In contrast, as explained by Choi-Lee ([3], Section 5.3), there is a Coxeter 4-orbifold whose deformation space is the union of two lines intersecting at a single point. Hence, some real projective structures on certain Coxeter orbifolds may not even admit open neighborhoods homeomorphic to cells, so in particular their corresponding deformation spaces are not a topological manifold.
In this paper, we provide a sufficient condition on a labeled combinatorial 3-polytope for the space to be a smooth manifold, ensuring that each real projective structure on the corresponding orbifold admits deformations of a fixed dimension. The main condition we assume is the notion of orderability, whose precise definition is given in Definition 4.1. To determine an element of , we have to consider a convex polytope together with linear reflections across the facets of . The orderability condition ensures that there exists an indexing of the facets of such that the linear reflections can be constructed successively by solving certain linear equalities and inequalities. Under the orderability assumption on , the space fibers over the “space of polytopes” that are combinatorially equivalent to , with the fiber over each polytope determined by solving linear equalities and inequalities.
In addition to assuming the orderability condition, we further exclude certain labeled combinatorial polytopes from our discussion. These polytopes form a small and exceptional class whose deformation spaces can be computed individually in elementary ways. Namely, we do not consider the labeled combinatorial polytopes such that one Coxeter polytope (hence all Coxeter polytopes) realizing tessellate the sphere or an affine chart under the action of its linear reflection group. The former case occurs if and only if the associated Coxeter group is finite (see (2.2) for the definition of ). Additionally, we exclude Coxeter polytopes that are either cones over polygons or products of polygons with closed intervals. The remaining Coxeter polytopes, which do not fall into any of these excluded categories, are referred to as being of normal type (see Definition 4.2). This distinction allows us to focus on the cases where our main results apply.
Choi [1] proved that if a Coxeter 3-orbifold is orderable and of normal type, then the subspace of consisting of real projective structures sharing a common fundamental domain is a smooth manifold. We will state this result precisely in Section 4 and use it to prove the following result about the smoothness of the global space .
Theorem 1.2.
Let be a labeled combinatorial 3-polytope. Let and be the numbers of facets and the edges of order 2 of . Suppose that is orderable and is of normal type. Suppose further that the stabilizer subgroup of fixing any polyhedron of combinatorial type is trivial. Then is a smooth manifold of dimension .
The proof of Theorem 1.2 follows the idea suggested by Hodgson, which is formulated in Corollary 2 of [1]. His idea presents another way to parametrize the deformation space of real projective structures on Coxeter orbifolds. The basic idea is that the deformation space fibers over a smooth manifold whose elements are polytopes representing the class . The base space is called the realization space, and it is a smooth manifold if is 3-dimensional (see Section 5, or [6]). On the other hand, the non-empty fibers of the projection are called the restricted deformation spaces. It is proved by Choi [1] that under the hypothesis of Theorem 1.2, the restricted deformation spaces are smooth manifolds of a common dimension. We combine these results to construct smooth charts around each element of . We cannot apply this argument for labeled combinatorial polytopes of general dimensions. One reason is that the realization spaces for some polytopes of dimension may not even be a topological manifold [11].
The orderability condition in Theorem 1.2 has a connection with Marquis’ result [8]. Namely, if is simple (i.e. each vertex of is joined to exactly three edges) and orderable, then is a truncation polytope. If the assumptions of Theorem 1.2 are satisfied and is a truncation polytope, then the space is homeomorphic to a disjoint union of some copies of by Marquis (Theorem 3.16, [8]). Then we see that Theorem 1.2 verifies Marquis’ result, since a truncation polytope always satisfy , and we have
Therefore, Theorem 1.2 extends to the labeled combinatorial polytopes which is orderable but not necessarily simple.
The study of deformations of Coxeter 3-orbifolds provides a way to construct new examples of real projective orbifolds via truncation and gluing. This method was introduced in [4], and we briefly mention the process below.
Consider two Coxeter 3-orbifolds arising from hyperbolic polyhedra with ideal vertices. If each orbifold can be deformed so that one of its ideal vertices moves outside of the closure of the hyperbolic 3-space, then it is possible to truncate the orbifolds at these ‘hyperideal’ vertices, yielding new real projective orbifolds. By gluing the resulting orbifolds along the triangular faces produced by truncation, we obtain another non-hyperbolic real projective orbifold.
Understanding when a given ideal vertex admits a deformation of this type is therefore useful. The dimension of the deformation space near the hyperbolic structure of a Coxeter 3-orbifold provides information on the extent to which such deformations can occur.
Table 1 shows the counts of orderable labeled combinatorial polytopes. In the counting process, one notes that the only factor determining the orderability of a labeled combinatorial polytope is whether the integer assigned to each edge is 2 or not. For example, when counting the number of all labeled polytopes with 5 facets, we note that there are exactly two combinatorial polytopes: the cone over a quadrilateral and the triangular prism. The cone over a quadrilateral has 8 edges, and the triangular prism has 9 edges. Hence, we have labeled combinatorial polytopes in total. Among them, we have 654 labeled combinatorial polytopes which are orderable. The other cases follow the same procedure. Due to computational difficulty we cannot go beyond 7 faces yet. The Mathematica code for the counts can be found at the webpage [10].
# of facets | Orderable labeled polytopes | All labeled polytopes | Ratio |
4 | 64 | 64 | 1 |
5 | 654 | 768 | 0.851563 |
6 | 7130 | 14848 | 0.480199 |
7 | 157334 | 421888 | 0.372928 |
1.1. Outline of the Paper
In Section 2, we define labeled combinatorial polytopes and introduce related concepts, including the deformation spaces and the Coxeter group . To facilitate the proof of our main theorem, we identify with a subspace of the quotient
In Section 3, we review some results of Vinberg on linear reflection groups. Specifically, we recall the necessary and sufficient conditions for a subgroup of , generated by linear reflections in the facets of a polyhedral cone, to generate a linear Coxeter group. These results are closely related to the Coxeter polytopes considered in Section 2 and allow us to describe the elements of
that are identified with elements of (see Remark 3.4).
In Section 4, we recall Choi’s result [1] on restricted deformation spaces of . We recall the result on the smoothness of the restricted deformation spaces (Theorem 4.5), which is necessary in our proof. We also introduce concepts such as labeled combinatorial polytopes of normal type and describe the restricted deformation spaces in our terminology.
In Section 5, we introduce the notion of realization spaces. We review the results of Steinitz [13] and Filpo Molina [6], which state the smoothness results on the realization spaces of 3-dimensional polytopes necessary for proving our main theorem.
In Section 6, we prove our main theorem by constructing a map from the deformation space into the associated realization space. We use the smoothness results mentioned in previous sections to complete the proof.
In Section 7, we provide two examples of and compute their deformation spaces . The first example illustrates in detail the process of computing restricted deformation spaces and the deformation space itself using the orderability conditions. This explicit computation verifies Theorem 1.2 and describes the global structure of . The second example follows a similar computation but proves that the map is not necessarily a fiber bundle.
Acknowledgement This work is supported by the National Research Foundation of Korea under Grant number 2022R1A2C300316213.
We are grateful to Gye-Seon Lee and Jean-Paul Filpo Molina for their valuable information and discussions. We also thank Ludovic Marquis for his helpful information and lectures.
2. Deformation spaces of Coxeter polytopes
In Section 2.1, we review the notion of labeled combinatorial 3-polytopes , which can be associated to Coxeter 3-orbifolds in the manner described in the previous section. In Section 2.2, we recall the notion of the deformation space of Coxeter 3-polytopes realizing a labeled combinatorial polytope .
2.1. Labeled combinatorial polytopes
We recall the definition of labeled combinatorial polytopes and related notions such as their associated Coxeter groups and Coxeter graphs.
Let denote the projective -sphere, defined as the quotient space , where two nonzero vectors and of are equivalent if and only if for some . For each subset , we let denote the image of under the projection . An affine chart of is a subset of the form for some nonzero linear functional on . Any affine chart of can be identified with in such a way (though not uniquely) that for each nontrivial linear subspace , the intersection is either empty or forms an affine subspace of . A subset is said to be convex if it is contained in an affine chart of and is convex in the affine chart. Furthermore, the set is said to be properly convex if its closure is a convex and bounded subset of an affine chart of .
A convex -polytope is a properly convex subset of , given by
(2.1) |
for some nonzero linear functionals on . Throughout this paper, we will assume that none of these defining inequalities are redundant, meaning none of the inequalities is implied by the others. The boundary of in is the union of the faces of , each of which is a convex -polytope for some in a -dimensional projective subspace of . We call the 0-dimensional (resp. 1-dimensional) faces of the vertices (resp. edges). We call the codimension-1 (resp. codimension-2) faces of the facets (resp. ridges). Since the inequalities are assumed to be non-redundant, the convex -polytope has exactly facets.
Let be a convex -polytope. The face lattice of is the set of faces of partially ordered by the set inclusion. Two convex -polytopes and are combinatorially equivalent if there is a bijection preserving the inclusion relations: if and only if . A combinatorial -polytope is a combinatorial equivalence class of convex -polytopes.
We provide an alternative description of combinatorial polytopes, which will be essential for our subsequent discussion. The labeled combinatorial polytope can be understood as a homeomorphism class of CW-complexes, represented by a CW-complex whose underlying space is , and whose -dimensional cells correspond to the -dimensional faces of . The notions of faces, vertices, edges, facets, ridges, and so on in are naturally derived from the corresponding notions in any of its representatives. For example, if the facets of are denoted by , we define the facets as the codimension-1 subcomplexes represented by , respectively.
For each pair of adjacent facets, and , we assign an integer to the ridge . The combinatorial polytope , together with the assigned integers, is called a labeled combinatorial polytope.
For each labeled combinatorial polytope with facets and an assignment of integers , we can associate a Coxeter group, an abstract group with the group presentation
(2.2) |
We set if and are not adjacent.
Definition 2.1.
For a Coxeter group in the form (2.2), we can associate a Coxeter graph . It is a weighted graph such that
-
(i)
the vertices (or the nodes) are the generators ;
-
(ii)
two vertices , are joined by a single edge if and only if , and in that case the edge is labeled by .
The labels are conventionally omitted in the representations of Coxeter graphs; however, this convention will not be relevant in this paper. We say that the Coxeter group is irreducible if its associated Coxeter graph is a connected graph.
2.2. The deformation space of Coxeter polytopes
In this section, we define the notion of Coxeter polytopes and their deformation spaces. We will also explain the topology assigned to the deformation spaces.
Definition 2.2.
Let be a labeled combinatorial polytope with facets . A Coxeter n-polytope realizing is a convex -polytope together with linear reflections such that:
-
(i)
is a convex -polytope combinatorially equivalent to , with facets corresponding to the facets ;
-
(ii)
each is a reflection in the hyperplane of supporting the facet ;
-
(iii)
if the facets are adjacent and the integer assigned to the edge is , then the product has order in the group ; and
-
(iv)
the subgroup generated by the linear reflections satisfies the condition
Note that the group acts (on the left) on the Coxeter -polytopes realizing by
Definition 2.3.
Let be a labeled combinatorial polytope with facets . The deformation space of Coxeter n-polytopes realizing is the space
Let be the multiplicative group of positive real numbers. The product Lie group acts on the vector space by
(2.3) |
To topologize , we identify the space as a subset of the quotient space
(2.4) |
in the following manner.
Let be a tuple representing an element of , where are linear reflections in the facets of the convex -polytope , generating a linear reflection group. For each , we have an expression for some and with and for . Then can be expressed as (2.1).
For each element , the tuple of linear reflections is uniquely determined by the action of the group where the action is given by
Moreover, for each reflection with , the tuple is determined by the action of the multiplicative group given by
Hence, the element determines a unique element
of the orbit space in (2.4).
Thus, we have obtained a map
By the following lemma, the map is injective. Throughout this paper, we give the topology induced by the injective map . This identification will be useful in the proof of our main theorem, particularly in relating the space to the realization space, which will be discussed in Section 5.
Lemma 2.4.
The map is injective. In particular, there is a unique topology on such that the map is a topological embedding.
Proof.
The map is defined by associating to each equivalence class the orbit of with under the action of as described in (2.2). Since each orbit uniquely determines the linear reflection up to projective equivalence, and since the convex polytope is determined (up to projective equivalence) by the collection of inequalities , is injective. ∎
3. The theory of Vinberg
Vinberg [15] characterized the discrete subgroups of generated by reflections in the facets of convex polyhedra in , in terms of the linear functionals and vectors defining these reflections. It is shown that these linear functionals and vectors must satisfy specific real polynomial equalities and inequalities.
Moreover, Vinberg’s results provide a method to construct the universal covering manifold of a given Coxeter -orbifold. Using this method, we can identify the deformation space as a subspace of the deformation space of real projective structures on the Coxeter orbifold associated with . This process will be briefly mentioned in Theorem 3.2 and Remark 3.3 but will not be discussed in detail, as it does not appear in the subsequent discussions.
In this section, we present some of Vinberg’s results, the first of which will be frequently used in our discussions. Additionally, we strengthen Lemma 2.4 by describing the image of the embedding (Remark 3.4).
A linear transformation is called a linear reflection if (hence diagonalizable) and it has as its eigenvalue with algebraic multiplicity . Then can be written in the form for some linear functional and vector with . The vector is an eigenvector of corresponding to the simple eigenvalue , and the kernel of is fixed pointwise by the linear reflection .
Let be a convex polyhedral cone given by
for some linear functionals . Let be vectors with and let be the reflection determined by . We further assume that has nonempty interior and each inequality is not implied by the other inequalities.
The subgroup of generated by the reflections is called a linear reflection group generated by the reflections if we further have
Linear reflection groups are also called linear Coxeter groups or discrete linear groups [15].
In this setting, we have the following theorem.
Theorem 3.1.
([15], Theorem 1) Let , , and , be as above. Then the subgroup of generated by is a linear reflection group if and only if , satisfy the following conditions:
-
(i)
if ;
-
(ii)
if and only if ;
-
(iii)
or for some integer .
In this case, the polyhedral cone is a fundamental domain of the discrete subgroup, and the subgroup is isomorphic to the abstract group
(3.1) |
via the isomorphism . Here, we have if . If and , then the relation is omitted from the group presentation (3.1).
The following theorem and its subsequent Remark 3.3 enable us to relate the deformation space of Coxeter polytopes realizing the labeled combinatorial polytope with the deformation space of real projective structures on the Coxeter orbifold associated to (see Section 1).
Theorem 3.2.
([15], Theorem 2) Let be a linear reflection group generated by reflections in the facets of a convex polyhedral cone . For each , let denote the subgroup of generated by reflections in those facets of which contain . Define
Then the following assertions are true.
-
(i)
is a convex cone.
-
(ii)
acts discretely on the interior of the cone .
-
(iii)
.
-
(iv)
The canonical map is a homeomorphism.
-
(v)
For every , is the stabilizer of in .
-
(vi)
For every pair of supported by the functionals , let denote the order of ( may be infinite). Then
is a system of defining relations for .
Remark 3.3.
Let be as in the theorem. Let be the natural projection and let , . Since is convex by Theorem 3.2, its projectivization is also convex. Therefore, the quotient gives a convex real projective structure on the orbifold . In fact, Theorem 2 of [1] states that every real projective structure on a Coxeter orbifold is convex when the orbifold is 3-dimensional.
Remark 3.4.
Recall from Lemma 2.4 that the space can be identified as a subspace of the quotient space (2.4). We can improve the lemma by describing the image of the embedding as follows. It follows from Theorem 3.1 and the definition of that
belongs to (the image of) if and only if
-
(i)
if ;
-
(ii)
if and only if ;
-
(iii)
or for some integer ;
-
(iv)
the projectivization of the polyhedral cone in is a convex -polytope representing the combinatorial polytope , so that the facet supported by represents .
4. Restricted deformation spaces
Given a discrete subgroup preserving a convex open domain , it admits fundamental domains such that . Choi [1] proved that if a Coxeter 3-orbifold is orderable and satisfies certain generic conditions, then the space consisting of real projective structures whose holonomy representations share a common fixed fundamental domain is a smooth manifold. Such spaces are called the restricted deformation spaces.
In this section, we recall the precise notion of restricted deformation spaces and the sufficient conditions under which Coxeter 3-orbifolds admit smooth restricted deformation spaces.
Let be two convex 3-polytopes. We say that they are projectively equivalent if there is some automorphism of such that . Let be a labeled combinatorial polytope and let be the deformation space of Coxeter 3-polytopes. We consider an equivalence relation on by saying that if and only if and are projectively equivalent. We denote each equivalence class represented by by and call it the restricted deformation space with fundamental polytope .
The following two definitions involve our main assumptions on the labeled combinatorial polytopes .
Definition 4.1.
A labeled combinatorial polytope is orderable if the facets of can be totally ordered as so that each facet has at most three edges such that each of them is either (i) of order 2 or (ii) the common edge of the facets and with .
Definition 4.2.
We say that is of normal type if does not satisfy any of the following conditions:
-
(i)
is a cone over a polygon and the integers assigned to the edges of the base polygon are all 2;
-
(ii)
equals a polygon times a closed interval and the edge orders assigned to the edges of the two base polygons are all 2;
-
(iii)
the associated Coxeter group (see (2.2)) is finite.
-
(iv)
admits an affine Coxeter group representation, i.e. there is a Coxeter polytope realizing such that the interior of is contained in an affine chart of which is invariant under .
Remark 4.3.
Let be the Coxeter group associated with . If is irreducible (see Definition 2.1), then by Margulis-Vinberg [7], the group is either:
-
(i)
spherical (i.e. finite);
-
(ii)
affine (i.e. infinite and virtually abelian);
-
(iii)
large (i.e. there exists a finite-index subgroup of admitting a surjective homomorphism onto a free group of rank ).
If is both irreducible and large, then is of normal type. In particular, many Coxeter orbifolds including hyperbolic Coxeter orbifolds of finite volume correspond to irreducible and large Coxeter groups and hence they are of normal type.
Proposition 4.4.
Let be a labeled combinatorial 3-polytope and let be its associated Coxeter group. If the Coxeter group is irreducible and large, then is of normal type.
Proof.
Since the Coxeter group is irreducible but not spherical, none of the conditions (i), (ii), and (iii) of Definition 4.2 is satisfied.
Let be a Coxeter 3-polytope realizing . It remains to show that the reflections do not simultaneously preserve an affine chart of containing the interior of .
Case 1: .
If , then the reflections do not simultaneously preserve a nontrivial linear subspace of by Proposition 19 in [15] and its corollary. Consequently, they do not preserve any affine chart of .
Case 2: .
If , then the vectors span a 3-dimensional subspace of . Suppose, for contradiction, that simultaneously preserve an affine chart containing the interior of . Then the boundary is invariant under and must equal the span of by Proposition 19 of [15].
On the other hand, since is of negative type, there exists a vector with for all such that all the entries of are negative (see Theorem 3 of [15]). Define the vector
The vector projects into the interior of the polytope , implying that . However, this contradicts the fact that .
In both cases, we conclude that the reflections do not simultaneously preserve an affine chart of . Thus, is of normal type. ∎
We present a rephrazed version of Choi’s result [1] on the smoothness of the restricted deformation spaces.
Theorem 4.5.
([1], Theorem 4) Let be a labeled combinatorial 3-polytope. Let be the number of facets, edges of and let be the number of edges of of order 2. Suppose that is orderable and is of normal type. Let be the dimension of the stabilizer subgroup of fixing a convex 3-polytope in combinatorially equivalent to . Then the restricted deformation space is a smooth manifold of dimension if it is not empty.
Remark 4.6.
The number does not depend on the choice of the convex 3-polytopes combinatorially equivalent to . It can be easily checked that if is a tetrahedron, if is a cone over a polygon other than a triangle, and otherwise.
Remark 4.7.
There was an error in the proof of Proposition 2 of [1]. We need to exclude Coxeter orbifolds admitting affine structures, which is necessary for the proof of Theorem 4.5. We will try to mend the proof here.
Let be a properly convex fundamental polytope. Let be the sides of . Let be the reflections on the sides of .
First, note that if the sphere of fixed points of a reflection contains an antipodal fixed point of another reflection, then those two reflections must commute, and their associated sides must meet in an edge, and their edge order is .
We need to show that there is no holonomy-invariant disjoint union of one or two -dimensional subspaces or holonomy-invariant -dimensional subspaces.
Suppose that is a holonomy-invariant disjoint union of one or two -dimensional subspaces. The case of the two -dimensional subspaces reduces to the first one because a reflection must act on each -dimensional subspace if it acts on a disjoint union of two -dimensional subspaces.
Let be a holonomy-invariant -dimensional subspace. If a face is contained in a -dimensional subspace containing , we call it a parallel face. The associated reflection is also called parallel. If not, it is called a transverse face. The associated reflection is called transverse. In this case, the antipodal fixed point must lie on , and the fixed point subspace must intersect transversely.
Suppose that . Then must have at most two parallel sides and . If there are exactly two parallel sides and , then and commute with all other reflections. Hence, we violated the normality. Otherwise, we cannot have a compact : If there is one parallel face, then the group is just an extension of the -dimensional Coxeter group by a reflection of the face. This follows from the first paragraph above. If there is no parallel face, then each sphere containing is invariant by the nature of transversal reflections, and again we have a -dimensional Coxeter group. These do not have properly convex fundamental polytopes with some vertices removed.
Suppose that . If there is a pair of adjacent transverse faces and , then and generate a finite group, and by their action and convexity, we must have . This implies by convexity, and we must have a finite Coxeter group, contradicting the normality. Also, there can be at most two parallel faces since is a properly convex polytope. From these two facts, it follows that there must be at most one transverse face and at most two parallel faces. We cannot construct a properly convex in this situation.
Suppose that is a holonomy-invariant -dimensional subspace. If , then there is an invariant affine subspace containing , and our orbifold admits an affine structure.
The old proof correctly rules out . We explain a bit more. In the old proof, we chose the fundamental polytope so that . Also, to deduce the infinite edge orders, we tacitly used the fact that our holonomy group acts as a -dimensional Coxeter group on . ∎
For two non-projectively-equivalent convex 3-polytopes representing a common combinatorial polytope , the associated restricted deformation spaces and may not be homeomorphic to each other, even if satisfies the hypothesis of Theorem 4.1. It may happen that one restricted deformation space is empty while another restricted deformation space is not. Moreover, even if both and are non-empty, those spaces may not be homeomorphic to each other in general. We will see an example (Example 7.2) in which the above phenomena occur simultaneously.
Let be a labeled combinatorial polytope. Each element determines a projective equivalence class of a convex 3-polytope , where represents the combinatorial polytope . Thus it is natural to consider the space of projective equivalence classes of convex polytopes representing , and consider the projection given by of into that space. The nonempty fibers of this projection are precisely the restricted deformation spaces of by definition. In the next section, we study this space of polytopes representing .
5. Realization spaces
In this section, we recall the notion of realization spaces for convex 3-polytopes. Essentially, the realization space of a fixed combinatorial 3-polytope is the set of all convex 3-polytopes in that share the same combinatorial type, modulo projective equivalence. Steinitz [13] studied a related realization space consisting of 3-dimensional polytopes in the affine 3-space modulo affine equivalence, proving that the realization space of each affine 3-polytope is a cell. See also [12], which introduces the realization spaces of affine 3-polytopes and includes a proof of Steinitz’s result.
For the proof of Theorem 1.2, we require an analogous result for the realization spaces of projective 3-polytopes. At the end of this section, we will recall a theorem regarding the smoothness of the realization spaces of projective 3-polytopes.
For each subset , let denote the convex hull of in .
Definition 5.1.
Let be a combinatorial 3-polytope, whose edges need not be labeled by integers. Let be the set of vertices of . A realization of is a tuple such that
-
(i)
is a convex 3-polytope combinatorially equivalent to ;
-
(ii)
for each subset , the subset is a face of (in an arbitrary dimension) if and only if is the set of vertices of a face of of same dimension.
Definition 5.2.
The pre-realization space is the set of all the realizations of .
Note that the pre-realization space is a subset of the product . We endow the subspace topology.
Note that the group of projective automorphisms of acts on the space by
(5.1) |
where we identify as a projective automorphism .
Definition 5.3.
The (projective) realization space of is the quotient space .
We can define the affine realization spaces of analogously by requiring its realizations lie in an affine space and by replacing the group by the group of affine automorphisms. A classical result of Steinitz [13] states that the affine realization space of a 3-polytope having edges is homeomorphic to . Filpo Molina [6] extended the result to the projective geometry. We state the result in our terminology as follows.
Theorem 5.4.
([6], Theorem B) Let be a combinatorial 3-polytope with -edges that is not combinatorially equivalent to a cone over a polygonal base. Then the projective realization space is a smooth manifold of dimension .
Note that if is a convex 3-polytope that is not combinatorially equivalent to a cone over a polygonal base, then . This can be verified as follows. Let denote the number of edges of the -th facet of . Since for each , we have
This implies that if . If , then is either a triangular prism or a cone over a quadrilateral. Each triangular prism has exactly 9 edges, and cones over quadrilaterals are excluded by our assumption. If , then is a tetrahedron, which is always a cone over a triangle.
Remark 5.5.
For dimensions , the realization spaces of convex -polytopes can be defined analogously. However, the realization spaces of some polytopes may not be topological manifolds in general. (See [11].) For the purpose of proving the smoothness of the deformation space , we thus restrict our attention to the 3-dimensional polytopes.
6. The proof of the main theorem
In this section, we prove Theorem 1.2. The starting point is to consider a map that “forgets” the reflection data (explained in Section 6.2). The smoothness of will essentially follow from the smoothness of the realization space and the nonempty fibers of the map .
The realization space , as described in Section 5, is expressed in terms of the vertices of the polytopes. It will be more convenient, however, to describe the realization space in terms of the facets of the polytopes. We achieve this in Section 6.1 by embedding in a quotient space of .
In Section 6.2, we consider an open map whose nonempty fibers correspond to the restricted deformation spaces discussed in Section 4. Section 6.3 uses this map to construct a smooth manifold . Finally, in Section 6.4, we show that the quotient of by the Lie group is homeomorphic to , thereby inducing a smooth structure on .
Throughout this section, we adopt the following settings. Let be an orderable, labeled combinatorial 3-polytope satisfying the conditions of Theorem 1.2. Let be the set of vertices of . We label the facets of as , and denote by the integer assigned to the edge (= ridge) , whenever it is defined. Let be a 4-dimensional real vector space, and let denote the real projective 3-sphere obtained by projectivizing . The group of linear automorphisms of with determinant is denoted by , which can also be viewed as the group of projective automorphisms of . Lastly, let be the one-dimensional group of positive real numbers, and define , which is a product Lie group of dimension .
6.1. Reparametrizing the realization space
In Section 5, we considered the realization spaces of convex 3-polytopes. In the settings of Section 5, each polytope (realization) is described in terms of its vertices, as the vertices determine the polytope by taking the convex hull. However, it will be more beneficial for us to describe the polytopes in terms of their facets.
More specifically, for each convex 3-polytope with facets , there exist linear functionals such that is defined by the linear inequalities , with each facet supported by the hyperplane of determined by . These functionals are not uniquely defined by , as any positive scalar multiple of also supports the facet .
In this way, determines an element of the quotient . On the other hand, each element of the realization space is a projective equivalence class of a convex 3-polytope, so the corresponding element of is uniquely determined up to the action of . Thus, each realization of a polytope determines a unique element of
We describe the elements of that arise as the image of a realization. For computational purposes, it will be convenient to consider the lift of these elements in under the projection . In this subsection, we consider these constructions in detail.
Recall from Lemma 2.4 that we have an embedding . Similarly, for the realization spaces, we will consider an embedding of the realization space into .
Now we make the above considerations precise. Let be the pre-realization space of (see Definition 5.2). Then, is the quotient space . We first construct an embedding , where is the quotient space obtained by the action of the group on given by
Let be a realization of (see Definition 5.1). The convex hull is a convex 3-polytope combinatorially equivalent to , so in particular has facets. We label the facets by in alignment with the labeling of the facets of , i.e., in such a way that for each vertex of , if and only if .
We choose elements such that for each the hyperplane is projected onto the hypersphere of containing . Additionally, we impose the condition for each lifting a point of . The tuple is uniquely determined up to multiplication by positive real numbers. In this way, we obtain a map .
Lemma 6.1.
The map is a topological embedding.
Proof.
We first prove that is injective. Let , be two realizations of , and suppose that
We need to show that for each .
Let , be the convex 3-polytopes determined by , respectively. Label the facets of and by and so that they accord with the labeling of the facets of .
Let , and let be the facets of containing the vertex , so that we have
Then and satisfy analogous relations, i.e., we have
This proves that for each . Hence, is injective.
We can check easily that the map is continuous. Small perturbations of the vertices of a convex 3-polytope, while maintaining its combinatorial type, result in small perturbations of the supporting hyperplanes of the facets of the resulting convex 3-polytope. Therefore, is continuous.
Finally, the inverse map is continuous for a similar reason: small perturbations of the supporting hyperplanes, while maintaining the combinatorial type of the polytope, result in small perturbations of the vertices of the polytope. Hence, is continuous.
We conclude that is a topological embedding. ∎
The group acts on the space by the rule (5.1), and also acts on by the rule
It can be easily checked that the embedding in Lemma 6.1 is equivariant with respect to these actions. Therefore, we obtain an embedding
(Recall .)
In the proof of Theorem 1.2, we use the smoothness of the realization space . It turns out to be convenient to use the images of the maps and instead of their domains and . Hence, we introduce the following notations. We define
Lastly, we define to be the preimage of under the projection . We have the following commuting diagram, where the vertical maps are the quotient maps induced by the corresponding group actions.
We call the face lattice of to be the set of faces of in all dimensions, partially ordered by the inclusion, and denote it by . By the construction of the map , we have the following description of .
Lemma 6.2.
Let . Then if and only if the set
is a convex 3-polytope combinatorially equivalent to , and there exists a face-lattice isomorphism sending each facet to the facet of supported by .
Proof.
The “only if” part follows directly from the construction of the map .
Conversely, the face-lattice isomorphism restricts to a labeling , of the vertices of . The realization is then mapped to via the map . ∎
In the proof of Theorem 1.2, we will construct a smooth manifold and consider a proper free smooth action of the group on it, such that is the resulting quotient smooth manifold. To achieve this, we need to construct a smooth structure on . For this purpose, we prove the following two lemmas.
Lemma 6.3.
Let be a combinatorial 3-polytope (whose facets need not be labeled) with facets . Suppose is not a cone over a polygon. Let be the subspace constructed in the above process. Then the action of on is free.
Proof.
Let , and let
Suppose that . Consider the polytope , which is combinatorially equivalent to .
Since , the assumption is equivalent to
(6.1) |
First, we note that the forms span . If they did not span , then there would be a point such that for all , which would imply that both and belong to , contradicting the fact that is properly convex.
We can assume, by reindexing the facets of if necessary, that are linearly independent. Then for each , there are unique coefficients , , such that
(6.2) |
We make two observations:
-
1.
For each , at most one of the coefficients is zero. If two of the coefficients , say and , this would imply that . In this case, two of the three inequalities , and would imply the other, contradicting the fact that has exactly facets.
-
2.
For each , there is at least one such that . Without loss of generality, assume . Since are linearly independent, there is a unique point such that and . If for all , then for all such , implying that is the cone over the facet with apex , contradicting our assumption.
Now, the equations for imply that the matrix representation of with respect to the dual basis of is given by . Since , we have . Since for all , we obtain .
Finally, to conclude the proof, it suffices to show that , since this will imply that , and by equation (6.1), for all .
Let . Applying (6.1) and (6.2) gives
On the other hand, we have
Comparing the coefficients, we obtain for all and .
We consider the index . If are all nonzero, then it follows that , so we obtain the desired result. Suppose that one of is zero. For simplicity, we assume that . Then Observation 1 implies that are nonzero, and this implies that . By Observation 2, there is another index such that . Then Observation 1 again implies that there are at least two indices such that , so . Hence, we obtain .
We conclude that and . Therefore, the action of on is free. ∎
Lemma 6.4.
Let be a combinatorial 3-polytope. Let and be the numbers of facets and edges of , respectively. Suppose that is not a cone over a polygon. Let be the quotient map, defined as the restriction of the quotient map . Then is a locally trivial principal -bundle.
In particular, is a topological manifold of dimension
and admits a smooth structure such that is a smooth submersion.
Proof.
The group acts freely on by Lemma 6.3. Let . To prove the local triviality of the map , it suffices to construct a neighborhood of in and a continuous section of (see Proposition 14.1.5 of [14]).
We reindex the facets of if necessary, ensuring that each of the three facets is adjacent to . For each element , the set
is a convex 3-polytope that is combinatorially equivalent to . Moreover, the four facets do not share a common vertex, since have no common vertex among them. Therefore, for each , the first four linear functionals are linearly independent. Consequently, for and , there are unique continuous maps such that
To choose a local section around the point , we use the observations on the coefficients from the proof of Lemma 6.3, which are numbered 1 and 2. According to the first observation, there exist three distinct indices such that . We define as the index in the complement .
The second observation indicates that there is an index such that . Moreover, the first observation again implies that for some . Lastly, for , we select arbitrary indices such that .
For notational simplicity, we assume that for , , and . Then the following conditions hold:
-
(i)
;
-
(ii)
;
-
(iii)
for .
The above choices cannot be made if . In this case, a separate argument is required. If , then is a tetrahedron, which means it is a cone over a polygon. If and is not a cone over a polygon, then is a triangular prism. In this situation, the realization space is a singleton, which implies that the projection is a trivial bundle over a point.
By the continuity of , there exists an open neighborhood of such that the signs of
remain constant over . Let denote the constant signs of for the specified indices and the neighborhood .
We construct a map , which will descend to the section (where ) that we are looking for. Let . We claim that there is a unique element in the -orbit of satisfying the following properties:
-
-
for , where is the standard dual basis of ;
-
-
for ;
-
-
for ;
-
-
for .
In other words, we need to prove that there exists a unique such that . This equation can be expressed as:
The first condition, for , is equivalent to
(6.3) |
where we interpret the in each row as the coordinate vector of with respect to the dual basis . This implies that we are subject to the relation
For each , we have
thus,
By comparing the coefficients, it can be verified that there are unique satisfying , and a corresponding matrix such that the requirements for and equation (6.3) are satisfied.
We further note that the unique elements and depend continuously on , allowing us to obtain a continuous map . Since acts continuously on , the map is an open map, which implies that is an open neighborhood of . Furthermore, since the map is constant on the intersection of with each -orbit, the map descends to a continuous section . This completes the proof. ∎
6.2. The projection and the restricted deformation spaces
In this section, we consider a natural map and observe that each nonempty fiber of the map can be identified with a restricted deformation space . In view of Theorem 4.5 and Theorem 5.4, the space and the nonempty fibers of the map thus admit smooth structures.
For computational purposes, especially in constructing the smooth structure on , we use the embedding of onto a subspace as described in Lemma 2.4. This embedding allows us to transform the map into a topologically equivalent map given by restricting the projection .
In constructing the smooth structure on , it will also be convenient to work with the lift of under the projection , in a manner analogous to our definition of .
We will examine the map and observe that the nonempty fibers of this map can also be identified with the restricted deformation spaces.
Let be a labeled combinatorial 3-polytope. Recall that the elements of are of the form , where is a convex 3-polytope combinatorially equivalent to , and are linear reflections in the facets of corresponding to the facets of , respectively. The projection descends to the map given by , where each vertex is a vertex of the facet if and only if the vertex of is fixed by the reflection .
Recall that by Lemma 2.4, we have an embedding . Let denote the image of this embedding (see the diagram in Figure 2). Let
be the projection induced by the action of on , and define . An element belongs to if and only if it satisfies the conditions of Remark 3.4.
Now, the map can be described in terms of the images of the embeddings and . This map is simply the projection induced by the natural projection given by
We thus have the following commuting diagram:
Recall from Section 4 that for each convex 3-polytope representing the underlying combinatorial polytope of , the restricted deformation space is defined to be the subspace consisting of such that and are projectively equivalent. In other words, the restricted deformation spaces in are precisely the nonempty fibers of the map .
We abuse the notation by letting to denote the restriction of the natural projection as well. The map is -equivariant, so it induces a map . By the above commuting diagram, the restricted deformation spaces can be identified with the nonempty fibers of the map . Moreover, each nonempty fiber of the map is mapped homeomorphically onto the fiber , since the action of on is free and the projection map is open. Therefore, each nonempty fiber is homeomorphic to the restricted deformation space , where
is the convex 3-polytope determined by .
We conclude this subsection by discussing the smooth structure on each fiber of . In the forthcoming discussions, the nonempty fibers will often be identified with the subspace via the homeomorphism . By Theorem 4.5, each nonempty fiber is a smooth manifold. In fact, the theorem’s proof shows that is an embedded submanifold of . To explain this, we briefly outline the key idea behind the theorem’s proof.
Since we are considering the restricted deformation space, we fix a convex 3-polytope with facets and determine all possible reflections in the facets that make a Coxeter 3-polytope. As the convex 3-polytope and its facets are fixed, we only need to find all possible choices of the vectors defining the reflections. We may assume that the polytope and the vectors lie in .
There exist affine functions , for , such that and on the facet . The map is an affine function mapping onto a 3-dimensional affine subspace . Each vector is mapped to , whose -th coordinate must be negative by the first condition of Remark 3.4. Under the projection , it is mapped to , where the -th coordinate is . By removing the -th coordinate, we obtain an element .
In this manner, the tuple can be viewed as an element of by stacking . The entries of must satisfy the equalities in Remark 3.4 as well as the defining equations of the affine subspace . Thus, the set of such is the zero-level set of a polynomial map , where represents the total number of equalities in Remark 3.4 and the defining equations of .
In the proof of Theorem 4.5, Choi proves that the polynomial map has full rank. Hence, the set of , which represents the restricted deformation space, is an embedded submanifold of . This observation will be employed to verify the smoothness of maps between nonempty fibers of .
Specifically, if there exists a smooth map between two open subsets of containing nonempty fibers of , and if this smooth map sends one nonempty fiber of to another, then the restriction of the smooth map to these fibers is also smooth. This fact will be crucial in constructing a smooth atlas on .
6.3. Construction of a smooth structure on
In this section, we construct a smooth atlas on . The existence of this smooth structure, along with Lemma 6.9, will be used to define a smooth structure on .
The construction proceeds as follows. To define a coordinate chart around each point in (note that ), it suffices to find a homeomorphism between an open neighborhood of in and an open subset of , as the latter space is proven to be a smooth manifold by Lemma 6.4 and Theorem 4.5. We do it by choosing some open neighborhoods and of and , respectively, and constructing a chart which maps to .
For each element , we will construct so that it is of the form . Geometrically, we have perturbed the convex 3-polytope to obtain another convex 3-polytope within the same realization space, and we need to find the tuple of vectors so that the resulting endomorphisms are linear reflections and satisfy the Vinberg’s relations in Remark 3.4. Note that for each , we always have because but itself may not lie in in general.
We construct in succession to satisfy the conditions in Remark 3.4. In each step, is determined as the solution to a system of up to 4 linear equations. If there are fewer than 4 equations, may not be uniquely determined, so we add extra equations as needed. For this purpose, we assign 3 indices according to the orderability condition and add necessary linear equations to some of these indices. This process allows us to determine a unique such that .
Finally, we verify in Lemma 6.8 that the transition maps between the charts , are smooth, and this completes the construction of the smooth atlas on .
We begin with giving an explicit description of the elements of . Recall that the subspace is defined as the preimage under the natural projection
Moreover, the space is defined as the image of the embedding from Lemma 2.4. According to Theorem 3.1 and Lemma 6.2, an element
belongs to if and only if it satisfies the following conditions:
-
(V1)
for ;
-
(V2)
if ;
-
(V3)
if and only if ;
-
(V4)
if and are adjacent and is the integer assigned to the edge , then ;
-
(V5)
if and are not adjacent, then ;
-
(V6)
the set
is a convex 3-polytope combinatorially equivalent to , and there exists a face-lattice isomorphism mapping each facet to the facet of supported by .
As the first step in constructing a smooth structure on , we need to select indices according to the orderability condition. Since is orderable, we reindex the facets if necessary, so that for each facet , there are at most three facets adjacent to such that either:
-
-
, or
-
-
.
Then, for each , we choose three distinct indices such that:
-
(i)
For , the facets and are adjacent.
-
(ii)
The first indices satisfy .
-
(iii)
The next indices satisfy and .
-
(iv)
The last indices satisfy and .
-
(v)
If and are adjacent and satisfy either or , then is included in .
Since is orderable, for each , there are at most three facets adjacent to such that either or . Therefore, the indices with in the above requirement do exist. Note that the requirement (v) indicates that include all such indices. For the remaining facets adjacent to , we must have . In (iv), we arbitrarily select indices with this property.
We make such a choice due to a technical reason, and the choice of indices achieves the following.
Given a tuple , we will frequently construct such that satisfy the conditions (V1), (V3), and (V4). We will construct them inductively, i.e. we assume that are determined and then construct . The conditions (V1), (V3), and (V4) indicates the values of for . For instance, if , then (V4) implies . (Note that on the right-hand side is given by induction hypothesis.)
Since , we thus have at most 4 linear equations for . We add complementary linear equations by assigning the values for . The resulting system consists of 4 linear equations and thus determine a unique vector .
Now let . We construct an open embedding of the product of some smooth manifolds and such that:
-
-
is an open neighborhood of ;
-
-
is an open neighborhood of in ; and
-
-
.
Since and are open in and , respectively, and since the latter spaces are proven to admit smooth structures, the sets and inherit these smooth structures. It will be shown that the transition maps are smooth with respect to these smooth structures. The smooth structure on will be the maximal atlas induced from the open embeddings of this form.
We temporarily let and be arbitrary open neighborhoods of and , respectively. These neighborhoods will be shrunk as needed. Let (where we identify as a subspace of ). Note that is not an element of in general, since unless . We define to be the element obtained by the following lemma.
Lemma 6.5.
There exist sufficiently small neighborhoods and of and , respectively, such that there is a unique continuous map satisfying the following properties:
-
(i)
,
-
(ii)
as , so that ,
-
(iii)
for , .
Proof.
We construct in this order, shrinking and during the process if necessary.
By requirement (i), the element must satisfy conditions (V1) through (V6). We construct so that these conditions are not violated at each step.
We define as the unique solution to the following system of four linear equations:
for | |||||
for |
Note that since 1 is the smallest index. The solution exists and is unique: since are adjacent to , the four linear functionals are linearly independent by Lemma 6.2. By Cramer’s rule, is a continuous function of and . Moreover, if we substitute , then it follows from the uniqueness of the solution that , implying that as .
The element may not belong to , and in particular it is possible that for some , so might violate condition (V2) even if are not yet defined. However, since for , we can use the continuity of to choose smaller neighborhoods and so that for and , ensuring that condition (V2) is no longer violated.
We define in a similar way, as a continuous function of , , and . Since depends continuously on and , the resulting will also depend continuously only on and .
Let be the unique solution of the following system of four linear equations:
for | |||||
for | |||||
for |
Using similar logic as with , we confirm that are linearly independent. Since is either 0 or 1 (because is the only index with ) and , is well-defined and continuous.
We proceed similarly to define by iterating this construction process, ensuring each is continuous and meets the conditions (V1) through (V6) as required. Fix and assume that the neighborhoods and of and , along with the continuous functions for , are defined so that .
We define to be the solution to the following system of four linear equations:
for | |||||
for | |||||
for |
The continuity of follows from the continuities of . Since , we also obtain by the uniqueness of the solution and the fact that satisfies (V1) through (V6). Since for , the continuity of ensures that we can choose small neighborhoods and so that for . In this way, we obtain continuous functions on satisfying the condition (ii).
Finally, since satisfies conditions (V2) and (V3), we can select a sufficiently small neighborhood of such that
By choosing smaller neighborhoods and , we ensure that for with .
It remains to show that , i.e., satisfies conditions (V1) through (V6). Conditions (V1), (V3), and (V4) are satisfied by construction. Since , condition (V6) is automatically satisfied by Lemma 6.2. Condition (V2) holds because if , it is satisfied by the construction of , and if , it holds by our choice of neighborhoods .
Condition (V5) follows from Lemma 6.6. According to this lemma, if and are not adjacent, we can find constants for (the set of indices such that and are adjacent) and such that
Using this, we obtain
Therefore, satisfies (V5).
In conclusion, the neighborhoods and the functions meet all the required conditions. ∎
Lemma 6.6.
([15], Proposition 14) Let be a finite dimensional real vector space, and let be linear functionals such that the cone
has nonempty interior and no inequality is implied by any combinations of the other inequalities with . Let be the facets of supported by the functionals respectively. Let be two indices such that the facets are not adjacent. Let
(6.4) |
Then there are for and such that
For each , let be the map given by Lemma 6.5. Then we define a map by . We refer to such maps as standard charts around the point .
Lemma 6.7.
Let and let be open neighborhoods of as in Lemma 6.5. Then the standard chart is a topological embedding onto an open subset of .
Proof.
The map is continuous by Lemma 6.5. It remains to show that is injective and open.
We first show that is injective. Let and suppose that . From the definition, it follows immediately that .
On the other hand, since , we have . In particular, satisfies conditions (V1) and (V3). These conditions imply that
To summarize, the vector is the unique solution of the following system of four linear equations:
for | |||||
for |
Since and , we see that is also a solution of this same system of equations. Therefore, we conclude that .
Next, we prove that . The construction of in Lemma 6.5 includes the condition
On the other hand, since , it satisfies conditions (V1), (V3), and (V4). These conditions imply that
for | |||||
for |
By combining these systems, we see that is the unique solution of the following system:
for | |||||
for | |||||
for |
Since , , and , we conclude that is also a solution of this same system of equations. Therefore, we obtain .
The equalities for can be proved in the same manner. This completes the proof of the injectivity of .
Now we prove the openness of . Let and write . To prove openness, it suffices to construct a continuous local inverse
of for some open neighborhoods and of and , respectively, such that .
Let and be arbitrary open neighborhoods of and in and , respectively. We choose small enough so that . Let . We now construct so that with belongs to in a manner analogous to the construction of . Since we require , the element must satisfy , i.e., must satisfy conditions (V1) through (V6).
We define to be the unique solution of the system
for | |||||
for |
The inequalities for are automatically satisfied since . Thus, the subsequent equations to define are well-defined.
Let be the vectors obtained by applying the same process. Up to this point, there is no need to shrink the neighborhoods and .
To ensure that for all with and , we select smaller neighborhoods and of and , respectively. Since depends continuously on and by the injectivity of , the constructions of and imply that is the identity on .
By the same reasoning as in the proof of Lemma 6.5, the element satisfies conditions (V1) through (V6). Using the continuity of , we can further refine the neighborhoods and so that the image of lies within .
Thus, the map is a continuous local inverse of . This completes the proof of the openness of . ∎
The images of the standard charts for cover the “lifted” deformation space . We next prove that their transition maps are smooth.
Lemma 6.8.
Let , , be two standard charts around the points , for . Suppose that the intersection
is nonempty. Then the map
is smooth.
In particular, the standard charts of define a smooth structure on . The dimension of is .
Proof.
Let and let . Define .
From the definition of standard charts, it follows immediately that . Furthermore, the following relations hold due to the fact that and from the construction of the standard charts:
for | |||||
for | |||||
for |
In particular, can be expressed as a rational function of the entries of .
Since is an embedded submanifold of , we conclude that the transition map is smooth. (See the remark at the end of Section 6.2.)
6.4. Proof of the main theorem
In this section, we finalize the proof of Theorem 1.2.
Recall that the group acts smoothly on by
Lemma 6.9.
Suppose that the underlying combinatorial polytope of is not a cone over a polygon. Then the action of on is proper and free.
Proof.
Since the group acts freely on , it also acts freely on .
We prove the properness of the action of on . Since the map is a principal bundle and both and are smooth manifolds (Lemma 6.4), the action of on is proper.
To prove that the action of on is proper, let be a compact subset of . Let be a sequence in , a sequence in , and suppose . We need to find a convergent subsequence of . The sequences and lie in the compact subset . Since the action of on is proper, we conclude that has a convergent subsequence.
∎
We conclude the proof of our main theorem.
Theorem 1.2. Let be a labeled combinatorial 3-polytope. Let and be the numbers of facets and the edges of order 2 of . Suppose that is orderable and of normal type. Suppose further that the stabilizer subgroup of fixing any polyhedron representing is trivial. Then is a smooth manifold of dimension .
Proof.
By the embedding in Lemma 2.4 and Section 6.2, the space is homeomorphic to . By Lemma 6.9, the space admits a smooth structure such that the quotient map is a smooth submersion.
The dimension of the smooth manifold is computed in Lemma 6.8. It follows that admits a smooth structure, and its dimension is
∎
7. Examples
The deformation space is naturally identified with a subspace of . In the preceding section, we introduced the map , which associates each Coxeter 3-polytope with the projective equivalence class of polytopes. Each non-empty fiber of corresponds to a restricted deformation space, and it is a smooth manifold in the settings of Theorem 1.2. Furthermore, since the map is induced by the projection , it is an open map onto an open submanifold of the realization space .
In this section, we examine two examples of labeled combinatorial 3-polytopes to illustrate a procedure for computing . We explicitly compute the restricted deformation spaces, corresponding to the non-empty fibers of the map , and describe the global deformation space
In Example 7.1, we present a case where the deformation space is topologically a cell, outlining a method to compute both the realization space and the restricted deformation spaces in detail. In Example 7.2, we apply the same procedure and observe that, while the restricted deformation spaces are smooth manifolds of the same dimension (cf. Theorem 4.5), some of them may not be homeomorphic to each others. In particular, the projection map is generally not a fiber bundle. In both examples, we see that the map is not surjective. This implies that, given two combinatorially equivalent convex 3-polytopes in , one polytope may admit reflections making it a Coxeter polytope, while the other may not admit such reflections.
Example 7.1.
Let be the labeled combinatorial 3-polytope given in Figure 3. In the notations of Theorem 1.2, we have , , and . Thus, the deformation space is a smooth manifold of dimension by Theorem 1.2 and the realization space is a smooth manifold of dimension by 5.4. Furthermore, the restricted deformation spaces, which can be identified with the nonempty fibers of the map , are smooth manifolds of dimension .
For this example, we first describe the realization space , then compute the restricted deformation spaces explicitly, and finally determine the global structure of the deformation space .
- The description of the realization space .
We first describe the realization space explicitly. Here is a brief outline of the computations. For each (see Section 6.1 for the notation), we find a “standard” representative of the -orbit of such that the first five linear functionals are in a specified form. It can then be easily checked that such a representative is unique in each -orbit. Next, we determine the last linear functional such that the resulting convex 3-polytope, defined by the inequalities , is combinatorially equivalent to .
Let be an arbitrary element. We note that the first five linear inequalities determine a convex 3-polytope, which is a triangular prism. Since any triangular prism has 9 edges, its realization space is 0-dimensional by Theorem 5.4. Indeed, it can be verified that the realization space consists of a single element, defined by the inequalities where
and is the standard basis of the dual vector space . Here we have chosen the indices so that the facets supported by match the adjacency relations shown in Figure 3.
We next find such that the six inequalities , , determine a convex polytope combinatorially equivalent to . Let be the triangular prism determined by the first five inequalities , and let be the vertices of contained in the facets and , respectively.
Then, the sixth supporting hyperplane must pass through the vertices and . Using the explicit forms of the first five functionals , we can obtain
Substituting these vertices into , we find that has the form
(7.1) |
for some .
To obtain possible values of , we observe that the vertex of (defined analogously to and ) must lie inside the half-space . The vertex must satisfy and , so we have . Substituting in the relation (7.1) we thus obtain . Since multiplying by a positive scalar leaves the hyperplane invariant, we may assume
for some .
We find the range of such that the inequalities determine a convex 3-polytope combinatorially equivalent to . Let denote the edge of the triangular prism . The inequalities determine a convex 3-polytope combinatorially equivalent to if and only if the hyperplane intersects the interior of the edge transversally. This condition holds if and only if the three vertices , , and lie in the open half-space , while the vertex lies in the opposite half-space . Using the explicit forms of the first five functionals , we obtain , , and . Substituting these vertices, we find that determines an element of if and only if . By Lemma 6.3, we see that different values of give projectively non-equivalent elements of . Thus, we obtain an infinite path given by , where
and this path descends to a homeomorphism .
- The computation of the restricted deformation spaces.
We compute the restricted deformation spaces for the same labeled combinatorial 3-polytope . Recall from Section 6.2 that the restricted deformation spaces in can be identified with the nonempty fibers of the map . In the commuting diagram of Figure 2, we see that they can also be identified with the nonempty fibers of the map . Moreover, since maps each nonempty fiber of homeomorphically onto a nonempty fiber of , it suffices to compute the nonempty fibers of .
Here is the outline of the computation. Let , and let as described in the previous computation. An element lies in if and only if satisfies the conditions (V1) through (V6). The condition (V6) is already given since . We first find such successively by solving the linear equations arising from the conditions (V1), (V3), and (V4). Then we sort out the solutions satisfying the condition (V2). Checking (V5) is unnecessary, as it is redundant with (V1) through (V4) by Lemma 6.6 (this redundancy is explained at the end of the proof of Lemma 6.5). In the process, we will also determine all values of for which the fiber is nonempty.
We first find the vector . By conditions (V1) and (V3), it is uniquely determined by the equalities
Hence, we obtain .
Similarly, the equations , for , and yield .
The third vector is not uniquely determined. It is given by only the three equations and for . Thus, for some . The parameter will serve as the parameter for the 1-dimensional restricted deformation space, and we will determine the range of possible values for later.
For , we need an additional condition (V4), and the resulting system of equations is
Thus, we obtain , which depends uniquely on and .
Following the same approach, we find
and .
To summarize, we have obtained
The realization space is parametrized by , and the restricted deformation space corresponding to the parameter is then parametrized by .
Next, we find all and such that satisfies condition (V2). Since the cases are already covered in the construction of , we only need to consider the pairs such that . Furthermore, Lemma 6.6 implies that it suffices to consider pairs with , , and . These pairs correspond to the edges of with order .
It follows that the values of and satisfying condition (V2) must satisfy the inequalities
These inequalities, combined with the condition , yield
We conclude that the restricted deformation space over the point is nonempty if and only if . Moreover, each nonempty fiber , parametrized by , is homeomorphic to an open interval.
From these observations, we conclude that the deformation space is homeomorphic to an open 2-cell , which gives an additional information to the statement of Theorem 1.2.
Example 7.2.
We consider the labeled combinatorial 3-polytope given in Figure 4. The global topological structure of can be easily obtained without computing the restricted deformation spaces as in the previous example. This polytope is a truncation polytope, so we can apply Theorem 3.16 of [8] to conclude that the deformation space is homeomorphic to the space , the disjoint union of two copies of .
In Example 7.1, the map is not surjective, but it is a fiber bundle onto its open image, parametrized by . In the current example, we will see that the map is not a fiber bundle over its image by observing that the number of connected components of the fibers over a single continuous path in is not constant.
We will compute the realization space and some restricted deformation spaces, but will omit details of computations that are similar to those in Example 7.1.
In the computation of the space , we apply the same argument as in Example 7.1. Specifically, we consider the unique representative in each -orbit such that the first five functionals determine the triangular prism as in Example 7.1. This prism is defined by the five inequalities , where for (the standard basis elements of ), and .
Note that the positions of and are switched compared to Example 7.1. This adjustment ensures that the orderability conditions are satisfied.
Let be the vertex of . For the sixth element , the set forms a convex 3-polytope combinatorially equivalent to if and only if the vertex lies in the open half-space and the remaining five vertices of lie in the opposite half-space .
These conditions, along with normalization by positive scalars, yield the parametrization of given by
with . The number of parameters also coincides with Theorem 5.4 since we have .
Next, we consider a specific path inside using the parametrization. Let , be the (infinite) path given by
in the above parametrization.
We examine the fiber over the point , i.e., the restricted deformation space associated with the polytope determined by . Following the same argument as in Example 7.1, we compute the vectors as
where parametrizes the 1-dimensional restricted deformation space for each .
The complete solution to this system of inequalities is complicated. For our purposes, it suffices to note the following partial solutions:
In particular, the number of connected components of the restricted deformation spaces changes from 1 to 2 as the parameter passes the value . Moreover, the system of inequalities has no solution if
so the fibers for such are empty. Thus, the map is not surjective, as in Example 7.1, but in this example, the map is not a fiber bundle either.
References
- [1] Suhyoung Choi. The deformation spaces of projective structures on 3-dimensional Coxeter orbifolds. Geom. Dedicata, 119, 2006.
- [2] Suhyoung Choi, Craig D. Hodgson, and Gye-Seon Lee. Projective deformations of hyperbolic Coxeter 3-orbifolds. Geom. Dedicata, 159:125–167, 2012.
- [3] Suhyoung Choi and Gye-Seon Lee. Projective deformations of weakly orderable hyperbolic Coxeter orbifolds. Geom. Topol., 19(4):1777–1828, 2015.
- [4] Suhyoung Choi, Gye-Seon Lee, and Ludovic Marquis. Deformation spaces of Coxeter truncation polytopes. J. Lond. Math. Soc. (2), 106(4):3822–3864, 2022.
- [5] Jeffrey Danciger, François Guéritaud, Fanny Kassel, Gye-Seon Lee, and Ludovic Marquis. Convex cocompactness for coxeter groups. Journal of the European Mathematical Society, 2024. Published online first.
- [6] Jean Paul Filpo Molina. On the realization space of convex polyhedra. Master’s thesis, Korea Advanced Institute of Science and Technology, Daejeon, South Korea, 2022.
- [7] G. A. Margulis and È.B̃. Vinberg. Some linear groups virtually having a free quotient. J. Lie Theory, 10(1):171–180, 2000.
- [8] Ludovic Marquis. Espace des modules de certains polyèdres projectifs miroirs. Geom. Dedicata, 147:47–86, 2010.
- [9] Ludovic Marquis. Coxeter group in Hilbert geometry. Groups Geom. Dyn., 11(3):819–877, 2017.
- [10] Seung-Yeol Park. The mathematica code for counting orderable labeled polytopes. https://sites.google.com/view/seungyeolpark/resources, 2024. Accessed on 2024-07-21.
- [11] Laith Rastanawi, Rainer Sinn, and Günter M. Ziegler. On the dimensions of the realization spaces of polytopes. Mathematika, 67(2):342–365, 2021.
- [12] Jürgen Richter-Gebert. Realization spaces of polytopes, volume 1643 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1996.
- [13] E. Steinitz. Polyeder und raumeinteilungen. Encyklopädie der mathematischen Wissenschaften, 1916. Published online.
- [14] Tammo tom Dieck. Algebraic topology. EMS Textbooks in Mathematics. European Mathematical Society (EMS), Zürich, 2008.
- [15] È.B̃. Vinberg. Discrete linear groups that are generated by reflections. Izv. Akad. Nauk SSSR Ser. Mat., 35:1072–1112, 1971.