Skip to content

Erdős Problem #757

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, distances, 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

Let A be a finite set of n real numbers with the property that every four-element subset B satisfies |B−B|≥11, counting zero and BOTH signs of differences. Erdős and Sós asked for the best universal c such that A contains a Sidon subset of size at least c n, where a Sidon set has all nonzero ordered differences distinct (equivalently pair sums unique). This optimal constant remains OPEN.

A small example

The four-element set B={0,1,3,5} has positive differences {1,2,3,4,5}, so B−B={0,±1,±2,±3,±4,±5} and |B−B|=11. It is NOT Sidon: 3−1=5−3=2. By contrast {0,1,3,7} has six distinct positive differences and |B−B|=13, and it is Sidon. Thus the local ≥11 condition is strictly weaker than every four points being Sidon.

What is known

The source records Erdős–Sós c≥1/2, Gyárfás–Lehel 1995 1/2+1/(141·76)≤c≤3/5, and Ma–Tang February 2026 improved 9/17≤c≤4/7 (arXiv:2602.23282). These are bounds on the BEST universal c, not a proof of its exact value. The maintained site was edited Apr 10 2026; the authors state they used exploratory ChatGPT assistance but subsequently independently checked their arguments. This claim of author checking must not be rewritten as GCL reproduction of the paper.

GCL's current state

The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.

Critical source-scope distinction: Ma–Tang 2026 constant bounds 9/17 to 4/7, exact best constant OPEN; four-point difference≥11.

What remains

Source-lock Ma–Tang 2026 exact 9/17 and 4/7 bounds, with the Fibonacci-style sharpness constructions and four-point distance constraints. Verify |B−B|=11 for the non-Sidon example and clarify one-dimensional distinct DISTANCES vs signed differences (five distances correspond to 11 signed differences).

Sources and claim boundaries

Maintained #757; GCL source return. Original papers and full formal proof status not independently checked. Primary full theorem proof replay remains outstanding.

Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2028 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • 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