The infinite sum written as $\sum_{k=1}^\infty a_k$ converges if and only if $|\sum_{k=n}^m a_k | < \varepsilon$ holds for all $m > n > N$. for all $\varepsilon$>0
The infinite sum converges: $|s_{n-1} - L| < \varepsilon$, for $n-1 > N$, where $s_n$ is $n$-th partial sum of complex numbers $(a_n)$, iff $(s_{n- 1})$ is Cauchy iff $|s_m - s_{n-1}| < \varepsilon$, for $m > n > n-1 > N$ equals to $$ \left| \sum_{k=n}^ma_k \right| < \varepsilon $$ hence proved the claim
What you've written doesn't appear to make sense. Here's how I would do it:
Let $(s_n)$ be the sequence of partial sums. Then $\sum a_n$ converges iff $(s_n)$ converges iff $(s_n)$ is Cauchy iff for all $\epsilon>0$ there's an $N$ such that whenever $n,m \geq N$ we have $\left|s_n-s_m \right|=\left|\sum_{k=m+1}^{n} a_k \right|<\epsilon$.