Im trying to solve this exercise from the book Analysis I of Amann and Escher (page 216, exercise 9).
Let $a=\sum a_k X^k\in\Bbb C[\![X]\!]$ with $a_0=1$.
(a) Show that there is some $b\in\Bbb C[\![X]\!]$ such that $ab=1$. Provide a recursive algorithm for calculating the coefficients $b_k$.
(b) Show that the radius of convergence of $\rho_b$ of $b$ is positive if $\rho_a$ of $a$ is positive.
The first part is easy, we have that $b_0=1$ and
$$b_n=-a_n-\sum_{k=1}^{n-1}a_kb_{n-k},\quad\forall n\ge 1$$
(with the convention that the empty sum is zero). But Im stuck in the second part. To context the exercise: this exercise comes prior to any definition of continuity, derivative or analyticity in the book, then, from this context, I dont know how to prove it or if it is provable.
My work so far: let $a:=\sum a_k X^k$ a formal power series with radius of convergence $\rho_a>0$, then for $a(x):=\sum_{k=0}^\infty a_k x^k$ for $x\in\Bbb B(0,\rho_a)$ we have
$$a_0=1\le\left|\sum_{k=0}^\infty a_kx^k\right|\le \sum_{k=0}^\infty |a_k|r^k=M<\infty,\quad\forall x\in\Bbb B(0,r),\text{ with }0 If we define $b:=\sum b_k X^k$ such that $ab=1$ then from above we have that $$\frac1M\le\left|\sum_{k=0}^\infty b_kx^k\right|\le 1,\quad\forall x\in\Bbb B(0,r),\text{ with }0 Some help will be appreciated, thank you.