uniolympiads Ελληνικά

IMC 2003, Day 1, Problem 6

Let f(z)=anzn+an−1zn−1+⋯+a1z+a0f(z) = a_nz^n + a_{n-1}z^{n-1} + \dots + a_1z + a_0 be a polynomial with real coefficients. Prove that if all roots of ff lie in the left half-plane {z∈C:Re⁡z<0}\{z \in \mathbb{C} : \operatorname{Re} z < 0\} then

akak+3<ak+1ak+2a_ka_{k+3} < a_{k+1}a_{k+2}

holds for every k=0,1,…,n−3k = 0, 1, \dots, n - 3.

Original from the official PDF6. Let f (z) = a n z n + a n−1 z n−1 + . . . + a 1 z + a 0 be a polynomial with real coefficients. Prove that if all roots of f lie in the left half-plane {z ∈ C : Re z < 0} then a k a k+3 < a k+1 a k+2 holds for every k = 0, 1, . . . , n − 3. (20 points)

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. The polynomial ff is a product of linear and quadratic factors, f(z)=∏i(kiz+li)⋅∏j(pjz2+qjz+rj)f(z) = \prod_i (k_iz + l_i) \cdot \prod_j (p_jz^2 + q_jz + r_j), with ki,li,pj,qj,rj∈Rk_i, l_i, p_j, q_j, r_j \in \mathbb{R}. Since all roots are in the left half-plane, for each ii, kik_i and lil_i are of the same sign, and for each jj, pj,qj,rjp_j, q_j, r_j are of the same sign, too. Hence, multiplying ff by −1-1 if necessary, the roots of ff don't change and ff becomes the polynomial with all positive coefficients.

For the simplicity, we extend the sequence of coefficients by an+1=an+2=…=0a_{n+1} = a_{n+2} = \ldots = 0 and a−1=a−2=…=0a_{-1} = a_{-2} = \ldots = 0 and prove the same statement for −1≤k≤n−2-1 \le k \le n - 2 by induction.

For n≤2n \le 2 the statement is obvious: ak+1a_{k+1} and ak+2a_{k+2} are positive and at least one of ak−1a_{k-1} and ak+3a_{k+3} is 0; hence, ak+1ak+2>akak+3=0a_{k+1}a_{k+2} > a_ka_{k+3} = 0.

Now assume that n≥3n \ge 3 and the statement is true for all smaller values of nn. Take a divisor of f(z)f(z) which has the form z2+pz+qz^2 + pz + q where pp and qq are positive real numbers. (Such a divisor can be obtained from a conjugate pair of roots or two real roots.) Then we can write

f(z)=(z2+pz+q)(bn−2zn−2+…+b1z+b0)=(z2+pz+q)g(x).(1)f(z) = (z^2 + pz + q)(b_{n-2}z^{n-2} + \ldots + b_1z + b_0) = (z^2 + pz + q)g(x). \tag{1}
The roots polynomial g(z)g(z) are in the left half-plane, so we have bk+1bk+2<bkbk+3b_{k+1}b_{k+2} < b_kb_{k+3} for all −1≤k≤n−4-1 \le k \le n - 4. Defining bn−1=bn=…=0b_{n-1} = b_n = \ldots = 0 and b−1=b−2=…=0b_{-1} = b_{-2} = \ldots = 0 as well, we also have bk+1bk+2≤bkbk+3b_{k+1}b_{k+2} \le b_kb_{k+3} for all integer kk.

Now we prove ak+1ak+2>akak+3a_{k+1}a_{k+2} > a_ka_{k+3}. If k=−1k = -1 or k=n−2k = n - 2 then this is obvious since ak+1ak+2a_{k+1}a_{k+2} is positive and akak+3=0a_ka_{k+3} = 0. Thus, assume 0≤k≤n−30 \le k \le n - 3. By an easy computation,

ak+1ak+2−akak+3==(qbk+1+pbk+bk−1)(qbk+2+pbk+1+bk)−(qbk+pbk−1+bk−2)(qbk+3+pbk+2+bk+1)==(bk−1bk−bk−2bk+1)+p(bk2−bk−2bk+2)+q(bk−1bk+2−bk−2bk+3)++p2(bkbk+1−bk−1bk+2)+q2(bk+1bk+2−bkbk+3)+pq(bk+12−bk−1bk+3).\begin{aligned} &a_{k+1}a_{k+2} - a_ka_{k+3} = \\ &= (qb_{k+1} + pb_k + b_{k-1})(qb_{k+2} + pb_{k+1} + b_k) - (qb_k + pb_{k-1} + b_{k-2})(qb_{k+3} + pb_{k+2} + b_{k+1}) = \\ &= (b_{k-1}b_k - b_{k-2}b_{k+1}) + p(b_k^2 - b_{k-2}b_{k+2}) + q(b_{k-1}b_{k+2} - b_{k-2}b_{k+3}) + \\ &+ p^2(b_kb_{k+1} - b_{k-1}b_{k+2}) + q^2(b_{k+1}b_{k+2} - b_kb_{k+3}) + pq(b_{k+1}^2 - b_{k-1}b_{k+3}). \end{aligned}
We prove that all the six terms are non-negative and at least one is positive. Term p2(bkbk+1−bk−1bk+2)p^2(b_kb_{k+1} - b_{k-1}b_{k+2}) is positive since 0≤k≤n−30 \le k \le n - 3. Also terms bk−1bk−bk−2bk+1b_{k-1}b_k - b_{k-2}b_{k+1} and q2(bk+1bk+2−bkbk+3)q^2(b_{k+1}b_{k+2} - b_kb_{k+3}) are non-negative by the induction hypothesis.

To check the sign of p(bk2−bk−2bk+2)p(b_k^2 - b_{k-2}b_{k+2}) consider

bk−1(bk2−bk−2bk+2)=bk−2(bkbk+1−bk−1bk+2)+bk(bk−1bk−bk−2bk+1)≥0.b_{k-1}(b_k^2 - b_{k-2}b_{k+2}) = b_{k-2}(b_kb_{k+1} - b_{k-1}b_{k+2}) + b_k(b_{k-1}b_k - b_{k-2}b_{k+1}) \ge 0.
If bk−1>0b_{k-1} > 0 we can divide by it to obtain bk2−bk−2bk+2≥0b_k^2 - b_{k-2}b_{k+2} \ge 0. Otherwise, if bk−1=0b_{k-1} = 0, either bk−2=0b_{k-2} = 0 or bk+2=0b_{k+2} = 0 and thus bk2−bk−2bk+2=bk2≥0b_k^2 - b_{k-2}b_{k+2} = b_k^2 \ge 0. Therefore, p(bk2−bk−2bk+2)≥0p(b_k^2 - b_{k-2}b_{k+2}) \ge 0 for all kk. Similarly, pq(bk+12−bk−1bk+3)≥0pq(b_{k+1}^2 - b_{k-1}b_{k+3}) \ge 0.

The sign of q(bk−1bk+2−bk−2bk+3)q(b_{k-1}b_{k+2} - b_{k-2}b_{k+3}) can be checked in a similar way. Consider

bk+1(bk−1bk+2−bk−2bk+3)=bk−1(bk+1bk+2−bkbk+3)+bk+3(bk−1bk−bk−2bk+1)≥0.b_{k+1}(b_{k-1}b_{k+2} - b_{k-2}b_{k+3}) = b_{k-1}(b_{k+1}b_{k+2} - b_kb_{k+3}) + b_{k+3}(b_{k-1}b_k - b_{k-2}b_{k+1}) \ge 0.
If bk+1>0b_{k+1} > 0, we can divide by it. Otherwise either bk−2=0b_{k-2} = 0 or bk+3=0b_{k+3} = 0. In all cases, we obtain bk−1bk+2−bk−2bk+3≥0b_{k-1}b_{k+2} - b_{k-2}b_{k+3} \ge 0.

Now the signs of all terms are checked and the proof is complete.

Transcribed from the official solutions, page 4. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?