If f:N→C is a function, and s∈C with ℜ(s)>0 is a complex number such that the Dirichlet series L(f,s)=∞∑n=1f(n)ns converges,
then ∑n≤xf(n)=o(xs)forx→+∞
As an example, take f(n)=1, then ∞∑n=11ns converges for s>1 and indeed ∑n≤x1=⌊x⌋=o(xs) for all s>1.
As a second example, take f(n)=1n, then ∞∑n=11n1+s converges for s>0 and indeed ∑n≤x1n=logx=o(xs) for all s>0.
What I like about Kronecker's lemma is that its statement and proof involve real analysis only; one does not need to know anything about the behaviour of the function L(f,s) for complex numbers s. On the other hand, in analytic number theory, one often uses Perron's formula to estimate sums ∑n≤xf(n) for number theoretic functions f. One then needs to have information about the zeros of the Dirichlet series, and its behaviour for large imaginary values of s to make Perron's formula work. All this information is thus not needed when using Kronecker's lemma.
Although a proof of Kronecker's lemma can be found in Hildebrand's lecture notes, I write here a proof for the case s∈R. This proof is based on the French Wikipedia article about Kronecker's lemma and is very transparent.