Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (p. 191). The paper's (1) is the normalization f(z)∼znf(z)\sim z^n as z→∞z\to\infty, so ff is a monic polynomial of degree nn, and Ef={z:∣f(z)∣≤1}E_f=\{z:\lvert f(z)\rvert\le1\}. With TnT_n the Chebyshev polynomial, cos⁡nz=Tn(cos⁡z)\cos nz=T_n(\cos z), the paper sets

fn(z)=Tn(2(1−n)/nz+1),n=1,2,…,f_n(z)=T_n\bigl(2^{(1-n)/n}z+1\bigr),\qquad n=1,2,\ldots,

and lists four properties of fnf_n: (i) fn(0)=1f_n(0)=1; (ii) fn′(0)=2(1/n)−1n2f_n'(0)=2^{(1/n)-1}n^2; (iii) fnf_n is real and all its zeros are negative; (iv) the critical values of fnf_n are ±1\pm1. The paper states (pp. 191--192) that (1), (i), (iii) and (iv) characterize fnf_n uniquely.

Theorem 1 (p. 192). Let ff be a polynomial satisfying (1) with ∣f(0)∣=1\lvert f(0)\rvert=1 and EfE_f connected. Then

∣f′(0)∣≤2(1/n)−1n2,\lvert f'(0)\rvert\le2^{(1/n)-1}n^2,

and equality can occur only for f(z)=c−nfn(cz)f(z)=c^{-n}f_n(cz) with ∣c∣=1\lvert c\rvert=1. The print gives the bound as "∣f′(0)∣≤fn(0)=2(1/n)−1n2\lvert f'(0)\rvert\le f_n(0)=2^{(1/n)-1}n^2" [sic]; by (i) and (ii) the middle term is fn′(0)f_n'(0). The polynomial fnf_n satisfies (1), one of its characterizing properties, and by (i), (ii) and (iv) it has ∣fn(0)∣=1\lvert f_n(0)\rvert=1, attains the bound, and has EfnE_{f_n} connected (its critical points have critical values ±1\pm1, so they lie in EfnE_{f_n}; this step is not written out in the paper), so the bound is sharp, as the abstract states.

Form for the whole set (abstract and p. 192). The paper observes that the hypotheses and the conclusion are invariant under f(z)↦f(z+c)f(z)\mapsto f(z+c), c∈Cc\in\mathbb C, and states that the conjecture follows. The abstract states the result in this form: if f(z)=zn+⋯f(z)=z^n+\cdots and E={z:∣f(z)∣≤1}E=\{z:\lvert f(z)\rvert\le1\} is connected, then max⁡{∣f′(z)∣:z∈E}≤2(1/n)−1n2\max\{\lvert f'(z)\rvert:z\in E\}\le2^{(1/n)-1}n^2, and this estimate is the best possible. (The maximum of ∣f′∣\lvert f'\rvert over the compact set EE is attained on its boundary, where ∣f∣=1\lvert f\rvert=1, so a translation moves that point to 00; this step is not written out in the paper.)

Since 2(1/n)−1n2=12n2+12(21/n−1)n22^{(1/n)-1}n^2=\tfrac12n^2+\tfrac12(2^{1/n}-1)n^2, the bound is (12+o(1))n2(\tfrac12+o(1))n^2 as n→∞n\to\infty, and it exceeds 12n2\tfrac12n^2 for every n≥1n\ge1 (an observation of this page).

Source. A. Eremenko and L. Lempert, An extremal problem for polynomials, Proc. Amer. Math. Soc. 122 (1994), no. 1, 191--193: the setting and the properties of fnf_n on p. 191, their characterization on pp. 191--192, Theorem 1 on p. 192 and its proof on pp. 192--193, in the journal version identified on the source card.

Read depth. Claims checked: the abstract, the setting, properties (i)--(iv) and Theorem 1 were read clause by clause on the page images. The characterization of fnf_n and the proof of Theorem 1 were read on the page images but not checked step by step. Nothing here is independently reviewed.

Proof pointer

Pp. 191--193. Characterization of fnf_n (pp. 191--192): for ff with (1), (i), (iii) and (iv), all zeros of ff and f′f' are real and simple, a real affine change of variable g(z)=f(az+b)g(z)=f(az+b) puts the zeros in (−1,1)(-1,1) with g(1)=1g(1)=1 and g(−1)=(−1)ng(-1)=(-1)^n, and the rational function g′2/(1−g2)g'^2/(1-g^2) is then identified as n2/(1−z2)n^2/(1-z^2), whose solution with g(1)=1g(1)=1 is TnT_n. Theorem 1 (pp. 192--193): an extremal polynomial exists. Writing it as λ∏(1−z/zk)\lambda\prod(1-z/z_k) with ∣λ∣=1\lvert\lambda\rvert=1 and ∏∣zk∣=1\prod\lvert z_k\rvert=1, the paper replaces it by f∗(z)=∏(1+z/∣zk∣)f^*(z)=\prod(1+z/\lvert z_k\rvert), which satisfies (1) and f∗(0)=1f^*(0)=1, has Ef∗E_{f^*} connected (its zeros lie on a segment inside Ef∗E_{f^*}, then the minimum principle) and has (f∗)′(0)≥∣f′(0)∣(f^*)'(0)\ge\lvert f'(0)\rvert, with equality only when all zkz_k have one argument. So f∗f^* is extremal and f(z)=c−nf∗(cz)f(z)=c^{-n}f^*(cz). If fewer than n−1n-1 critical points of f∗f^* have critical value ±1\pm1, a perturbation f∗+εzpf^*+\varepsilon zp with a suitable real polynomial pp keeps the hypotheses and increases the derivative at 00, contradicting extremality; so f∗f^* has properties (1), (i), (iii) and (iv), and f∗=fnf^*=f_n.

Dependencies

None beyond classical facts: the Chebyshev polynomials, Rolle's theorem and the minimum principle. The paper cites Hayman's Research problems in function theory (1967), Problem 4.8, for the question, Pommerenke (Michigan Math. J. 6 (1959), 373--375) for the earlier bound en2/2en^2/2, and Erdős's survey Some of my favorite unsolved problems (1990).

Bears on

  • Problem 115: the problem's corrected Statement asks whether a monic polynomial pp of degree nn with {∣p∣≤1}\{\lvert p\rvert\le1\} connected has ∣p′∣≤(12+o(1))n2\lvert p'\rvert\le(\tfrac12+o(1))n^2 there. The form for the whole set gives the bound 2(1/n)−1n22^{(1/n)-1}n^2, which is (12+o(1))n2(\tfrac12+o(1))n^2, so it answers that question yes; the normalization (1) is the corrected Statement's monic hypothesis. The polynomial fnf_n shows that the exact bound 12n2\tfrac12n^2 fails for every nn.