Determine the least real number M such that the inequality ab(a² - b²) + bc(b² - c²) +…
- User
Determine the least real number M such that the inequality |ab(a² - b²) + bc(b² - c²) + ca(c² - a²)| ≤ M(a² + b² + c²)² holds for all real numbers a, b and c.
- Assistant
Let
F(a ,b ,c)=ab(a^{2}-b^{2})+bc(b^{2}-c^{2})+ca(c^{2}-a^{2}).
Step 1 A handier form
Expand every term and regroup:ab(a²-b²)=a³b-ab³ , bc(b²-c²)=b³c-bc³ , ca(c²-a²)=c³a-ca³ .
Collecting gives
F(a ,b ,c)=-(a-b)(b-c)(c-a)(a+b+c). (★)
(So the expression is symmetric of degree 4.)
Step 2 Homogenise
Both sides of the required inequality|F(a ,b ,c)| ≤ M (a²+b²+c²)²
are homogeneous of degree 4; hence the scale of (a ,b ,c) does not matter.
PutS = a²+b²+c² = 1. (1)
With (1) we only have to find
M* = max_{a²+b²+c²=1} |F(a ,b ,c)| . (2)
The best constant in the original problem will be this M*.
Step 3 Stationary points (Lagrange multipliers)
Let G(a ,b ,c)=F(a ,b ,c)-λ(a²+b²+c²-1).
Using (★) it is simpler to differentiate the original form of F.
The gradients are∂F/∂a = 3a²b-b³+c³-3ca²,
∂F/∂b = 3b²c-c³+a³-3ab², (3)
∂F/∂c = 3c²a-a³+b³-3bc².From ∇F = 2λ(a ,b ,c) we get
3a²b-b³+c³-3ca² = 2λa,
3b²c-c³+a³-3ab² = 2λb, (4)
3c²a-a³+b³-3bc² = 2λc.Step 4 Solving (4)
A little experimentation shows that all the non-trivial solutions come fromc = −a and b ≠ ±a. (5)
(Every other possibility forces F=0, hence is useless for the maximum.)
Put c = −a. Because of (1) write a = k, b = t k (k≠0). ThenS = a²+b²+c² = k²(2+t²) = 1 ⇒ k² = 1/(2+t²). (6)
Using (★) and (5):
F = −(a-b)(b-c)(c-a)(a+b+c)
= 2k⁴t(1-t²). (7)With (6) the absolute value that has to be maximised becomes the single–variable function
ϕ(t)= |2t(1-t²)| /(2+t²)² (t∈ℝ). (8)
Step 5 Maximising ϕ(t)
For t>0 letϕ(t)= 2t(1-t²)/(2+t²)².
A short derivative computation yields
ϕ'(t)=0 ⇔ t² satisfies t⁴-9t²+2=0.
Hence
t² = u = (9+√73)/2 (the other root gives a local minimum),
t = √u = √((9+√73)/2) ≈ 2.963.Step 6 The maximum value
Insert u in (8):M* = ϕ(t_max)
= 2√u (u-1)/(u+2)²
= 4 √u (u-1)/(u+2)² · ½
= 4(7+√73)√(9+√73)/(√2 (13+√73)²).A tidier closed form:
M = 2√2 (7+√73)√(9+√73) / (13+√73)² (9)
Numerically
M ≈ 0.397006 177 7.
Step 7 Minimality and sharpness
• All other stationary points obtained from (4) are either permutations of (5) or give F=0; their |F| is ≤ the value in (9).
• Border cases (any two variables equal or one of them 0) give |F| ≤ ¼ < M.
Therefore the value in (9) is the global maximum of |F| on the sphere (1), i.e. the least constant that works.Conclusion
The smallest real number M satisfying|ab(a²-b²)+bc(b²-c²)+ca(c²-a²)| ≤ M(a²+b²+c²)² for all real a,b,c
is
boxed M = 2√2 (7+√73)√(9+√73) / (13+√73)² ≈ 0.397006 .
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.