Erdős Problem #1193
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1193 is DISPROVED AS LITERALLY STATED in the source as of 15 October 2026.
For \(A\subseteq\mathbb N\), let \((1_A*1_A)(n)\) be the number of ordered pairs \((a,b)\in A^2\) with \(a+b=n\). Given any positive nondecreasing \(g(n)\), ask whether the set of \(n\) satisfying \((1_A*1_A)(n)=g(n)\) has lower density zero, and whether its upper density is bounded by some universal \(c<1\). The literal question does not restrict \(A\) to a sparse basis or impose a sublinear growth condition on \(g\), even though Erdős likely intended a restriction.
A small example
The phase23 exact check enumerates all ordered pairs \((a,b)\) of nonnegative integers summing to each \(n=0,\dots,20\), giving precisely \(n+1\) solutions. The proof is elementary for every nonnegative \(n\), since the pairs are \((0,n),(1,n-1),\dots,(n,0)\). This is a rigorous general counterexample to the literal unrestricted statement, not just a finite numerical coincidence.
What is known
The maintained https://www.erdosproblems.com/1193 calls both questions trivially false and notes that Er80,p.100 omitted intended restrictions. If \(\mathbb N\) includes zero, take \(A=\mathbb N_0\), giving \((1_A*1_A)(n)=n+1\) identically. If \(\mathbb N\) is positive, take \(A=\{1,2,\dots\}\) and \(g(n)=n-1\) for every \(n\ge2\) (extend by positive monotone values for finitely many initial indices if required). In both conventions the equality holds for all sufficiently large \(n\), so lower/upper agreement densities are both one.
GCL's current state
Authenticated original issue-bound research source return. The exact bounded example was independently replayed through ci/erdos_compendium_007_phase23_checks.py; general mathematical results here remain explicitly attributed to primary/external proofs, not independently certified by GCL. This manuscript is a local UNACCEPTED editorial draft.
What remains
Source-read Er80,p.100 for any tacit conditions on \(A\) or \(g\) and compare with the current formalized statement; if a sparse-basis or bounded-moment restriction was intended, formulate it as a separate corrected conjecture rather than retroactively changing the false literal question. The counterexample must preserve ordered convolution convention.
Any critical sample approval, theorem source fidelity, public site rollout and protected V2 admission are separate uncompleted steps.
Sources and claim boundaries
https://www.erdosproblems.com/1193 ; [Er80,p.100].
Finite evidence: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE23.json. Frozen original source issue identity retained; independent mathematical source approval PENDING.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2464 — 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.