The rigidity of the graphs of homology spheres minus one edge
Hailun Zheng

TL;DR
This paper proves that removing any edge from the graph of a prime homology sphere of dimension at least 2 results in a graph that is generically rigid in the corresponding dimension, confirming a previous conjecture.
Contribution
It establishes the generic rigidity of graphs derived from prime homology spheres minus one edge, confirming a conjecture by Nevo and Novinsky.
Findings
Graphs of prime homology spheres minus one edge are generically rigid in the corresponding dimension.
Confirms the conjecture of Nevo and Novinsky for all prime homology spheres of dimension at least 2.
Provides a new understanding of the rigidity properties of homology sphere graphs.
Abstract
We prove that for any prime homology -sphere of dimension and any edge , the graph is generically -rigid. This confirms a conjecture of Nevo and Novinsky.
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.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics
The rigidity of the graphs of homology spheres minus one edge
Hailun Zheng
Department of Mathematics
University of Washington
Seattle, WA 98195-4350, USA
Abstract
We prove that for any prime homology -sphere of dimension and any edge , the graph is generically -rigid. This confirms a conjecture of Nevo and Novinsky.
1 Introduction
The main object of this paper is the notion of generic rigidity. We now briefly mention a few relevant definitions, defering the rest until later sections. Recall that a -embedding of a graph is a map . This embedding is called rigid if there exists an such that if satisfies for every and for every , then for every . A graph is called generically -rigid if the set of rigid -embeddings of is open and dense in the set of all -embeddings of .
The first substantial mathematical result concerning rigidity can be dated back to 1813, when Cauchy proved that any bijection between the vertices of two convex 3-polytopes that induces a combinatorial isomorphism and an isometry of the facets, induces an isometry of the two polytopes. Based on Cauchy’s theorem and on later results by Dehn and Alexandrov, in 1975 Gluck [6] gave a complete proof of the fact that the graphs of all simplicial 3-polytopes are generically 3-rigid. Later Whiteley [11] extended this result to the graphs of simplicial -polytopes for any . Many other generalizations have been made since, including, for example, the following theorem proved by Fogelsanger.
Theorem 1.1**.**
[5]* Let . The graph of a minimal -cycle complex is generically -rigid. In particular, the graphs of all homology -spheres are generically -rigid.*
The rigidity theory of frameworks is a very useful tool for tackling the lower bound conjectures. For a -dimensional simplicial complex , we define , where and are the numbers of edges and vertices of , respectively. By interpreting as the dimension of the left kernel of the rigidity matrix of , Kalai [7] proved that the -number of an arbitrary triangulated manifold of dimension at least three is nonnegative (thus reproving the Lower Bound Theorem due to Barnette [3], [4]). Furthermore, Kalai showed that is attained if and only if is a stacked sphere. Kalai’s theorem was then extended to the class of normal pseudomanifolds by Tay [10], where Theorem 1.1 served as a key ingredient in the proof. We refer to [8] for another application of the rigidity theory to the Balanced Lower Bound Theorem.
It might be tempting to conjecture that the graph of a non-stacked homology sphere minus any edge of is also generically -rigid. This is not true in general; for example, let be obtained by stacking over a facet of any -sphere , and let be any edge not in . In this case the graph of is not generically -rigid. However, Nevo and Novinsky [9] showed that this statement does hold if, in addition, one requires that is prime (i.e., has no missing facets) and . They raised the following question.
Problem 1.2**.**
[9, Problem 2.11]* Let and let be a prime homology -sphere. Is it true that for any edge in , the graph is generically -rigid?*
In this paper we give an affirmative answer to the above problem. The proof is based on the rigidity theory of frameworks. Specifically, we first verify the base cases and , and then prove the result by inducting on both the dimension and the value of .
The paper is organized as follows. In Section 2 after reviewing some preliminaries on simplicial complexes, we introduce the rigidity theory of frameworks and summerize several well-known results in this field. We then prove our main result (Theorem 3.4) in Section 3.
2 Preliminaries
A simplicial complex on vertex set is a collection of subsets , called faces, that is closed under inclusion, and such that for every , . The dimension of a face is , and the dimension of is . The facets of are maximal faces of under inclusion. We say that a simplicial complex is pure if all of its facets have the same dimension. A missing face of is any subset of such that is not a face of but every proper subset of is. A pure simplicial complex is prime if it does not have any missing facets.
For a simplicial complex , we denote the graph of by . If is a graph and , then the restriction of to is the subgraph whose vertex set is and whose edge set consists of all of the edges in that have both endpoints in . We denote by the graph of the cone over a graph , and by the complete graph on the vertex set . For brevity of notation, in the following we will use (resp. ) to denote the graph obtained by adding an edge to (resp. deleting from) .
In this paper we focus on the graphs of a certain class of simplicial complexes. Given an edge of a simplicial complex , the contraction of to a new vertex in is the simplicial complex
[TABLE]
A simplicial complex is a simplicial sphere if the geometric realization of , denoted as , is homeomorphic to a sphere. Let denote the reduced singular homology of with coefficients in . The link of a face is , and the star of is . For a pure -dimensional simplicial complex and a field , we say that is a homology sphere over if for every face , including the empty face. We have the following inclusion relations:
boundary complexes of simplicial -polytopes simplicial -spheres
homology -spheres.
It follows from Steinitz’s theorem that when , all three classes above coincide. When , all three inclusions are strict.
We are now in a position to review basic definitions of rigidity theory of frameworks. Given a graph and a -embedding of , we define the matrix associated with a graph as follows: it is an matrix with rows labeled by edges of and columns grouped in blocks of size , with each block labeled by a vertex of ; the row corresponding to contains the vector in the block of columns corresponding to , the vector in columns corresponding to , and zeros everywhere else. It is easy to see that for a generic the dimensions of the kernel and image of are independent of . Hence we define the rigidity matrix of as for a generic . It follows from [2] that is generically -rigid if and only if . The following lemmas summerize a few additional results on framework rigidity.
Lemma 2.1** (Cone Lemma, [11]).**
* is generically -rigid if and only if is generically -rigid.*
Since the star of any face in a homology sphere is the join of with the link of , and since the link of is a homology sphere, Theorem 1.1 along with the cone lemma implies the following corollary.
Corollary 2.2**.**
Let and let be a homology -sphere. Then the graph of is generically -rigid for any face with .
Lemma 2.3** (Gluing Lemma, [2]).**
Let and be generically -rigid graphs such that has at least vertices. Then is also generically -rigid.
Lemma 2.4** (Replacement Lemma, [7]).**
Let be a graph and a subset of . If both and are generically -rigid, then is generically -rigid.
Finally we state a variation of the gluing lemma.
Lemma 2.5**.**
Let and be two graphs, and assume that . Assume further that and satisfy the following conditions: 1) the set contains at least vertices, including and , 2) both and are generically -rigid, and 3) . Then is also generically -rigid.
*Proof: * The second condition implies that is generically -rigid. Since are generically -rigid for and their intersection contains at least vertices, by the gluing lemma, is generically -rigid. Note that by condition 3), the restriction of to is . Replacing by the generically -rigid graph , we obtain the graph , which is also generically -rigid by the replacement lemma.
3 Proof of the main theorem
In this section we will prove our main result, Theorem 3.4. We begin with the following lemma that is originally due to Kalai. We give a proof here for the sake of completeness.
Lemma 3.1**.**
Let and let be a homology -sphere. If is a missing -face in and , then is generically -rigid for any edge .
*Proof: * Let . The dimension of is
[TABLE]
so is generically -rigid. By Corollary 2.2, is generically -rigid. Note that , and the induced subgraph of on contains a generically -rigid subgraph . Applying the replacement lemma on (that is, replacing with ), we conclude that the resulting graph is also generically -rigid.
The following proposition was mentioned in [9] without a proof.
Proposition 3.2**.**
Let be a prime homology -sphere with , where . Then for any edge , the graph is generically -rigid.
*Proof: * By Theorem 1.3 in [9], , where is the boundary complex of an -simplex for some , and is either the boundary complex of a -simplex, or a cycle graph when . If , then is generically -rigid by Lemma 3.1. Now assume that contains a vertex in . Note that is either a simplex or a path graph. In the former case, the graph of is the complete graph on vertices, and hence it is generically -rigid. In the latter case, since the graph of is also the complete graph on vertices, by the gluing lemma, is generically -rigid. Finally, the graph is obtained by adding to the vertex and edges containing . Hence is generically -rigid.
Proposition 3.3**.**
Let be a prime homology 3-sphere. For any edge , the graph is generically 4-rigid.
*Proof: * The proof has a similar flavor to the proof of Proposition 1 in [12]. If is an edge in a missing 2-face of , then by Lemma 3.1, is generically 4-rigid. Now assume that does not belong to any missing 2-face of . We claim that . If , then , and are edges of . Hence, by our assumption, , and so . Also if , then . Since does not belong to any missing 2-face of , it follows that . Hence , which by the primeness of implies that , i.e., . Finally, if contains a 2-dimensional face whose boundary edges are and , then the above argument implies that for . Hence , and so is the boundary complex of a 3-simplex. This contradicts the fact that is prime. We conclude that both and are 1-dimensional. Furthermore, . However, it is obvious that the reverse inclusion also holds. This proves the claim.
If is a 3-cycle, then the filled-in triangle determined by is not a face of . Otherwise, by the fact that and are subcomplexes of and by the primeness of , we obtain that . Then since , we conclude that , contradicting that is 1-dimensional. Hence we are able to construct a new sphere from by replacing with the suspension of (indeed, and differ in a bistellar flip), and therefore is generically 4-rigid. Next we assume that has at least 4 vertices. By [9, Proposition 2.3], the edge contraction of is also a homology sphere. Assume that in a -embedding of , both and are placed at the origin, , and . The rigidity matrix of can be written as a block matrix
[TABLE]
where the columns of and correspond to the vertices in , and the rows of correspond to the edges containing either or but not both. For convenience, we write (resp. , ) to represent (resp. and ). Then
[TABLE]
where the rest of the entries not indicated above are 0. We apply the following row and column operations to matrix : first add the last four columns, i.e. columns corresponding to to the corresponding columns of , then substract row from the row for . This gives
[TABLE]
where is the -embedding of induced by , where for the new vertex , and for all other vertices . Since , it follows that the last four columns of are linearly independent. Hence for a generic ,
[TABLE]
Since is the maximal rank that the rigidity matrix of a 4-dimensional framework with vertices can have, and a small generic perturbation of and preserves the rank of the rigidity matrix, we conclude that . Hence is generically 4-rigid.
In the following we generalize the previous proposition to the case of by inducting on the dimension and the value of . We fix some notation here. If a homology -sphere is the connected sum of prime homology spheres , then each is called a prime factor of . In particular, is called stacked if each is the boundary complex of a -simplex. For every stacked -sphere with , there exists a unique simplicial -ball with the same vertex set as and whose boundary complex is ; we denote it by . We refer to such a ball as a stacked ball.
Theorem 3.4**.**
Let and let be a prime homology -sphere with . Then for any edge , the graph is generically -rigid.
*Proof: * The two base cases and are proved in Proposition 3.2 and 3.3 respectively. Now we assume that the statement is true for every prime homology -sphere with and and every edge . The result follows from the following two claims.
Claim 3.5**.**
Under the above assumptions, if, furthermore, for some vertex , then is generically -rigid for any edge .
*Proof: * Since is at least 3-dimensional and since , it follows that is a stacked sphere. Also since is prime, the interior faces of the stacked ball are not faces of (or otherwise such a face together with will form a missing facet of ). Let
[TABLE]
Then is a homology -sphere but not necessarily prime. (For more details on this and similar operations, see [13].) Also by the primeness of , every missing facet of must contain a missing facet of . Pick a missing facet of and assume that there are prime factors of that contain . We first find two facets of that contain and say they are and . Now assume that the prime factors of are , and each of them satisfies for some other vertices and . Furthermore, for . Let , where is the set of edges connecting and the vertices in . Since an arbitrary edge of either contains or belongs to one of ’s, it follows that , where the union is taken over all missing facets of . By the gluing lemma, it suffices to show that is generically -rigid for any and edge . We consider the following two cases:
Case 1: for some , is not the boundary complex of the -simplex, and for any other . Since is a generically -rigid subgraph of , it follows that
[TABLE]
Furthemore, by the inductive hypothesis on , is generically -rigid for any edge . Also since is the induced subgraph of on , by the replacement lemma, is generically -rigid.
Case 2: either for some and is the boundary complex of the -simplex (in this case the edge ), or , or . Hence , where is the cycle graph . By Lemma 3.2, is generically -rigid for any edge . The graph can be recovered from by replacing each edge with the edges in whenever is not the boundary complex of the -simplex. Note that nothing needs to be done when is the boundary complex of a simplex, since is already a subcomplex of . (See Figure 1 for an illustration in a lower dimension case.) Repeatedly applying Lemma 2.5 with , and , we conclude that is also generically -rigid.
Claim 3.6**.**
Under the above assumption, if, furthermore, every vertex link of has , then is generically -rigid for any edge .
*Proof: * Assume that there is a vertex such that is the connected sum of prime factors and for some . If is an edge in a missing facet of (which is also a missing -face of ), then by Lemma 3.1, is generically -rigid.
Otherwise, assume first that . Then is generically -rigid by the inductive hypothesis on the dimension. Hence by the gluing lemma and cone lemma, we obtain that is generically -rigid. By the replacement lemma, is generically -rigid.
Finally, assume that is the boundary complex of a -simplex, or equivalently, is the boundary complex of a -simplex. If furthermore for any vertex , the link of in is the boundary complex of -simplex, then must be the boundary complex of a -simplex. Hence is obtained by adding a pyramid over a facet of some -sphere, and is the apex of the pyramid. Now we construct a new homology -sphere as follows: first delete the edge from , then add the faces , and to . It follows that , which implies that is generically -rigid.
Otherwise, there exists a vertex such that is not the boundary complex of -simplex. Then we may show that is generically -rigid by applying the same argument as above on . This proves the claim.
Acknowledgements
The author was partially supported by a graduate fellowship from NSF grant DMS-1361423. I thank Isabella Novik for helpful comments and discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Asimow and B. Roth: The rigidity of graphs I., Trans. Am. Math. Soc. , 245 (1978), 279-289.
- 2[2] L. Asimow and B. Roth: The rigidity of graphs II., Math. Anal. Appl. , 68 (1979), 171-190.
- 3[3] D. Barnette, A proof of the lower bound conjecture for convex polytopes, Pacific J. Math. , 46 (1973), 349-354.
- 4[4] D. Barnette, Graph theorems for manifolds, Israel Journal of Mathematics , 16 (1973), 62–72.
- 5[5] A. Fogelsanger: The generic rigidity of minimal cycles, Pro Quest LLC, Ann Arbor, MI, 1988. Thesis (Ph.D.)-Cornell University.
- 6[6] H. Gluck: Almost all simply connected closed surfaces are rigid, in: Geometric Topology , Proc. Conf., Park City, Utah, 1974; in: Lecture Notes in Math. , Springer, Berlin, 438 (1975), 225-239.
- 7[7] G. Kalai: Rigidity and the lower bound theorem. I, Invent. Math. , 88 (1987), 125-151.
- 8[8] S. Klee and I. Novik: Lower bound theorems and a generalized lower bound conjecture for balanced simplicial complexes, Mathematika , 62 (2016), 441-477.
