Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
, , and is "the radius of the largest disk contained in " (p. 101). Quoted (p. 101): "If , there exists a positive number such that [2, Theorem 6]. If is a disk of radius 1 or a segment of length 4 (in both cases, ), there does not exist any positive lower bound for that is independent of the degree of . Erdös, Herzog and Piranian put the question whether if [2, Problem 3]. I shall only prove a weaker estimate (see also [2, Problem 2])."
Theorem 4 (p. 101). "If , the lemniscate domain contains a disk of radius ."
The disk found is centered at a zero and lies in the component of containing . Its open interior lies in the interior of , which is the open set , so that set has area at least ; this consequence is drawn here, not printed.
Source. Ch. Pommerenke, On metric properties of complex polynomials, Michigan Math. J. 8 (1961), no. 2, 97--115; Theorem 4 with its proof and the introductory paragraph on printed p. 101 (PDF p. 5 of the publisher's scan), read on the page image (the scan has no text layer). The copy read is identified in the source digest.
Read depth. Claims checked: the statement and the introductory paragraph were read clause by clause on the page image; the proof (one paragraph) was read in full and its steps followed, with the external inputs named below taken as cited. Nothing here is independently reviewed.
Proof pointer
Page 101. Let be the component of containing . Theorem 3 with gives for its diameter; since is connected, (Golusin [6, p. 42]), so . Since on , the author's derivative bound [11] gives for . Take a zero and the boundary point of nearest to it; integrating along the segment, , so and the disk lies in .
Dependencies
Within the paper: Theorem 3 at (theorem_3). Outside it: the inequality for a continuum (Golusin, Geometrische Funktionentheorie, 1957, p. 42; not held) and the derivative bound on a component where , from the author's On the derivative of a polynomial, Michigan Math. J. 6 (1959), 373--375 (cited as [Po59a] on Problem 115's page; not held).
Bears on
- Problem 116: the area of is at least , the polynomial lower bound the problem asks for; the paper says nothing about the strengthening, later obtained by Krishnapur, Lundberg and Ramachandran 2025, whose card names this theorem as the bound it improves.
- Problem 1039: , the "weaker estimate" the paper proves toward the of [2, Problem 3], which is the problem's question and which the paper leaves open.