Erdős Problem #790
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
A strongly sum-free set has no element equal to the sum of any collection of distinct other members. Avoiding ordinary three-term Schur relations alone is not sufficient.
Let l(n) guarantee a subset B of any n-element A subset Z with no equality a1=a2+...+ar where ALL participating terms are DISTINCT members of B. This is the strong subset-sum-free property; ordinary Schur sum-free sets only rule out r=2, not arbitrary r. The original text explicitly requires distinctness.
A small example
The set {1,2,4} satisfies the condition, but {1,2,3} does not because 1+2=3. The set {1,2,4,7} also fails due to 1+2+4=7, a relation missed by a two-term-only test.
Finite example B={1,2,4}: 1+2=3 not in B, so the three-element set meets the strong property. B={1,2,3}: 1+2=3 with three distinct terms violates it. B={1,2,4,7}: 1+2+4=7 violates even though its pairwise sums may miss B. All three are exact fixtures and must not be conflated with sum-free in the two-summand sense.
What is known
Maintained https://www.erdosproblems.com/790 OPEN: attributes (n log n / loglog n)^{1/2} lower and n/log n upper to Choi–Komlós–Szemerédi [CKS75]. In particular l(n)/sqrt n -> infinity already follows from known lower bound; this subquestion is proved, while the n^{1-o(1)} lower speculation and sharper growth remain unresolved. Historical original and CKS75 proof not independently read.
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: all distinct multi term sum free partial. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Next: enumerate all subsets B of finite ambient A and test all distinct-element partitions, prove implication of CKS lower to divergence beyond sqrt n with elementary logs, inspect full 1975 primary paper before claiming 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 #790 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: #2061 — 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.