Brunnian link

This four-component link is a Brunnian link.
Six-component 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.

Examples

The Borromean rings are the simplest Brunnian link.

The best-known and simplest possible Brunnian link is the Borromean rings, a link of three unknots. However for every number three or above, there are an infinite number of links with the Brunnian property containing that number of loops. Here are some relatively simple three-component Brunnian links which are not the same as the Borromean rings:

The simplest Brunnian link other than the 6-crossing Borromean rings is presumably the 10-crossing L10a140 link.[1]

An example of a n-component Brunnian link is given by the "Rubberband" Brunnian Links, where each component is looped around the next as aba−1b−1, with the last looping around the first, forming a circle.

Classification

Brunnian links were classified up to link-homotopy by John Milnor in (Milnor 1954), and the invariants he introduced are now called Milnor invariants.

An (n + 1)-component Brunnian link can be thought of as an element of the link group – which in this case (but not in general) is the fundamental group of the link complement – of the n-component unlink, since by Brunnianness removing the last link unlinks the others. The link group of the n-component unlink is the free group on n generators, Fn, 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.

Not every element of the link group gives a Brunnian link, as removing any other component must also unlink the remaining n elements. Milnor showed that the group elements that do correspond to Brunnian links are related to the graded Lie algebra of the lower central series of the free group, which can be interpreted as "relations" in the free Lie algebra.

Massey products

Main article: Massey product

Brunnian links can be understood in algebraic topology via Massey products: a Massey product is an n-fold product which is only defined if all (n − 1)-fold products of its terms vanish. This corresponds to the Brunnian property of all (n − 1)-component sublinks being unlinked, but the overall n-component link being non-trivially linked.

Brunnian braids

See also: Closed braid
The standard braid is Brunnian: if one removes the black strand, the blue strand is always on top of the red strand, and they are thus not braided around each other; likewise for removing other strands.

A Brunnian braid is a braid that becomes trivial upon removal of any one of its strings. Brunnian braids form a subgroup of the braid group. Brunnian braids over the 2-sphere that are not Brunnian over the 2-disk give rise to non-trivial elements in the homotopy groups of the 2-sphere. For example, the "standard" braid corresponding to the Borromean rings gives rise to the Hopf fibration S3 → S2, and iterations of this (as in everyday braiding) is likewise Brunnian.

Real-world examples

Many disentanglement puzzles and some mechanical puzzles are variants of Brunnian Links, with the goal being to free a single piece only partially linked to the rest, thus dismantling the structure.

Brunnian chains are also used to create wearable and decorative items out of elastic bands using devices such as the Rainbow Loom or Wonder Loom.

References

  1. ↑ Bar-Natan, Dror (2010-08-16). "All Brunnians, Maybe", [Academic Pensieve].

Further reading

Wikimedia Commons has media related to Brunnian links.

External links

This article is issued from Wikipedia - version of the Monday, March 09, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.