Shadows of acyclic 4-manifolds with sphere boundary
Yuya Koda, Hironobu Naoe

TL;DR
This paper establishes conditions under which certain acyclic 4-manifolds with sphere boundary are diffeomorphic to the standard 4-ball, using Turaev's shadows and shadow-complexity constraints.
Contribution
It provides a new sufficient condition based on shadow complexity for identifying when such 4-manifolds are standard 4-balls.
Findings
Acyclic 4-manifolds with boundary S^3 and shadow-complexity ≤ 2 are diffeomorphic to the 4-ball.
A sufficient condition for a 4-manifold to be a 4-ball is given in terms of Turaev's shadows.
The paper links shadow complexity with the topological classification of 4-manifolds.
Abstract
In terms of Turaev's shadows, we provide a sufficient condition for a compact, smooth, acyclic 4-manifold with boundary the 3-sphere to be diffeomorphic to the standard 4-ball. As a consequence, we prove that if a compact, smooth, acyclic 4-manifold with boundary the 3-sphere has shadow-complexity at most 2, then it is diffeomorphic to the standard 4-ball.
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.
Shadows of acyclic 4-manifolds with sphere boundary
Yuya Koda
Department of Mathematics
Hiroshima University, 1-3-1 Kagamiyama, Higashi-Hiroshima, 739-8526, Japan
and
Hironobu Naoe
Department of Mathematics
Chuo University, 1-13-27 Kasuga Bunkyo-ku, Tokyo, 112-8551, Japan
Abstract.
In terms of Turaev’s shadows, we provide a sufficient condition for a compact, smooth, acyclic -manifold with boundary the -sphere to be diffeomorphic to the standard -ball. As a consequence, we prove that if a compact, smooth, acyclic -manifold with boundary the -sphere has shadow-complexity at most , then it is diffeomorphic to the standard -ball.
The first author is supported in part by JSPS KAKENHI Grant Numbers 15H03620, 17K05254, 17H06463, and JST CREST Grant Number JPMJCR17J4. The second author is supported by JSPS KAKENHI Grant Number 18H05827.
2010 Mathematics Subject Classification: 57N13; 57M20, 57R55, 57R65
**Keywords: 4-manifold, shadow, differentiable structure, handlebody, polyhedron. **
Introduction
In [24, 25], Turaev introduced the notion of shadow as a combinatorial tool to present smooth 3- and 4-manifolds. A shadow of a 4-manifold with boundary is a simple polyhedron properly embedded in so that collapses onto , and is locally flat in . The polyhedron is also called a shadow of the 3-manifold . By counting the minimum number of vertices of a shadow of a given 4- or 3-manifold, we get a (non-negative) integer-valued invariant called the shadow-complexity.
In the -manifold topology, shadows are used to study quantum invariants, see e.g. [24, 25, 1, 22, 23, 2]. Moreover, it was revealed that the shadow-complexity of a 3-manifold is strongly related to the Gromov norm and the minimum number of codimension- singular fibers of a stable map , see [9, 8, 13].
In the dimension , shadows allow us to classify -manifolds experimentally according to increasing complexity. Costantino [5] studied closed 4-manifolds of shadow-complexity [math] or in a special case. Here, a shadow of a closed 4-manifold is a shadow of the union of [math], , and handles of its handle decomposition. In [17] Martelli gave a complete classification of the closed 4-manifolds of shadow-complexity [math]. A very interesting consequence of this paper is that a simply connected closed 4-manifold has complexity zero if and only if it is a connected sum of copies of the standard , , , and . This implies in particular that the shadow-complexity detects the exotic structures on those manifolds. It is also classified the closed 4-manifolds of shadow-complexity in [15]. For the other studies of 4-manifolds using shadows see e.g. [3, 6, 7, 4, 16, 20, 21, 14].
In the present paper, we consider the following naive question.
Question*.*
Let be an acyclic -dimensional -handlebody with boundary the -sphere. Then is diffeomorphic to the standard -ball?
Here, recall that a compact, oriented 4-manifold is called a -handlebody if it is made of finitely many handles of index at most . Note that the manifold in the above question is at least homeomorphic to the -ball. Indeed, it is easy to see that is simply connected, thus, is homeomorphic to the -ball by Freedman’s classification theorem [10]. A negative answer to the above question implies the existence of an exotic -sphere. The following theorem gives an affirmative answer to the question when the (special) shadow-complexity of is very small.
Theorem 0.1**.**
- (1)
Costantino* *[5] Every acyclic -manifold of special shadow-complexity [math] or with boundary the -sphere is diffeomorphic to the standard -ball. Here, for the definition of the special shadow-complexity, see Section 1. 2. (2)
Naoe* *[19] Every acyclic -manifold of shadow-complexity [math] is diffeomorphic to the standard -ball.
In this paper, using shadows we provide a sufficient condition for a compact, smooth, acyclic -manifold with boundary the -sphere to be diffeomorphic to the standard -ball (Theorem 2.11). As a direct consequence, we show (in Theorem 2.1) that every acyclic -manifold of shadow-complexity at most with is diffeomorphic to the standard -ball. Precisely speaking, we show the same thing for a wider class of 4-manifolds, that is, -manifolds of connected shadow-complexity at most . See Section 1 for the definition.
Throughout the paper, we will work in the smooth category unless otherwise mentioned.
1. Shadows
A compact and connected polyhedron is called a simple polyhedron if every point of has a star neighborhood homeomorphic to one of the five models shown in Figure 1.
A point whose star neighborhood is shaped on the model (iii) is called a vertex of , and we denote the set of vertices of by . The set of points whose stat neighborhoods are shaped on the models (ii), (iii) or (v) is called the singular set of , and we denote it by . The set of points whose star neighborhoods are shaped on the models (iv) or (v) is called the boundary of and we denote it by . Each component of is called a region, and we denote the set of regions of by . The number of vertices of is called the complexity of . In [15], the connected complexity of was defined to be the maximum number of vertices that are contained in some connected component of . A simple polyhedron is said to be closed if . A simple polyhedron is said to be special if each region of is simply-connected. We note that if is special and , is closed and is connected.
Definition*.*
A simple polyhedron embedded in a compact oriented smooth 4-manifold is called a shadow of if
- •
collapses onto after equipping the natural PL structure on ;
- •
is locally flat, that is, each point of has a neighborhood that lies in a 3-dimensional submanifold of ; and
- •
.
Note that is a knotted trivalent graph, i.e. a smooth graph in with only vertices of valence , where we admits knot components as well. For a -handlebody is defined to be an oriented -manifold made of finitely many handles of index at most . In [24, 25], Turaev proved that any 2-handlebody has a (special) shadow. In [3, 9], the shadow-complexity (special shadow-complexity) of a 2-handlebody , denoted by (resp. ), was defined to be the minimum complexity of any shadow (resp. special shadow) of . In [15], the connected shadow-complexity of , denoted by , was defined to be the minimum connected complexity of any shadow of . Note that the shadow-complexity of is [math] if and only if the connected shadow-complexity of is [math]. In general, we have .
A framed knotted trivalent graph is a knotted trivalent graph equipped with a framing, i.e. an oriented surface thickening of the graph considered up to isotopy. Let be a compact oriented smooth 4-manifold, and let be a shadow. Fix a framing of the knotted trivalent graph . To each region of , we may assign a half-integer , called a gleam, as follows. Let be the inclusion. Let be the metric completion of with the path metric inherited from a Riemanian metric on . Suppose for simplicity that the natural extension is injective. The boundary of consists of simple closed curves. The framing of and the germs of the remaining regions near provide a structure of interval bundle over , which is a sub-bundle of the normal bundle of in . Let be a generic small perturbation of such that lies in the interval bundle. The gleam is then (well-)defined by counting the finitely many isolated intersections of and with signs as follows:
[TABLE]
We call a polyhedron equipped with a gleam on each region a shadowed polyhedron. In [24, 25], Turaev showed that the 4-manifold and the framed knotted trivalent graph are recovered from a shadowed polyhedron in a canonical way.
Let () be a framed oriented knot in the boundary of a compact oriented 4-manifold . Let be a 3-ball in such that is a properly embedded trivial arc in . Let be a diffeomorphism such that
- •
is orientation-reversing;
- •
is orientation-reversing; and
- •
respects (the corresponding parts of) the framings.
We denote the framed knot in by , and call it the connected sum of and . The following two lemmas are straightforward from the definition.
Lemma 1.1**.**
Let be a framed oriented knot in the boundary of a compact oriented -manifold . Let be an orientation-reversing diffeomorphism such that is orientation-reversing and respects the framings. Then the -manifold is obtained from by attaching a -handle along the framed knot .
Lemma 1.2**.**
Let be a shadowed polyhedron of a compact -manifolds . Let be a framed knot component of . Fix an orientation of each of and . Let be a diffeomorphism such that is orientation-reversing and respects the framings. Then the shadowed polyhedron obtained by the move shown in Figure 2 is a shadow of .
Let be a simple polyhedron. In general, a polyhedron obtained by collapsing might be no longer a simple polyhedron but an almost-simple polyhedron, i.e. a compact polyhedron where the link of each point can be embedded into the complete graph with vertices, see Matveev [18] for the details. A point of an almost-simple polyhedron is called a true vertex if its link is , equivalently, the star neighborhood of the point is shaped on the model Figure 1 (iii). An almost-simple polyhedron is said to be minimal with respect to collapsing if it cannot be collapsed onto any proper subpolyhedron. Up to a small perturbation, each point of such a polyhedron has a star neighborhood of one of Figure 1 (i)-(iii) and Figure 3 (i)-(iv).
Note that a simple polyhedron is minimal if and only if it is closed.
Lemma 1.3**.**
Let be a -manifold of shadow-complexity resp. connected shadow-complexity . Then admits a closed shadow of complexity resp. connected complexity exactly .
Proof.
Let be a -manifold of shadow-complexity . Let be a shadow of with exactly vertices. Then collapses onto an almost simple polyhedron that is minimal with respect to collapsing and has at most true vertices. If remains to be a simple polyhedron, there is nothing to prove. If is a graph, i.e. a [math]- or -dimensional complex, then is a -handlebody, which contradicts the assumption that the shadow-complexity of is at least . Suppose that is not a graph. Then is the union of a simple polyhedron and a graph .
If there exists a path, i.e. a subgraph homeomorphic to , in that connects two different points of , we apply the move shown in Figure 4.
Otherwise, there exists a racket, i.e. a subgraph homeomorphic to
[TABLE]
in with the (unique) univalent vertex on . In this case, we apply the move shown in Figure 5.
Note that the polyhedra before and after each of the above two moves have the same regular neighborhood in . Further, the resulting polyhedron remains to be minimal with respect to collapsing, and the number of true vertices does not increase by each of the moves. Since the number of edges of is finite, by applying these moves finitely many times, we finally end with a closed shadow of with at most vertices (see Figure 6).
Since the shadow-complexity of is , (and so ) has exactly (true) vertices.
The argument for the connected shadow-complexity runs exactly the same way. ∎
Remark*.*
It is easy to see that the gleams of the small disks region produced by the moves in Figures 4 and 5 are zero. (We do not use this fact in this paper.)
1.1. Diagrams of special polyhedra
Let be a special polyhedron having at least one vertex. Recall that the singular part of is a connected (possibly non-simple) 4-regular graph. Let be the set of vertices and the set of edges of . Set . Note that the closure of consists of disks, hence the topological type of is uniquely recovered from that of . At each vertex , choose a neighborhood homeomorphic to Figure 1 (iii) so that each component of the closure of is homeomorphic to , where is the cone over 3 points. Let be the component of corresponding to the edge . We call each of and a block of .
The diagram of is obtained as follows. Draw a diagram (with only normal crossings) of the graph on . In the diagram, replace each vertex of with the local diagram (which describes the block ) shown in Figure 7 (i). Replace each edge of in the diagram with one of the four local diagrams (which describes the block ) shown in Figure 7 (ii) so that the gluing of the end of the strands matches the combinatorial structure of .
Apparently, one simple polyhedron admits many diagrams, but each diagram defines a unique special polyhedron.
The above decomposition of a neighborhood of the singular part of a special polyhedron into blocks allows us to enumerate all special polyhedron with a given number of vertices systematically. The table in Appendix B lists all the special polyhedra with 1 or 2 vertices. Note that the special polyhedron in the Appendix B has vertices and regions. The table in Appendix B.1 was already given in [15] with different names of polyhedra. The special polyhedra , , , , , , , , , , in this paper are in [15], respectively.
1.2. From special shadows to Kirby diagrams
Let be a special shadow of a 4-manifold . We can construct a Kirby diagram of as follows. Draw a diagram of as explained in Subsection 1.1. The diagram can be regarded as immersed circles on with normal crossings. At each crossing, choose over/under crossings in an arbitrary way. Choose a maximal tree of the graph . Encircle with a dotted circle the 3 strands of the diagram corresponding to each edge of not contained in .
Let be a special polyhedron with regions. For each region of , let be the inclusion. Let be the metric completion of with the path metric inherited from a Riemanian metric on . Let be the natural extension of . Let be a maximal tree in .
Definition*.*
We say that admits canceling pairs (with respect to ) if there exist
- •
an ordered subset of the edges of not contained in ; and
- •
an ordered subset of the regions of
such that for each , passes through exactly once, and does not pass through (for ).
Remark that if a special polyhedron admits canceling pairs with respect to then a Kirby diagram obtained from by using as above admits canceling pairs of - and -handles (a dotted circle and a component of the framed link).
1.3. Graphs encoding simple polyhedra without vertices
Let be the cone over 3 points. We denote by , , the three -bundles over such that , , .
Every simple polyhedron whose singular set is a disjoint union of circles is decomposed into pieces each homeomorphic to a disk , a pair of pants , a Möbius band , , or . Such a decomposition induces a graph having one vertex for each piece or a component of as shown in Figure 10, and one edge for each adjacent pieces.
This graph is introduced by Martelli in [17] for the classification of closed 4-manifold with shadow-complexity 0. Let be a graph encoding . We note that there is a natural (but not unique) embedding such that is a retract of . In particular, we have the following:
Lemma 1.4**.**
Let be a graph encoding a simple polyhedron whose singular set is a disjoint union of circles. Then a natural embedding induces an injection of the fundamental groups.
As was mentioned in [17], the simple polyhedron is recovered from a pair of a graph and a map , which describes each cycle in is orientation-preserving or not after naturally embedding into (this property does not depend of the choice of embedding).
2. Main Theorem
We prove the following.
Theorem 2.1**.**
Every acyclic -manifold of connected shadow-complexity at most with boundary the -sphere is diffeomorphic to the standard -ball. In other words, there exists no acyclic -manifold of connected shadow-complexity or with boundary the -sphere.
The key ingredients in the proof are Property R theorem by Gabai [11] and detailed analyses of acyclic polyhedra. In fact we prove the same thing as above in a more general setting in Theorem 2.11. We note that the nature of acyclic polyhedra with vertices are completely different from those without vertices. In [19] it was shown that every acyclic simple polyhedron without vertices collapses onto . In contrast, as we will see in the following arguments, there exists infinitely many closed acyclic simple polyhedra for a given number of vertices.
2.1. Acyclic special polyhedra
In this subsection, we focus on special polyhedra, and prove a special case (Lemma 2.6) of Theorem 2.1.
Lemma 2.2**.**
Let be an acyclic special polyhedron with vertices. Then the number of regions of is exactly .
Proof.
Since is acyclic, the Euler characteristic is one. The number of edges of is as is a -regular graph. Thus, by the assumption that is special, we have
[TABLE]
which implies . ∎
Lemma 2.3**.**
An acyclic special polyhedron with at most vertices is one of and .
Proof.
This is easily checked by Lemma 2.2 and the table in Appendixes B.1 and B.4. ∎
Recall the following famous Property R theorem by Gabai [11].
Theorem 2.4** (Gabai [11]).**
Any -manifold obtained by [math]-surgery on a nontrivial knot in is irreducible. In particular, non-trivial surgery on a non-trivial knot in does knot yield .
Theorem 2.4 implies that a Kirby diagram with a (framed) knot and a dotted circle of a 4-manifold with is nothing but the one shown in Figure 11. In particular, is diffeomorphic to .
The following is the direct consequence of Theorem 2.4.
Lemma 2.5**.**
Let be an acyclic -manifold with . Let be a special shadow of with vertices. If admits canceling pairs, is diffeomorphic to .
Proof.
By Lemma 2.2 a Kirby diagram of corresponding to is an -component (framed) link with dotted circles. If that diagram admits cancelling pairs of - and -handles, after canceling them, we get a (framed) knot with a dotted circle. Hence, the assertion follows from Theoerm 2.4. ∎
Lemma 2.6**.**
Every acyclic -manifold of special shadow-complexity at most with is diffeomorphic to .
Proof.
The case of special shadow-complexiy 0 is due to Theorem 0.1 (1). Let be an acyclic -manifold with special shadow-complexity , where is or . Let be a special shadow of with vertices. By Lemma 2.3, is one of () and (). For each case, we can easily check that all of them admit canceling pairs. Thus, by Lemma 2.5, is diffeomorphic to . ∎
Remark*.*
It is worth noting that every shadow of a -manifold with is simply-connected. In fact, the restriction of a projection to induces a surjective homomorphism . This fact does not give any restriction for the shadows in the above argument. That is, every acyclic special polyhedron with vertices up to is simply-connected. It is an interesting problem to find an acyclic special shadow that is not simply-connected.
2.2. Acyclic simple polyhedra
We are going to extend Lemma 2.6 to the 4-manifolds of connected shadow-complexity at most . We begin with two lemmas that will be used repeatedly in the remaining part of the paper.
Lemma 2.7** (Ikeda [12]).**
Let be an acyclic simple polyhedron. Then the following holds.
- (1)
Every region of is a -sphere with holes. 2. (2)
If has no vertices, then .
Lemma 2.8** (Naoe [19]).**
Let be an acyclic simple polyhedron. Let be a simple closed curve. Then splits into and such that
- (1)
* is acyclic; and* 2. (2)
* is a homology- and is generated by the cycle represented by .*
We note that if the piece in Lemma 2.8 has no vertices, then it has at least one boundary component other than . Otherwise, the polyhedron obtained from by capping off by a disk is an acyclic polyhedron with and , which contradicts Lemma 2.7. In particular, an acyclic simple polyhedron does not contain a piece homeomorphic to nor (recall Subsection 1.3).
The following lemma is a generalization of Lemma 2.2.
Lemma 2.9**.**
*Let be an acyclic simple polyhedron with at least one vertex. Suppose that there exists a component of containing vertices. Set and . Then and the simple closed curves splits into , acyclic pieces , and homology- pieces . Further, if is closed, each contains at least one vertex. *
Proof.
By Lemma 2.8 and the Euler characteristic computation, it is straightforward to see that splits into , acyclic pieces , and homology- pieces . Suppose that some does not contain vertices. Then as we noted right after Lemma 2.8, consists of at least two components. This implies that is not empty. ∎
Remark*.*
If an acyclic piece in Lemma 2.9 contains no vertices, we can describe its explicit shape as we discuss in Appendix A.
Lemma 2.10**.**
Let be an acyclic -manifold with . Let be a shadow with vertices. Suppose that there exists a component of containing all vertices of . Set . Suppose that . Let be the special polyhedron obtained from by capping off the boundary components by disks. If admits canceling pairs, then is diffeomorphic to .
Proof.
By Lemma 2.9, the simple closed curves splits into and acyclic pieces . Set for . The decomposition of into and naturally induces a decomposition of . Let and be the pieces of the decomposition of corresponding to and . Note that is diffeomorphic to . Since does not contain vertices, is diffeomorphic to by Theorem 0.1 (2). Let be the framed knot in corresponding to .
Since admits canceling pairs, some Kirby diagram obtained from a diagram of as explained in Section 1.2 admits canceling pairs. That Kirby diagram consists of an -component framed link , where corresponds to , together with dotted circles . By Lemmas 1.1 and 1.2, the Kirby diagram obtained from by replacing with represents the 4-manifold . Hence, that Kirby diagram of can be simplified to a (framed) knot with a single dotted circle by handle-canceling. Since , the Kirby diagram thus obtained is the one shown in Figure 11 by Theorem 2.4. This implies that is diffeomorphic to . ∎
Let be a closed acyclic simple polyhedron. We say that satisfies the cancellation condition if the following holds: For each component of such that and , where , the special polyhedron obtained from by capping off the boundary components by disks admits canceling pairs.
Theorem 2.1 is a direct consequence of the following theorem.
Theorem 2.11**.**
Let be an acyclic -manifold with . If admits a closed shadow satisfying the cancellation condition, then is diffeomorphic to .
Proof of Theorem 2.1 from Theorem
2.11.
Let be an acyclic -manifold of connected shadow-complexity with , where or . The case where is due to Theorem 0.1 (2). In the following we assume that or . By Lemma 1.3, admits a closed shadow of connected complexity . Let be a component of such that and , where . Then the special polyhedron obtained from by capping off the boundary components by disks remains to be acyclic. As we have seen in the proof of Lemma 2.6, admits canceling pairs. Therefore, satisfies the cancellation condition. Consequently, is diffeomorphic to by Theorem 2.11. ∎
Proof of Theorem 2.11.
Let be an acyclic -manifold with . Let be a closed shadow of satisfying the cancellation condition. If contains no vertices, then the assertion follows from Theorem 0.1 (2). In the following we assume that contains vertices. Let be the connected components of having at least one vertex. We use the induction on .
Let . Set . By Lemma 2.9, we have . Since satisfies the cancellation condition, is diffeomorphic to by Lemma 2.10.
Let and assume that the conclusion holds for all . Set and for . By Lemma 2.9, for each , the simple closed curves splits into , acyclic pieces, and several (possibly no) homology- pieces. Further, here if there exists a homology- piece, then it contains a vertex. The argument is divided into two cases.
Case 1: Suppose first that there exists such that . Without loss of generality, we can assume that . Note that or . By Lemma 2.9, splits into and acyclic pieces . The decomposition of into , naturally induces a decomposition of into , . Since the number of connected components of () having at least 1 vertex is fewer than , we have for each by the assumption of the induction. Now the rest of the proof for this case runs as in Lemma 2.10.
Case 2: Suppose that for all . We are going to show that in this case is not closed, which is a contradiction. Let be the connected components of . Let be the bipartite graph whose vertices are such that two vertices and span an edge if and only if . Note that since is acyclic, is a tree. Note also that the set of edges of one to one corresponds to the set of simple closed curves of . Each edge of is labeled by [math] or as follows. Let be the edge of corresponding to a simple closed curve of . The curve separates into two components and , where . See Figure 12.
By Lemma 2.8, is acyclic or a homology-. We assign [math] to if is acyclic, and to if is a homology-. Note that for each vertex , there exists at least one -labeled edge connected to by the assumption of Case 2.
Claim*.*
The graph contains a vertex such that every edge connected to is labeled by .
Proof of Claim.
Suppose for a contradiction that for each vertex , there exists a [math]-labeled edge connected to . Choose an arbitrary vertex of . Then is connected to a vertex of by a -labeled edge. By the assumption, is connected to a vertex of by a [math]-labeled edge. Then is connected to a vertex by a -labeled edge. In this way, we can make a path of arbitrary large length. During the process, we do not pass the same vertex more than once because is a tree. This contradicts the finiteness of . ∎
By the above claim, without loss of generality, we can assume that the all edges, say , connected to is labeled by . This implies that for each ,
- •
is acyclic; and
- •
is a homology- and is generated by the cycle represented by .
Let be the polyhedron obtained from by capping off by a disk. Then is acyclic. Construct inductively a sequence of polyhedrons , where is the polyhedron obtained from by capping off by a disk. Since each is acyclic, is again acyclic. Since contains no vertex, by Lemma 2.7 (2), has at least one boundary component. This implies that is not closed, which is a contradiction. ∎
Acknowledgments
The authors wish to express their gratitude to Kouichi Yasui for many helpful comments.
Appendix A Acyclic simple polyhedron without vertices and with a single boundary circle.
Let be an acyclic simple polyhedron without vertices and with a single boundary circle . We can describe a specific shape of as follows. Since is acyclic, cannot contain a piece homeomorphic to nor . Further, does not contain a piece homeomorphic to as well by the following Lemma.
Lemma A.1** (Naoe [19]).**
Let be an acyclic simple polyhedron without vertices. Fix a component of . Then collapses onto a sub-polyhedron fixing such that does not contain a piece homeomorphic to and .
Let be a graph encoding , which is a tree by Lemma 1.4. Let be the unique vertex of type (B) (recall Figure 10), which corresponds to the unique boundary component , in . Let be a vertex of type in . Since is a tree, there exists a unique path from to . Let be an edge in the path incident to .
Lemma A.2**.**
In the above setting, the edge is marked with two lines.
Proof.
Suppose not for a contradiction. By the simple closed curve corresponding to , the polyhedron decomposes into 2 polyhedra and , where contains . We note that . By Lemma 2.8, one of them is acyclic, and the other is a homology-. Since has no boundary component other than , cannot be a homology-. Thus is acyclic. By collapsing from , we obtain an acyclic simple polyhedron containing a Möbius band in a region. This contradicts Lemma 2.7. ∎
Now we are ready to describe the shape of . For convenience, as a generalization of a vertex of type (P), we introduce a white vertex of degree as shown in Figure 13 (i) to encode a piece of a simple polyhedron homeomorphic to the sphere with holes. By the previous observation and Lemma A.2, the shape of can thus be described as in Figure 13 (ii).
Appendix B Table of special polyhedron of complexity up to
B.1. Special polyhedra with vertices
B.2. Special polyhedra with vertices and region
B.3. Special polyhedra with vertices and regions
B.4. Special polyhedra with vertices and regions
B.5. Special polyhedra with vertices and regions
B.6. Special polyhedra with vertices and regions
B.7. Special polyhedra with vertices and regions
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Burri, U., For a fixed Turaev shadow Jones-Vassiliev invariants depend polynomially on the gleams, Comment. Math. Helv. 72 (1997), no. 1, 110–127.
- 2[2] Carrega, A., Martelli, B., Shadows, ribbon surfaces, and quantum invariants, Quantum Topol. 8 (2017), no. 2, 249–294.
- 3[3] Costantino, F., Shadows and branched shadows of 3 3 3 and 4 4 4 -manifolds , Edizioni della Normale, Scuola Normale Superiore, Pisa, Italy, 2005.
- 4[4] Costantino, F., A short introduction to shadows of 4-manifolds, Fund. Math. 188 (2005), 271–291.
- 5[5] Costantino, F., Complexity of 4-manifolds, Experiment. Math. 15 (2006), no. 2, 237–249.
- 6[6] Costantino, F., Stein domains and branched shadows of 4-manifolds, Geom. Dedicata 121 (2006), 89–111.
- 7[7] Costantino, F., Branched shadows and complex structures of 4-manifolds, J. Knot Theory Ramifications 17 (2008), no. 11, 1429–1454.
- 8[8] Costantino, F., Frigerio, R., Martelli, B., Petronio, C., Triangulations of 3 3 3 -manifolds, hyperbolic relative handlebodies, and Dehn filling, Comment. Math. Helv. 82 (2007), no. 4, 903–933.
