General Leibniz rule

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Other uses {{#invoke:sidebar|collapsible | class = plainlist | titlestyle = padding-bottom:0.25em; | pretitle = Part of a series of articles about | title = Calculus | image = abf(t)dt=f(b)f(a) | listtitlestyle = text-align:center; | liststyle = border-top:1px solid #aaa;padding-top:0.15em;border-bottom:1px solid #aaa; | expanded = | abovestyle = padding:0.15em 0.25em 0.3em;font-weight:normal; | above =

Template:Startflatlist

Template:EndflatlistTemplate:Startflatlist

Template:Endflatlist

| list2name = differential | list2titlestyle = display:block;margin-top:0.65em; | list2title = Template:Bigger | list2 ={{#invoke:sidebar|sidebar|child=yes

 |contentclass=hlist
 | heading1 = Definitions
 | content1 =
 | heading2 = Concepts
 | content2 =
 | heading3 = Rules and identities
 | content3 =
}}

| list3name = integral | list3title = Template:Bigger | list3 ={{#invoke:sidebar|sidebar|child=yes

 |contentclass=hlist
 | content1 =

| heading2 = Definitions

 | content2 =
 | heading3 = Integration by
 | content3 =
}}

| list4name = series | list4title = Template:Bigger | list4 ={{#invoke:sidebar|sidebar|child=yes

 |contentclass=hlist
 | content1 =
 | heading2 = Convergence tests
 | content2 =
}}

| list5name = vector | list5title = Template:Bigger | list5 ={{#invoke:sidebar|sidebar|child=yes

 |contentclass=hlist
 | content1 =
 | heading2 = Theorems
 | content2 =
}}

| list6name = multivariable | list6title = Template:Bigger | list6 ={{#invoke:sidebar|sidebar|child=yes

 |contentclass=hlist
 | heading1 = Formalisms
 | content1 =
 | heading2 = Definitions
 | content2 =
}}

| list7name = advanced | list7title = Template:Bigger | list7 ={{#invoke:sidebar|sidebar|child=yes

 |contentclass=hlist
 | content1 =
}}

| list8name = specialized | list8title = Template:Bigger | list8 =

| list9name = miscellanea | list9title = Template:Bigger | list9 =

}} In calculus, the general Leibniz rule,[1] named after Gottfried Wilhelm Leibniz, generalizes the product rule for the derivative of the product of two (which is also known as "Leibniz's rule"). It states that if f and g are Template:Mvar-times differentiable functions, then the product fg is also Template:Mvar-times differentiable and its Template:Mvar-th derivative is given by (fg)(n)=k=0n(nk)f(nk)g(k), where (nk)=n!k!(nk)! is the binomial coefficient and f(j) denotes the jth derivative of f (and in particular f(0)=f).

The rule can be proven by using the product rule and mathematical induction.

Second derivative

If, for example, Template:Math, the rule gives an expression for the second derivative of a product of two functions: (fg)(x)=k=02(2k)f(2k)(x)g(k)(x)=f(x)g(x)+2f(x)g(x)+f(x)g(x).

More than two factors

The formula can be generalized to the product of m differentiable functions f1,...,fm. (f1f2fm)(n)=k1+k2++km=n(nk1,k2,,km)1tmft(kt), where the sum extends over all m-tuples (k1,...,km) of non-negative integers with t=1mkt=n, and (nk1,k2,,km)=n!k1!k2!km! are the multinomial coefficients. This is akin to the multinomial formula from algebra.

Proof

The proof of the general Leibniz rule[2]Template:Rp proceeds by induction. Let f and g be n-times differentiable functions. The base case when n=1 claims that: (fg)=fg+fg, which is the usual product rule and is known to be true. Next, assume that the statement holds for a fixed n1, that is, that (fg)(n)=k=0n(nk)f(nk)g(k).

Then, (fg)(n+1)=[k=0n(nk)f(nk)g(k)]=k=0n(nk)f(n+1k)g(k)+k=0n(nk)f(nk)g(k+1)=k=0n(nk)f(n+1k)g(k)+k=1n+1(nk1)f(n+1k)g(k)=(n0)f(n+1)g(0)+k=1n(nk)f(n+1k)g(k)+k=1n(nk1)f(n+1k)g(k)+(nn)f(0)g(n+1)=(n+10)f(n+1)g(0)+(k=1n[(nk1)+(nk)]f(n+1k)g(k))+(n+1n+1)f(0)g(n+1)=(n+10)f(n+1)g(0)+k=1n(n+1k)f(n+1k)g(k)+(n+1n+1)f(0)g(n+1)=k=0n+1(n+1k)f(n+1k)g(k). And so the statement holds for Template:Nowrap and the proof is complete.

Relationship to the binomial theorem

The Leibniz rule bears a strong resemblance to the binomial theorem, and in fact the binomial theorem can be proven directly from the Leibniz rule by taking f(x)=eax and g(x)=ebx, which gives

(a+b)ne(a+b)x=e(a+b)xk=0n(nk)ankbk,

and then dividing both sides by e(a+b)x.[2]Template:Rp

Multivariable calculus

With the multi-index notation for partial derivatives of functions of several variables, the Leibniz rule states more generally: α(fg)=β:βα(αβ)(βf)(αβg).

This formula can be used to derive a formula that computes the symbol of the composition of differential operators. In fact, let P and Q be differential operators (with coefficients that are differentiable sufficiently many times) and R=PQ. Since R is also a differential operator, the symbol of R is given by: R(x,ξ)=ex,ξR(ex,ξ).

A direct computation now gives: R(x,ξ)=α1α!(ξ)αP(x,ξ)(x)αQ(x,ξ).

This formula is usually known as the Leibniz formula. It is used to define the composition in the space of symbols, thereby inducing the ring structure.

See also

References

Template:Reflist

Template:Calculus topics