Skip to content

Erdős Problem #707

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: additive combinatorics, sidon sets.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

The maintained Erdős #707 asks whether every finite Sidon set embeds into a perfect difference set modulo p²+p+1 for some PRIME p. Sidon means all unordered two-term sums (including repetitions) are different. The answer is DISPROVED. Historical Hall 1947 and Alexeev–Mixon 2025 supply five-point examples, and an externally published Lean formalization has been reported, but GCL has not audited its proof dependencies.

A small example

An elementary positive control is {1,2,4} modulo 7. Its six ordered differences between distinct members are 1,2,3,4,5,6 modulo 7 in some order, exactly once each, so this small Sidon set already forms a perfect difference set. The negative example {1,2,4,8,13} is a Sidon set with all 15 unordered sums distinct; Alexeev–Mixon prove that it cannot be extended to any cyclic perfect difference set.

What is known

Primary author abstract: Boris Alexeev and Dustin G. Mixon, 'Forbidden Sidon subsets of perfect difference sets, featuring a human-assisted proof', arXiv:2510.19804 (2025). They also describe earlier Hall 1947 nonextension of {1,3,9,10,13}. Directly checked GCL-pinned Formal Conjectures 707.lean at commit 85f863718beeec7b58a3a1926ee92e3472bc2020. Its parent theorem concerns ANY positive modulus, a stronger claim than the particular p²+p+1 modulus, with separate prime and prime-power variants. Main negative theorem and variants have by sorry placeholders in the GCL-pinned snapshot. An external Lean project is linked, but its proof and axioms were not independently replayed. The exact relationship among allowed moduli must remain explicit.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: sidon counterexample hall alexeev mixon; pinned fc arbitrary modulus stronger; external lean not replayed. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Check original Hall 1947 Theorem 4.3 and Alexeev–Mixon's complete proof. Verify all 15 Sidon sums for {1,2,4,8,13}, and the six nonzero modular differences for {1,2,4}. Compare arbitrary-modulus, prime-power and prime formulations in the external formal proof, including exact hashes and axioms. Stop at this bounded evidence interface.

Sources and claim boundaries

Maintained Problem #707; Alexeev–Mixon primary paper; GCL source report; pinned https://github.com/google-deepmind/formal-conjectures/blob/85f863718beeec7b58a3a1926ee92e3472bc2020/FormalConjectures/ErdosProblems/707.lean . Full original primary proofs, protected production, deployed browser math and V2 admission outstanding.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1978 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction