Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 3--4). The notation of Lemma 5.1: for a block , is the monic polynomial of degree whose roots are those of in . The note sets , and the local sharpness factor .
Proposition 6.1 (Inductive local bound for proper blocks, p. 4). Assume Claim 3.1 holds for monic polynomials of degree strictly smaller than . Let be a radius-minimizing counterexample of degree , and let be a proper block, so . Then ; equivalently , or .
The result is conditional: its hypothesis is the claim the note sets out to prove, in lower degrees.
Proof pointer
Pp. 4--5. If , apply the hypothesis to at level (through the rescaled monic polynomial ; the print calls the claim "Claim 2.1" [sic] at this point). The lemniscate contains , each component of lies in one component of , and the resulting partition refines into blocks with the same mean centers and total radius at most , against the minimality of .
Read depth
Claims checked: the definitions and Proposition 6.1 were read clause by clause on the page images of the print, and the proof on pp. 4--5 was followed for its structure. Nothing here is independently reviewed.
Dependencies
- Claim 3.1 in lower degree, as a hypothesis.
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 step of an induction on the degree toward Claim 3.1, conditional on that claim in lower degrees; it settles no case of the problem.