Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Eremenko 1994 extremal problem polynomials
theorem_1: Eremenko and Lempert's sharp bound on the derivative at a point of modulus one of a monic degree n polynomial whose set of modulus at most one is connected, with equality only for rotations of a shifted Chebyshev polynomial.
A. Eremenko and L. Lempert, An extremal problem for polynomials, Proc. Amer. Math. Soc. 122 (1994), no. 1, 191--193. Received 18 November 1992, revised 10 December 1992; dedicated to Paul Erdős on his 80th anniversary; 1991 MSC 30C10, 30A10.
The copy read for this card is a publisher scan of the journal version, the three printed pages (head "PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, Volume 122, Number 1, September 1994"; physical PDF p. is printed p. ) with a text layer whose formulas are garbled, so the statements below were checked on the page images. Provenance: downloaded in September 2026; the download URL was not recorded; 97,226 bytes. The journal version is the only version read. The scan prints "© 1994 American Mathematical Society" on its first page, every other right reserved.
Reading depth is claims checked: the abstract, properties (i)--(iv) of (p. 191) and Theorem 1 (p. 192) were read clause by clause on the page images; the characterization of (pp. 191--192) and the proof of Theorem 1 (pp. 192--193) were read on the page images but not checked step by step, and are not verified here.
Contents
- The question (p. 191): for a polynomial as (the paper's (1), so is monic) with connected, is (the paper's (2))? The paper cites Hayman's problem collection (its [1], Problem 4.8), Pommerenke's bound with in place of (its [2]) and Erdős's survey (its [3]), which observed that the bound in (2) must be relaxed to and proposed Chebyshev polynomials as the extremal case.
- Extremal polynomials (pp. 191--192): with the Chebyshev polynomial; , , is real with all zeros negative, and its critical values are . The paper states that the normalization (1) together with , real negative zeros and critical values (its (1), (i), (iii) and (iv), p. 191) characterizes uniquely; the derivative value (ii) is not among the characterizing properties.
- Theorem 1 (p. 192): let be a polynomial satisfying (1), , and connected. Then (printed as , a misprint, since by (i)). Equality can occur only for , . Since the hypotheses and the conclusion are invariant under , the theorem gives for every monic of degree with connected, and the abstract states that this estimate is the best possible.
- Proof (pp. 192--193): an extremal polynomial exists; replacing its zeros by gives a real polynomial with negative zeros that is again extremal and has connected by the minimum principle; if fewer than critical points of have critical value , the perturbation for a suitable real keeps the set connected and increases the derivative at , contradicting extremality, so .
Compiled scope
The abstract, properties (i)--(iv) of and Theorem 1 were checked on the page images. The characterization of on pp. 191--192 and the proof on pp. 192--193 were read on the page images but not checked step by step. Nothing here is independently reviewed.
Results. Theorem 1 (p. 192), with the extremal polynomials (p. 191) and the form of the bound for the whole set (abstract and p. 192).
Bears on. #115: Theorem 1, through the paper's translation remark, gives for monic of degree with connected, attained by , which answers yes the problem page's corrected Statement, whose monic hypothesis is the paper's normalization (1); the site's wording, which puts no normalization on the polynomial, is not what the theorem addresses. The value also shows that the exact bound fails for every .
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.