Given the known condition ∑i=1nai1⩽1 and the structure of the inequality to be proven, it is not difficult to think of using the Cauchy inequality to first perform a relaxation, obtaining (∑i=1nai2+x21)2⩽∑i=1n(ai2+x2)2ai. Then, by constructing a recursive relationship, we can prove the strengthened inequality of the original inequality. By the Cauchy inequality and ∑i=1nai1⩽1, we get
(i=1∑nai2+x21)2⩽(i=1∑nai1)[i=1∑n(ai2+x2)2ai]⩽i=1∑n(ai2+x2)2ai
Therefore, to prove the original inequality, it suffices to prove the following inequality:
i=1∑n(ai2+x2)2ai⩽21.
a1(a1−1)+x21.
To this end, we can first prove the following stronger proposition:
i=1∑n(ai2+x2)2ai⩽21⋅[a1(a1−1)+x21−an+1(an+1−1)+x21],
where an+1>an is a positive integer.
Let bn=21⋅[a1(a1−1)+x21−an+1(an+1−1)+x21]. By ak+1⩾ak+1, we get
bk−bk−1==⩾=21⋅[a1(a1−1)+x21−ak+1(ak+1−1)+x21]−21⋅[a1(a1−1)+x21−ak(ak−1)+x21]21⋅[ak(ak−1)+x21−ak+1(ak+1−1)+x21]21⋅[ak(ak−1)+x21−(ak+1)⋅ak+x21](ak2+x2)2−ak2ak⩾(ak2+x2)2ak(k⩾2).
Also, b1 Also, bn=21⋅[a1(a1−1)+x21−a2(a2−1)+x21]⩾21⋅[a1(a1−1)+x21−(a1+1)a1+x21]=(a12+x2)2−a12a1⩾(a12+x2)2a1=b1+k=2∑n(bk−bk−1)⩾(a12+x2)2a1+k=2∑n(ak2+x2)2ak=k=1∑n(ak2+x2)2ak
Therefore,
i=1∑n(ai2+x2)2ai⩽21⋅[a1(a1−1)+x21−an+1(an+1−1)+x21]
⩽21⋅a1(a1−1)+x21