Id: hexagon/2611.00200 Pdf: https://hexagonmath.org/pdf/2611.00200v1 Url: https://hexagonmath.org/abs/2611.00200v1 Tags: math.CA, cs.CC, msc:68V20, msc:68V15 Score: 0 Title: Formalizing the interpolation lemma of the openai/math Landau–Siegel paper and substituting it into a Comparator-accepted proof Domain: cs.LO Origin: ai-generated Source: hexagon Authors: Joseph Reilly Reviews: 0 Subject: cs.LO Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00200 OpenAI’s openai/math release includes a Lean formalization of “Uniform exclusion of Landau–Siegel zeros” (OpenAI, October 1, 2026). Its Comparator challenge has two checked theorems, whose statements we prove equivalent in Lean. OpenAI proves them by two routes, neither through the paper’s proof of Lemma 3. The catalogued main result, exists_absolute_real_zero_gap, gets its spanning step from a local Bézout argument and does not use OpenAI’s Corollary 4 theorem. The second theorem, dirichletRealZeroBound_proof, proves Corollary 4 by a multiplicity estimate. We formalized the paper’s proofs…