Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. A. W. Goodman, On the convexity of the level curves of a polynomial, Proc. Amer. Math. Soc. 17 (1966), no. 2, 358--361, DOI 10.1090/S0002-9939-1966-0188408-3, identified on the source card: the setting on p. 358, the construction in section 3 (pp. 359--361) and the unnumbered Theorem on p. 361.
Read depth. Claims checked: the setting and the Theorem were read clause by clause on the page images. In the construction, the value and the algebra turning the conditions on , and into (7), (8) and (9) were recomputed here, as was the check that , satisfy all three; the topological steps (where the roots lie, the count of components, and the nonconvexity of the component of the smaller positive root, which the paper argues only by pointing to section 2) were read but not checked. Nothing here is independently reviewed.
Statement
Setting (p. 358). For distinct points and positive integers , equation (1) is . is the open set of with , and , its boundary, is the lemniscate . Grunsky's question (problem 16 of Erdős, Herzog and Piranian, as the paper reports it): if has components, is each of them convex?
Theorem (p. 361, quoted). "Let and let (10) . Then the polynomial has four distinct roots and one of the components of is not convex."
Here with . The paper adds that dividing and by gives the monic form of (1); is unchanged. is the case , of the family (6) below, for which the section's argument gives four components of , one about each root, so the Theorem answers Grunsky's question no with all roots simple ( equal to the degree, ).
The family behind it (pp. 359--360). For and the paper takes (5), so (6), and sets , a critical value, with . It states three conditions:
- (7) , equivalent to : then has four distinct roots, a conjugate pair with negative real part and two real roots .
- (8) : assuming it, has four components with . The paper derives it from , written as , whose rearranged form would carry ; the printed (8) is strict.
- (9) , equivalent to : then is not convex.
Proof pointer
Pp. 359--361. The construction splits the double root of the first counterexample (example_p359) into two simple real roots by prescribing the critical points and rather than the roots. has no negative real roots, since every term of (6) is positive at a negative real ; with the Gauss--Lucas theorem this places a conjugate pair of roots in the left half plane, and together with places one real root on each side of . Taking at the critical value , the components of and are separate, and by the symmetry of in the real axis the rest splits into two components exactly when . For the paper says only that, following the pattern of section 2, it is not convex if ; there the double points at the critical points lay on the boundary of the nonconvex component and their midpoint lay outside it, and here is the midpoint of the critical points . The choice , satisfies (7)--(9): , , and ; then .
Dependencies
The Gauss--Lucas theorem; otherwise elementary. The construction follows the pattern of the first counterexample (p. 359).
Bears on
- Problem 1047: the Theorem answers Grunsky's question no for the open set with a quartic whose four roots are simple. The problem asks about the closed set . At the paper's level the critical points of lie on the lemniscate, and the paper counts components of the open set only; it does not treat the closed set at that level or at a lower one, so the Theorem does not by itself answer the problem as posed.