uniolympiads English

IMC 2009, Ημέρα 1, Θέμα 4

Let p(z)=a0+a1z+a2z2+⋯+anznp(z) = a_0 + a_1z + a_2z^2 + \dots + a_nz^n be a complex polynomial. Suppose that 1=c0≥c1≥⋯≥cn≥01 = c_0 \ge c_1 \ge \dots \ge c_n \ge 0 is a sequence of real numbers which is convex (i.e. 2ck≤ck−1+ck+12c_k \le c_{k-1} + c_{k+1} for every k=1,2,…,n−1k = 1, 2, \dots, n-1), and consider the polynomial

q(z)=c0a0+c1a1z+c2a2z2+⋯+cnanzn.q(z) = c_0a_0 + c_1a_1z + c_2a_2z^2 + \dots + c_na_nz^n.

Prove that

max⁡∣z∣≤1∣q(z)∣≤max⁡∣z∣≤1∣p(z)∣.\max_{|z| \le 1} |q(z)| \le \max_{|z| \le 1} |p(z)|.
Πρωτότυπο από το επίσημο PDFLet p(z) = a 0 + a 1 z + a 2 z 2 + · · · + a n z n be a complex polynomial. Suppose that 1 = c 0 ≥ c 1 ≥ · · · ≥ c n ≥ 0 is a sequence of real numbers which is convex (i.e. 2c k ≤ c k−1 + c k+1 for every k = 1, 2, . . . , n − 1), and consider the polynomial q(z) = c 0 a 0 + c 1 a 1 z + c 2 a 2 z 2 + · · · + c n a n z n . Prove that max q(z) ≤ max p(z) . |z|≤1 |z|≤1

Η μεταγραφή συγκρίθηκε σύμβολο προς σύμβολο με το πρωτότυπο, όχι ακόμα από άνθρωπο.

Χρόνος σε αυτό το θέμα 0:00

Δούλεψε τουλάχιστον 45 λεπτά πριν ανοίξεις τη λύση.

Επίσημη λύση

Solution. The polynomials pp and qq are regular on the complex plane, so by the Maximum Principle, max⁡∣z∣≤1∣q(z)∣=max⁡∣z∣=1∣q(z)∣\max_{|z|\le 1}|q(z)| = \max_{|z|=1}|q(z)|, and similarly for pp. Let us denote Mf=max⁡∣z∣=1∣f(z)∣M_f = \max_{|z|=1}|f(z)| for any regular function ff. Thus it suffices to prove that Mq≤MpM_q \le M_p.

First, note that we can assume cn=0c_n = 0. Indeed, for cn=1c_n = 1, we get p=qp = q and the statement is trivial; otherwise, q(z)=cnp(z)+(1−cn)r(z)q(z) = c_np(z) + (1-c_n)r(z), where r(z)=∑j=0ncj−cn1−cnajzjr(z) = \sum_{j=0}^n \frac{c_j - c_n}{1-c_n}a_jz^j. The sequence cj′=cj−cn1−cnc'_j = \frac{c_j-c_n}{1-c_n} also satisfies the prescribed conditions (it is a positive linear transform of the sequence cnc_n with c0′=1c'_0 = 1), but cn′=0c'_n = 0 too, so we get Mr≤MpM_r \le M_p. This is enough: Mq=∣q(z0)∣≤cn∣p(z0)∣+(1−cn)∣r(z0)∣≤cnMp+(1−cn)Mr≤MpM_q = |q(z_0)| \le c_n|p(z_0)| + (1-c_n)|r(z_0)| \le c_nM_p + (1-c_n)M_r \le M_p.

Using the Cauchy formulas, we can express the coefficients aja_j of pp from its values taken over the positively oriented circle S={∣z∣=1}S = \{|z| = 1\}:

aj=12πi∫Sp(z)zj+1dz=12π∫Sp(z)zj∣dz∣a_j = \frac{1}{2\pi i}\int_S \frac{p(z)}{z^{j+1}}\mathrm{d}z = \frac{1}{2\pi}\int_S \frac{p(z)}{z^j}|dz|
for 0≤j≤n0 \le j \le n, otherwise
∫Sp(z)zj∣dz∣=0.\int_S \frac{p(z)}{z^j}|dz| = 0.
Let us use these identities to get a new formula for qq, using only the values of pp over SS:
2π⋅q(w)=∑j=0ncj(∫Sp(z)z−j∣dz∣)wj.2\pi\cdot q(w) = \sum_{j=0}^n c_j\left(\int_S p(z)z^{-j}|dz|\right)w^j.
We can exchange the order of the summation and the integration (sufficient conditions to do this obviously apply):
2π⋅q(w)=∫S(∑j=0ncj(w/z)j)p(z)∣dz∣.2\pi\cdot q(w) = \int_S\left(\sum_{j=0}^n c_j(w/z)^j\right)p(z)|dz|.
It would be nice if the integration kernel (the sum between the brackets) was real. But this is easily arranged – for −n≤j≤−1-n \le j \le -1, we can add the conjugate expressions, because by the above remarks, they are zero anyway:
2π⋅q(w)=∑j=0ncj(∫Sp(z)z−j∣dz∣)wj=∑j=−nnc∣j∣(∫Sp(z)z−j∣dz∣)wj,2\pi\cdot q(w) = \sum_{j=0}^n c_j\left(\int_S p(z)z^{-j}|dz|\right)w^j = \sum_{j=-n}^n c_{|j|}\left(\int_S p(z)z^{-j}|dz|\right)w^j,
2π⋅q(w)=∫S(∑j=−nnc∣j∣(w/z)j)p(z)∣dz∣=∫SK(w/z)p(z)∣dz∣,2\pi\cdot q(w) = \int_S\left(\sum_{j=-n}^n c_{|j|}(w/z)^j\right)p(z)|dz| = \int_S K(w/z)p(z)|dz|,
where
K(u)=∑j=−nnc∣j∣uj=c0+2∑j=1ncjℜ(uj)K(u) = \sum_{j=-n}^n c_{|j|}u^j = c_0 + 2\sum_{j=1}^n c_j\Re(u^j)
for u∈Su \in S.

Let us examine K(u)K(u). It is a real-valued function. Again from the Cauchy formulas, ∫SK(u)∣du∣=2πc0=2π\int_S K(u)|\mathrm{d}u| = 2\pi c_0 = 2\pi. If ∫S∣K(u)∣∣du∣=2π\int_S |K(u)||\mathrm{d}u| = 2\pi still holds (taking the absolute value does not increase the integral), then for every ww:

2π∣q(w)∣=∣∫SK(w/z)p(z)∣dz∣∣≤∫S∣K(w/z)∣⋅∣p(z)∣∣dz∣≤Mp∫S∣K(u)∣∣du∣=2πMp;2\pi|q(w)| = \left|\int_S K(w/z)p(z)|dz|\right| \le \int_S |K(w/z)|\cdot|p(z)||dz| \le M_p\int_S |K(u)||du| = 2\pi M_p;
this would conclude the proof. So it suffices to prove that ∫S∣K(u)∣∣du∣=∫SK(u)∣du∣\int_S |K(u)||\mathrm{d}u| = \int_S K(u)|\mathrm{d}u|, which is to say, KK is non-negative.

[Figure in the original PDF.]

Now let us decompose KK into a sum using the given conditions for the numbers cjc_j (including cn=0c_n = 0). Let dk=ck−1−2ck+ck+1d_k = c_{k-1} - 2c_k + c_{k+1} for k=1,…,nk = 1, \ldots, n (setting cn+1=0c_{n+1} = 0); we know that dk≥0d_k \ge 0. Let Fk(u)=∑j=−k+1k−1(k−∣j∣)ujF_k(u) = \sum_{j=-k+1}^{k-1}(k-|j|)u^j. Then K(u)=∑k=1ndkFk(u)K(u) = \sum_{k=1}^n d_kF_k(u) by easy induction (or see Figure for a graphical illustration). So it suffices to prove that Fk(u)F_k(u) is real and Fk(u)≥0F_k(u) \ge 0 for u∈Su \in S. This is reasonably well-known (as Fkk\frac{F_k}{k} is the Fejér kernel), and also very easy:

Fk(u)=(1+u+u2+⋯+uk−1)(1+u−1+u−2+⋯+u−(k−1))==(1+u+u2+⋯+uk−1)(1+u+u2+⋯+uk−1)‾=∣1+u+u2+⋯+uk−1∣2≥0\begin{aligned} F_k(u) &= (1+u+u^2+\cdots+u^{k-1})(1+u^{-1}+u^{-2}+\cdots+u^{-(k-1)}) = \\ &= (1+u+u^2+\cdots+u^{k-1})\overline{(1+u+u^2+\cdots+u^{k-1})} = |1+u+u^2+\cdots+u^{k-1}|^2 \ge 0 \end{aligned}
This completes the proof.

Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 2–3. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.

Θέμα αρχείου: η εκφώνηση είναι το επίσημο κείμενο (μεταγραμμένο, με το πρωτότυπο παραπάνω). Η ταξινόμηση ανά αντικείμενο και η δυσκολία εκτιμήθηκαν αυτόματα· υποδείξεις και λύση στα ελληνικά προστίθενται σταδιακά.

Πώς πήγε;