EPFL Logo
fr|en
Login
Concept

Linking number

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. In Euclidean space, the linking number is always an integer, but may be positive or negative depending on the orientation of the two curves (this is not true for curves in most 3-manifolds, where linking numbers can also be fractions or just not exist at all). 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. 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: 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. 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.

Official source
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 lectures (5)
Steenrod Squares
Covers the concept of Steenrod Squares and their applications in stable cohomology operations.
Show more
Related publications (9)
Show more
Related concepts (8)
Link (knot theory)
In mathematical knot theory, a link is a collection of knots which do not intersect, but which may be linked (or knotted) together. A knot can be described as a link with one component. Links and knots are studied in a branch of mathematics called knot theory. Implicit in this definition is that there is a trivial reference link, usually called the unlink, but the word is also sometimes used in context where there is no notion of a trivial link.
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.
Linkless embedding
In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into three-dimensional Euclidean space in such a way that no two cycles of the graph are linked. A flat embedding is an embedding with the property that every cycle is the boundary of a topological disk whose interior is disjoint from the graph. A linklessly embeddable graph is a graph that has a linkless or flat embedding; these graphs form a three-dimensional analogue of the planar graphs.
Show more

Copyright © 2025 EPFL, all rights reserved

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.