Moving over here from this question.
You can't, in general, convert the limit of a sum of terms into the sum of the limits of the individual terms, if the number of terms grows without bound. The problem in the original question is an example of this not working.
Recall that
$$
\lim_{n \to \infty} a_n = a
$$
really means that for any $\varepsilon > 0$, there exists an integer $m > 0$ such that for all $n > m$, $| a-a_n | < \varepsilon$. The reason we can convert the limit of a sum of a fixed number of individual terms
$$
\lim_{n \to \infty} a_n + b_n + c_n + \cdots
$$
into the sum of their respective limits
$$
\lim_{n \to \infty} a_n + \lim_{n \to \infty} b_n + \lim_{n \to \infty} c_n + \cdots
$$
is that if there are $t$ terms, say, we can find
- $m_a$ such that $|a-a_n| < \varepsilon/t$ whenever $n > m_a$
- $m_b$ such that $|b-b_n| < \varepsilon/t$ whenever $n > m_b$
- $m_c$ such that $|c-c_n| < \varepsilon/t$ whenever $n > m_c$
and so on. Then we let $m = \max\{m_a, m_b, m_c, \ldots\}$, so that
$$
|a-a_n|, |b-b_n|, |c-c_n| < \varepsilon/t
$$
whenever $n > m$. Since there are $t$ terms in all, we can then conclude that
\begin{align}
|(a+b+c+\cdots)-(a_n+b_n+c_n+\cdots)|
& \leq |a-a_n|+|b-b_n|+|c-c_n|+\cdots \\
& < \varepsilon/t + \varepsilon/t + \varepsilon/t + \cdots \\
& = \varepsilon
\end{align}
establishing the limit. But for the expression
$$
\lim_{n \to \infty} \frac{1}{n^2}+\frac{2}{n^2}+\frac{3}{n^2}+\cdots+\frac{n}{n^2}
$$
we can't constrain ourselves to $t$ terms. Eventually the number of terms exceeds any fixed value, so that we can't divide $\varepsilon$ across the individual terms so as to obtain individual margins greater than $0$. The limit fails to be the sum of the individual limits in general (and in this case, they are different).