A sufficient condition for a polyhedron to be rigid
Victor Alexandrov

TL;DR
This paper establishes a new sufficient condition based on edge length relations that guarantees a polyhedron's rigidity, and explores properties of dihedral angles during flexing.
Contribution
It introduces a novel criterion involving rational linear combinations of edge lengths to determine polyhedral rigidity and analyzes dihedral angle invariants during flexing.
Findings
Polyhedra are rigid if each edge length cannot be expressed as a rational linear combination of the others.
Flexible polyhedra have certain linear combinations of dihedral angles that remain constant during flexing.
Coefficients of these invariant linear combinations are integers and do not change during flex.
Abstract
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed continuously by changing its dihedral angles only. We prove that the polyhedron is not flexible if for each of its edges the following holds true: the length of this edge is not a linear combination with rational coefficients of the lengths of the remaining edges. We prove also that if a polyhedron is flexible, then some linear combinations of its dihedral angles remain constant during the flex. In this case, the coefficients of such a linear combination do not alter during the flex, are integers, and do not equal to zero simultaneously.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A sufficient condition for a polyhedron
to be rigid
Victor Alexandrov
Sobolev Institute of Mathematics, Koptyug ave., 4, Novosibirsk, 630090, Russia and Department of Physics, Novosibirsk State University, Pirogov str., 2, Novosibirsk, 630090, Russia
December 26, 2018
Abstract.
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed continuously by changing its dihedral angles only. We prove that the polyhedron is not flexible if for each of its edges the following holds true: the length of this edge is not a linear combination with rational coefficients of the lengths of the remaining edges. We prove also that if a polyhedron is flexible, then some linear combinations of its dihedral angles remain constant during the flex. In this case, the coefficients of such a linear combination do not alter during the flex, are integers, and do not equal to zero simultaneously.
Keywords: flexible polyhedron, dihedral angle, Dehn invariant, Hamel basis, Bricard octahedron.
Mathematics subject classification (2010): Primary 52C25, Secondary 52B70, 51M20.
1. Introduction
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in . For brevity, we call them polyhedra, as is customary in the theory of flexible polyhedra. A polyhedron is called flexible, if its spatial form can be changed continuously by changing its dihedral angles only, i. e., due to such a continuous (in particular, continuous with respect to a parameter describing the process of the flex) deformation of the polyhedron, in which each of its faces remains congruent to itself in the process of deformation. A continuous family of such deformations is called the flex of the polyhedron.
We know quite a lot about flexible polyhedra, namely:
(a) they do exist (see [6], [7]; see also [26], [24], [8]; moreover, they can be of any genius and can even be non-orientable, see [35];
(b) during the flex, they necessarily keep unaltered the so-called total mean curvature, see [1];
(c) during the flex, they necessarily keep unaltered the volume of the domain they bound (see [29], [30], [31]; see also [9], [34]);
(d) during the flex, they necessarily keep unaltered the Dehn invariants, see [21];
(e) the notion of a flexible polyhedron can be introduced in all spaces of constant curvature of dimension 3 and above (see [36], [37], [16], [17], [19], as well as in pseudo-Euclidean spaces of dimension 3 and above (see [3]); moreover, it is known that in many of these spaces flexible polyhedra do exist and possess properties similar to properties (a)–(d) (see [24], [14], [15], [18], [20]).
However, still very little is known about one of the central problems of the theory of flexible polyhedra: how do we know if a given polyhedron is flexible or not? Roughly, we can say that to answer this problem we have only the classical results that a closed convex polyhedron is necessarily nonflexible (i. e., rigid) and that a polyhedron that does not allow nontrivial infinitesimal deformations is also rigid. A large number of publications is devoted to these results, of which we will indicate only a few, in our opinion, the most significant ones, namely [2], [5], [11], [23], [38], [28], [33]. Among recent results in this direction, we mention the following one by I. Kh. Sabitov [32]: given a polyhedron, he builds a certain set of polynomials and proves that if each of these polynomials has at least one non-zero coefficient, then the polyhedron is rigid.
In this article, we give a fundamentally new sufficient condition for a polyhedron to be rigid. Namely, we prove that the condition “the length of each edge is not a -linear combination of the lengths of the remaining edges,” implies that the polyhedron is rigid, see Theorem 2 in Section 3.
In addition, we prove that if a polyhedron is flexible, some linear combinations of its dihedral angles remain constant during the flex, see Theorem 3 in Section 3. In this case, the coefficients of such a linear combination do not change during the flex, are integers, and not all are equal to zero.
Our arguments essentially use one auxiliary statement, proved by A. A. Gaifullin and L. S. Ignashchenko in [21], see Lemma 1 in Section 2.
2. Definitions, notation, and an auxiliary statement
Definition 1**.**
A non-empty finite set of simplices in Euclidean space is called a finite strongly connected two-dimensional simplicial complex if the following conditions (i)–(v) are satisfied:
(i) each face of a simplex in is itself a simplex in ;
(ii) the intersection of any two simplices of is a face for each of these simplices;
(iii) each simplex of is contained in a 2-dimensional simplex of ;
(iv) every 1-dimensional simplex of the complex is contained in exactly two 2-dimensional simplices of ;
(v) for any two 2-dimensional simplices there is a sequence of 2-dimensional simplices of the complex such that the intersection of is a 1-dimensional simplex of for all .
The set of all -dimensional simplices of the complex is denoted by , .
A complex is called oriented if each of its 2-dimensional simplices is equipped with an orientation and these orientations are consistent with each other. The latter means that if is contained both in and , then and generate opposite orientations on .
Remark 1*.*
The conditions (i) and (ii) mean that is a simplicial complex; the condition (iii), in particular, means that is a two-dimensional complex; the condition (iv) means that has no neither boundary nor branch points; the condition (v) means that is strongly connected.
Definition 2**.**
Let be a finite strongly connected two-dimensional simplicial complex. A mapping , whose restriction to each simplex of is affine, is called a polyhedron of the combinatorial type . For brevity, the image of under the action of is sometimes called a polyhedron too. If and then is called a vertex of , if ; is called an edge of , if ; and is called a face of , if . We say that a polyhedron has nondegenerate faces (or, equivalently, nondegenerate triangular faces), if, for every , the face is a nondegenerate 2-dimensional simplex in . If is an oriented complex, then a polytope is called oriented.
Remark 2*.*
A polyhedron may have self-intersections, i. e., in Definition 2, it may occur that there are simplices such that and .
Definition 3**.**
A continuous family of polyhedra is called a flex of a polyhedron if and, for every and , the face of the polyhedron is congruent to the face of the polyhedron . A flex is called trivial if is obtained from by means of an isometry of , i. e., if for every there is an isometry such that . Otherwise, the flex is called nontrivial. A polyhedron is called flexible if there is nontrivial flex of and is called rigid if every flex of is trivial.
Remark 3*.*
Definitions 2 and 3 concern only simplicial polytopes, but this does not reduce the generality of the results obtained in Section 3. After all, even if we would use some more general definition of a flexible polyhedron, which allows us to consider flexible polyhedra with non-triangular faces, we would additionally triangulate the faces of the flexible polyhedron and obtain a flexible polyhedron in the sense of Definition 3. Note also that, by analogy with Definitions 1–3, the concept of a flexible polyhedron can be defined in any spatial form (i. e., in a connected complete Riemannian manifold of constant curvature) of dimension 3 and above; see, e. g., [24], [37], [16], [17], [18], [20].
Definition 4**.**
Let be a finite strongly connected oriented two-dimensional simplicial complex and be an oriented polyhedron with nondegenerate faces. Suppose , and . Let us denote by and the unit positively oriented (according to the orientation of ) normals to the faces respectively. Consider first the case when . Let be an arbitrary point of the edge , which is not a vertex of , and let be a ball in which is centered at and does not intersect any edge of the faces and , except the edge . The set divides the ball into two bodies (slices). Let us denote by the one whose interior contains the points , where a positive number is less than the radius of the ball . We call the number , the principal value of the dihedral angle of the polyhedron at the edge . Here stands for the 3-dimensional volume of the corresponding body. If , we put by definition . We call the set the oriented dihedral angle at the edge of the polyhedron . Here stands for the principal value of the dihedral angle at the edge .
Remark 4*.*
It can be shown that is in the range from 0 to and does not depend on the choice of the point on the edge . It can also be shown that is not a continuous function on the set of all oriented polytopes of a given combinatorial type with non-degenerate faces. The fact is that if at the edge of , then in any neighborhood of there exist polyhedra of combinational type with non-degenerate faces, for which the principal value of the dihedral angle at the corresponding edge is close to [math] and there are polyhedra for which it is close to . On the other hand, it can be shown that the many-valued function is continuous on the set of all oriented polytopes of a given combinatorial type with non-degenerate faces. Therefore, it is possible to find continuous selection functions for it, see [25]. In Definition 5, we use the existence of a suitable continuous selection function.
Definition 5**.**
Let be a finite strongly connected oriented two-dimensional simplicial complex and let . Let be an oriented polyhedron with nondegenerate faces and let be a flex of . We call a continuous selection function of the multi-valued mapping such that , where is a principal value of the dihedral angle of at the edge , a dihedral angle at the edge during the flex .
The following lemma is a very special case of Statement 3.4, proved by A. A. Gaifullin and L. S. Ignashchenko in their article [21].
Lemma 1*.*
Let be a finite strongly connected oriented two-dimensional simplicial complex, be an oriented polyhedron with nondegenerate faces, and be a flex of . Then, for every -linear function, , the expression is independent of , i. e. it remains constant during the flex. Here, summation is carried out over all 1-dimensional simplices , while and denote the length of the edge and the dihedral angle of the polyhedron at the edge during the flex , respectively.
We will use Lemma 1 in Section 3.
3. The main results
Theorem 1*.*
Let be a finite strongly connected oriented two-dimensional simplicial complex, be an oriented polyhedron with nondegenerate triangular faces, and be a flex of . Suppose that a 1-dimensional simplex is such that the length of the edge is not a -linear combination of the lengths of the remaining edges of . Then the dihedral angle at the edge during the flex remains unaltered, i. e., .
Proof.
As usual, denote by the set of all 1-dimensional simplices of and put . Let us denote by the -linear span of the set , where stands for the length of the edge of . Let denote an arbitrary -basis in .
According to the conditions of Theorem 1, the set is -linearly independent. Viewing as a vector space over the field , expand to a Hamel basis in this space. Define a -linear function by putting for every element of the above constructed Hamel base in
[TABLE]
Since is a basis in , for every , there are rational numbers , such that . Therefore, from the definition of the function , we obtain for every
[TABLE]
Hence,
[TABLE]
However, according to Lemma 1, the left-hand side of the last equality is independent of . So, its right-hand side does not depend on too, i. e., . ∎
Theorem 2*.*
Let be a finite strongly connected oriented two-dimensional simplicial complex and be an oriented polyhedron with nondegenerate triangular faces. Suppose that the set of the lengths of the edges of is -linearly independent. Then is rigid.
Proof.
Let be a flex of the polyhedron . Since, for every , the length of the edge of cannot be represented as a -linear combination of the lengths of remaining edges of then, by Theorem 1, the dihedral angle at the edge during the flex remains constant, i. e., .
Let us fix and a 2-dimensional simplex . Since is a flex, there is an isometry , which matches the faces and together with their orientation, i. e., such that . Since, for every (including the case ), we have , the equality holds true on the union of the simplex and all three 2-dimensional simplices of , adjacent to . Continuing in the same way and using the strong connectivity of the complex , we make sure that the equality holds true on . Hence, the flex is trivial. Thus, we see that the polyhedron allows only trivial flexes, i. e., it is rigid. ∎
Remark 5*.*
For the first time, Theorem 2 was published without proof in [21] as Corollary 1.3.
Remark 6*.*
It would be very interesting to determine to what extent Theorem 2 holds for non-orientable polyhedra. The above arguments are not suitable for this, since they rely on Lemma 1, which is applicable to oriented polyhedra only.
Remark 7*.*
Theorem 2 gives a sufficient condition for a polyhedron to be rigid, which is fundamentally different from the two classical sufficient conditions for a polyhedron to be rigid mentioned in Section 1 (we mean the convexity and the absence of nontrivial infinitesimal deformations), and from a sufficient condition for rigidity of polyhedra found by I.Kh. Sabitov in [32]. Recall that, in [32, Theorem 2], for each small diagonal of a polyhedron , a polynomial in one real variable is constructed such that
the coefficients of are real numbers and depend only on and the edge lengths of ;
the length of this small diagonal is a root of a .
Obviously, if is flexible then at least one of its small diagonals is nonconstant and, therefore, takes infinitely many values. Hence, all the coefficients of the corresponding polynomial are zero. This consideration led I. Kh. Sabitov to the following sufficient condition for a polyhedron to be rigid: If for each small diagonal at least one coefficient of the corresponding polynomial is not equal to zero then the polyhedron is rigid, see [32, Corollary 2]. However, the application of Sabitov’s condition is complicated by the fact that the problem of finding the polynomial in itself is very difficult.
Remark 8*.*
Theorem 2 in a new way expresses the well-known fact that “almost all closed polytopes are inflexible.” The novelty is that the condition interpreted as “almost all” is imposed on the edge lengths, while in previously known theorems of this type a similar condition was imposed on the coordinates of the vertices. To be more precise, we recall that there is a natural one-to-one mapping from the set of all polyhedra of a given combinatorial type onto , where is the number of 0-dimensional simplices of . This mapping maps to the vector in such that the set of its coordinates is the union of the sets of coordinates of all vertices of ordered according to a preassumed order on the set of 0-dimensional simplices of . The following properties of the set consisting of the points of corresponding to flexible polyhedra are known:
(A) is contained in the complement to an open everywhere dense subset of , see, e. g., [5], [32], [22];
(B) is contained in the complement to a set which consists of the points whose coordinates are algebraically independent over (this means that, given , there is no nonzero polyhedron with rational coefficients for which is a root), see, e. g., [13], [12].
For completeness, we note that properties (A) and (B) are also valid in more general situations, namely, for various and very wide classes of frameworks in , , which, for , include 1-skeletons of -dimensional simplicial polyhedra, see, e. g., [27], [10] and literature mentioned there.
The following theorem is a generalization of Theorem 1:
Theorem 3*.*
Let be a finite strongly connected oriented two-dimensional simplicial complex, be the set of all 1-dimensional simplices of , be an oriented polyhedron with nondegenerate triangular faces, be the set of the lengths of all edges of , and let be a -basis in the -linear span of , i. e., the reals are -linearly independent and, for every , there are such that
[TABLE]
Then, for every flex of and every , the expression
[TABLE]
is independent of . In (1), the summation is taken over all 1-dimensional simplices of and stands for the dihedral angle at the edge during the flex .
Proof.
Treating as a vector space over the field , expand the set to a Hamel basis in this space. For every , define a -linear function by putting for an element of the above constructed Hamel base in
[TABLE]
Then, using (1) and the definition of , we get
[TABLE]
However, according to Lemma 1, the left-hand side of the last equality does not depend on . Hence, its right-hand side does not depend on . ∎
Remark 9*.*
Reducing rational numbers in (1) to a common denominator, we find that some linear combination of its dihedral angles remains constant during the flex of a polyhedron. Moreover, the coefficients of this linear combination do not change during the flex, are integers, and not all are equal to zero. Thus, Theorem 3 clarifies the origin of linear relations with integer coefficients between dihedral angles of Bricard octahedra, found in [4] (to be more precise, in [4], linear relations for dihedral angles of Bricard octahedra of types I, II, and III were obtained and used in the proofs of Theorems 2, 4, and 6, respectively).
4. Acknowledgement
The author is grateful to Alexander A. Gaifullin and Idzhad Kh. Sabitov for their comments on a preliminary version of this article.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Alexander, R.: Lipschitzian mappings and total mean curvature of polyhedral surfaces. I. Trans. Am. Math. Soc. 288 (2), 661–678 (1985)
- 2[2] Alexandrov, A.D.: Convex polyhedra. Springer, Berlin (2005)
- 3[3] Alexandrov, V.: Flexible polyhedra in Minkowski 3-space. Manuscr. Math. 111 (3), 341–356 (2003)
- 4[4] Alexandrov, V.: The Dehn invariants of the Bricard octahedra. J. Geom. 99 (1–2), 1–13 (2010)
- 5[5] Asimow, L., Roth, B.: The rigidity of graphs. II. J. Math. Anal. Appl. 68 , 171–190 (1979)
- 6[6] Bricard, R.: Mémoire sur la théorie de l’octaèdre articulé. Journ. de Math. (5) 3 , 113–148 (1897)
- 7[7] Connelly, R.: A counterexample to the rigidity conjecture for polyhedra. Publ. Math., Inst. Hautes Étud. Sci. 47 , 333–338 (1977)
- 8[8] Connelly, R.: Conjectures and open questions in rigidity. In: O. Lehto (ed.) Proceedings of the International Congress of Mathematicians, Helsinki 1978, Vol. 1, 407–414. Finnish Academy of Sciences, Helsinki (1980)
