certified
For every subset A of the natural numbers, the count E_A(N) of integers without exactly one unordered two-term representation exceeds sqrt(N)/12000 for N at least 2 * 10^24. This stronger bound implies part (i). The PDF discusses both parts; this Lean proof establishes part (i).
Submitted by JenW1N
The PDF is a working mathematical exposition. Lean verification applies to the formal source, not the prose.
Certified 16 Sept 2026, published by conjectures.io.
Review decision
Approved in reviewREVIEW_APPROVED
Approved under policy v3: REVIEW_APPROVED, for the full submission-time locked bounty. The submission proves Erdős 14(i): for every subset A of the natural numbers and every epsilon > 0, the exception count for unique two-term representations is bounded below by a positive multiple of N^(1/2-epsilon) for all sufficiently large N. The proof establishes the stronger uniform bound E_A(N) > sqrt(N)/12000 for every A and N >= 2*10^24. The reviewed definition counts unordered pairs, allows equal summands, and counts exceptions in 1 through N. The [proof-claim tab](https://www.erdosproblems.com/forum/thread/14/proof-claims) contained no claims when reviewed on 15 September 2026. The [ordinary discussion](https://www.erdosproblems.com/forum/thread/14) gives finite computations and conditional structural reductions, with the necessary lower bounds unproved. The [LeanGenius page](https://leangenius.org/proof/erdos-14-unique-sums) does not prove the required bound. Results on unique-representation bases over the integers address a different domain. No qualifying earlier complete proof or exact external formalization was established. Part (ii) is a separate stable reward target despite the shared proof core. The committed proof and task passed production verification. Review checked their digests, the matching report, statement fidelity, permitted axioms, and earlier reward claims. No material formalization defect or published disqualification reason was established. This eligibility decision does not guarantee originality. The review used the recorded Lean verification; no fresh Lean or independent-kernel replay was performed. The submission was accepted on 2026-09-14 15:29:59.393718+00:00. The [Erdős Problem a Day report](https://www.erdosproblemaday.com/report/14), dated 26 July 2026, explicitly leaves both asymptotic questions unresolved. Earlier Erdős–Freud finite estimates do not settle these two asymptotic targets. The bounded prior-source review found no qualifying earlier solution or external formalization. Two independent Codex agent assessments each recommended REVIEW_APPROVED: one examined the exact formal statements, proof architecture and verification commitments; the other examined prior solutions, chronology, correspondence and duplicate eligibility. No material disagreement was found. They used separate contexts in the same model family; no distinct-model consensus is claimed. The shared argument addresses two separately published stable reward targets, so it does not itself establish a same-target duplicate. The miner may submit contrary evidence or request reconsideration from the review team, citing this submission ID.
Approved · decided 15 Sept 2026
Formal statement
True ↔ ∀ (A : Set ℕ), ∀ ε > 0, Erdos14.almostSquareRoot ε =O[Filter.atTop] Erdos14.nonUniqueSumCount AVerification report
Every box below had to hold before the proof counted. They are grouped in the order the verifier reaches them.
Manifest valid — Passed
The task bundle held together: the exact file set, a strict manifest, and every trusted hash matching the bytes on disk.
Task commitment matches — Passed
The bundle digest the submission committed to is the digest of the bundle that was actually verified.
Production task — Passed
The task came from the production pool rather than a test fixture.
Trusted file hashes match — Passed
The pinned dependencies agree across the manifest, the lockfile and the checkout, down to the same Formal Conjectures commit.
Submission policy respected — Passed
The submitted source passed the static scan: no imports, no axiom declarations, no sorry, no native_decide, no unsafe options.
Production sandbox — Passed
The run happened under real isolation, Landrun with seccomp, and the sandbox passed its own live self-test before the proof was touched.
Challenge built — Passed
The trusted Challenge.lean, which contains no miner code, compiled on its own.
Source type hash matches — Passed
The source theorem in the compiled environment still hashes to the type recorded in the task, so the statement has not drifted upstream.
Solution built — Passed
The submitted Solution.lean compiled.
Statement unchanged — Passed
The theorem the proof establishes has exactly the same canonical type as the task's target - it was not weakened or restated.
Only permitted axioms — Passed
The transitive axiom closure of the proof stays inside the axioms this task permits.
Lean kernel accepted — Passed
The Lean kernel replayed the proof and accepted it.
Nanoda accepted — Not run
A second kernel, written independently of Lean's, also accepted the proof.
One kernel, not two
This task does not require a second, independent kernel, so Nanoda was not run. The verdict rests on a single kernel implementation.
Theorems established
Stage COMPLETED · Axioms permitted: propext, Quot.sound, Classical.choice