Skip to content

Erdős Problem #806

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

For every A subset {1,...,n} of cardinality <=sqrt(n), find B subset of ALL integers such that A subset B+B with B much smaller than sqrt(n). The sumset B+B allows b1=b2 and B is not required to lie in [1,n].

There is a uniform asymptotic construction with B+B covering A and |B| at most a constant multiple of sqrt(n) loglog(n)/log(n). This tends to zero as a proportion of sqrt(n), proving the conjecture. The historical lower example shows that the order of this improvement is essentially tight.

A small example

For A={2,4,6} subset [1,9] with |A|=3<=sqrt(9), B={1,3} has B+B={2,4,6} (1+1,1+3,3+3), so a smaller exact cover exists in this small example. Repetition is essential; requiring DISTINCT b1,b2 would yield only 4.

This finite fixture tests the conventions. It does not certify any of the asymptotic or all-graphs assertions.

What is known

Maintained #806 PROVED: Alon, Bukh and Sudakov [ABS09] establish |B| = O(sqrt(n) loglog n/log n). Erdős–Newman [ErNe77] supply some sets requiring Omega(sqrt(n) loglog n/log n). Thus the uniform order is optimal up to constants. Primary ABS09 theorem full text and original 1977 lower-bound proof need independent verification. A bound O(sqrt n loglog n/log n)=o(sqrt n).

The distinctions between established partial theorems, original open parts, and disproved universal claims have been preserved. Historical publications are attributed, rather than presented as new GCL mathematics.

The cited sharp order of the auxiliary basis size is

\[ |B|\ll\sqrt n\,\frac{\log\log n}{\log n}, \qquad A\subseteq B+B. \]

Because \(\log\log n/\log n\) tends to zero, this is the desired little-o statement. Matching lower examples are separately attributed to Erdős and Newman.

GCL's current state

The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.

Unclosed mathematical proof/source qualifications: ABS2009_ERDOS_NEWMAN1977_PRIMARY_PROOFS_PENDING.

What remains

Finite brute-force minimum B inside bounded integer ranges for A={2,4,6}; verify repeated terms and that B can contain negatives. Source-lock 2009 Alon–Bukh–Sudakov theorem and 1977 lower bound; preserve asymptotic quantifier over all A.

For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.

Sources and claim boundaries

  • Erdos problem #806 and maintained source and bibliography, retrieved by web search 14 October 2026.
  • Authenticated issue-bound return for #806, preserving source limitations and open proof obligations.
  • Pinned teorth/erdosproblems repository revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, source blob 4e60263a80af6207aca494d2e1388e44fa372889. No protected source lock was silently changed.
  • Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2077 — 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.

Back to catalogue · Compendium introduction