Metraipolis › archive › dc_2176f8dcfa6b

The geometric case of the Erdős Similarity Conjecture. A human exposition of the OpenAI proof — arXiv:2611.02454

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02454
License (as archived)
CC0-1.0
Archived
2026-11-03T18:47:30.420Z
SHA-256 of the archived text
6f72d600f08850d6239cf9b9e15ca902c071436755a776224d2c63bb5e73b2da
Stable URL of this page
https://metraipolis.com/documento/dc_2176f8dcfa6b

How to cite

The geometric case of the Erdős Similarity Conjecture. A human exposition of the OpenAI proof — arXiv:2611.02454 — arXiv (en), https://arxiv.org/abs/2611.02454 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2176f8dcfa6b (Metraipolis archive dc_2176f8dcfa6b, sha256 6f72d600f08850d6239cf9b9e15ca902c071436755a776224d2c63bb5e73b2da)
BibTeX
@misc{dc2176f8dcfa6b,
  title = {The geometric case of the Erdős Similarity Conjecture. A human exposition of the OpenAI proof — arXiv:2611.02454},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02454},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2176f8dcfa6b; sha256 6f72d600f08850d6239cf9b9e15ca902c071436755a776224d2c63bb5e73b2da},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02454. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a fixed $q\in(0,1)$, can a set of positive Lebesgue measure avoid every translated and dilated copy of $\{q^n:n\ge1\}$? OpenAI's release of October 6, 2026 shows that it can, with a compact subset of $[0,1]$ whose measure is arbitrarily close to one. We give a detailed exposition of the proof, using only finite probability and basic measure theory. The proof removes a small open set intersecting every copy, obtained from a random construction: fair random choices, attached to the cells of nested grids, route each point down a finite tree, and at the leaf reached a further random choice removes the point with probability $p$. The removed set therefore has expected density $p$, however large the tree, while the branching gives each copy many independent chances to intersect it. Each chance depends on only part of the tree, so its outcome changes at only a controlled number of dilations, and a union bound over finitely many representative dilations then covers every dilation. We also relate the proof to the earlier random-cell arguments going back to Kolountzakis (Bull. London Math. Soc. 29 (1997), 415--424) and to recent work on two-fold sumsets ( arXiv:2607.03584 ) and on Rajchman measures ( arXiv:2609.04456 ), and we show how the method of conditional expectations makes the construction deterministic.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Analysis of PDEs (math.AP).
Pagina del lavoro: https://arxiv.org/abs/2611.02454 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:07.726Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).