0

Let $a_1, a_2,\cdots a_n$ be positive real numbers. The A.M-G.M inequality states that $$(a_1a_2\cdots a_n)^\frac{1}{n}\leq\frac{a_1+a_2+\cdots +a_n}{n}$$ with equality if and only if $a_1=a_2=a_3\cdots =a_n$.

I was able to prove the inequality using Lagrange Multipliers method. Can anyone help me prove the Equality part. i.e if A.M=G.M then $a_1=a_2=a_3\cdots =a_n$.

RobPratt
  • 45,619
user31459
  • 396
  • 1
  • 9

2 Answers2

2

Assume that you have proved LHS $\le$ RHS by some way.

Now we prove that if LHS $=$ RHS, then $a_1 = a_2 = \cdots = a_n$.

Assume, for the sake of contradiction, that LHS = RHS for some positive real numbers $a_1, a_2, \cdots, a_n$, not all equal.

WLOG, assume that $a_1 < a_2$. Let $b_1 = b_2 = (a_1 + a_2)/2$. We have $b_1 + b_2 = a_1 + a_2$ and $$b_1b_2 - a_1a_2 = (a_1 - a_2)^2/4 > 0.$$ If we replace $a_1, a_2$ with $b_1, b_2$, we get LHS $>$ RHS. A contradiction.

River Li
  • 37,323
0

Hint: if you were able to do it by Lagrange Multipliers then AM$=$GM implies $\left(a_1,\ldots,a_n\right)$ satisfies the KKT. Can you continue from here?

Kroki
  • 13,135