Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Pommerenke 1961 metric properties complex polynomials
example_p103: A lemniscate set whose projection onto every line has measure greater than 2.386, obtained from the "5-Stern" through the approximation theorem, with Theorem 7's complementary bound that some projection of a capacity-1 set has measure less than 3.30; the negative answer to Problem 1043.
example_p98: For 1 < r < 2 the set where |z^n - r^n| is at most 1 has n components whose common diameter tends to 0 as n grows, so no component has diameter at least 2 - r; the negative half of the answer to Problem 1048.
theorem_1: For every l below 4 and every k there is a monic polynomial whose sublevel set has at least k components of diameter at least l; the negative answer to Problem 511 and to Problems 8 and 9 of the 1958 paper.
theorem_10: With the centroid of the zeros at 0, E is connected when the zeros lie in the disk of radius 1/sqrt 2 or in [-1, 1], and a connected E lies in the disk of radius 2 about the centroid, with the zeros inside it and sigma below sqrt 2; the connected case of Problem 509.
theorem_14: The polynomial z^p (z - a), for large p and a slightly above (1 + 1/p) p^{1/(p+1)}, has a sublevel set with two components one of which is not convex; the negative answer to Grunsky's question, Problem 1047.
theorem_16: The maximum of the ordered product of the distances among n points of diameter at most 2 is at most 2^{4(n-1)} n^n, from Theorem 15 on convex continua of capacity 1; the first general upper bound for Problem 1045, with the remark that the hull of a maximal system is nearly a disk.
theorem_3: When the zeros lie in the disk of radius r at most 1, the component of E containing 0 has diameter at least 2, more than 1/r, or more than 2 - r^2 in three ranges of r, in every case at least 2 - r; the affirmative half of the answer to Problem 1048, for the closed set.
theorem_4: When the zeros lie in the closed unit disk, E contains a disk of radius (2e)^{-1} n^{-2}, so its area is at least pi (2e)^{-2} n^{-4}; the polynomial lower bound of Problem 116 and the n^{-2} inradius bound of Problem 1039.
theorem_9: The lemniscate |f(z)| = 1 of a monic polynomial of degree n has length less than 74 n^2, the first polynomial upper bound toward the length question of Problem 114.
Ch. Pommerenke, On metric properties of complex polynomials, Michigan Math. J. 8 (1961), no. 2, 97--115, DOI 10.1307/mmj/1028998561; received November 26, 1960 (footnote, p. 97); the author at the University of Göttingen (p. 115). Cited as [Po61] on the problem pages. The paper's [2] is Erdős, Herzog and Piranian, Metric properties of polynomials (1958), filed as erdos_1958_metric_properties_polynomials; its [9] is the author's 1959 note On some problems by Erdős, Herzog and Piranian, Michigan Math. J. 6 (1959), 221--225, cited as [Po59] on the problem pages and filed as pommerenke_1959_some_problems_erdos_herzog_piranian; its [11] is the author's On the derivative of a polynomial, Michigan Math. J. 6 (1959), 373--375; its [10] and [12] are the author's Math. Ann. papers Über die Kapazität ebener Kontinuen (139 (1959/60), 64--75) and Einige Sätze über die Kapazität ebener Mengen (141 (1960), 143--152), and its [8] is Pólya's 1928 Berlin Akademie note on the projection of a set of capacity 1. The thirteen references are printed on p. 115.
The copy read for this card is the publisher's scan of the printed article as served by Project Euclid: 20 PDF pages, printed pp. 97--115 = PDF pp. 1--19 (printed p. is PDF p. ), PDF p. 20 blank; an image-only scan with no text layer (its metadata names a 2002 conversion by c42pdf and PDFlib), so every passage below was read on the page image. Provenance: the copy was obtained free of charge on 2026-09-22 from the publisher's open-access article page on Project Euclid, from https://projecteuclid.org/journals/michigan-mathematical-journal/volume-8/issue-2/On-metric-properties-of-complex-polynomials/10.1307/mmj/1028998561.full (the article's PDF download endpoint); 1,315,023 bytes. No notice is printed on the scan's first or last page, and the publisher's article page labels the article Open Access and shows no copyright or license line (https://projecteuclid.org/journals/michigan-mathematical-journal/volume-8/issue-2/On-metric-properties-of-complex-polynomials/10.1307/mmj/1028998561.full, read 2026-10-02); the term is unstated.
Read status: claims checked for every numbered statement of the paper, Theorems 1--16 and Lemmas 1--6, and for the unnumbered passages on Problem 7 (p. 98), on the minimum projection (p. 103), on the width and diameter of a continuum (p. 109) and on Problem 13 (p. 112), each read clause by clause on the page images of PDF pp. 1--19 (printed pp. 97--115) on 2026-09-22; the footnote, the section headings and the reference list were read on the same images. The proofs of Theorem 1, of the example, of Lemmas 1--3, of Theorems 4 and 7, of Theorem 14 and of Theorems 15--16 (a paragraph or a page each) were read in full and their steps followed; the proofs of Theorems 3, 5, 6, 9, 10, 11, 12 and 13 and of Lemmas 4--6 were read for structure and not checked. Three filing observations are recorded in the contents below. Nothing here is independently reviewed.
Contents
Throughout, and , the closed set the paper calls the lemniscate domain (p. 97); the open set is written where the paper distinguishes it (p. 102). Several site problems (#116, #511, #1038, #1039, #1048) are posed for the open set; where the transfer from the closed set matters, the result page says so as a filing observation.
- Introduction and § 1, the diameters of the components of (pp. 97--100). The paper "will give (at least partial) answers to some problems raised by Erdös, Herzog and Piranian [2]" and derive "some metric properties of continua of capacity 1" (p. 97). Every has logarithmic capacity 1 ([4]) and, quoted (p. 97), "the following approximation theorem holds [5]: Let be a closed bounded set with . Given any and , there exists a () and a polynomial such that the lemniscate contains in its interior and is contained in an -neighborhood of ." Problem 8 of [2] asks whether over the component diameters is bounded, and Problem 9 (revised form, [2, p. 148]) whether the number of components of diameter greater than a fixed is bounded. The paper states that both answers are negative, and that they stay negative when Problem 8 is asked with , , in place of , and when Problem 9 is asked with any (p. 98). Theorem 1 (p. 98, quoted): "For each and , one can find a polynomial such that has at least different components of diameter greater than or equal to ." Proof: the union of the segments , ; a segment of length has capacity , so for small , and the approximation theorem gives with inside a -neighborhood of . A filing observation, not a review verdict: the approximation theorem is quoted for and a level , and the proof applies it to a set of capacity below 1 at level 1 without spelling out the rescaling; the step was not reconstructed here. Theorem 2 (p. 98, quoted): "If lies on a line of support of , there exists a point with . The constant is best possible", answering Problem 10b of [2], which asked for such a with ; the paper cites its [9] for the failure of the constant . Proof: an explicit map shows the half-disk of radius has capacity 1, and a lemniscate set inside it would equal it. Problem 7 of [2] (p. 98), quoted: "Let the zeros of belong to the disk . Erdös, Herzog and Piranian [2, Problem 7] raised the question whether there is always a component of with diameter at least (). The answer is negative for ." The example is , : has components and, for in the component of the zero , , so "the (common) diameter of the components of tends to as ." Lemma 1 (pp. 98--99): with and , if the disk lies in (by the arithmetic-geometric mean inequality). Lemma 2 (p. 99): if a continuum contains all the zeros, is connected. Theorem 3 (p. 99, quoted): "Let , , and let be the diameter of the component of that contains . Then for , for , for ." Remarks (p. 99): since , and the centroid lies in ; is sharp for (), and the 1958 polynomial has , so is best possible for ; Remark 3 observes that each of the three bounds , and is at least , so Theorem 3 gives the affirmative answer to Problem 7 of [2] for . Proof (p. 100), four steps: meets unless (the polynomial and the minimum principle); for , is connected and a continuum of capacity 1 has diameter at least 2; for the middle range, the disk of Lemma 1 and a case split on against ; for the last range, the point outside the unit disk and the disk of Lemma 1.
- § 2, the largest disk contained in (pp. 101--102). For zeros in a given compact set , let be the radius of the largest disk contained in (p. 101). The paper recalls that has a positive lower bound when [2, Theorem 6], and that no lower bound independent of the degree exists when is a radius- disk or a length- segment, both of capacity . Erdös, Herzog and Piranian asked whether when [2, Problem 3]; the paper calls Theorem 4 "a weaker estimate" and points also to [2, Problem 2]. Theorem 4 (p. 101, quoted): "If , the lemniscate domain contains a disk of radius ." Proof: by Theorem 3, [6, p. 42], so ; the derivative bound of [11], on ; integrating from a zero to the nearest boundary point gives , so the disk lies in . Lemma 3 (p. 101): for , on the upper unit semicircle, . Theorem 5 (p. 101, quoted): "Let . Then the set contains a segment of length ( denotes the real axis)", introduced with "I want to establish the conjecture of Erdös, Herzog and Piranian [2, p. 132] that , where denotes an absolute constant", and the introduction (p. 97) announces "In Section 2 it will be proved that contains a disk of radius const, if "; the theorem as printed gives a segment of , not a disk. The conjecture printed on [2, p. 132] itself reads for zeros on , which a real segment of length of order in already gives. Proof (pp. 101--102): of degree with zeros on ; Theorem 4's proof gives a disk of radius in centered on ; an arc of the circle "of diameter " with on and ; "has length at least , by Lemma 3", and on . A filing observation, not a review verdict: the proof's last estimate as printed gives , half the constant stated in the theorem; the discrepancy was not resolved here.
- § 3, upper bounds for geometric quantities associated with (pp. 102--105). Pólya [8]: the projection of a compact set of capacity 1 onto a line has linear measure . Theorem 6 (p. 102, quoted): "Let , let be the projection of onto the real axis , and let be the linear measure of . Then , , with exactly if all lie on a parallel to and if has components. (The result concerning was already known to P. Erdös and Bl. Sendov; see the remark after Problem 102, Wisk. Opgaven 20/3 (1957), p. 22.)" Remark: holds exactly when is one segment of capacity , which "can be shown" to happen if and only if , the Chebyshev polynomial. Proof (pp. 102--103): for the polynomial with the real parts of the zeros, Fekete's theorem gives capacity for , and Pólya's . Then (p. 103): since holds for every direction, the largest of the projection measures of is at most . Writing for the smallest projection measure of , the paper applies the approximation theorem to the "5-Stern" of [10, p. 73] and obtains a lemniscate domain with , pointing to [2, Problem 10a], and then turns to an upper bound for . Theorem 7 (p. 103, quoted): "Let be a closed bounded set with . Then the projection of onto a certain straight line has measure less than ." Proof: is enclosed by closed convex curves of total length below [12, Theorem 2]; with the width of in direction and [1, p. 48], some has , and the projection of onto a line perpendicular to the direction has measure at most that sum. Theorem 8 (p. 104): if then , by averaging over the st roots of unity. Then (p. 104): "Problem 12a in [2] asks whether is greatest for . An affirmative answer would imply that ." Theorem 9 (p. 104, quoted): "If and is the length of , then ." Proof (pp. 104--105): is the real part of an algebraic curve of order , assumed by continuity to have only simple singularities and no real double points; at most real inflection points [7] and, by Bézout, at most points with horizontal tangent; fewer than marked points cut into arcs of constant curvature sign, each of capacity at most , whose convex hulls have perimeter below [10, Theorem 5]; so .
- § 4, the connectedness of (pp. 105--110). Lemma 4 (p. 105): for and , for ( is strictly increasing with limit at ). Theorem 10 (pp. 106--107, quoted): "Let and . Then the following best possible results hold: (a) If or if , then is connected. (b) If is connected, then and ." Proof of (a): Lemma 1 puts the disk in , or [2, Theorem 1] puts and in , and Lemma 2 applies; with and with show sharpness. Proof of (b) (p. 107): with , is univalent outside , its inverse is univalent in , so lies in the closed disk [6, p. 42], and each zero, an interior point of , has ; Lemma 4 and the area theorem give . The polynomial , whose is connected, shows the bounds in (b) cannot be improved (pp. 107--108). Lemma 5 (p. 108): is univalent outside the convex hull of the zeros. Theorem 11 (p. 108): if is a closed bounded convex set of capacity with conformal center , the zeros lie in and their centroid is , then is connected and contains . Then (p. 109), for a continuum of capacity 1 with width and diameter , the paper recalls Problem 15 of [2] (bounds for , , ), its own [10, Theorem 6], and completes the proof of the inequality asserted in [9], whose proof "was not correctly formulated, as Prof. Herzog kindly pointed out": the sentence prints the assertion as , and the completed proof derives , "which is the asserted inequality"; "Probably holds (with equality for a segment of length 4)", proved in [10, Theorem 9] when is convex or contains a segment of length . Theorem 12 (p. 109): for a continuum of capacity 1 symmetric about , either (I) , and , or (II) , and ; remarks give a symmetric continuum with and one with [9], and the sharp , for the width measured parallel to a diameter (equality for two perpendicular segments of length ).
- § 5, convexity (pp. 110--115). Erdős, Herzog and Piranian [2, Theorem 11] proved convex when . Theorem 13 (p. 110, quoted): "If one of the conditions (a) , (b) and is satisfied, then is convex." Proof (pp. 110--111) by the area theorem and a convexity criterion for the level curve of the exterior map (Hilfssatz 4b of [13]). Then (pp. 111--112), for with distinct and positive integer exponents , and with the maximal number of components, the paper recalls that "H. Grunsky (see [2, Problem 16]) raised the question whether all components must be convex" and announces a counterexample. Theorem 14 (p. 112, quoted): "Let . If is positive and sufficiently small, and is sufficiently large, then the set has two components, one of which is not convex." Proof: with and , and , so is a double point of whose two branches have tangents , and near the set lies in ; the point has , so for large , while since ; the segment from to leaves , and increasing slightly separates the two components and keeps the component of nonconvex. Then (p. 112) the paper turns to Problem 13 of Erdös, Herzog and Piranian [2], quoted: "Let be complex numbers which satisfy (). Is maximal if the are the vertices of a regular -gon of diameter 2?" It writes for the maximum, display (10) , and notes that the conjecture would give for even and for odd , the latter equal to . Lemma 6 (pp. 112--113): for a convex continuum of capacity 1 there are monic polynomials of every degree with zeros in and (the zeros are the images of the th roots of unity under the exterior map, and a starlike univalent function bounds the product). Theorem 15 (p. 113, quoted): "Let be a convex continuum of capacity 1. Then, for (), ." Proof (pp. 113--114): the product is the squared Vandermonde determinant, whose columns may be replaced by ; Hadamard's determinant theorem gives (the paper attributes this inequality to Szegö, citing footnote 7 on p. 236 of [3]), and Lemma 6 bounds each factor by 16. Theorem 16 (p. 114, quoted): "If is defined by (10), then ." Proof: for the convex hull of a maximal system, Theorem 15 scaled gives (12) , and . Remark (pp. 114--115), "in favor of the conjecture", quoted: "The convex hull of a maximal system [sic] is nearly a disk, for large " (Remark, p. 114), since a subsequence of hulls converging to a non-disk convex set of diameter at most 2 would have , and (12) would give , against .
Compiled scope
The paper is compiled at statement depth for the results the citing problems consume, each with a result page: Theorem 1 (p. 98), the example (p. 98), Theorem 3 (p. 99), Theorem 4 (p. 101), the projection example with Theorem 7 (p. 103), Theorem 9 (p. 104), Theorem 10 (pp. 106--107), Theorem 14 (p. 112) and Theorems 15--16 (pp. 113--114). Theorems 2, 5, 6, 8, 11, 12 and 13 and Lemmas 1--6 are recorded above as statements read on the page images. The short proofs named in the read status were followed; no proof was checked line by line, and nothing here is independently reviewed.
Bears on. #1043: the passage on p. 103, "By applying the approximation theorem to the "5-Stern" [10, p. 73] we obtain a lemniscate domain with (compare [2, Problem 10a])", where is "the minimum of the measures of the projections of ", is the negative answer to the problem's question (a line onto which projects to measure at most 2): for that polynomial every projection has measure above . The construction rests on the approximation theorem and on the 5-Stern of the author's [10, p. 73], not held, and not on the 1959 note [9], which the paper cites only for Problem 10b (Theorem 2, p. 98) and for the width and diameter bounds of p. 109. Theorem 7 (p. 103) bounds the other side, some projection of any capacity-1 set has measure below , and Theorem 6 (p. 102) gives for the projection onto any fixed line. #1045: display (10) on p. 112 is the problem's ordered product under the same diameter constraint, and Theorem 16 (p. 114), "", is a general upper bound, from Theorem 15 (p. 113) for points in a convex continuum of capacity 1; the remark on pp. 114--115 shows that for large the convex hull of any maximizing configuration is close to a disk. The paper does not determine or decide the regular-polygon question; the values it records for the conjecture are for even and for odd , the even value later refuted for every even by Danzer and Pommerenke (1967). #1047: Theorem 14 (p. 112), quoted above, the set of with two components, one of which is not convex, answers Grunsky's question, the problem's, in the negative with distinct roots at for the closed sublevel set the problem uses; the counterexample of high degree with a multiple root that Goodman (1966) attributes to the author, before his quartic with simple roots. #1048: the example on p. 98, with , whose components have common diameter tending to , is the negative answer for ("The answer is negative for "), and Theorem 3 (p. 99) with its Remark 3 is the affirmative answer for for the closed set, which carries over to the open set for and is left undecided by the theorem for ; the problem is posed for the open set and a strict inequality, and the example transfers since the open set's components lie inside the closed set's. #114: Theorem 9 (p. 104), "" for the length of , is an upper bound only; the paper records that an affirmative answer to Problem 12a of [2], the problem's question, "would imply that ", and decides nothing about it. #116: Theorem 4 (p. 101), a disk of radius inside when , gives , the polynomial lower bound the problem asks for (the open disk of that radius lies in the interior of , which is the open set); the paper says nothing about a bound. #509: the paper states no result on covering by disks with radii summing to at most 2. Its connected case is the proof of Theorem 10(b) (p. 107): for a connected with the centroid of the zeros at , " is contained in ", one disk of radius 2 about the centroid; Theorem 2 (p. 98) and Theorem 6 (p. 102) bound related quantities. #511: Theorem 1 (p. 98), at least components of diameter at least for every and every , is the negative answer to the problem's question (boundedly many components of diameter above a fixed , independent of the degree), stated by the paper as the negative answer to Problems 8 and 9 of [2]; the problem is posed for the open set, and the approximation theorem puts the segments in the interior of , which is that open set. The 2025 rediscovery is filed as huang_2025_many_lemniscates_large_diameter. #1038: the paper states no result on the infimum or the supremum of for real zeros in ; Theorem 5 (p. 101) gives a real segment of length in for real zeros in the wider interval , with the printed-constant observation above, and the proof of Theorem 10(a) (p. 107) records that for zeros in with centroid both and lie in by [2, Theorem 1]. #1039: Theorem 4 (p. 101) is the bound on the problem's , introduced (p. 101) as "a weaker estimate" than the of [2, Problem 3], the problem's question, which the paper leaves open.
Results.
- Theorem 1 (p. 98): for each and each , a monic polynomial whose has at least components of diameter at least .
- Example, p. 98: , : components of common diameter tending to ; no component of diameter at least for large .
- Theorem 3 (p. 99): for the component of has diameter , or in three ranges, in every case at least .
- Theorem 4 (p. 101): for , contains a disk of radius .
- Example, p. 103: a lemniscate set with every projection of measure above ; with Theorem 7, some projection of any capacity-1 set has measure below .
- Theorem 9 (p. 104): the length of is less than .
- Theorem 10 (pp. 106--107): with centroid , is connected for zeros in or in ; a connected lies in , with and .
- Theorem 14 (p. 112): with two components, one not convex.
- Theorem 16 (p. 114): , from Theorem 15 (p. 113) for points in a convex continuum of capacity 1.
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.