Markov theorem

Short description: Gives necessary and sufficient conditions for two braids to have equivalent closures

Braid closure

In mathematics the Markov theorem gives necessary and sufficient conditions for two braids to have closures that are equivalent knots or links. The conditions are stated in terms of the group structures on braids.

Braids are algebraic objects described by diagrams; the relation to topology is given by Alexander's theorem which states that every knot or link in three-dimensional Euclidean space is the closure of a braid. The Markov theorem, proved by Russian mathematician Andrei Andreevich Markov Jr. describes the elementary moves generating the equivalence relation on braids given by the equivalence of their closures.

More precisely Markov's theorem can be stated as follows: given two braids represented by elements [math]\displaystyle{ \beta_n, \beta_m' }[/math] in the braid groups [math]\displaystyle{ B_n, B_m }[/math], their closures are equivalent links if and only if [math]\displaystyle{ \beta_m' }[/math] can be obtained from applying to [math]\displaystyle{ \beta_n }[/math] a sequence of the following operations:

1. conjugating [math]\displaystyle{ \beta_n }[/math] in [math]\displaystyle{ B_n }[/math];
2. replacing [math]\displaystyle{ \beta_n }[/math] by [math]\displaystyle{ \beta_n\sigma_{n+1}^{\pm 1} \in B_{n+1} }[/math] (here [math]\displaystyle{ \sigma_i }[/math] are the standard generators of the braid groups; geometrically this amounts to adding a strand to the right of the braid diagram and twisting it once with the (previously) last strand);
3. the inverse of the previous operation (if [math]\displaystyle{ \beta_n = \beta_{n-1}\sigma_n^{\pm 1} }[/math] with [math]\displaystyle{ \beta_{n-1} \in B_{n-1} }[/math] replace with [math]\displaystyle{ \beta_{n-1} }[/math]).