Lagrange inversion theorem

Encyclopedia : L : LA : LAG : Lagrange inversion theorem

---

In mathematical analysis, the Lagrange inversion theorem, also known as the Lagrange-Bürmann formula, gives the Taylor series expansion of the inverse function of an analytic function. Suppose the dependence between the variables w and z is implicitly defined by an equation of the form

[f(w) = z\,]

where f is analytic at a point a and f '(a) ≠ 0. Then it is possible to invert or solve the equation for w:

[w = g(z)\,]

where g is analytic at the point b = f(a). This is also called reversion of series.

The series expansion of g is given by

[ \left. g(z) = a + \sum_^ \left(\frac\right)^ \left( \frac \right)^n \right| _ }.]

This formula can for instance be used to find the Taylor series of the Lambert W function (by setting f(w) = w exp(w) and a = b = 0).

The formula is also valid for formal power series and can be generalized in various ways. If it can be formulated for functions of several variables, it can be extended to provide a ready formula for F(g(z)) for any analytic function F, and it can be generalized to the case f '(a) = 0, where the inverse g is a multivalued function.

The theorem was proved by Lagrange and generalized by Bürmann, both in the late 18th century. There is a straightforward derivation using complex analysis and contour integration (the complex formal power series version is clearly a consequence of knowing the formula for polynomials, so the theory of analytic functions may be applied).

Example calculation: Lambert W function

The Lambert W function is the function [W(z)] that satisfies the implicit equation

[ W(z) e^ = z\,.]

We may use the theorem to compute the Taylor series of [W(z)] at [z=0.] We take [f(w) = w e^w] and [a = b = 0.] This gives

[ \left. W(z) = \sum_^ \left(\frac\right)^ e^ \right| _ } =

\sum_^  (-n)^ \frac.]

Special case

There is a special case of the theorem that is used in combinatorics and applies when [f(w)=w/\phi(w)] and [\phi(0)\ne 0.] Take [a=0] to obtain [b=f(0)=0.] We have

[ g(z) = \sum_^ \left. \left(\frac\right)^ \left( \frac \right)^n \right| _ \frac]

or

[ g(z) = \left. \sum_^ \frac \left( \frac \left(\frac\right)^ \phi(w)^n \right| _ \right) z^n,]

which can be written alternatively as

[ [z^n] g(z) = \frac [w^] \phi(w)^n,]

where [[w^r]] is an operator which extracts the coefficient of [w^r] in what follows it.

Example calculation: binary plane trees

Consider the set [\mathcal] of unlabelled binary plane trees. An element of [\mathcal] is either a leaf of size zero, or a root node with two subtrees (planar, i.e. no symmetry between them). The Fundamental theorem of combinatorial enumeration (unlabelled case) applies.

The group acting on the two subtrees is [E_2], which contains a single permutation consisting of two fixed points. The set [\mathcal] satisfies

[\mathcal = 1 + \mathcal\mathfrak_2(\mathcal).]

This yields the functional equation of the OGF [B(z)] by the number of internal nodes:

[B(z) = 1 + z B(z)^2 \mbox z = \frac.]

Let [B_(z) = B(z) - 1] to obtain

[z = \frac(z)}(z)+1)^2}.]

Now apply the theorem with [\phi(w) = (w+1)^2:]

[ [z^n] B_(z) = \frac [w^] (w+1)^= \frac = \frac ,]

the Catalan numbers.

Faà di Bruno's formula

Faà di Bruno's formula gives coefficients of the composition of two formal power series in terms of the coefficients of those two series. Equivalently, it is a formula for the nth derivative of a composite function.

See also

• Lagrange reversion theorem for another theorem sometimes called the inversion theorem

External links

• [Lagrange expansion] on MathWorld

• Daniel Panario, Jason Z. Gao, [Introduction to the Lagrange Inversion Formula.]

 

---

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.

Search Titles

0

1

2

3

4

5

6

7

8

9

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

?