Consider the series $S_N = \sum_{k=0}^N a_k b_k$. Let:
- $a_k > 0$
- $\sum_{k=0}^N a_k < M$ for any $N$
- $a_k \rightarrow 0$ as $N \rightarrow \infty$
- $b_k = \beta^{N-k}$ with $\beta \in (0,1)$.
I am pretty sure that this implies convergence of $\sum_{k=0}^N a_k b_k$ to $0$ as $N \rightarrow \infty$, because $a_k$ is finite and $b_k$ tends to $0$ for increasing $N$. But unfortunately, I'm not able to prove it.
The problem is that all available tests/theorems aim to prove convergence to a finite value instead of to zero. I tried a Abel's test/Dirichlet's test like approach (with summation of parts) but this alsways ends up in convergence to a nonzero value.
Any help and hint is appreciated. Thanks!
Just write $$\sum_{k=0}^N a_kb_k = \sum_{k=0}^N a_k \beta^{N-k}=\frac{\sum_{k=0}^N a_k \beta^{-k}}{\beta^{-N}}$$
and apply Kronecker's lemma.