Erdős Problem #785
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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
An exact additive complement pair covers every sufficiently large integer while its two counting functions multiply to approximately x. The question asks for a strictly stronger divergence of the counting surplus.
Let infinite A,B subsets positive integers satisfy A+B contains all sufficiently large integers and counting functions A(x)B(x)~x. Ask whether A(x)B(x)-x tends to positive infinity. Both coverage and asymptotic exactness are premises; do not infer the conclusion from either alone.
A small example
For a finite pair of sets A={1,2,3,4,5} and B={1,3,5}, every integer 2 through 10 is in A+B. This checks elementary coverage but does not imply the infinite asymptotic result.
Finite combinatorial mechanism: for any integer t covered by sums a+b with a,b positive, counting pairs with both a,b <=t yields A(t)B(t) possible ordered representations, while t in [T,x] contributes at least one. This simple bound only proves A(x)B(x)>=x-O(1); it does NOT prove divergence of surplus and must not be presented as the Sárközy–Szemerédi argument. Check toy A={1,...,5},B={1,3,5} and count coverage and pair counts, avoiding asymptotic conclusions.
What is known
Maintained https://www.erdosproblems.com/785 labels PROVED (LEAN) and attributes affirmative answer to Sárközy–Szemerédi [SaSz94], a stronger impossibility A(x)B(x)-x=o(A(x)), and later improvements to Chen–Fang [ChFa15]. The external Lean badge is not a GCL kernel replay. Full original 1994 proof, exact Chen–Fang text, and external Lean task/axiom environment remain unread in this audit.
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: exact additive complements proved external lean unreplayed. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Successor: primary-source lock [SaSz94] hypotheses, [ChFa15] bound and external Lean proof, then isolate exact combinatorial excess-counting lemma. Editorially publish only attributed established theorem, not new formal certification.
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 #785 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: #2056 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.