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 as , so is a monic polynomial of degree , and . With the Chebyshev polynomial, , the paper sets
and lists four properties of : (i) ; (ii) ; (iii) is real and all its zeros are negative; (iv) the critical values of are . The paper states (pp. 191--192) that (1), (i), (iii) and (iv) characterize uniquely.
Theorem 1 (p. 192). Let be a polynomial satisfying (1) with and connected. Then
and equality can occur only for with . The print gives the bound as "" [sic]; by (i) and (ii) the middle term is . The polynomial satisfies (1), one of its characterizing properties, and by (i), (ii) and (iv) it has , attains the bound, and has connected (its critical points have critical values , so they lie in ; 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 , , and states that the conjecture follows. The abstract states the result in this form: if and is connected, then , and this estimate is the best possible. (The maximum of over the compact set is attained on its boundary, where , so a translation moves that point to ; this step is not written out in the paper.)
Since , the bound is as , and it exceeds for every (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 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 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 (pp. 191--192): for with (1), (i), (iii) and (iv), all zeros of and are real and simple, a real affine change of variable puts the zeros in with and , and the rational function is then identified as , whose solution with is . Theorem 1 (pp. 192--193): an extremal polynomial exists. Writing it as with and , the paper replaces it by , which satisfies (1) and , has connected (its zeros lie on a segment inside , then the minimum principle) and has , with equality only when all have one argument. So is extremal and . If fewer than critical points of have critical value , a perturbation with a suitable real polynomial keeps the hypotheses and increases the derivative at , contradicting extremality; so has properties (1), (i), (iii) and (iv), and .
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 , 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 of degree with connected has there. The form for the whole set gives the bound , which is , so it answers that question yes; the normalization (1) is the corrected Statement's monic hypothesis. The polynomial shows that the exact bound fails for every .