To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Linking number

From Wikipedia, the free encyclopedia

 The two curves of this (2,8)-torus link have linking number four.
The two curves of this (2,8)-torus link have linking number four.

In mathematics, the linking number is a numerical invariant that describes the linking of two closed curves in three-dimensional space. Intuitively, the linking number represents the number of times that each curve winds around the other. The linking number is always an integer, but may be positive or negative depending on the orientation of the two curves.

The linking number was introduced by Gauss in the form of the linking integral. It is an important object of study in knot theory, algebraic topology, and differential geometry, and has numerous applications in mathematics and science, including quantum mechanics, electromagnetism, and the study of DNA supercoiling.

YouTube Encyclopedic

  • 1/5
    Views:
    83 932
    1 996
    4 692
    2 341
    11 436
  • DNA TOPOLOGY.avi
  • Introduction to the Linking Number
  • DNA supercoiling problem | CSIR UGC NET exam | practice problems
  • Linking number
  • Topoisomerase 1 and 2 mechanism

Transcription

Contents

Definition

Any two closed curves in space, if allowed to pass through themselves but not each other, can be moved into exactly one of the following standard positions. This determines the linking number:

Linking Number -2.svg
Linking Number -1.svg
Linking Number 0.svg
linking number −2 linking number −1 linking number 0
Linking Number 1.svg
Linking Number 2.svg
Linking Number 3.svg
linking number 1 linking number 2 linking number 3

Each curve may pass through itself during this motion, but the two curves must remain separated throughout. This is formalized as regular homotopy, which further requires that each curve be an immersion, not just any map. However, this added condition does not change the definition of linking number (it does not matter if the curves are required to always be immersions or not), which is an example of an h-principle (homotopy-principle), meaning that geometry reduces to topology.

Proof

This fact (that the linking number is the only invariant) is most easily proven by placing one circle in standard position, and then showing that linking number is the only invariant of the other circle. In detail:

  • A single curve is regular homotopic to a standard circle (any knot can be unknotted if the curve is allowed to pass through itself). The fact that it is homotopic is clear, since 3-space is contractible and thus all maps into it are homotopic, though the fact that this can be done through immersions requires some geometric argument.
  • The complement of a standard circle is homeomorphic to a solid torus with a point removed (this can be seen by interpreting 3-space as the 3-sphere with the point at infinity removed, and the 3-sphere as two solid tori glued along the boundary), or the complement can be analyzed directly.
  • The fundamental group of 3-space minus a circle is the integers, corresponding to linking number. This can be seen via the Seifert–Van Kampen theorem (either adding the point at infinity to get a solid torus, or adding the circle to get 3-space, allows one to compute the fundamental group of the desired space).
  • Thus homotopy classes of a curve in 3-space minus a circle are determined by linking number.
  • It is also true that regular homotopy classes are determined by linking number, which requires additional geometric argument.

Computing the linking number

 With six positive crossings and two negative crossings, these curves have linking number two.
With six positive crossings and two negative crossings, these curves have linking number two.

There is an algorithm to compute the linking number of two curves from a link diagram. Label each crossing as positive or negative, according to the following rule:[1]

Link Crossings.svg

The total number of positive crossings minus the total number of negative crossings is equal to twice the linking number. That is:

where n1, n2, n3, n4 represent the number of crossings of each of the four types. The two sums and are always equal,[2] which leads to the following alternative formula

Note that involves only the undercrossings of the blue curve by the red, while involves only the overcrossings.

Properties and examples

 The two curves of the Whitehead link have linking number zero.
The two curves of the Whitehead link have linking number zero.
  • Any two unlinked curves have linking number zero. However, two curves with linking number zero may still be linked (e.g. the Whitehead link).
  • Reversing the orientation of either of the curves negates the linking number, while reversing the orientation of both curves leaves it unchanged.
  • The linking number is chiral: taking the mirror image of link negates the linking number. The convention for positive linking number is based on a right-hand rule.
  • The winding number of an oriented curve in the x-y plane is equal to its linking number with the z-axis (thinking of the z-axis as a closed curve in the 3-sphere).
  • More generally, if either of the curves is simple, then the first homology group of its complement is isomorphic to Z. In this case, the linking number is determined by the homology class of the other curve.
  • In physics, the linking number is an example of a topological quantum number. It is related to quantum entanglement[citation needed].

Gauss's integral definition

Given two non-intersecting differentiable curves , define the Gauss map from the torus to the sphere by

Pick a point in the unit sphere, v, so that orthogonal projection of the link to the plane perpendicular to v gives a link diagram. Observe that a point (s,t) that goes to v under the Gauss map corresponds to a crossing in the link diagram where is over . Also, a neighborhood of (s,t) is mapped under the Gauss map to a neighborhood of v preserving or reversing orientation depending on the sign of the crossing. Thus in order to compute the linking number of the diagram corresponding to v it suffices to count the signed number of times the Gauss map covers v. Since v is a regular value, this is precisely the degree of the Gauss map (i.e. the signed number of times that the image of Γ covers the sphere). Isotopy invariance of the linking number is automatically obtained as the degree is invariant under homotopic maps. Any other regular value would give the same number, so the linking number doesn't depend on any particular link diagram.

This formulation of the linking number of γ1 and γ2 enables an explicit formula as a double line integral, the Gauss linking integral:

This integral computes the total signed area of the image of the Gauss map (the integrand being the Jacobian of Γ) and then divides by the area of the sphere (which is 4π).

Generalizations

 The Milnor invariants generalize linking number to links with three or more components, allowing one prove that the Borromean rings are linked, though any two components have linking number 0.
The Milnor invariants generalize linking number to links with three or more components, allowing one prove that the Borromean rings are linked, though any two components have linking number 0.

See also

Notes

  1. ^ This is the same labeling used to compute the writhe of a knot, though in this case we only label crossings that involve both curves of the link.
  2. ^ This follows from the Jordan curve theorem if either curve is simple. For example, if the blue curve is simple, then n1 + n3 and n2 + n4 represent the number of times that the red curve crosses in and out of the region bounded by the blue curve.

References

This page was last edited on 27 June 2017, at 17:18.
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.