Dehn's Lemma for Immersed Loops
Michael Freedman, Martin Scharlemann

TL;DR
This paper proves a version of Dehn's Lemma for immersed loops on the boundary of 3-manifolds, showing they can be isotoped to bound disks in the manifold.
Contribution
It extends Dehn's Lemma to immersed loops on boundary surfaces, providing a new isotopy technique for null-homotopic immersed curves.
Findings
Immersed boundary loops can be displaced to bound disks in the manifold.
The result applies to generic immersed curves, not just embedded ones.
Provides a method to simplify immersed loops in 3-manifold boundaries.
Abstract
Suppose is a generic immersed closed curve in the boundary of a 3-manifold M and is null-homotopic in M. Then can be displaced by a height function in a collar of the boundary so that the resulting simple closed curve in the collar bounds a disk in M.
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
TopicsGeometric and Algebraic Topology · Algebraic Geometry and Number Theory · Topological and Geometric Data Analysis
Dehn’s Lemma for Immersed Loops
Michael Freedman
Michael Freedman
Microsoft Research, Station Q, and Department of Mathematics
University of California, Santa Barbara
Santa Barbara, CA 93106
and
Martin Scharlemann
Martin Scharlesmann
Department of Mathematics
University of California, Santa Barbara
Santa Barbara, CA 93106
We know five theorems whose conclusion is the existence of an embedded disk, perhaps with additional structure, in some larger space. Each introduced an influential technique and had broad consequences. They are: (1) - 1913 Boundary continuity of the Riemann mapping to Jordan domains (Carathéodory [Cara13], Osgood and Taylor [Osgood13]); Carathéodory’s proof introduced “external length”; applications to quasifuschian groups. (2) - 1944, the Whitney disk (with appropriate normal frame extension) [Whitney92]; applications to Whitney embedding theorem, h-cobordism theorem. (3) - 1957 Dehn’s Lemma - loop theorem (Papakyriakopoulos [Papa57]); correctly treated triple points; applications: hierarchy in Haken manifolds, Thurston’s geometrization theorem. (4) - 1982 Disk embedding theorem (Freedman [Freedman82]); used decomposition theory to identify Casson handles; application: topological classification of simply-connected 4-manifolds. (5) - Existence of Pseudoholomorphic disks (Gromov [Gromov85]); brought Kahler manifold techniques into symplectic context; applications: the nonsqueezing theorem, Seiberg-Witten invariants, quantum cohomology. This paper is a comment on (3); we prove a simply stated extension of Dehn’s Lemma.
Let be a 3-manifold with boundary , and be a generic immersion, where S^{1}\coloneqq[0,2\pi]/$$0\equiv 2\pi. By generic, we mean that has only simple crossings. We say that is “displaced by a height function ” if , where is a Morse function and is a normal collar coordinate on into . We call a simple closed curve (scc) unknotted iff bounds an embedded disk .
Theorem 1**.**
Let be a generic immersed loop so that the composition into is null homotopic. There is a height function so that is unknotted.
The theorem readily implies two familiar facts:
- (1)
Dehn’s Lemma: For any scc which is null homotopic in there is a properly embedded disk with parameterizing . 2. (2)
Given any knot diagram there is always a way to rechoose the crossings to produce an unknot. (This is the case when is a 3-ball.)
Regarding 1: A short argument connects the special case of the theorem where is one-to-one to Dehn’s Lemma. Let be the annular collar joining to and a disk with boundary . If and are in general position initially there may be arcs of intersection, but a perturbation of near starting from an outermost arc ensures that and intersect only in sccs contained in int and int. Let be an innermost circle of intersection bounding a subdisk . may be paired with either an essential or inessential scc in . Perform disk exchanges to modify until either is an embedded disk or some innermost is paired to an essential scc in . In this case a final cut and glue operation yields an embedded disk with boundary .
Regarding 2: We should note a subtlety. The height function produced in the theorem may, in general, be more complicated than the familiar height function which solves the knot diagram problem (see Figure 1b). For knot diagrams the unknotting function may be taken to be any function with a unique local maximum and unique local minimum.
Actually Theorem 1 is a corollary of a stronger Theorem 0, better adapted to the required induction.
Theorem 0. Let be a generic immersed loop with base point ( is assumed disjoint from multiple points of ) whose composition into is null homotopic. There is a height function , , , so that bounds an embedded disk with . We say collapses to , and call a “lollypop” for .
Proof.
No methods post dating Papakyriakopoulos [Papa57] are required. He would have found this proof rather easy to understand and perhaps to generate. First we build a tower.
is the pointed, immersed loop, the immersed null homotopy bounding it, and the regular neighborhood of in . Subscript will indicate height in the tower.
To build the tower we should ask about the Betti number . If , there is no tower. For homological reasons is a disjoint union of 2-spheres and is contained in one of these: .
If choose a 2-fold cover and choose a lift and let . If then is the top of the tower. If continue and find a 2-fold cover , and lift and set . Again if then is the top of the tower. If not, proceed to construct and until . A simple complexity argument, where the complexity can be the number of simplicies identified by for a fixed triangulation of making all simplicial, shows that the tower is indeed finite.
Observation: can be unknotted by a suitable resolution of its crossings (i.e. a normal function as in Theorem 1). As in Theorem 0, given for any base point (chosen away from crossings) we can resolve crossings and produce an embedded disk with and .
Explanation of and its null-isotopy. One might expect to choose , = 0, , where has a unique local maximum and a unique local minimum. However, this solution does not, in general, push down the tower. We prefer to give a second solution. There are two cases. If is one-to-one bounds a hemisphere . Pushing the disk normally toward interior gives a disk bounding .
Now assume is not one-to-one. Let , not containing , be a subarc so that is a scc . Let be one of the two disks in bounded by . Begin to resolve the crossings of by following this rule: lies above , where is the complementary arc, and . Also the two endpoints of are at a crossing: resolve this crossing arbitrarily.
Now an isotopy across the disk bounding effectively erases the loop . If the simplified diagram is a scc we may continue the unknotting using a hemisphere 2-cell making no further crossing choices. If the simplified diagram is still singular choose another arc whose image is again a scc not containing and proceed as before. Continuing in this way, guided by a sequence of embedded 2-cells, say , all crossings are eventually assigned so that the diagram resolution is unknotted with remaining in the final 2-cell . The cells determine a sequence of isotopies so that the composition shrinks toward the base point . Note: the 2-cells will not generally have disjoint interiors. ∎
This solution will now be pushed down the tower
Dissection of disks with double arcs: Let be a properly embedded disk in a 3-manifold and a 2-fold cover with covering translation . Assume and are in generic position and meet only in double arcs and double loops. Double loops are easily removed by an innermost circle argument and will not be discussed further. is assumed to have a base point . Call and in an abuse of notation.
We now describe how to form an ordered list of embedded disks from pieces (some used several times) of . Constructing will dictate “crossing choices” for , which yield , bounding a lollypop. Each has base point with . Furthermore, once are constructed we may view them as the instructions for an isotopy , as above, collapsing toward .
Let be an outermost arc cutting off an outermost disk not containing . Let be the partner arc of and be the subdisk of cut off by which also does not contain . There are two cases, shown in Figure 4.
In both cases can be perturbed into a proper map of a disk . There is a residual general position proper map with only double arc singularities of a disk formed from . In both cases, label this map . Because is outermost, both and have fewer double arcs than .
We need to discuss crossing choices (resolutions) and base point choices. The end points on , i.e. its crossings with other segments of , are deemed overcrossings (in both cases). is provided a base point in its copy of and retains as its base point.
Now unless is embedded find an outermost arc cutting off an outermost disk , with disjoint from and sharing a double arc with , not containing and as above dissect:
F_{0}$$F_{00}$$F_{01}andF_{1}$$F_{10}$$F_{11}
to obtain general position proper pointed maps and of disks with only double arc singularities. We call such maps good maps. In each case follow the preceding rule for resolving the crossing of as overcrossings.
Continuing in this way a dyadic tree of good maps is obtained. The leaves of this tree are called great maps as they have the additional property of being embeddings. (No disjointness has been constructed or assumed for these great maps.) The leaves are now linearly ordered by the base 2 numerical value of their subscripts considered as decimals. By the time we reach the leaves all crossings have been resolved. These great disks, monotonically reindexed, become the ordered list , built from pieces of , which we sought. We call this list a great sequence (for ) guiding a collapse of to . Note that the great sequence uniquely defines the crossing resolution of of . The simple expedient of successively declaring to over-cross other segments of the boundary has given us the well-defined crossing choices and thus defines . The isotopy shrinks toward .
To summarize the Dissection section:
The tree, as constructed above, of good disks terminating in great disks is a dissection of . The same tree, according to our convention, determines crossing choices for . The great sequence (the leaves of the dissection) are said to guide a sequence of isotopes with supported near , , so that collapses toward its base point.
Example: We illustrate (Figure 6) dissection, the crossing resolutions, and the collapsing isotopy with an example. Our crossing convention implies that middle sheet of the three sheets of the outermost in F_{...0}\mathbin{\rotatebox[origin={c}]{180.0}{\Pi}}F_{...1} should be compressed slightly into interior () near when interpreting the disk , , which contain this sheet of as guiding the isotopes .
We now finish the proof of Theorem 0.
At the top of the tower the collapse of is guided by an initial sequence of properly embedded 2-cells , where the base point of each is taken to be the self intersection point of its boundary, and with the original serving as the base point for the final .
Now consider each of these cells , , and its singular image under the 2-fold cover . Again we may remove double loops and only need consider double arcs. As above, dissect into a sequence of great disks and replace each with that ordered sublist to obtain a great sequence:
[TABLE]
which guides the collapse of to (and defines the crossing resolution indicated by the “prime”).
Now proceed all the way down the tower. At height by induction assume a great sequence for . Project each , , by to and construct, as above, a great sequence for each . The great sequence for is obtained by concatenating these great sequences. Finally, setting we obtain a great sequence guiding the null isotopy which establishes Theorem 0. ∎
Note: There is a potentially exponential efficiency in describing a null isotopy as a long composition, as we have done in the proof of Theorem 0, compared with attempting a direct description of the bounding disk. The Fox-Artin-like unknot in Figure 7 makes this clear: any bounding disk must pass times over the rightmost protuberance. This motivated our proof strategy.
References
