Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For let . For every and every there is a compact set of Lebesgue measure greater than such that for every and every some has ; that is, contains no set with , for either sign of . This is Theorem 1.1 of The geometric case of the Erdős similarity conjecture, a manuscript of the OpenAI mathematics release dated 5 October 2026, whose author line is "OpenAI" and whose release README says the manuscripts were produced by an internal OpenAI model and that the collection includes results at different stages of verification; the claimant is the organization. The statement is compiled on the result page theorem_1_1 and the digest on the card openai_2026_geometric_case_erdos_similarity_conjecture. The set depends on as well as on , and the manuscript says that the theorem makes no simultaneous assertion for different ratios. The proof reduces the theorem to Proposition 2.1, a periodic hitting statement: for a fixed and every an open -periodic set of density at most meets for every real and every . The proposition is proved by a random routing construction on nested dyadic grids whose resolution at index is comparable to , a finite ordered tree carrying index windows, independent local tests at a stable center, a finite set of scale representatives, and an open-neighborhood repair of the exceptional centers; the hypothesis enters through the grid separation and the decay . At the theorem is the dyadic case, which the release also states and formalizes separately on its own claim page; this manuscript does not cite that one. Since Problem 120 asks for an avoiding set for every infinite , the theorem is the case of a geometric progression with a fixed ratio and no more.
Covers. The question, answered yes for each set with a fixed ratio , one ratio at a time: for every a compact of Lebesgue measure greater than , so positive, that contains no set for any real and any nonzero of either sign. The theorem says nothing about an infinite set that is not a geometric progression, including exponentially decaying sequences that are not geometric progressions (the survey's example is the case claimed here) and the Cantor sets the surveys name as open, and nothing about the general question. Sets containing a nonzero affine copy of some follow by a one-line argument that is not in the manuscript.
Standing. The manuscript has no refereed publication and no arXiv version, and no reviewer independent of the claimant has endorsed it; the formalization described below covers the ratio only. The site's commentary names the dyadic sequence as an open case of the conjecture and its proof-claims tab carried no claim for this problem. The claim therefore stays claimed. Read depth: the theorem statement, clause by clause, on the result page; no proof step was checked.
Formalization. Only the instance is formally verified, while this
page claims every . The release's Lean catalog lists no formalization
of this manuscript, and its family page describes a formalization of the dyadic
manuscript only, so no formalization link is carried here. That formalization's
declaration OAI.Problem310.dyadic_affine_avoidance, built by this corpus's
verification at the pinned revision with the toolchain
leanprover/lean4:v4.34.1, with axioms exactly propext, Classical.choice
and Quot.sound and a fingerprint identical to its comparator challenge, is
accepted on
the dyadic claim page. It
fixes the ratio through dyadicPoint n = (2:ℝ)⁻¹ ^ n and has no ratio
parameter: for every it gives a compact of
Lebesgue measure greater than containing no copy
with , which is this page's Claim at clause by clause, and it
says nothing about any other ratio. It is therefore not formal evidence for this
page's claim, and no formalized evidence is listed.
Depends on. Nothing beyond the cited manuscript.