Erdős·erdos:36
Erdős Problem 36
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, additive combinatorics·Source
AI activity
How grades workCandidate partial result
Reasoning and sources
Autonomy
AI standalone; human involvement recorded as non-significant
Sources
Slight improvement to past construction
Reasoning and sources
Autonomy
AI building on literature supplied to it
Details
literature: 🟡 Haugland (2016)
Sources
Claimed on erdosproblems.com
2Proof 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.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Declared by the projects
1As each project's formalization.yaml states it.
A certified lower bound for Erdős' minimum-overlap problem
- authors
- Arthur Freitas Ramos, David Barros Hulak, Ruy Jose Guerra Barretto de Queiroz
- method
- agent — Codex coding agent, GPT-6 Astra Pro
- review
- agent-reviewed (Separate internal AI statement-fidelity and mathematical reviewers)
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 11 main results named, checked with Comparator, with an alignment table
- sources
- Boundary capacity and continuous profile duality: pre-formal minimum-overlap research note — formalizes, authors n/a; Minimum-overlap Fourier, periodic, and phase Gram certificate framework — adapts, authors not-contacted; Erdős' minimum overlap problem — background, authors not-contacted; Erdős problem 36 — background, authors not-contacted
- related
- linrock/math-proofs/blob/22db103d7b6109baca46f2623a7287b965a56936/erdos-36/Solution.lean — prior formalization of classical weaker lower bounds and limit statements.; https://google-deepmind.github.io/formal-conjectures/src/FormalConjectures/ErdosProblems/%C2%AB36%C2%BB/ — independent statement-fidelity reference, not a proof dependency.
- divergences
- The continuous model uses Borel measurable representatives on [0,2], a translation of the usual interval of length two. A separately proved finite step embedding gives the literal integer theorem, so no equality of the continuous and discrete optimization problems is assumed. The extension from Borel to arbitrary completed-Lebesgue-measurable representatives is not separately formalized. The asymptotic conclusion is stated as a liminf; the stronger finite representation-count result holds for every positive N, without assuming limit existence.
- checked by
- nobody independent of its authors yet
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Cited proofs · 4
- linrock/math-proofs/blob/22db103d7b6109baca46f2623a7287b965a56936/erdos-36/Solution.lean#L52
- linrock/math-proofs/blob/22db103d7b6109baca46f2623a7287b965a56936/erdos-36/Solution.lean#L56
- linrock/math-proofs/blob/22db103d7b6109baca46f2623a7287b965a56936/erdos-36/Solution.lean#L60
- linrock/math-proofs/blob/22db103d7b6109baca46f2623a7287b965a56936/erdos-36/Solution.lean#L68
Recorded elsewhere
Compare the registries- vibemathed — Lower bound 0.38055470 for Erdős's minimum overlap constant
Also known as · 3
- https://www.erdosproblems.com/36
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/36.lean
- FormalConjectures/ErdosProblems/36.lean
Cite this record
qed.bot, “Erdős Problem 36”, https://qed.bot/s/erdos-36, as of 20 Nov 2026.