Problem: Let a,b,c,d be real numbers such that 0≤a≤b≤c≤d. Prove the inequality ab3+bc3+cd3+da3≥a2b2+b2c2+c2d2+d2a2
Solution
Solution: The inequality is equivalent to (ab3+bc3+cd3+da3)2≥(a2b2+b2c2+c2d2+d2a2)2 By the Cauchy-Schwarz inequality, (ab3+bc3+cd3+da3)(a3b+b3c+c3d+d3a)≥(a2b2+b2c2+c2d2+d2a2)2 Hence it is sufficient to prove that (ab3+bc3+cd3+da3)2≥(ab3+bc3+cd3+da3)(a3b+b3c+c3d+d3a) i.e. to prove ab3+bc3+cd3+da3≥a3b+b3c+c3d+d3a. This inequality can be written successively a(b3−d3)+b(c3−a3)+c(d3−b3)+d(a3−c3)≥0 or (a−c)(b3−d3)−(b−d)(a3−c3)≥0 which comes down to (a−c)(b−d)(b2+bd+d2−a2−ac−c2)≥0 The last inequality is true because a−c≤0,b−d≤0, and (b2−a2)+(bd−ac)+(d2−c2)≥0 as a sum of three non-negative numbers. The last inequality is satisfied with equality whence a=b and c=d. Combining this with the equality cases in the Cauchy-Schwarz inequality we obtain the equality cases for the initial inequality: a=b=c=d.
Remark. Instead of using the Cauchy-Schwarz inequality, once the inequality ab3+bc3+cd3+da3≥a3b+b3c+c3d+d3a is established, we have 2(ab3+bc3+cd3+da3)≥(ab3+bc3+cd3+da3)+(a3b+b3c+c3d+d3a)=(ab3+a3b)+(bc3+b3c)+(cd3+c3d)+(da3+d3a)≥AM−GM2a2b2+2b2c2+2c2d2+2d2a2 which gives the conclusion.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.