Track / Stage 7 / 264 of 300 #1664 of 1964

Problem 1664

National olympiad second round; IMO P1/P4

Algebra Difficulty 7.7 Prove it

6. Let $\left\{a_{1}, a_{2}, a_{3}, \cdots\right\}$ be an infinite sequence of positive numbers. Prove the inequality $\sum_{n=1}^{N} \alpha_{n}^{2} \leqslant 4 \sum_{n=1}^{N} a_{n}^{2}$ for any positive integer $N$ . Here $\alpha_{n}$ is the average of $a_{1}, a_{2}, a_{3}, \cdots, a_{n}$ , i.e., $\alpha_{n}=$ $\frac{a_{1}+a_{2}+a_{3}+\cdots+a_{n}}{n} .(2005$ Korean Mathematical Olympiad Problem)

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

6. If we set $\frac{1}{c} \sum_{n=1}^{N} \alpha_{n}^{2} \leqslant \sum_{n=1}^{N} \alpha_{n} a_{n}$ , then we have $\sum_{n=1}^{N} \alpha_{n} a_{n} \leqslant c \sum_{n=1}^{N} a_{n}^{2}$ , and the problem can be transformed into handling by the Abel method:
$\begin{array}{l} \sum_{n=1}^{N} \alpha_{n} a_{n}=\sum_{n=1}^{N} \alpha_{n}\left[n \alpha_{n}-(n-1) \alpha_{n-1}\right]= \\ \sum_{n=1}^{N} n a_{n}^{2}-\sum_{n=1}^{N}(n-1) \alpha_{n} \alpha_{n-1} \geqslant \\ \sum_{n=1}^{N} n a_{n}^{2}-\frac{1}{2}\left[\sum_{n=1}^{N}(n-1) \alpha_{n}^{2}+\sum_{n=1}^{N}(n-1) \alpha_{n-1}^{2}\right]= \\ \frac{1}{2} \sum_{n=1}^{N} \alpha_{n}^{2}+\frac{1}{2} n \alpha_{n}^{2} \geqslant \frac{1}{2} \sum_{n=1}^{N} \alpha_{n}^{2} \end{array}$

By the Cauchy-Schwarz inequality, we get $\left(\sum_{n=1}^{N} \alpha_{n} a_{n}\right)^{2} \leqslant \sum_{n=1}^{N} \alpha_{n}^{2} \sum_{n=1}^{N} a_{n}^{2}$ , i.e.,
$\sum_{n=1}^{N} \alpha_{n} a_{n} \leqslant \sqrt{\sum_{n=1}^{N} \alpha_{n}^{2} \sum_{n=1}^{N} a_{n}^{2}}$

Therefore, $\sum_{n=1}^{N} \alpha_{n}^{2} \leqslant 4 \sum_{n=1}^{N} a_{n}^{2}$ holds for any positive integer $N$ .

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.