Erdős·erdos:338
Erdős Problem 338
Machine-checked by Palomar.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
number theory, additive basis·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Claimed on erdosproblems.com
1Proof 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.
Checks
1-
verified·Palomar
Registered by Palomar at a699263d: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
1As each project's formalization.yaml states it.
Erdős Problem 338: restricted order of robust sets of positive lower density
- authors
- Daniel Veljjanoski
- method
- agent — Claude Opus 5.5 (Anthropic)
- review
- agent-reviewed (Claude Opus 5.5 (Anthropic), a separate agent with a fresh context)
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Erdős problem #338: partial results on restricted order — formalizes, authors participated; Answer to a question by Burr and Erdős on restricted addition, and related results — adapts, authors not-contacted; Erdős Problem 338 — background, authors n/a
- related
- google-deepmind/formal-conjectures/blob/d995ef5d306637c0a2e489c7e579647168d7df2f/FormalConjectures/ErdosProblems/338.lean — builds-on; google-deepmind/formal-conjectures/blob/d995ef5d306637c0a2e489c7e579647168d7df2f/FormalConjecturesForMathlib/Data/Set/Density.lean — builds-on; YaelDillies/misc-yd/tree/f2f1d413b681dfd7a0f0e8481aee3ab7e0bae7ba/MiscYD/AddCombi/Kneser — builds-on
- divergences
- The statement is not in formal-conjectures. It uses the formal-conjectures definitions verbatim: positive lower density is 0 < A.lowerDensity, as in erdos_338.variants.kelly_lowerDensity, and robustness is the hypothesis of erdos_338.variants.basis_after_finite_removal. Compared with Theorem 1 of the source, the bound on the restricted order is not part of the statement, and the residue condition of the source is not a hypothesis (the source derives it from robustness; the Lean proof uses robustness directly).
- checked by
- Palomar
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 · 1
Also known as · 3
- https://www.erdosproblems.com/338
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/338.lean
- FormalConjectures/ErdosProblems/338.lean
Cite this record
qed.bot, “Erdős Problem 338”, https://qed.bot/s/erdos-338, as of 20 Nov 2026.