Tuesday, 20 March 2018

inequality - Prove minleft(a+b+frac1a+frac1bright)=3sqrt2: given a2+b2=1



Prove that
min(a+b+1a+1b)=32


Given a2+b2=1(a,bR+)

Without using calculus.
MyAttempt
I tried the AM-GM, but this gives min=4.



I used Cauchy-Schwarz to get (a+b)22(a2+b2)=2a+b2
But using Titu's Lemma I get 1a+1b4a+b1a+1b22
I'm stuck here, any hint?


Answer




Notice
a+b+1a+1b=(a+12a+12a)+(b+12b+12b)AMGM3[(14a)1/3+(14b)1/3]AMGM6(116ab)1/6a2+b22ab6(18(a2+b2))1/6=6(18)1/6=62=32


Since the value 32 is achieved at a=b=12, we have



min{a+b+1a+1b:a,b>0,a2+b2=1}=32



Notes




About the question how do I come up with this. I basically know the minimum is
achieved at a=b=12. Since the bound 32 on RHS of is optimal, if we ever want to prove the inequality, we need to use something that is tight when a=b. If we want to use AM GM, we need to arrange the pieces so that all terms are equal. That's why I split 1a into 12a+12a and 1b into 12b+12b and see what happens. It just turns out that works.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...