Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 3). The minimal partition of the setup recorded on Lemma 4.1, with , , and as in Claim 3.1. For a block the note picks with , which exists since is compact, and argues that when .
Lemma 5.1 (Internal product upper bound, p. 3). Let and let be the roots belonging to , counted with multiplicity. If satisfies , then
Inequality (1) (p. 4). Write and , so . When , Lemma 5.1 gives
and summing, .
Proof pointer
P. 3. Normalize to and and set . Then and the have mean , so the mean of is at most , and the arithmetic-geometric mean inequality bounds by .
Read depth
Claims checked: Lemma 5.1 and inequality (1) were read clause by clause on the page images of the print, and the proofs on pp. 3--4 were followed. Nothing here is independently reviewed.
Source. Boon Qing Hong, Strategy Proposal on Covering Lemniscates for Erdős Problem #509, unpublished note (2026), 11 pp.; the edition read is named on the source card.
Bears on
- Problem 509: a lower bound on the radius of each block of a hypothetical minimal counterexample to Claim 3.1 in terms of the roots outside the block; the note does not turn it into a proof of any case of the problem.