Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Quoted (pp. 111--112): "Let ( distinct, positive integers), and let have the maximal number of components. H. Grunsky (see [2, Problem 16]) raised the question whether all components must be convex. I shall give a counter-example."
Theorem 14 (p. 112). "Let . If is positive and sufficiently small, and is sufficiently large, then the set has two components, one of which is not convex."
Here ( with , with ), the level is for the closed sublevel set, and the nonconvex component is the one containing . The degree is large and the root has high multiplicity; a quartic with four simple roots was given later by Goodman (1966), whose paper (p. 358) cites this counterexample and remarks on its high degree and its zero of high multiplicity.
Source. Ch. Pommerenke, On metric properties of complex polynomials, Michigan Math. J. 8 (1961), no. 2, 97--115; the question and Theorem 14 with its proof on printed pp. 111--112 (PDF pp. 15--16 of the publisher's scan), read on the page images (the scan has no text layer). The copy read is identified in the source digest.
Read depth. Claims checked: the question as the paper recalls it and the statement were read clause by clause on the page images; the proof (one paragraph) was read in full and its steps followed, the two limits and being checked mentally and the constant taken as printed. Nothing here is independently reviewed.
Proof pointer
Page 112. The proof first takes the borderline value , , and writes . A direct computation gives , and the logarithmic derivative vanishes at , so : the level curve crosses itself at with branch tangents , and is made of two pieces meeting only at . Close to , therefore stays inside the double sector . As , and at (where ), so for large the point lies in but outside ; the chord from to then leaves , so the piece through fails to be convex. Raising slightly above pulls the two pieces apart, so has two components and the one through is still not convex.
Dependencies
None outside elementary calculus.
Bears on
- Problem 1047: the negative answer to the problem's question, in the problem's own terms: a monic polynomial with distinct roots and a level at which has two components, one of which is not convex. The status "DISPROVED (LEAN)" of the site was not traced to a formal proof here; the closed sublevel set matches the problem's inequality.