Wiki
Wiki

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 SS, PS(z)=∏α∈S(z−α)m(α)P_S(z)=\prod_{\alpha\in S}(z-\alpha)^{m(\alpha)} is the monic polynomial of degree nSn_S whose roots are those of ff in SS. The note sets TS=sup⁡z∈KS∣PS(z)∣T_S=\sup_{z\in K_S}\lvert P_S(z)\rvert, MS=TS/r(S)nSM_S=T_S/r(S)^{n_S} and the local sharpness factor ρS=r(S)/(2TS1/nS)\rho_S=r(S)/(2T_S^{1/n_S}).

Proposition 6.1 (Inductive local bound for proper blocks, p. 4). Assume Claim 3.1 holds for monic polynomials of degree strictly smaller than N=deg⁡fN=\deg f. Let p∗p_* be a radius-minimizing counterexample of degree NN, and let S∈p∗S\in p_* be a proper block, so nS<Nn_S<N. Then MS≥2−nSM_S\ge2^{-n_S}; equivalently r(S)≤2TS1/nSr(S)\le2T_S^{1/n_S}, or ρS≤1\rho_S\le1.

The result is conditional: its hypothesis is the claim the note sets out to prove, in lower degrees.

Proof pointer

Pp. 4--5. If r(S)>2TS1/nSr(S)>2T_S^{1/n_S}, apply the hypothesis to PSP_S at level TST_S (through the rescaled monic polynomial w↦TS−1PS(TS1/nSw)w\mapsto T_S^{-1}P_S(T_S^{1/n_S}w); the print calls the claim "Claim 2.1" [sic] at this point). The lemniscate {∣PS∣≤TS}\{\lvert P_S\rvert\le T_S\} contains KSK_S, each component of SS lies in one component of {∣PS∣<TS}\{\lvert P_S\rvert<T_S\}, and the resulting partition refines SS into blocks with the same mean centers and total radius at most 2TS1/nS<r(S)2T_S^{1/n_S}<r(S), against the minimality of p∗p_*.

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.