Status
On this page
Status
Topics
Status
On this page
Status
Topics
If is a polynomial of degree such that is connected then is it true that
If is a polynomial of degree such that is connected then is it true that
Source: erdosproblems.com/115
An accepted solution exists. The statement is true.
Proved. The site's label is PROVED (LEAN), a label that describes the corrected Statement; its Lean marker refers to a formal proof by others, linked from the claim page, unbuilt and unaudited in this corpus. The corrected Statement is proved: Eremenko and Lempert [ErLe94] prove the sharp bound , attained by a shifted Chebyshev polynomial, refereed in the Proceedings of the AMS and credited by the site, which the corpus accepts on the claim page Eremenko and Lempert 1994.
The site's wording puts no normalization on . The change writes , so that is monic; nothing else changes. The evidence is Erdős's own statement of the problem. [Er61], Problem IV.1, p. 246 (Some unsolved problems), opens "Let be a polynomial of degree " and asks on p. 247 whether when is connected, his (IV.1.1). Hayman's collection states the question as Problem 4.8, one of five problems on the set , the first of which, Problem 4.7, takes (Research Problems in Function Theory, the 2018 edition, which keeps the 1967 numbering), and Eremenko and Lempert state it from there with as , their (1) on p. 191. The site's own commentary fits only monic polynomials: it says the maximum is at least , with equality only for , and for with the maximum is . The defect is the site's; Erdős's text carries the normalization. The form comes from [Er61], not from the hypotheses of the theorem that settles it. No result about the site's wording is recorded.