# The Unapologetic Mathematician

## Inverses of Power Series

Now that we know how to compose power series, we can invert them. But against expectations I’m talking about multiplicative inverses instead of compositional ones.

More specifically, say we have a power series expansion

$\displaystyle p(x)=\sum\limits_{n=0}^\infty p_nz^n$

within the radius $r$, and such that $p(0)=p_0\neq0$. Then there is some radius $\delta$ within which the reciprocal has a power series expansion

$\displaystyle\frac{1}{p(x)}=\sum\limits_{n=0}^\infty q_nz^n$

In particular, we have $q_0=\frac{1}{p_0}$.

In the proof we may assume that $p_0=1$ — we can just divide the series through by $p_0$ — and so $p(0)=1$. We can set

$\displaystyle P(z)=1+\sum\limits_{n=1}^\infty\left|p_nz^n\right|$

within the radius $h$. Since we know that $P(0)=1$, continuity tells us that there’s $\delta$ so that $|z|<\delta$ implies $|P(z)-1|<1$.

Now we set

$\displaystyle f(z)=\frac{1}{1-z}=\sum\limits_{n=0}^\infty z^n$
$\displaystyle g(z)=1-p(z)=\sum\limits_{n=0}^\infty -p_nz^n$

And then we can find a power series expansion of $f\left(g(z)\right)=\frac{1}{p(z)}$.

It’s interesting to note that you might expect a reciprocal formula to follow from the multiplication formula. Set the product of $p(z)$ and an undetermined $q(z)$ to the power series $1+0z+0z^2+...$, and get an infinite sequence of algebraic conditions determining $q_n$ in terms of the $p_i$. Showing that these can all be solved is possible, but it’s easier to come around the side like this.

### Like this:

Posted by John Armstrong | Analysis, Calculus, Power Series

No comments yet.

« Previous | Next »

## About this weblog

This is mainly an expository blath, with occasional high-level excursions, humorous observations, rants, and musings. The main-line exposition should be accessible to the “Generally Interested Lay Audience”, as long as you trace the links back towards the basics. Check the sidebar for specific topics (under “Categories”).

I’m in the process of tweaking some aspects of the site to make it easier to refer back to older topics, so try to make the best of it for now.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 23, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9149054884910583, "perplexity_flag": "middle"}