{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Problem\n\nLet $G = \\langle S \\mid R \\rangle$ be a group given by a finite [[presentation|0JGEQXQ4AC]], with a finite set $S$ of generators and a finite set $R$ of relators.\nA *word* is a finite sequence of elements of $S \\cup S^{-1}$, that is, an element of the [[free group|0KTW26C80J]] $F(S)$.\nThe word problem for $G$ asks for an algorithm that decides, for every word $w$, whether $w$ represents the identity element of $G$.\nEquivalently: is the set of words that represent the identity a [[computable set|PPGD5KW8JC]]?\n\n## Remarks\n\nThe answer depends on the group.\nThe word problem is solvable for free groups, by free reduction, and for finite groups.\nMagnus showed that it is solvable for every group with one defining relator.\nDehn gave an algorithm for the fundamental groups of closed orientable surfaces of genus at least $2$.\nNovikov (1955) and Boone (1958) independently constructed finitely presented groups whose word problem is unsolvable.\nThe set of words that represent the identity is always computably enumerable, so the word problem asks only whether its complement is too.\nWhether the word problem is solvable does not depend on the chosen finite presentation of $G$.\n\n## Explanations\n\n### L1 human\n\nA group can be described by a few generators and a few rules saying which products equal the identity.\nThe question is whether there is a mechanical way to tell, for any product of generators, whether it equals the identity.\nFor many familiar groups there is, but there are groups, described by finitely many rules, where no computer program can answer the question.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "about": [
      "0JGEQXQ4AC"
    ],
    "history": {
      "first_stated": "1911",
      "posed_by": "Max Dehn"
    },
    "kind": "problem",
    "msc": [
      "20F10",
      "03D40"
    ],
    "name": "Word problem for groups",
    "same_as": {
      "wikidata": "Q8034369",
      "wikipedia": "Word problem for groups"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Word_problem_for_groups"
      }
    ],
    "tag": "PBGTTAVMMT",
    "uses": [
      "0JGEQXQ4AC",
      "0KTW26C80J",
      "PPGD5KW8JC"
    ]
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/PBGTTAVMMT/",
  "links": [
    {
      "field": "about",
      "target": "0JGEQXQ4AC"
    },
    {
      "field": "uses",
      "target": "0JGEQXQ4AC"
    },
    {
      "field": "uses",
      "target": "0KTW26C80J"
    },
    {
      "field": "uses",
      "target": "PPGD5KW8JC"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/PBGTTAVMMT.md",
  "msc": [
    "20F10",
    "03D40"
  ],
  "name": "Word problem for groups",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PBG/PBGTTAVMMT.md",
  "status": null,
  "tag": "PBGTTAVMMT",
  "uri": "m2://PBGTTAVMMT",
  "url": "https://math2.tamnd.com/wiki/word-problem-for-groups/",
  "writing": {
    "tag": "PBGTTAVMMT",
    "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
      }
    ]
  }
}