{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "7F3QQQ63WR"
    },
    {
      "field": "uses",
      "target": "878B9A4D9B"
    },
    {
      "field": "uses",
      "target": "A82BZ4JQR5"
    },
    {
      "field": "uses",
      "target": "VXSD46NRX0"
    }
  ],
  "body": "\n## Statement\n\nLet $L$ be a tame [[link|1A5WRCNTM3]] in $\\R^3$.\nA *link diagram* of $L$ is a projection of $L$ to a plane that is injective except at finitely many transverse double points, called crossings.\nAt each crossing the diagram records which strand passes over.\nThe three *Reidemeister moves* are local changes of a diagram inside a small disk:\n\n1. type I adds or removes a single twist with one crossing;\n2. type II adds or removes two crossings where one strand passes entirely over another;\n3. type III slides a strand over or under a crossing of two other strands.\n\nTwo diagrams represent equivalent links if and only if they are related by a finite sequence of Reidemeister moves and isotopies of the plane.\n\n## Remarks\n\nEach move is realized by a deformation of the link near the small disk, which gives the easy direction.\nFor the converse, an equivalence of tame links can be taken to be a finite sequence of triangle moves on polygonal links.\nSuch a move replaces one edge by the two other edges of a triangle, or the reverse, when the triangle meets the link only in these edges.\nThe effect of each such move on a diagram can be split into Reidemeister moves.\nThe theorem was proved by Kurt Reidemeister in 1927, and independently by James Alexander and Garland Briggs.\nIt is the basis of most proofs that a quantity computed from a diagram is a [[knot invariant|GZQ5ZE3X6G]]: one checks invariance under the three moves.\nFor example, [[tricolorability|KNAGK0W65G]] and the [[Kauffman bracket|JYKVYS4N32]] are proved invariant in this way, the bracket up to a factor under the first move.\nAll three types are needed: for instance, the number of crossings modulo $2$ is unchanged by moves of type II and III, but changed by a move of type I.\n\n## Explanations\n\n### L1 human\n\nKnots are usually drawn as pictures in the plane with gaps that show which strand goes under.\nThe same knot has many pictures.\nReidemeister's theorem says that any two pictures of the same knot are related by three simple kinds of local changes.\nThey are undoing a twist, pulling two strands apart, and sliding a strand past a crossing.\n\n### L2 human\n\nThe theorem turns knot theory into a combinatorial subject.\nTo build a knot invariant, one defines a quantity from a diagram and checks that the three moves leave it unchanged.\nThis is how the Jones polynomial, the Alexander polynomial via skein relations, and colourings by groups or quandles are shown to be invariants.\nThe theorem gives no bound on the number of moves needed, so by itself it does not give an algorithm to decide whether two diagrams represent the same knot.\n",
  "commit": "5fc425f97f1f6b11da5892c2948ef8c5d8805665",
  "front": {
    "about": [
      "QYEAZTYGPT",
      "1A5WRCNTM3"
    ],
    "kind": "statement",
    "msc": [
      "57K10"
    ],
    "name": "Reidemeister's theorem",
    "role": "theorem",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Reidemeister_move"
      }
    ],
    "tag": "T3HAGWYKK7",
    "uses": [
      "QYEAZTYGPT",
      "1A5WRCNTM3"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/T3HAGWYKK7/",
  "links": [
    {
      "field": "about",
      "target": "QYEAZTYGPT"
    },
    {
      "field": "about",
      "target": "1A5WRCNTM3"
    },
    {
      "field": "uses",
      "target": "QYEAZTYGPT"
    },
    {
      "field": "uses",
      "target": "1A5WRCNTM3"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/T3HAGWYKK7.md",
  "msc": [
    "57K10"
  ],
  "name": "Reidemeister's theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/T3H/T3HAGWYKK7.md",
  "status": null,
  "tag": "T3HAGWYKK7",
  "uri": "m2://T3HAGWYKK7",
  "url": "https://math2.tamnd.com/wiki/reidemeisters-theorem/",
  "writing": {
    "tag": "T3HAGWYKK7",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}