{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Problem\n\nLet $G$ be a [[finitely generated group|082DWWXMRJ]] with a finite generating set $S$.\nA word is a finite sequence of elements of $S$ and their inverses.\nThe *conjugacy problem* for $G$ asks for an algorithm that takes two words $u$ and $v$ and decides whether they represent [[conjugate|0DXD4QSZ8A]] elements of $G$.\nThat is, the algorithm decides whether $v = g u g^{-1}$ in $G$ for some $g \\in G$.\n\n## Remarks\n\nWhether the problem is solvable does not depend on the finite generating set.\nA word $w$ represents the identity if and only if it is conjugate to the empty word.\nSo an algorithm for the conjugacy problem solves the [[word problem|PBGTTAVMMT]], and every group with unsolvable word problem has unsolvable conjugacy problem.\nThe converse fails: there are finitely presented groups with solvable word problem and unsolvable conjugacy problem.\n\nThe problem is solvable in many classes of groups.\nIn a [[free group|0KTW26C80J]], two elements are conjugate if and only if their cyclically reduced forms are cyclic permutations of each other.\nIt is also solvable for finitely generated abelian groups, where it is the word problem, for [[hyperbolic groups|JWJ8YPR7EB]], and for [[braid groups|BNR4H5GCTP]].\nIt is one of the three decision problems, with the word problem and the [[isomorphism problem|MP3F49QT3C]], that Max Dehn posed for groups given by presentations.\n\n## Explanations\n\n### L1 human\n\nTwo elements of a group are conjugate when one becomes the other after a change of point of view, $v = g u g^{-1}$.\nThe conjugacy problem asks whether a computer can always decide this for a group given by generators.\nIn a free group the answer is easy: cancel what you can, also around the ends of the word, and compare the results up to rotation.\nFor example, in the free group on $a$ and $b$, the word $b a b^{-1}$ reduces cyclically to $a$, so it is conjugate to $a$ and not to $b$.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "about": [
      "0DXD4QSZ8A",
      "082DWWXMRJ"
    ],
    "history": {
      "first_stated": "1911",
      "posed_by": "Max Dehn"
    },
    "kind": "problem",
    "msc": [
      "20F10",
      "03D40"
    ],
    "name": "Conjugacy problem",
    "same_as": {
      "wikidata": "Q5161137",
      "wikipedia": "Conjugacy problem"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Conjugacy_problem"
      }
    ],
    "tag": "4AF7AF7690",
    "uses": [
      "082DWWXMRJ",
      "0DXD4QSZ8A",
      "0JGEQXQ4AC"
    ]
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/4AF7AF7690/",
  "links": [
    {
      "field": "about",
      "target": "0DXD4QSZ8A"
    },
    {
      "field": "about",
      "target": "082DWWXMRJ"
    },
    {
      "field": "uses",
      "target": "082DWWXMRJ"
    },
    {
      "field": "uses",
      "target": "0DXD4QSZ8A"
    },
    {
      "field": "uses",
      "target": "0JGEQXQ4AC"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/4AF7AF7690.md",
  "msc": [
    "20F10",
    "03D40"
  ],
  "name": "Conjugacy problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/4AF/4AF7AF7690.md",
  "status": null,
  "tag": "4AF7AF7690",
  "uri": "m2://4AF7AF7690",
  "url": "https://math2.tamnd.com/wiki/conjugacy-problem/",
  "writing": {
    "tag": "4AF7AF7690",
    "kind": "problem",
    "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
      }
    ]
  }
}