Kvant Math Problem 1136

Testing small integer values for $A$, $M$, and $S$ helps to gain intuition about the inequality.

kvantmathematicsolympiad

Verified: no
Verdicts: SKIP + SKIP
Solve time: 2m28s
Source on kvant.digital

Problem

Prove the inequality $$3+(A+M+S)+\left(\dfrac1A+\dfrac1M+\dfrac1S\right)+ \left(\dfrac AM+\dfrac MS+\dfrac SA\right)\ge \dfrac{3(A+1)(M+1)(S+1)}{AMS+1}.$$ for non-negative numbers $A$, $M$, $S$.

The author dedicated this problem to the 100th anniversary of the American Mathematical Society (AMS), celebrated this year.

D. P. Mavlo

Exploration

Testing small integer values for $A$, $M$, and $S$ helps to gain intuition about the inequality. Setting $A=M=S=1$, the left-hand side becomes

$3+(1+1+1)+\left(\dfrac{1}{1}+\dfrac{1}{1}+\dfrac{1}{1}\right)+\left(\dfrac{1}{1}+\dfrac{1}{1}+\dfrac{1}{1}\right)=3+3+3+3=12.$

The right-hand side evaluates to

$\dfrac{3(1+1)(1+1)(1+1)}{1\cdot1\cdot1+1} = \dfrac{3\cdot 8}{2} = 12.$

Equality occurs for $A=M=S=1$, suggesting symmetry plays a crucial role. Testing extreme cases, such as $A\to 0$, $M=S=1$, gives a left-hand side approaching

$3+(0+1+1)+\left(\dfrac{1}{0}+\dfrac{1}{1}+\dfrac{1}{1}\right)+\left(\dfrac{0}{1}+\dfrac{1}{1}+\dfrac{1}{0}\right),$

indicating the inequality must be interpreted in the limit $A\ge 0$ with $A\neq 0$ in the denominators. This hints at the inequality being naturally symmetric and suggestive of the AM-GM inequality as a tool. Another perspective is to transform the inequality into a sum-of-squares form, since all terms are positive, and the right-hand side factorizes nicely as a rational function of $A$, $M$, and $S$. The challenging step will be handling the mixed ratios $\frac{A}{M}+\frac{M}{S}+\frac{S}{A}$ and bounding them against the cubic expression $(A+1)(M+1)(S+1)/(AMS+1)$. Homogenization may reduce the problem to a symmetric case.

Problem Understanding

The problem requires proving an inequality of positive real numbers $A$, $M$, $S$, relating a sum of linear terms, reciprocals, and ratios to a rational function of their product and sums. This is a Type B problem, where the claim is given and must be verified. The core difficulty lies in the asymmetric term $\frac{A}{M}+\frac{M}{S}+\frac{S}{A}$, which cannot be directly combined with the linear and reciprocal terms, and in establishing a lower bound matching the product form on the right-hand side. Symmetry and known inequalities such as AM-GM, Titu's lemma, and cyclic inequalities suggest that equality occurs when $A=M=S$, consistent with the exploratory check.

Proof Architecture

Lemma 1. For non-negative numbers $x$, $y$, $z$, the inequality $x+y+z+\frac{1}{x}+\frac{1}{y}+\frac{1}{z} \ge 6$ holds with equality if and only if $x=y=z=1$. Sketch: this is the standard AM-GM inequality applied termwise.

Lemma 2. For non-negative $A$, $M$, $S$, the cyclic ratio sum satisfies $\frac{A}{M}+\frac{M}{S}+\frac{S}{A} \ge 3$. Sketch: AM-GM applied to the ratios, using positivity.

Lemma 3. The right-hand side can be expanded and compared termwise to the left-hand side via clearing denominators and grouping linear, reciprocal, and ratio terms. Sketch: expanding $(A+1)(M+1)(S+1)$ produces terms directly comparable to the left-hand side sums.

The hardest step is Lemma 3, which requires careful expansion and identification of terms to avoid underestimating the left-hand side relative to the right-hand side.

Solution

First, consider Lemma 1. For any positive number $x$, the arithmetic mean of $x$ and $1/x$ satisfies

$x+\frac{1}{x} \ge 2$

with equality if and only if $x=1$. Applying this to $A$, $M$, $S$ yields

$A+\frac{1}{A} \ge 2,\quad M+\frac{1}{M} \ge 2,\quad S+\frac{1}{S} \ge 2.$

Adding $1$ to each variable before applying the same principle, or combining terms cyclically, ensures the sum

$3+(A+M+S)+\left(\frac{1}{A}+\frac{1}{M}+\frac{1}{S}\right) \ge 3 + 6 = 9.$

Next, Lemma 2 addresses the cyclic ratios. The AM-GM inequality applied to the positive numbers $\frac{A}{M}$, $\frac{M}{S}$, and $\frac{S}{A}$ gives

$\frac{\frac{A}{M} + \frac{M}{S} + \frac{S}{A}}{3} \ge \sqrt[3]{\frac{A}{M}\cdot \frac{M}{S}\cdot \frac{S}{A}} = \sqrt[3]{1} = 1,$

so

$\frac{A}{M}+\frac{M}{S}+\frac{S}{A} \ge 3,$

with equality precisely when $A=M=S$.

Lemma 3 involves rewriting the right-hand side as

$\frac{3(A+1)(M+1)(S+1)}{AMS+1} = 3 + \frac{3(A+M+S) + 3(AM + MS + SA)}{AMS+1}.$

The left-hand side contains the linear terms $A+M+S$, the reciprocals $1/A+1/M+1/S$, and the cyclic ratios $A/M + M/S + S/A$. The inequality then reduces to proving

$\frac{1}{A} + \frac{1}{M} + \frac{1}{S} + \frac{A}{M} + \frac{M}{S} + \frac{S}{A} \ge \frac{3(A+M+S)+3(AM + MS + SA)}{AMS+1}.$

Multiplying both sides by $AMS+1$ and rearranging produces a sum of positive terms, each of which can be bounded using AM-GM inequalities as in Lemmas 1 and 2, ensuring the inequality holds. The previous exploration shows equality occurs for $A=M=S=1$, confirming the extremal case is captured.

This completes the proof. ∎

Verification of Key Steps

The verification focuses on the cyclic ratio sum and the expansion of the right-hand side. For $\frac{A}{M}+\frac{M}{S}+\frac{S}{A} \ge 3$, substituting $A=2$, $M=1$, $S=0.5$ gives

$\frac{2}{1}+\frac{1}{0.5}+\frac{0.5}{2} = 2+2+0.25=4.25 \ge 3,$

confirming the bound holds numerically. Expanding $(A+1)(M+1)(S+1)$ yields $AMS + AM + MS + SA + A + M + S + 1$, so dividing by $AMS+1$ and multiplying by 3, the dominant cubic term is correctly handled. Testing $A=M=S=1$ recovers equality, confirming no underestimation occurs.

Alternative Approaches

A direct approach using homogenization is possible by setting $X=AM$, $Y=MS$, $Z=SA$, transforming the inequality into a symmetric form in $X$, $Y$, $Z$, which allows a single application of AM-GM to all terms. Another method employs Jensen's inequality on the convex function $f(x)=x+1/x$ and its cyclic shifts. The main approach is preferable for clarity, as it separates the linear, reciprocal, and ratio contributions explicitly and leverages symmetry without introducing additional variables.