{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nThere is a single closed topological disk $T$ in the plane $\\R^2$ with the following two properties.\n\n1. The plane has a [[tiling|GKJK293DXS]] in which every tile is congruent to $T$.\n2. No tiling of the plane in which every tile is congruent to $T$ is [[periodic|WFRGSBFZGV]].\n\nIn other words, the one-element set $\\set{T}$ is an [[aperiodic set of prototiles|Z3FCJZF6WK]], and $T$ is called an *aperiodic monotile* or *einstein*.\n\n## Remarks\n\nThe question whether one tile can be aperiodic, with no matching rules, is the einstein problem; the name plays on the German \"ein Stein\", one stone.\nDavid Smith, Joseph Samuel Myers, Craig S. Kaplan and Chaim Goodman-Strauss answered it in 2023 with the \"hat\", a polygon made of eight kites with angles $60^\\circ, 90^\\circ, 120^\\circ, 90^\\circ$.\nTilings by the hat use both the hat and its mirror image.\nThe same authors later found the \"spectre\", which tiles the plane only non-periodically even when only rotations and translations are allowed.\nThe proof groups the tiles of any hat tiling into larger clusters that again form a tiling of the same kind.\nThis hierarchical structure at all scales rules out periods.\n\n## Explanations\n\n### L1 human\n\nFor a long time people asked whether one single shape could cover the whole plane, but only in patterns that never repeat.\nTwo shapes were known to do it, such as the Penrose tiles.\nIn 2023 an amateur, David Smith, found a single shape, called the hat, that does it.\nAny tiling by hats is forced to be non-repeating.\n\n### L2 human\n\nAperiodic sets of prototiles had shrunk from Berger's huge set of tiles in 1966 to the two Penrose tiles in the 1970s.\nThe einstein problem asked whether the number can be $1$.\nThe hat solves it if reflections are allowed, and the spectre solves it even with rotations and translations only.\nThe key technique, as for Penrose tilings, is a substitution: tilings are built from clusters that copy the structure on a larger scale.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "Z3FCJZF6WK"
    ],
    "kind": "statement",
    "msc": [
      "52C23",
      "52C20",
      "05B45"
    ],
    "name": "Einstein problem",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q18204561",
      "wikipedia": "Einstein problem"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Einstein_problem"
      }
    ],
    "tag": "F456KQGPFV",
    "uses": [
      "GKJK293DXS",
      "WFRGSBFZGV",
      "Z3FCJZF6WK"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/F456KQGPFV/",
  "links": [
    {
      "field": "about",
      "target": "Z3FCJZF6WK"
    },
    {
      "field": "uses",
      "target": "GKJK293DXS"
    },
    {
      "field": "uses",
      "target": "WFRGSBFZGV"
    },
    {
      "field": "uses",
      "target": "Z3FCJZF6WK"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/F456KQGPFV.md",
  "msc": [
    "52C23",
    "52C20",
    "05B45"
  ],
  "name": "Einstein problem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/F45/F456KQGPFV.md",
  "status": null,
  "tag": "F456KQGPFV",
  "uri": "m2://F456KQGPFV",
  "url": "https://tamnd.github.io/math2/wiki/einstein-problem/",
  "writing": {
    "tag": "F456KQGPFV",
    "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
      }
    ]
  }
}