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?