Math 2.0

Real functions Theorem

General Leibniz rule

Builds on Higher derivativeProduct rule

Statement

Let nn be a natural number, and let ff and gg be nn times differentiable real functions on an open interval II. Then fgf g is nn times differentiable on II, and (fg)(n)=∑k=0n(nk)f(k)g(n−k).(f g)^{(n)} = \sum_{k=0}^{n} \binom{n}{k} f^{(k)} g^{(n-k)}.

Remarks

The proof is an induction on nn with the product rule, like the proof of the binomial theorem. For n=1n = 1 it is the product rule. For n=2n = 2 it is (fg)′′=f′′g+2f′g′+fg′′(f g)'' = f'' g + 2 f' g' + f g''. Mathlib states it as iteratedDeriv_mul.

Reading path

To understand this page from the ground up, read these 10 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Limit point of a set definition
  2. Limit of a function definition
  3. Continuity at a point definition
  4. Derivative definition
  5. Differentiable function definition
  6. Differentiable functions are continuous statement
  7. Derivative function definition
  8. Product rule statement
  9. Higher derivative definition
  10. General Leibniz rule statement

Further reading

  1. Web https://en.wikipedia.org/wiki/General_Leibniz_rule, lead section
About this page
Tag0K9QCK6WJC
URIm2://0K9QCK6WJC
Kindstatement, theorem
WritingW1 stated
MSC26A24
StatusThis copy of the site has no build data. Run m2 status 0K9QCK6WJC.
UsesHigher derivative, Product rule
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.