9

I want to show that if $\sum_{k=0}^\infty a_kx^k = 0$ on $[0,1]$, then $a_k=0 \forall k\in\mathbb{N}$. I'm aware of the standard proof, but wanted to try another argument.

We know that a polynomial of degree $k$ has at most k roots, so the polynomial $\sum_{k=0}^N a_kx^k$ has at most $N$ roots. Now if we let $N\rightarrow \infty$ we know that we can have at most "$\aleph_0$ roots", but for the function to be identically zero we must have uncountably many roots.

I know that this argument is rubbish, but is there a way (by transfinite induction/Baire Category or something else) to make this idea rigorous?

Jan Lynn
  • 1,183

1 Answers1

3

I think that the closest way to prove the claim following your idea is putting the problem in the complex plane, so you can use Rouché's theorem: basically, you approximate the behavior of $f$ in a small neighbourhood of $0$ by the first non-vanishing Taylor polynomial of $f$.

Suppose that for some $n\ge0$ we have that $a_n\neq0$. Get the smallest integer $n$ such that $a_n\neq0$. Then: $$\exists r>0,\forall |z|=r, |f(z)-a_n z^n|<|a_n|r^n.$$ Then, by Rouché's theorem, $f$ has exactly $n$ zeros in the disk $D_r$, contradicting the fact that $f$ is equal to zero in $[0,1]$.

Bob
  • 5,705