Maths Olympiad Prep

Library / /4 of 4

, 2010

Algebra Difficulty 7.4 National Olympiad, round 2 Prove it Romania

Find the largest constant K0K \ge 0 such that for any 0kK0 \le k \le K, and for any non-negative real numbers a,b,ca, b, c, satisfying a2+b2+c2+kabc=k+3a^2 + b^2 + c^2 + kabc = k + 3, to have a+b+c3a + b + c \le 3.

Solution

Let us work from first principles. Whenever (at least) one variable is zero, say cc, it follows a2+b2=k+3a^2 + b^2 = k + 3, hence a+b+c2(k+3)3a + b + c \le \sqrt{2(k+3)} \le 3 for k3/2k \le 3/2, with equality holding for a=b=3/2a = b = 3/2. We thus have a starting tentative limiting bound of K=3/2K = 3/2.

Let also notice that a=b=c=1a = b = c = 1 checks for any value of kk, while providing a maximal admissible value for a+b+c=3a + b + c = 3.

Assume σ=a+b+c>3\sigma = a + b + c > 3. Notice that then (for some k>0k > 0) k(1abc)=a2+b2+c2313(a+b+c)23=13σ23>0k(1 - abc) = a^2 + b^2 + c^2 - 3 \ge \frac{1}{3}(a+b+c)^2 - 3 = \frac{1}{3}\sigma^2 - 3 > 0, by Cauchy-Schwarz, and so abc<1abc < 1. Now is the time for the key step. Since a+b+c>3a + b + c > 3, assuming some ordering of our variables, say 0abc0 \le a \le b \le c, it will follow c>1c > 1, and so we can compute

k=a2+b2+c231abc =(a+b)2+c232ab1abc =(σc)2+c232ab1abc =c(2c22σc+σ23)2+2(1abc)c(1abc) =2c+2c32σc2+(σ23)c2c(1abc) \begin{align*} k &= \frac{a^2 + b^2 + c^2 - 3}{1 - abc} \ &= \frac{(a+b)^2 + c^2 - 3 - 2ab}{1 - abc} \ &= \frac{(\sigma-c)^2 + c^2 - 3 - 2ab}{1 - abc} \ &= \frac{c(2c^2 - 2\sigma c + \sigma^2 - 3) - 2 + 2(1 - abc)}{c(1 - abc)} \ &= \frac{2}{c} + \frac{2c^3 - 2\sigma c^2 + (\sigma^2 - 3)c - 2}{c(1 - abc)} \end{align*}
Denote f(c)=2c32σc2+(σ23)c2f(c) = 2c^3 - 2\sigma c^2 + (\sigma^2 - 3)c - 2. As (xy)(f(x)f(y))=(xy)2(32(x+y23σ)2+12(xy)2+13(σ29))0(x-y)(f(x)-f(y)) = (x-y)^2 \left( \frac{3}{2} \left( x+y-\frac{2}{3}\sigma \right)^2 + \frac{1}{2}(x-y)^2 + \frac{1}{3}(\sigma^2-9) \right) \ge 0, ff is increasing; and as f(1)=(σ+1)(σ3)>0f(1) = (\sigma+1)(\sigma-3) > 0, it follows f(c)>0f(c) > 0. Therefore the minimal value for kk is reached when ab=0ab = 0, for a=0a = 0, whence kb2+c2312(b+c)23=12σ23>32k \ge b^2 + c^2 - 3 \ge \frac{1}{2}(b+c)^2 - 3 = \frac{1}{2}\sigma^2 - 3 > \frac{3}{2}.

Define
L(a,b,c)=a+b+cλ(a2+b2+c2+kabck3). L(a, b, c) = a + b + c - \lambda(a^2 + b^2 + c^2 + kabc - k - 3).

The analysis of the values on the border of the domain of LL has been done above, leading to K3/2K \le 3/2 (we could now simplify our work to just k=3/2k = 3/2, but it is enlightening to see it in full generality). The system of partial derivatives is
{La=1λ(2a+kbc)Lb=1λ(2b+kca)Lc=1λ(2c+kab) \left\{ \begin{array}{l} \displaystyle \frac{\partial L}{\partial a} = 1 - \lambda(2a + kbc) \\[1em] \displaystyle \frac{\partial L}{\partial b} = 1 - \lambda(2b + kca) \\[1em] \displaystyle \frac{\partial L}{\partial c} = 1 - \lambda(2c + kab) \end{array} \right.

Equaling the partial derivatives to zero forbids λ=0\lambda = 0. Then, from pairwise equalities, we get
λ(ab)(2kc)=λ(bc)(2ka)=λ(ca)(2kb)=0. \lambda(a - b)(2 - kc) = \lambda(b - c)(2 - ka) = \lambda(c - a)(2 - kb) = 0.
One possibility is a=b=c=xa = b = c = x, thus (from the constraint) 3x2+kx3=k+33x^2 + kx^3 = k + 3, or
(x1)(kx2+(k+3)x+(k+3))=0(x-1)(kx^2+(k+3)x+(k+3)) = 0, with only non-negative real solution x=1x = 1, since
the coefficients of the quadratic factor are non-negative. Then a+b+c=3x=3a + b + c = 3x = 3,
the admissible maximum.
The other possibility is for two variables to be equal, say a=ba = b, but not equal
to the third, hence needing a=b=2/ka = b = 2/k, thus (from the constraint) $8/k^2 + c^2 +
4c/k = k + 3,or, or k^2c^2 + 4kc - (k^3 + 3k^2 - 8) = 0$, with non-negative real solution
c=(k+2)k12kc = \frac{(k+2)\sqrt{k-1}-2}{k} for k3+3k280k^3+3k^2-8 \ge 0, i.e. kκ1.3553k \ge \kappa \approx 1.3553. Then a+b+c=a+b+c =
(k+2)k1+2k<3\frac{(k+2)\sqrt{k-1}+2}{k} < 3 for k<2k < 2, since it is equivalent to (k2)3<0(k-2)^3 < 0. As kk needs
be at most K3/2K \le 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+ca+b+c is reached for k=3/2k = 3/2 both at a=b=c=1a = b = c = 1, and at a=b=3/2a = b = 3/2 and c=0c = 0 et al., suggests this is a Schur-type inequality. Indeed, assume 0k3/20 \le k \le 3/2 and a>3\sum a > 3.
Then
k+3=a2+kabca2+3kabca=(1k3)a2+k3(a2+9abca)(1k3)a2+2k3ab=(12k3)a2+k3(a2+2ab)=(12k3)a2+k3(a)2(13(12k3)+k3)(a)2=k+39(a)2>k+3 \begin{aligned} k+3 &= \sum a^2 + kabc \\ &\ge \sum a^2 + \frac{3kabc}{\sum a} \\ &= \left(1-\frac{k}{3}\right) \sum a^2 + \frac{k}{3} \left(\sum a^2 + \frac{9abc}{\sum a}\right) \\ &\ge \left(1-\frac{k}{3}\right) \sum a^2 + \frac{2k}{3} \sum ab \\ &= \left(1-\frac{2k}{3}\right) \sum a^2 + \frac{k}{3} \left(\sum a^2 + 2\sum ab\right) \\ &= \left(1-\frac{2k}{3}\right) \sum a^2 + \frac{k}{3} \left(\sum a\right)^2 \\ &\ge \left(\frac{1}{3}\left(1-\frac{2k}{3}\right) + \frac{k}{3}\right) \left(\sum a\right)^2 \\ &= \frac{k+3}{9} \left(\sum a\right)^2 \\ &> k+3 \end{aligned}
since inequality a2+9abca2ab\sum a^2 + \frac{9abc}{\sum a} \ge 2\sum ab is in turn equivalent to (a2)(a)+9abc2(ab)(a)(\sum a^2)(\sum a) + 9abc \ge 2(\sum ab)(\sum a), then a3+3abca2b+ab2\sum a^3 + 3abc \ge \sum a^2b + \sum ab^2, at last a(ab)(ac)0\sum a(a-b)(a-c) \ge 0, a basic form of Schur; while a213(a)2\sum a^2 \ge \frac{1}{3}(\sum a)^2 by Cauchy-Schwarz.

Putting it all together, the largest admissible value for KK turns to be 3/23/2, with the maximum value a+b+c=3a+b+c = 3 being reached only at points (3/2,3/2,0)(3/2, 3/2, 0), (3/2,0,3/2)(3/2, 0, 3/2), (0,3/2,3/2)(0, 3/2, 3/2) and (1,1,1)(1, 1, 1). For 0k<3/20 \le k < 3/2 the unique maximum is reached at (1,1,1)(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)(1, 1, 1) (which works for any kk) achieve a larger value than 3 for a+b+ca + b + c only starting with k>2k > 2, so would induce the erroneous bound K=2K = 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.