{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0ZA4AX4MW3"
    }
  ],
  "body": "\n## Statement\n\nLet $(a_n)$ be a [[Cauchy sequence|0QZMTN5AXX]] of real numbers.\nThen $(a_n)$ is [[bounded|05FQ3VGAR9]].\n\n## Remarks\n\nTake $\\varepsilon = 1$ to get $N$ with $|a_n - a_N| \u003c 1$ for all $n \\ge N$. Then $|a_n| \\le \\max(|a_0|, \\dots, |a_{N-1}|, |a_N| + 1)$ for all $n$.\nThe statement holds in each metric space.\nThe proof of the [[Cauchy criterion|0ZA4AX4MW3]] uses this fact.\n\n## Explanations\n\n### L1 human\n\nFrom some index on, all terms are within distance $1$ of one fixed term.\nThe finitely many terms before that index are bounded too, so the whole sequence is bounded.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "statement",
    "msc": [
      "40A05"
    ],
    "name": "Cauchy sequences are bounded",
    "role": "proposition",
    "sources": [
      {
        "locator": "Other properties",
        "url": "https://en.wikipedia.org/wiki/Cauchy_sequence"
      }
    ],
    "tag": "0G6D8E7CTA",
    "uses": [
      "0QZMTN5AXX",
      "05FQ3VGAR9"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0G6D8E7CTA/",
  "links": [
    {
      "field": "uses",
      "target": "0QZMTN5AXX"
    },
    {
      "field": "uses",
      "target": "05FQ3VGAR9"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0G6D8E7CTA.md",
  "msc": [
    "40A05"
  ],
  "name": "Cauchy sequences are bounded",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0G6/0G6D8E7CTA.md",
  "status": null,
  "tag": "0G6D8E7CTA",
  "uri": "m2://0G6D8E7CTA",
  "url": "https://math2.tamnd.com/wiki/cauchy-sequences-are-bounded/",
  "writing": {
    "tag": "0G6D8E7CTA",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}
