Concept

Link group

In knot theory, an area of mathematics, the link group of a link is an analog of the knot group of a knot. They were described by John Milnor in his Ph.D. thesis, . Notably, the link group is not in general the fundamental group of the link complement. The link group of an n-component link is essentially the set of (n + 1)-component links extending this link, up to link homotopy. In other words, each component of the extended link is allowed to move through regular homotopy (homotopy through immersions), knotting or unknotting itself, but is not allowed to move through other components. This is a weaker condition than isotopy: for example, the Whitehead link has linking number 0, and thus is link homotopic to the unlink, but it is not isotopic to the unlink. The link group is not the fundamental group of the link complement, since the components of the link are allowed to move through themselves, though not each other, but thus is a quotient group of the link complement's fundamental group, since one can start with elements of the fundamental group, and then by knotting or unknotting components, some of these elements may become equivalent to each other. The link group of the n-component unlink is the free group on n generators, , as the link group of a single link is the knot group of the unknot, which is the integers, and the link group of an unlinked union is the free product of the link groups of the components. The link group of the Hopf link, the simplest non-trivial link – two circles, linked once – is the free abelian group on two generators, Note that the link group of two unlinked circles is the free nonabelian group on two generators, of which the free abelian group on two generators is a quotient. In this case the link group is the fundamental group of the link complement, as the link complement deformation retracts onto a torus. The Whitehead link is link homotopic to the unlink – though it is not isotopic to the unlink – and thus has link group the free group on two generators.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related concepts (6)
Hopf link
In mathematical knot theory, the Hopf link is the simplest nontrivial link with more than one component. It consists of two circles linked together exactly once, and is named after Heinz Hopf. A concrete model consists of two unit circles in perpendicular planes, each passing through the center of the other. This model minimizes the ropelength of the link and until 2002 the Hopf link was the only link whose ropelength was known. The convex hull of these two circles forms a shape called an oloid.
Brunnian link
In knot theory, a branch of topology, a Brunnian link is a nontrivial link that becomes a set of trivial unlinked circles if any one component is removed. In other words, cutting any loop frees all the other loops (so that no two loops can be directly linked). The name Brunnian is after Hermann Brunn. Brunn's 1892 article Über Verkettung included examples of such links. The best-known and simplest possible Brunnian link is the Borromean rings, a link of three unknots.
Unlink
In the mathematical field of knot theory, an unlink is a link that is equivalent (under ambient isotopy) to finitely many disjoint circles in the plane. An n-component link L ⊂ S3 is an unlink if and only if there exists n disjointly embedded discs Di ⊂ S3 such that L = ∪i∂Di. A link with one component is an unlink if and only if it is the unknot. The link group of an n-component unlink is the free group on n generators, and is used in classifying Brunnian links. The Hopf link is a simple example of a link with two components that is not an unlink.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.