Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2010 / Problems / Day 1, P5

IMC 2010 · Day 1 · P5

killer

Suppose that a,b,ca, b, c are real numbers in the interval [1,1][-1, 1] such that 1+2abca2+b2+c2.1 + 2abc \ge a^2 + b^2 + c^2. Prove that 1+2(abc)na2n+b2n+c2n1 + 2 (abc)^n \ge a^{2n} + b^{2n} + c^{2n} for all positive integers nn.

Solution 1 of 2 (official)

Consider the symmetric matrix A=(1aba1cbc1).A = \begin{pmatrix} 1 & a & b \\ a & 1 & c \\ b & c & 1 \end{pmatrix}. By the constraint we have detA0\det A \ge 0 and det(1aa1),det(1bb1),det(1cc1)0\det \begin{pmatrix} 1 & a \\ a & 1 \end{pmatrix}, \det \begin{pmatrix} 1 & b \\ b & 1 \end{pmatrix}, \det \begin{pmatrix} 1 & c \\ c & 1 \end{pmatrix} \ge 0. Hence AA is positive semidefinite, and A=B2A = B^2 for some symmetric real matrix BB.

Let the rows of BB be xx, yy, zz. Then x=y=z=1|x| = |y| = |z| = 1, a=xya = x \cdot y, b=yzb = y \cdot z and c=zxc = z \cdot x, where x|x| and xyx \cdot y denote the Euclidean norm and scalar product. Denote by X=nxX = \otimes^n x, Y=nyY = \otimes^n y, Z=nzZ = \otimes^n z the nnth tensor powers, which belong to R3n\mathbb{R}^{3^n}. Then X=Y=Z=1|X| = |Y| = |Z| = 1, XY=anX \cdot Y = a^n, YZ=bnY \cdot Z = b^n and ZX=cnZ \cdot X = c^n. So, the matrix (1anbnan1cnbncn1),\begin{pmatrix} 1 & a^n & b^n \\ a^n & 1 & c^n \\ b^n & c^n & 1 \end{pmatrix}, being the Gram matrix of three vectors in R3n\mathbb{R}^{3^n}, is positive semidefinite, and its determinant, 1+2(abc)na2nb2nc2n1 + 2 (abc)^n - a^{2n} - b^{2n} - c^{2n} is non-negative.

Solution 2 of 2 (official)

The constraint can be written as (abc)2(1b2)(1c2).(1)\tag{1} (a - bc)^2 \le (1 - b^2)(1 - c^2). By the Cauchy-Schwarz inequality, (an1+an2bc++bn1cn1)2(an1+an2bc++bcn1)2(1+bc++bcn1)2(1+b2++b2(n1))(1+c2++c2(n1))\begin{align*} \bigl( a^{n-1} &+ a^{n-2} bc + \dots + b^{n-1} c^{n-1} \bigr)^2 \le \bigl( |a|^{n-1} + |a|^{n-2} |bc| + \dots + |bc|^{n-1} \bigr)^2 \le \\ &\le \bigl( 1 + |bc| + \dots + |bc|^{n-1} \bigr)^2 \le \bigl( 1 + |b|^2 + \dots + |b|^{2(n-1)} \bigr) \bigl( 1 + |c|^2 + \dots + |c|^{2(n-1)} \bigr) \end{align*} Multiplying by (1), we get (abc)2(an1+an2bc++bn1cn1)2(1b2)(1+b2++b2(n1))(1c2)(1+c2++c2(n1)),(a - bc)^2 \bigl( a^{n-1} + a^{n-2} bc + \dots + b^{n-1} c^{n-1} \bigr)^2 \le (1 - b^2) \bigl( 1 + |b|^2 + \dots + |b|^{2(n-1)} \bigr) (1 - c^2) \bigl( 1 + |c|^2 + \dots + |c|^{2(n-1)} \bigr), (anbncn)2(1bn)(1cn),(a^n - b^n c^n)^2 \le (1 - b^n)(1 - c^n), 1+2(abc)na2n+b2n+b2n.1 + 2 (abc)^n \ge a^{2n} + b^{2n} + b^{2n}.

How the field did

contestants scored
322
average (of 10)
0.30
solved (≥ 80%)
1.9%
near-0 (≤ 10%)
96.6%
discrimination
0.29

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2002 · Day 1 · P6killeravg 0.2/10 · solved 2% · near-0 98% · disc 0.21
IMC 2016 · Day 2 · P10killeravg 0.1/10 · solved 1% · near-0 99% · disc 0.16
IMC 2016 · Day 2 · P9killeravg 0.7/10 · solved 3% · near-0 92% · disc 0.40
IMC 1999 · Day 1 · P6killeravg 0.1/10 · solved 0% · near-0 97% · disc 0.22