qedbot

Erdős·erdos:348

Erdős Problem 348

problem formal record: solved source: open 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, complete sequences·Source

AI activity

How grades work

No AI contribution recorded against this statement.

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.

Jesse Geneson

a full proof claimed·9 Sep 2026·using GPT-6 Astra, Claude Opus 5·1 comment there

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

1

As each project's formalization.yaml states it.

Erdős Problem 348: deletion thresholds for complete sequences (Geneson's Theorem 1)IamMikeHelsel/erdos-348-lean · joined by names · no independent check

Read formalization.yaml

authors
Mike Helsel
method
agent — claude-opus-5-5
review
agent-reviewed (Lean kernel and lake comparator (mechanical), Claude Code agents (claude-opus-5-5, claude-fable-5-1))
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, checked with Comparator, with an alignment table
sources
Deletion thresholds and exponential examples for complete sequences — formalizes, authors not-contacted; Erdős Problem #348 — background, authors n/a; Formal Conjectures: Erdős Problem 348 statement (FormalConjectures/ErdosProblems/348.lean) — other, authors not-contacted
divergences
None relative to the formal-conjectures statement, which is reproduced verbatim (the Comparator configuration checks that Challenge.lean and Solution.lean state the same theorem). Conventions of the formal statement: sequences are monotone functions ℕ → ℕ, so repeated values are allowed and terms are natural numbers (zeros allowed); deleting the indices in a finite set s replaces the indexed terms by 0 (Function.updateFinset a s 0), so a deletion removes one indexed occurrence (deleting an index whose term is already 0 is allowed and has no effect on sums); "deleting any m terms" quantifies over all index sets of cardinality exactly m; completeness (IsAddCompleteNatSeq') allows finitely many exceptions. Relative to the paper: Geneson states Theorem 1 for non-decreasing integer sequences (terms may be zero or negative), counts repeated values as separate occurrences, deletes occurrences, and uses eventual completeness, as in Erdős and Graham. The formal statement is restricted to natural-number sequences; the existence direction uses the same examples (powers of two; Fibonacci 1, 1, 2, 3, …), and the exclusion of m ≥ 2 is proved for all monotone ℕ-valued sequences, including bounded
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/348
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/348.lean
  • FormalConjectures/ErdosProblems/348.lean

Cite this record

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

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