Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Section 6, pp. 8--10, with Lemma 6.1 and Theorem 6.2 on p. 9 and Remark 6.4 on p. 10, and Appendix A, pp. 10--14, of Venkata Siddharth Pendyala, Radial access for polynomial lemniscates: the cubic theorem and a degree-six obstruction, SSRN preprint (2026), doi:10.2139/ssrn.6850818, the edition named on the source card.
Statement
Admissible polynomials, safe radii, , and are as on the Theorem 1.1 page.
The polynomial (pp. 8--9). Let
the product running over with its repetitions, so that
Its leading coefficient is , so
is monic of degree six, and . Its zeros are for : double at and , simple at and , all of modulus ; and . As fractions of a turn, their directions are and for the double zeros and and for the simple ones, the four directions Remark 6.4 names (p. 10). For the paper's (6.1) is
Lemma 6.1 (Three-radius certificate, p. 9). Let . For every ,
and, more quantitatively,
Theorem 6.2 (Strict degree-six radial obstruction, p. 9). There is a monic polynomial of degree six, with all its zeros in the open disk , such that
Consequently . The polynomial is the above: every radius carries a point at distance , or from where , so no radius is safe, , and Proposition 2.2 gives (p. 10).
The certificate
Appendix A (pp. 10--12) states the certificate for Lemma 6.1 as a finite datum and checks it by rational inequalities.
- Intervals. is cut into for , and each gets a radius from Table 1 (p. 11), which the paper calls the certificate; no search or numerical optimization enters the check.
- Table 1, the blocks of with their radius: to , radius ; to , ; to , ; to , ; to , ; to , ; to , ; to , ; to , . The outer radius blocks every direction except four short corridors centered at the zero directions; the middle radius closes the corridors at and of the simple zeros, and the inner radius those at and of the double zeros (Remark 6.4, p. 10).
- Cosine bound. For a phase let and let be the distance from to . If then ; otherwise , with and . Each is rational, and for , the paper's (A.1).
- Inequalities. With multiplicities , let . By (6.1) and (A.1), gives for all , so Lemma 6.1 reduces to the 8192 rational inequalities .
- Margins. Table 2 (p. 12) lists the least in each block. The least of all is at , in block 6, an exact rational with a numerator of 1289 digits and a denominator of 1295 digits; the paper states that the smallest is at least . The other block minima run from about (block 8) to about (blocks 2 and 4). The paper calls its displayed decimals renderings of exact positive rationals.
- Checker. Pages 12--14 print a Wolfram Language program that checks that the blocks cover , computes every in exact rational arithmetic, stops if some , and prints the block minima with SHA-256 hashes of their exact values; floating point enters only the displayed decimals (p. 12). It was not run for this page.
Read depth. Claims checked: the construction, (6.1), Lemma 6.1, Theorem 6.2, Remark 6.4 and the definitions and Tables 1 and 2 of Appendix A were read clause by clause on the page images. Only the certificate's bookkeeping was recomputed here, in exact arithmetic and without the printed checker: the leading coefficient, the zero directions, which match Remark 6.4, and that the blocks of Table 1 cover and give the radius to the intervals containing and and the radius to those containing and . The derivation of (A.1) was read and not checked, none of the 8192 inequalities was checked, and the printed checker was not run. The paper is an unrefereed preprint, and nothing here is independently reviewed.
Proof pointer
Theorem 6.2, pp. 9--10. is monic and admissible by construction. Since , Lemma 6.1 gives for every , so no radius lies in ; then , and Proposition 2.2 gives . Lemma 6.1 (p. 9) follows from the certificate above, since the intervals cover . For (A.1) the paper uses that the cosine is symmetric about half-integers and decreasing on , that , and Taylor's theorem for the cosine with remainder at most (pp. 10--11).
Dependencies
Lemma 6.1 (p. 9) with Appendix A (pp. 10--14), and the harder half of Proposition 2.2 (p. 2), stated on the Theorem 1.1 page: zero detour forces a safe radius.
Bears on
- Problem 1120: in the problem page's worst-case reading , the theorem gives , so in degree six the trivial bound is not attained. It gives no lower bound for , does not say whether is finite, and says nothing about other degrees.