Prove that if $x\in [0, 1)$, then $\displaystyle \left({1 \over 1-x}\right)^2 = \sum_{n=0}^\infty (n+1)x^n$
I have a theorem which claims that
THEOREM: If for some $x\in\mathbb R$ the power series $\sum_{n=0}^\infty a_nx^n$ and $\sum_{n=0}^\infty b_nx^n$ are absolutely convergent, then $$\left(\sum_{n=0}^\infty a_nx^n\right)\left(\sum_{n=0}^\infty b_nx^n\right) = \left(\sum_{n=0}^\infty c_nx^n\right),$$ where $c_n = \sum_{k=0}^na_kb_{n-k}.$
I attempted the proof and the heart of the proof is extremely straightforward: $$\begin{align}\left({1 \over 1-x}\right)^2 & = \left({1 \over 1-x}\right)\left({1 \over 1-x}\right)\\ & = \left(\sum_{n=0}^\infty1x^n\right)\left(\sum_{n=0}^\infty1x^n\right) \tag{Geometric Series}\\ &= \sum_{n=0}^\infty\left(\left[\sum_{k=0}^n(1)(1)\right]x^n\right) \tag{Theorem}\\ &=\sum_{n=0}^\infty\left[(n+1)x^n\right].\end{align}$$
However, is it necessary for the proof to show that $\sum_{n=0}^\infty x^n$ is absolutely convergent? I'm not entirely sure how to go about doing that. If I had to hazard a guess, I would say that since $x \in [0, 1)$, then $|x^n| = |x|^n = x^n$ for all $n\in\mathbb N$, so $\sum_{n=0}^\infty |x^n| = \sum_{n=0}^\infty x^n$ is convergent since it is a geometric series which implies the series is absolutely convergent. But is it valid to say two infinite series are "equal" like this?
Although you have the multiplication theorem at hand, but you can easily prove the problem by differentiation. That is, try to differentiate both sides of the following identity $$\frac1{1-x}=\sum_{n=0}^\infty{x^n}$$ and you'll get this $$\left(\frac1{1-x}\right)^2=\sum_{n=0}^\infty{nx^{n-1}}$$ Since the first term of the summation is zero, you can change the index to get this $$\left(\frac1{1-x}\right)^2=\sum_{n=0}^\infty{(n+1)x^{n}}$$