Find the largest constant K≥0 such that for any 0≤k≤K, and for any non-negative real numbers a,b,c, satisfying a2+b2+c2+kabc=k+3, to have a+b+c≤3.
Solution
Let us work from first principles. Whenever (at least) one variable is zero, say c, it follows a2+b2=k+3, hence a+b+c≤2(k+3)≤3 for k≤3/2, with equality holding for a=b=3/2. We thus have a starting tentative limiting bound of K=3/2.
Let also notice that a=b=c=1 checks for any value of k, while providing a maximal admissible value for a+b+c=3.
Assume σ=a+b+c>3. Notice that then (for some k>0) k(1−abc)=a2+b2+c2−3≥31(a+b+c)2−3=31σ2−3>0, by Cauchy-Schwarz, and so abc<1. Now is the time for the key step. Since a+b+c>3, assuming some ordering of our variables, say 0≤a≤b≤c, it will follow c>1, and so we can compute
k=1−abca2+b2+c2−3=1−abc(a+b)2+c2−3−2ab=1−abc(σ−c)2+c2−3−2ab=c(1−abc)c(2c2−2σc+σ2−3)−2+2(1−abc)=c2+c(1−abc)2c3−2σc2+(σ2−3)c−2 Denote f(c)=2c3−2σc2+(σ2−3)c−2. As (x−y)(f(x)−f(y))=(x−y)2(23(x+y−32σ)2+21(x−y)2+31(σ2−9))≥0, f is increasing; and as f(1)=(σ+1)(σ−3)>0, it follows f(c)>0. Therefore the minimal value for k is reached when ab=0, for a=0, whence k≥b2+c2−3≥21(b+c)2−3=21σ2−3>23.
Define L(a,b,c)=a+b+c−λ(a2+b2+c2+kabc−k−3).
The analysis of the values on the border of the domain of L has been done above, leading to K≤3/2 (we could now simplify our work to just k=3/2, but it is enlightening to see it in full generality). The system of partial derivatives is ⎩⎨⎧∂a∂L=1−λ(2a+kbc)∂b∂L=1−λ(2b+kca)∂c∂L=1−λ(2c+kab)
Equaling the partial derivatives to zero forbids λ=0. Then, from pairwise equalities, we get λ(a−b)(2−kc)=λ(b−c)(2−ka)=λ(c−a)(2−kb)=0. One possibility is a=b=c=x, thus (from the constraint) 3x2+kx3=k+3, or (x−1)(kx2+(k+3)x+(k+3))=0, with only non-negative real solution x=1, since the coefficients of the quadratic factor are non-negative. Then a+b+c=3x=3, the admissible maximum. The other possibility is for two variables to be equal, say a=b, but not equal to the third, hence needing a=b=2/k, thus (from the constraint) $8/k^2 + c^2 + 4c/k = k + 3,ork^2c^2 + 4kc - (k^3 + 3k^2 - 8) = 0$, with non-negative real solution c=k(k+2)k−1−2 for k3+3k2−8≥0, i.e. k≥κ≈1.3553. Then a+b+c= k(k+2)k−1+2<3 for k<2, since it is equivalent to (k−2)3<0. As k needs be at most K≤3/2, these points are critical, but not global maxima (in fact they turn to be global minima).
Alternative Solution: The fact the value 3 for a+b+c is reached for k=3/2 both at a=b=c=1, and at a=b=3/2 and c=0 et al., suggests this is a Schur-type inequality. Indeed, assume 0≤k≤3/2 and ∑a>3. Then k+3=∑a2+kabc≥∑a2+∑a3kabc=(1−3k)∑a2+3k(∑a2+∑a9abc)≥(1−3k)∑a2+32k∑ab=(1−32k)∑a2+3k(∑a2+2∑ab)=(1−32k)∑a2+3k(∑a)2≥(31(1−32k)+3k)(∑a)2=9k+3(∑a)2>k+3 since inequality ∑a2+∑a9abc≥2∑ab is in turn equivalent to (∑a2)(∑a)+9abc≥2(∑ab)(∑a), then ∑a3+3abc≥∑a2b+∑ab2, at last ∑a(a−b)(a−c)≥0, a basic form of Schur; while ∑a2≥31(∑a)2 by Cauchy-Schwarz.
Putting it all together, the largest admissible value for K turns to be 3/2, with the maximum value a+b+c=3 being reached only at points (3/2,3/2,0), (3/2,0,3/2), (0,3/2,3/2) and (1,1,1). For 0≤k<3/2 the unique maximum is reached at (1,1,1). Notice the importance of examining the values on the border; without that, the other critical interior points found but (1,1,1) (which works for any k) achieve a larger value than 3 for a+b+c only starting with k>2, so would induce the erroneous bound K=2.
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.