Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Notation (p. 125): ff is a monic polynomial (1), EE the set where ∣f∣<1|f|<1, and CC the unit circle; ∣E∩C∣|E\cap C| is one-dimensional measure.

Theorem 5 (p. 134). "For a polynomial (1) with all zνz_\nu on CC, the relation 0<∣E∩C∣<2π0<|E\cap C|<2\pi holds, and the constants 0 and 2π2\pi are the best possible."

Source. P. Erdős, F. Herzog, G. Piranian, Metric properties of polynomials, J. Analyse Math. 6 (1958), 125--148, doi:10.1007/BF02790232; Theorem 5 on p. 134, its proof on pp. 134--135. The copy read is identified on the source card.

Read depth. Claims checked: the statement was read on the page image of p. 134 on 2026-10-08; the proof was read for structure, not checked. Nothing here is independently reviewed.

Proof pointer

Pages 134--135. The strict bounds: ff has a zero on CC, so ∣E∩C∣>0|E\cap C|>0, and ∣E∩C∣=2π|E\cap C|=2\pi would put the maximum of ∣f∣|f| on Dˉ\bar D at the origin. Sharpness at 00: start from zn−1z^n-1 and move to z=1z=1 every zero with ∣arg⁡zν∣<ε|\arg z_\nu|<\varepsilon; an explicit ratio estimate shows the moved factor tends to infinity uniformly on CC off the arc ∣arg⁡z∣<ε|\arg z|<\varepsilon, so lim sup⁡n∣E(fn)∩C∣≤2ε\limsup_n|E(f_n)\cap C|\le2\varepsilon. Sharpness at 2π2\pi: move the zeros with 0<∣arg⁡zν∣<ε0<|\arg z_\nu|<\varepsilon instead to the nearer of e±iεe^{\pm i\varepsilon}, which the paper says works similarly.

Dependencies

None.

Bears on

No problem in the catalog is recorded here as concerning this theorem. It studies the zeros-on-CC class of the Corollary to Theorem 4 through the arc length of E∩CE\cap C rather than the area of EE.