qedbot

Erdős·erdos:1139

Erdős Problem 1139

conjecture formal record: open source: open F3 anchored

Machine-checked by Palomar.

Fidelity F3: The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.

number theory, primes·Source

AI activity

How grades work
GPT-5.2 Pro, GPT-5.5 Pro

19 Jun 2026·with Przemek Chojecki, gavinsherry, Liam Price, Terence Tao

Candidate full solution

candidate A1 V0
Reasoning and sources

Autonomy

AI collaborating with humans

Claimed on erdosproblems.com

1

Proof claims posted on erdosproblems.com, which says that listing a claim “is no guarantee of proof correctness”. The register records who claims what, with which systems, and links to each claim there. Nobody has examined them, and none counts in the register's totals.

Liam Price

a full proof claimed·15 Jul 2026·using GPT Pro

Proof

candidateA? V0

F3 anchored. The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.

Anchored to google-deepmind/formal-conjectures/blob/eb1c5ce1bf406e46a6af5f859f097a5c5350a462/FormalConjectures/ErdosProblems/1139.lean

declares divergences from its source reviewed by an agent source authors not contacted

Checks

1
  • verified·Palomar

    Registered by Palomar at 38ad7ea8: Comparator confirmed 7 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-10-06·commit 38ad7ea8de1e

    PALOMAR-2026-10-06-000001

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős 1139: large gaps between almost-primeslinrock/math-proofs/erdos-1139 · joined by anchor · Palomar

Read formalization.yaml

authors
Linmiao Xu
method
agent
review
agent-reviewed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
7 main results named, checked with Comparator, with an alignment table
sources
A greedy matching proof of Erdős's two-fold residue-class problem — adapts, authors not-contacted; Linear equations in primes — background, authors not-contacted; An inverse theorem for the Gowers U^{s+1}[N]-norm — background, authors not-contacted; Candidate proof of Erdős Problem 1139 (June 2026 manuscript) — independently-proves, authors not-contacted
divergences
None on the formalized statements. All seven unconditional theorems (including uniform_maximal_gap, limsup_strictly_gt_one, and core_classification) are Comparator-verified in Challenge.lean and Solution.lean; the full infinite-limsup conjecture is proved conditionally on the explicit Green–Tao–Ziegler hypothesis HasFixedSignedMixedPublishedVonMangoldtAsymptotics in Solution.lean (erdos_1139_of_gtz) and matched against Statement.lean in AxiomAudit.lean.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 0

No proof artifact cited by the formal record.

Recorded elsewhere

Compare the registries
  • palomar — Erdős 1139: large gaps between almost-primes

    checked·their labels: registered

Also known as · 3
  • https://www.erdosproblems.com/1139
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1139.lean
  • FormalConjectures/ErdosProblems/1139.lean

Cite this record

qed.bot, “Erdős Problem 1139”, https://qed.bot/s/erdos-1139, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.