Erdős Problem #787
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
Choose numbers from an arbitrary finite set so that no sum of two different chosen numbers lies in the original ambient set. The forbidden destination is the ambient set, not merely the chosen subset.
Define g(n) as the minimum across n-element A subset R of the largest |B|, B subset A, such that b1+b2 is not in A whenever b1,b2 in B are DISTINCT. The forbidden sum is in the ORIGINAL A, not merely B; diagonal pairs b+b are not forbidden unless separately stated.
A small example
For A={1,2,3,4}, B={2,3,4} works: the distinct-pair sums are 5,6,7, none in A. But B={1,2} fails because 1+2=3 lies in A.
Finite example A={1,2,3,4}, B={1,2}: 1+2=3 in A, hence invalid. B={3,4} works, because 3+4=7 not in A. If B={2,3}, 2+3=5 not in A, also works. This is stronger than ordinary sum-free B; B={1,2} would be sum-free internally but fails here.
What is known
Maintained https://www.erdosproblems.com/787 OPEN. Attributes lower (log n)^{1+c} to Sanders [Sa21], upper exp(sqrt(log n)) to Ruzsa [Ru05], and Beker [Be25] lower (log n)^{1+1/68+o(1)}; these are separately sourced catalogue summaries, not individually proven here. Check whether later Beker result improves Sanders quantitatively for source's actual c. Original Sanders/Ruzsa/Beker primary proofs pending.
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: ambient a schur sum avoidance open. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Successor: exact maximum independent set of graph on A connecting distinct a,b with a+b in A; enumerate small sets and compare greedy bound, preserve ambient-vs-internal sum test, locate original Sanders/Beker theorem and constants.
Adversarial editorial checking must verify the original theorem hypotheses and examples and later inspect actual HTML/MathJax output. These prerequisites are not discharged by the existence of the draft.
Sources and claim boundaries
- Maintained Erdős Problem #787 and authenticated source-return record.
- Pinned teorth/erdosproblems source commit
536408716724a2402bdfa7c1d764bf83d64a8c89atdata/problems.yaml. Primary historical references are identified by their bibliography keys in the original return; any not directly inspected are explicitly unverified. - Source review: PARTIAL. Independent mathematical critical review: PENDING. Protected merge: NONE. Public browser MathJax: NOT VERIFIED. GCL theorem 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: #2058 — 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.