qedbot

Erdős·erdos:488

Erdős Problem 488

conjecture formal record: open source: falsifiable F2 declared

No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.

Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

number theory·Source

AI activity

How grades work
Aristotle

27 Nov 2025

New solution to variant problem (Lean)

partial A2 V2
Reasoning and sources

Autonomy

AI building on literature supplied to it

Details

literature: 🟡 Cambie (2025)

Aristotle, GPT-5.4

20 Mar 2026·with Przemek Chojecki

Partial result

partial A1 V1
Reasoning and sources

Autonomy

AI collaborating with humans

Claimed on erdosproblems.com

3

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.

Lucas Ewing

a partial proof claimed·28 Aug 2026·using GPT 5.6

Proof

candidateA? V0

F2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

declares divergences from its source reviewed by an agent

Declared by the projects

2

As each project's formalization.yaml states it.

Formal Resolution of Erdős Problem #488Alicienn/erdos-488-lean · joined by anchor · no independent check

Read formalization.yaml

authors
Alicienn
method
agent — Gemini 4 Carbon (Medium)
review
agent-reviewed (Alicienn)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
sources
Continual Graph Memory and Community Infrastructure for AI-Assisted Mathematical Discovery — adapts, authors not-contacted; Some unsolved problems — background, authors n/a
divergences
none known
checked by
nobody independent of its authors yet
Erdős Problem 488 has a negative answer: a finite counterexample to the doubling bound for the density of a set of multiplescarlostoledo1891/erdos-488-lean · joined by names · no independent check

Read formalization.yaml

authors
Declan Gessel
method
agent — GPT-6 Astra, claude-fable-5-2
review
agent-reviewed (Carlos Toledo, with Claude agents (independent certification of the original proof, doi:10.5281/zenodo.24025464), Deicyde (replay of the original proof at Lean and Mathlib v4.33.1; approving review on formal-conjectures PR #5297, 18 September 2026), Jig's verifier (the counterexample without the adapter; jig.so problem 398, statement 40))
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, checked with Comparator, with an alignment table
sources
A finite counterexample to Erdős Problem 488: the integers in (T, 256T] with all prime factors below 257 (Lean proof by Declan Gessel, with GPT-6 Astra, 5 September 2026) — other, authors participated; Erdős Problem #488 — background, authors n/a; Erdős Problem 488 in google-deepmind/formal-conjectures (Erdos488.erdos_488) — other, authors other; How much can the density of a set of multiples grow? The sharp order in a problem of Erdős — background, authors not-contacted
divergences
The statement is formal-conjectures' reading of the problem, kept as it is: A is a Finset of natural numbers, nonempty, with 0 ∉ A and 1 ∉ A (a comment in formal-conjectures' file points to its PR #256 for these two; when 1 ∈ A both densities are 1); "n ≥ max(A)" is Finset.max A ≤ n, with Finset.max valued in WithBot ℕ; "m > n" is strict; B is the set {n ≥ 1 | ∃ a ∈ A, a ∣ n}; the densities are the rational numbers card / m and 2 * card / n. The problem's question is answered no, so the theorem is that statement with `¬` in front, as formal-conjectures prescribes for a question answered no; formal-conjectures itself still tags the entry as open. The text was compiled here against Mathlib at v4.35.0, not against formal-conjectures' own Mathlib (v4.33.1): the fully elaborated statement prints identically at both (CHECKS.md), but the definitions beneath it were not compared constant by constant. No other divergence is known.
checked by
nobody independent of its authors yet

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.

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

Cite this record

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

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