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 z is defined as a function of w by an equation of the form where f is analytic at a point a and Then it is possible to invert or solve the equation for w, expressing it in the form given by a power series where The theorem further states that this series has a non-zero radius of convergence, i.e., represents an analytic function of z in a neighbourhood of This is also called reversion of series. If the assertions about analyticity are omitted, the formula is also valid for formal power series and can be generalized in various ways: 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 where the inverse g is a multivalued function. The theorem was proved by Lagrange and generalized by Hans Heinrich 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 a consequence of knowing the formula for polynomials, so the theory of analytic functions may be applied. Actually, the machinery from analytic function theory enters only in a formal way in this proof, in that what is really needed is some property of the formal residue, and a more direct formal proof is available. If f is a formal power series, then the above formula does not give the coefficients of the compositional inverse series g directly in terms for the coefficients of the series f. If one can express the functions f and g in formal power series as with f0 = 0 and f1 ≠ 0, then an explicit form of inverse coefficients can be given in term of Bell polynomials: where is the rising factorial.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.