Erdős Problem #792
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics.
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
For every n-element set A of integers, let f(n) be the minimum over A of the maximum size of a subset B with no solution a+b=c in B; repeated summands a=b are INCLUDED unless expressly excluded. Estimate f(n), particularly surplus over n/3.
The key is to preserve the order of the quantifiers and the exact distinction between a finite example and a theorem about arbitrary large inputs. Replacing an extremum over every admissible set by an extremum over one convenient set would change the problem.
A small example
For A={1,2,3}, B={2,3} is sum-free (neither 2+2 nor 2+3 nor 3+3 is in B), size two. B={1,2} is NOT sum-free because 1+1=2. The repeated-summand clause matters.
The calculation illustrates the exact definitions and hypotheses. No single finite example establishes the reported asymptotic assertion.
What is known
Live maintained /latex/792, read 2026-10-14 via CHAD HTTP: Erdős [Er65] n/3; Alon–Kleitman [AlKl90] (n+1)/3; Bourgain [Bo97] (n+2)/3; Bedert [Be25b] n/3+c loglog n; Eberhard–Green–Manners [EGM14] upper n/3+o(n). Source page labels OPEN. Exact theorem/papers not yet opened; this is a bibliographic source audit, not claim of reproduced proofs.
Catalogue status: OPEN. The actual recorded source-audit disposition is BOUNDED_TASK_DESIGNED. These are different registers: a historical theorem report does not count as an independent GCL proof.
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: open second order sum free minimum; repeated summands matter. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Inspect Bedert 2025 arXiv original and Eberhard–Green–Manners 2014, with quantifiers and o(n) bound; enumerate all nontrivial integer A inside a bounded interval, compute exact largest sum-free B and check a=b collisions. Preserve OPEN second-order gap, no new proof.
Historical original papers require precise theorem/section matching where the return documents that they have not been independently inspected. Do not conceal these source-fidelity holds when conducting editorial review.
Sources and claim boundaries
- Maintained Erdős Problem #792 and its LaTeX and bibliography, accessed 14 October 2026.
- Authenticated source return on original GCL issue #2063. Named bibliography and the limits of historical-primary inspection are recorded there.
- Pinned catalogue: teorth/erdosproblems at 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, original source blob 4e60263a80af6207aca494d2e1388e44fa372889.
- Editorial: editorially reviewed. Critical source/theorem review: PENDING. Public mathematical rendering: NOT VERIFIED. Mathematical certification: NONE.
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: #2063 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.