Find the smallest positive real number such that for all non-negative real numbers , we have
Bonus: Generalize this for non-negative real numbers.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We know that x ≥ 0 , y ≥ 0 , c > 0 . Since the inequality is always stands when x = y independently from c , let's assume that x = y .
Let u = x + y , v = ∣ x − y ∣ . It's apparent that u ≥ v > 0 .
Then, x 2 + y 2 = 2 1 ( 2 x 2 + 2 y 2 ) = 2 1 ( x 2 + 2 x y + y 2 + x 2 − 2 x y + y 2 ) = 2 1 ( ( x + y ) 2 + ( x − y ) 2 ) = 2 1 ( u 2 + v 2 ) .
Now, let's rewrite the inequality:
2 u + c ⋅ v ≥ 4 1 ( u 2 + v 2 )
4 1 u 2 + c ⋅ u v + c 2 ⋅ v 2 ≥ 4 1 u 2 + 4 1 v 2
c ⋅ u v + c 2 ⋅ v 2 ≥ 4 1 v 2
c ⋅ v u + c 2 ≥ 4 1
Let t = v u , t ≥ 1 :
c 2 + t ⋅ c − 4 1 ≥ 0
The roots are c 1 , 2 = 2 − t ± t 2 + 1 . Since c > 0 , then c ≥ c 2 = 2 − t + t 2 + 1 .
f ( t ) = 2 − 1 + t 2 + 1 is a descending function, meaning the maximum is reached at t = 1 . That means c ≥ f ( 1 ) = 2 2 − 1
Note: t = 1 when u = v meaning either x or y equals zero.