Loop theorem

Loop theorem

In the topology of 3-manifolds, the loop theorem is a generalization of Dehn's lemma. The loop theorem was first proven by Christos Papakyriakopoulos in 1956, along with Dehn's lemma and the sphere theorem.

A simple and useful version of the loop theorem states that if there is a map

:fcolon (D^2,partial D^2) o (M,partial M)

with f|partial D^2 not nullhomotopic in partial M, then there is an embedding with the same property.

The following version of the loop theorem, due to John Stallings, is given in the standard 3-manifold treatises (such as Hempel or Jaco):

Let M be a 3-manifold and let Sbe a connected surface in partial M . Let Nsubset pi_1(M) be a normal subgroup.Let

:f colon D^2 o M

be a continuous map such that

:f(partial D^2)subset S

and

: [f|partial D^2] otin N.

Then there exists an embedding :gcolon D^2 o M

such that

:g(partial D^2)subset Sand

: [g|partial D^2] otin N.

Furthermore if one starts with a map "f" in general position, then for any neighborhood U of the singularity set of "f", we can find such a "g" with image lying inside the union of image of "f" and U.

Stalling's proof utilizes an adaptation, due to Whitehead and Shapiro, of Papakyriakopoulos' "tower construction". The "tower" refers to a special sequence of coverings designed to simplify lifts of the given map. The same tower construction was used by Papakyriakopoulos to prove the sphere theorem, which states that a nontrivial map of a sphere into a 3-manifold implies the existence of a nontrivial "embedding" of a sphere. There is also a version of Dehn's lemma for minimal discs due to Meeks and S.-T. Yau, which also crucially relies on the tower construction.

A proof not utilizing the tower construction exists of the first version of the loop theorem. This was essentially done 30 years ago by Friedhelm Waldhausen as part of his solution to the word problem for Haken manifolds; although he recognized this gave a proof of the loop theorem, he did not write up a detailed proof. The essential ingredient of this proof is the concept of Haken hierarchy. Proofs were later written up, by Klaus Johannson, Marc Lackenby, and Iain Aitchison with Hyam Rubinstein.

References

*W. Jaco, "Lectures on 3-manifolds topology", A.M.S. regional conference series in Math 43.
*J. Hempel, "3-manifolds", Princeton University Press 1976.
* Hatcher, "Notes on basic 3-manifold topology", [http://www.math.cornell.edu/~hatcher/3M/3Mdownloads.html available online]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Loop quantum gravity — Not to be confused with the path integral formulation of LQG, see spin foam. This article is about LQG in its Canonical formulation.. Beyond the Standard Model …   Wikipedia

  • Loop-erased random walk — In mathematics, loop erased random walk is a model for a random simple path with important applications in combinatorics and, in physics, quantum field theory. It is intimately connected to the uniform spanning tree, a model for a random tree.… …   Wikipedia

  • Loop variant — In computer science, a loop variant is a mathematical function defined on the state space of a computer program having the property that each iteration of a loop (given its invariant) strictly decreases its value with respect to a well founded… …   Wikipedia

  • Jordan curve theorem — Illustration of the Jordan curve theorem. The Jordan curve (drawn in black) divides the plane into an inside region (light blue) and an outside region (pink). In topology, a Jordan curve is a non self intersecting continuous loop in the plane.… …   Wikipedia

  • Moufang loop — In mathematics, a Moufang loop is a special kind of algebraic structure. It is similar to a group in many ways but need not be associative. Moufang loops were introduced by Ruth Moufang. Contents 1 Definition 2 Examples 3 Properties …   Wikipedia

  • Robertson–Seymour theorem — In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem[1]) states that the undirected graphs, partially ordered by the graph minor relationship, form a well quasi ordering.[2] Equivalently, every family of graphs that …   Wikipedia

  • Miller theorem — refers to the process of creating equivalent circuits. It asserts that a floating impedance element supplied by two voltage sources connected in series may be split into two grounded elements with corresponding impedances. There is also a dual… …   Wikipedia

  • Grushko theorem — In the mathematical subject of group theory, the Grushko theorem or the Grushko Neumann theorem is a theorem stating that the rank (that is, the smallest cardinality of a generating set) of a free product of two groups is equal to the sum of the… …   Wikipedia

  • Freudenthal suspension theorem — In mathematics, and specifically in the field of homotopy theory, the Freudenthal suspension theorem is the fundamental result leading to the concept of stabilization of homotopy groups and ultimately to stable homotopy theory. It explains the… …   Wikipedia

  • Bott periodicity theorem — In mathematics, the Bott periodicity theorem is a result from homotopy theory discovered by Raoul Bott during the latter part of the 1950s, which proved to be of foundational significance for much further research, in particular in K theory of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”