{
  "aliases": [
    "limit-laws"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nThe algebra of limits is a set of rules for limits of convergent sequences.\nThe rules give the limit of a sum, a product or a quotient from the limits of the parts. If $a_n \\to a$ and $b_n \\to b$, then $a_n + b_n \\to a + b$, $a_n b_n \\to a b$, and $a_n / b_n \\to a / b$ when $b \\ne 0$. These rules let us find many limits from a few known ones.\n\n## Remarks\n\nThe rules are the nodes [[limit of a sum of sequences|0RAM4E07NR]], [[limit of a product of sequences|0734RSVF2V]] and [[limit of a quotient of sequences|03S6GWWKEZ]].\nSimilar rules hold for the [[limit of a function|0TXTSEMHR5]].\n\n## Explanations\n\n### L1 human\n\nTo find the limit of $(2n + 1)/(n + 3)$, divide the numerator and the denominator by $n$ to get $(2 + 1/n)/(1 + 3/n)$.\nSince $1/n \\to 0$, the rules give the limit $(2 + 0)/(1 + 0) = 2$.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "aliases": [
      "limit-laws"
    ],
    "kind": "concept",
    "msc": [
      "40A05"
    ],
    "name": "Algebra of limits",
    "sources": [
      {
        "locator": "Properties",
        "url": "https://en.wikipedia.org/wiki/Limit_of_a_sequence"
      }
    ],
    "tag": "07XBM3A9J5",
    "uses": [
      "0XKWSSY8P2"
    ]
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/07XBM3A9J5/",
  "links": [
    {
      "field": "uses",
      "target": "0XKWSSY8P2"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/07XBM3A9J5.md",
  "msc": [
    "40A05"
  ],
  "name": "Algebra of limits",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/07X/07XBM3A9J5.md",
  "status": null,
  "tag": "07XBM3A9J5",
  "uri": "m2://07XBM3A9J5",
  "url": "https://math2.tamnd.com/wiki/algebra-of-limits/",
  "writing": {
    "tag": "07XBM3A9J5",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}