Let $ a_n$ be a sequence, so that $ \sum_{i = 1}^\infty a_n$ converges and $ a_k \ge 0 \forall k \in \mathbb{N} $
I want to prove the following property of convergent series:
$ \forall \epsilon \gt 0 \exists n_0 \in \mathbb{N} $ so that $ \sum_{i = n_0}^\infty <\epsilon $
However I think my proof is not very elegant (because I have probably overlooked something) and I think/hope there is a better way to show this.
(sketch of the proof)
Proof by contradiction: Now $ \exists \epsilon > 0 : \forall n_0 \in \mathbb{N} $ either $ \exists n_m \in \mathbb{N} $ so that: $ \sum_{i = n_0}^{n_m} > \epsilon $ (Case 1)
or $ \sum_{i = n_0}^{\infty} = \epsilon $ (Case 2)
Case 1 can be brought to contradiction, because $ \sum_{i = 1}^\infty a_n$ converges, while the series in Case 1 tends to infinity.
In case 2, there is obviously a $a_m \ne 0 $ for some m. Setting $a_0 = a_{m+1} $ gets one to: $ \sum_{i = n_0}^{\infty} = \epsilon - a_m < \epsilon $, which brings one to the wanted contradiction.
In my opinion even this sketch is far too long for such a simple or fundamental property of such a convergent series. Writing everything down clearly would extend the proof even further, thus I hope someone can show me a better/more elegant way to proof this. If there are mistakes in it, I will correct them as soon as possible. (Thx in advance)