For $\alpha>2$, i want to find the speed of convergence of $$S_n=\sum_{i=1}^n\sum_{j=n-i+1}^n i^{-\alpha}j^{-\alpha}.$$
In particular, i want $\sum_{i=1}^n\sum_{j=n-i+1}^n i^{-\alpha}j^{-\alpha}\leq Cn^{-\alpha+1-\epsilon}$ for some $C,\epsilon>0$.
My first attempt was to estimate by integrals $$\sum_{i=1}^n\sum_{j=n-i+1}^n i^{-\alpha}j^{-\alpha}\leq \int_{x=1}^n\int_{y=n-x+1}^n x^{-\alpha}y^{-\alpha}dxdy\\=\int_{x=1}^nx^{-\alpha}(n^{-\alpha+1})dx+\int_{x=1}^nx^{-\alpha}(n-x+1)^{-\alpha+1}dx$$ but the second integral on the left is not an easy one.
My second attempt was to show that $$n^{\alpha-1+\epsilon}\sum_{i=1}^n\sum_{j=n-i+1}^n i^{-\alpha}j^{-\alpha}$$ is bounded.
We will show that $S_n=o(n^{-(\alpha-1)})$. We claim $$n^{(\alpha-1)}S_n \approx n^{(\alpha-1)} \sum_{i=1}^n i^{-\alpha}\left[(n-i+1)^{-(\alpha-1)}-n^{-(\alpha-1)}\right] =\sum_{i=1}^n i^{-\alpha}\left[\left(1+\frac{1-i}{n}\right)^{-(\alpha-1)}-1\right]$$ converges to $0$ where we replace the inner sum (over $j$) with difference of the tails.
Let $k=i-1$. Then \begin{align*} \sum_{i=1}^n i^{-\alpha}\left[\left(1+\frac{1-i}{n}\right)^{-(\alpha-1)}-1\right]&=\sum_{k=0}^{n-1} (k+1)^{-\alpha}\left[\left(1-\frac{k}{n}\right)^{-(\alpha-1)}-1\right]\\ &=0+\sum_{k=1}^{n-1} (k+1)^{-\alpha}\left[\left(1-\frac{k}{n}\right)^{-(\alpha-1)}-1\right]\\ &\leq \sum_{k=1}^{n-1} k^{-\alpha}\left[\left(1-\frac{k}{n}\right)^{-(\alpha-1)}-1\right]. \end{align*} Let $a_k(n)=k^{-\alpha}\left[\left(1-\frac{k}{n}\right)^{-(\alpha-1)}-1\right]$. Applying the generalized binomial theorem we have that $$a_k(n)\leq \frac{1}{n}C_{\alpha}k^{-(\alpha-1)}\left(1-\frac{k}{n}\right)^{-(\alpha-1)}.$$ Together with the fact that $$\left(\frac{n}{k(n-k)}\right)^{(\alpha-1)}=2^{(\alpha-1))}\left(\frac{n}{2k(n-k)}\right)^{(\alpha-1)}<2^{(\alpha-1)}\frac{n}{2k(n-k)}$$ we have that $$n^{(\alpha-1)}S_n\leq \frac{C_{\alpha}}{n}\sum_{k=1}^{n-1}\frac{n}{k(n-k)}\leq \frac{C_{\alpha}}{n}\int_{1}^{n-1}\frac{n}{x(n-x)}dx=\frac{C_{\alpha}}{n}2\log{(n-1)}\to 0.$$