Lets consider this method of finding inverse function:


$$f^{-1}(x) = \sum\_{k=0}^\infty A\_k(x) \frac{(x-f(x))^k}{k!}$$


where coefficients $A\_k(x)$ recursively defined as




$$\begin{cases} A\_0(x)=x \\ A\_{n+1}(x)=\frac{A\_n'(x)}{f'(x)}\end{cases}$$


It is evident that for some classes of functions starting from some point $A\_k(x)$ becomes zero and thus the inverse function can be expressed in closed form.


For example, the expression has limited number of terms for any function of the following form:


$$f(x)=a \sqrt[n]{x+b}+c$$


where $n\in \mathbb{N}$. It is also evident that there are other classes of functions for which the series have limited number of terms.


So my question is for which other classes of functions this series give inverse function is closed form?



For which classes of functions this inverse function formula gives a closed form expression?
The answer is not that difficult. Assume that $A\_{n+1}\equiv0$. This means $A\_n={\rm cst}$, that is $A\_{n-1}'=cf'$. Integrating, $A\_{n-1}=cf+d$, that is $A\_{n-2}'=(cf+d)f'$. Integrating again, $A\_{n-2}=\frac{c}{2}f^2+df+e$. And so on. By induction, we find that $A\_{n-k}=P\_k(f)$, where $P\_\ell$ is a polynomial of degree $\ell$. When $k=n$, we find the necessary and sufficient condition that $x=P\_n(f)$.


In conclusion, the functions $f$ for which the series in the formula has finitely many terms are the roots of equations $P(f)=x$, where $P$ is some polynomial. 



> 
> Edit. This answer suggests that the formula is nothing but Taylor expansion for $f^{-1}$, which turns out to be finite if and only if $f^{-1}$ is a polynomial. This also suggests that the series converges in a non-trivial interval whenever $f^{-1}$ is analytic.
> 
> 
> 


