# General Leibniz rule

Part of a series of articles about :
Calculus :
$\int _{a}^{b}f'(t)\,dt=f(b)-f(a)$ :
Fundamental theorem
Limits
Continuity
Rolle's theorem
Mean value theorem
Inverse function theorem :
Differential
Definitions
Derivative (generalizations)
Differential
infinitesimal
of a function
total
Concepts
Differentiation notation
Second derivative
Implicit differentiation
Logarithmic differentiation
Related rates
Taylor's theorem
Rules and identities
Sum
Product
Chain
Power
Quotient
L'Hôpital's rule
Inverse
General Leibniz
Faà di Bruno's formula
Reynolds :
Integral
Lists of integrals
Integral transform
Leibniz integral rule
Definitions
Antiderivative
Integral (improper)
Riemann integral
Lebesgue integration
Contour integration
Integral of inverse functions
Integration by
Parts
Discs
Cylindrical shells
Substitution (trigonometric, tangent half-angle, Euler)
Euler's formula
Partial fractions (Heaviside's method)
Changing order
Reduction formulae
Differentiating under the integral sign
Risch algorithm :
Series
Geometric (arithmetico-geometric)
Harmonic
Alternating
Power
Binomial
Taylor
Convergence tests
Summand limit (term test)
Ratio
Root
Integral
Direct comparison
Limit comparison
Alternating series
Cauchy condensation
Dirichlet
Abel :
Vector
Gradient
Divergence
Curl
Laplacian
Directional derivative
Identities
Theorems
Gradient
Green's
Stokes'
Divergence
generalized Stokes
Helmholtz decomposition :
Multivariable
Formalisms
Matrix
Tensor
Exterior
Geometric
Definitions
Partial derivative
Multiple integral
Line integral
Surface integral
Volume integral
Jacobian
Hessian :
Advanced
Calculus on Euclidean space
Generalized functions
Limit of distributions :
Specialized
Fractional
Malliavin
Stochastic
Variations :
Miscellanea
Precalculus
History
Glossary
List of topics
Integration Bee
Mathematical analysis
Nonstandard analysis :
vte :
In calculus, the general Leibniz rule, 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 n-times differentiable functions, then the product $fg$ is also n-times differentiable and its n-th derivative is given by $(fg)^{(n)}=\sum _{k=0}^{n}{n \choose k}f^{(n-k)}g^{(k)},$ where ${n \choose k}={n! \over k!(n-k)!}$ 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)=\sum \limits _{k=0}^{2}{{\binom {2}{k}}f^{(2-k)}(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 f$_1$,...,f$_m$. $\left(f_{1}f_{2}\cdots f_{m}\right)^{(n)}=\sum _{k_{1}+k_{2}+\cdots +k_{m}=n}{n \choose k_{1},k_{2},\ldots ,k_{m}}\prod _{1\leq t\leq m}f_{t}^{(k_{t})}\,,$ where the sum extends over all m-tuples (k$_1$,...,k$_m$) of non-negative integers with ∑$_{t=1}$$^m$k$_t$=n, {\textstyle \sum _{t=1}^{m}k_{t}=n, } and ${n \choose k_{1},k_{2},\ldots ,k_{m}}={\frac {n!}{k_{1}!\,k_{2}!\cdots k_{m}!}}$ are the multinomial coefficients. This is akin to the multinomial formula from algebra.

## Proof

The proof of the general Leibniz rule$^{:68–69}$ proceeds by induction. Let $f$ and $g$ be $n$-times differentiable functions. The base case when $n=1$ claims that: $(fg)'=f'g+fg',$ which is the usual product rule and is known to be true. Next, assume that the statement holds for a fixed $n\geq 1,$ that is, that $(fg)^{(n)}=\sum _{k=0}^{n}{\binom {n}{k}}f^{(n-k)}g^{(k)}.$
Then, ${\begin{aligned}(fg)^{(n+1)}&=\left[\sum _{k=0}^{n}{\binom {n}{k}}f^{(n-k)}g^{(k)}\right]'\\&=\sum _{k=0}^{n}{\binom {n}{k}}f^{(n+1-k)}g^{(k)}+\sum _{k=0}^{n}{\binom {n}{k}}f^{(n-k)}g^{(k+1)}\\&=\sum _{k=0}^{n}{\binom {n}{k}}f^{(n+1-k)}g^{(k)}+\sum _{k=1}^{n+1}{\binom {n}{k-1}}f^{(n+1-k)}g^{(k)}\\&={\binom {n}{0}}f^{(n+1)}g^{(0)}+\sum _{k=1}^{n}{\binom {n}{k}}f^{(n+1-k)}g^{(k)}+\sum _{k=1}^{n}{\binom {n}{k-1}}f^{(n+1-k)}g^{(k)}+{\binom {n}{n}}f^{(0)}g^{(n+1)}\\&={\binom {n+1}{0}}f^{(n+1)}g^{(0)}+\left(\sum _{k=1}^{n}\left[{\binom {n}{k-1}}+{\binom {n}{k}}\right]f^{(n+1-k)}g^{(k)}\right)+{\binom {n+1}{n+1}}f^{(0)}g^{(n+1)}\\&={\binom {n+1}{0}}f^{(n+1)}g^{(0)}+\sum _{k=1}^{n}{\binom {n+1}{k}}f^{(n+1-k)}g^{(k)}+{\binom {n+1}{n+1}}f^{(0)}g^{(n+1)}\\&=\sum _{k=0}^{n+1}{\binom {n+1}{k}}f^{(n+1-k)}g^{(k)}.\end{aligned}}$ And so the statement holds for $n+1$, 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)=e^{ax}$ and $g(x)=e^{bx},$ which gives
    $(a+b)^{n}e^{(a+b)x}=e^{(a+b)x}\sum _{k=0}^{n}{\binom {n}{k}}a^{n-k}b^{k},$
and then dividing both sides by $e^{(a+b)x}.$$^{:69}$

## Multivariable calculus

With the multi-index notation for partial derivatives of functions of several variables, the Leibniz rule states more generally: $\partial ^{\alpha }(fg)=\sum _{\beta \,:\,\beta \leq \alpha }{\alpha \choose \beta }(\partial ^{\beta }f)(\partial ^{\alpha -\beta }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=P\circ Q.$ Since R is also a differential operator, the symbol of R is given by: $R(x,\xi )=e^{-{\langle x,\xi \rangle }}R(e^{\langle x,\xi \rangle }).$
A direct computation now gives: $R(x,\xi )=\sum _{\alpha }{1 \over \alpha !}\left({\partial \over \partial \xi }\right)^{\alpha }P(x,\xi )\left({\partial \over \partial x}\right)^{\alpha }Q(x,\xi ).$
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.