{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $n$ be a natural number, and let $f$ and $g$ be $n$ times differentiable real functions on an open interval $I$.\nThen $f g$ is $n$ times differentiable on $I$, and\n$$(f g)^{(n)} = \\sum_{k=0}^{n} \\binom{n}{k} f^{(k)} g^{(n-k)}.$$\n\n## Remarks\n\nThe proof is an induction on $n$ with the [[product rule|0V9A43H7WV]], like the proof of the binomial theorem.\nFor $n = 1$ it is the product rule. For $n = 2$ it is $(f g)'' = f'' g + 2 f' g' + f g''$.\nMathlib states it as `iteratedDeriv_mul`.\n\n## Explanations\n\n### L1 human\n\nThe rule for the $n$-th derivative of a product looks like the binomial formula for $(a + b)^n$.\nEach term distributes $n$ differentiations between the two factors.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "statement",
    "msc": [
      "26A24"
    ],
    "name": "General Leibniz rule",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q2586745",
      "wikipedia": "General Leibniz rule"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/General_Leibniz_rule"
      }
    ],
    "tag": "0K9QCK6WJC",
    "uses": [
      "084NGSTWM7",
      "0V9A43H7WV"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0K9QCK6WJC/",
  "links": [
    {
      "field": "uses",
      "target": "084NGSTWM7"
    },
    {
      "field": "uses",
      "target": "0V9A43H7WV"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0K9QCK6WJC.md",
  "msc": [
    "26A24"
  ],
  "name": "General Leibniz rule",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0K9/0K9QCK6WJC.md",
  "status": null,
  "tag": "0K9QCK6WJC",
  "uri": "m2://0K9QCK6WJC",
  "url": "https://math2.tamnd.com/wiki/general-leibniz-rule/",
  "writing": {
    "tag": "0K9QCK6WJC",
    "kind": "statement",
    "level": "W1",
    "next": [
      {
        "what": "edge about out",
        "note": "the concepts that the statement is about",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge proves in",
        "note": "at least one proof node",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of or illustrates in",
        "note": "one example that shows the statement at work",
        "have": 0,
        "want": 1
      },
      {
        "what": "explanation L2",
        "have": 0,
        "want": 1
      }
    ]
  }
}
