General Leibniz rule

From HandWiki
Short description: Generalization of the product rule in calculus

In calculus, the general Leibniz rule,[1] named after Gottfried Wilhelm Leibniz, generalizes the product rule (which is also known as "Leibniz's rule"). It states that if f and g are n-times differentiable functions, then the product fg is also n-times differentiable and its nth 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, n = 2, 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 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 n+1, and the proof is complete.

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