x = a + b + c , y = b c a 3 + c a b 3 + a b c 3
If a , b , c are positive real numbers, which is bigger, x or y ?
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.
Good solution
Beautiful ❤️❤️❤️❤️😉
Elegant solution
Let's prove this using Muirhead's Inequality...
Let y ≥ x ⇒ a b c ⋅ y ⇒ a b c ( b c a 3 + c a b 3 + c a c 3 ) ⇒ a 4 + b 4 + c 4 ⇒ s y m ∑ a 4 ⇒ M ( 4 , 0 , 0 ) ≥ a b c ⋅ x ≥ a b c ( a + b + c ) ≥ a 2 b c + a b 2 c + a b c 2 ≥ s y m ∑ a 2 b c ≥ M ( 2 , 1 , 1 ) which is true since 4,0,0 majorizes 2,1,1. Thus our first guess that y ≥ x is correct.
Be careful to not assume what you want to prove. You don't have to rewrite everything: if you use biconditional arrows between the steps, the proof will still make sense.
WLOG, let
a
≤
b
≤
c
Then by rearrangement inequality we have
y
=
b
c
a
3
+
c
a
b
3
+
a
b
c
3
≥
c
a
a
3
+
a
b
b
3
+
b
c
c
3
=
c
a
2
+
a
b
2
+
b
c
2
≥
a
a
2
+
b
b
2
+
c
c
2
=
a
+
b
+
c
=
x
From the equality case of rearrangement inequality,
y
=
x
when
a
=
b
=
c
I saw there are nice solutions to this down the comments, but I think most of us came to this as on the page of Muirhead's Inequality, so I'll give a solution using only that.
Note: we can't use negative numbers as exponents in Muirhead, so let us multiply by a b c . Thus, a b c x = a 2 b c + b 2 a c + c 2 a b , a b c y = a 4 + b 4 + c 4 We have to multiply both sides by 2 for the Muirhead to be complete (see the AM-GM part in Wiki, where it explains that for example M(2,1,1) means there will be a a 2 b c and a a 2 c b = a 2 b c expression too)
2 a b c x = a 2 b c + a 2 c b + b 2 a c + b 2 c a + c 2 a b + c 2 b a = M ( 2 , 1 , 1 ) 2 a b c y = a 4 + a 4 + b 4 + b 4 + c 4 + c 4 = a 4 b 0 c 0 + a 4 c 0 b 0 + b 4 a 0 c 0 + b 4 c 0 a 0 + c 4 a 0 b 0 + c 4 b 0 a 0 = M ( 4 , 0 , 0 ) . Since M ( 4 , 0 , 0 ) ≥ M ( 2 , 1 , 1 ) , y ≥ x , and the exercise is done.
∵ ( 3 , − 1 , − 1 ) ≻ ( 1 , 0 , 0 ) ∴ s y m ∑ b c a 3 ≥ s y m ∑ a ⇔ 2 c y c ∑ b c a 3 ≥ 2 ( a + b + c ) ⇔ y ≥ x
Given y = b c a 3 + c a b 3 + a b c 3 , if we give all of the fractions the same denominator, namely a b c , we get = a b c a 4 + a b c b 4 + a b c c 4 = a b c a 4 + b 4 + c 4 . Using the inequality a 2 + b 2 + c 2 ≥ a b + b c + c a , we have y = a b c a 4 + b 4 + c 4 ≥ a b c a 2 b 2 + b 2 c 2 + c 2 a 2 ≥ a b c a b 2 c + a b c 2 + a 2 b c = a b c a b c ( a + b + c ) = a + b + c = x . Thus, y ≥ x .
Problem Loading...
Note Loading...
Set Loading...
Using AM-GM we have b c a 3 + b + c ≥ 3 a a c b 3 + a + c ≥ 3 b a b c 3 + a + b ≥ 3 c Combine all the inequalities and we get y + 2 x ≥ 3 x ⇔ y ≥ x So the answer is " y ≥ x always"