Skip to content

Erdős Problem #1211

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory, ramsey theory.

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 #1211 currently has source status PROVED SHARP LOGARITHMIC DENSITY.

Partition positive integers \(\mathbb N=A\sqcup B\). Let \(S(A)\) and \(S(B)\) consist of finite sums of distinct elements in the respective color classes. For \(X\subseteq\mathbb N\) define upper logarithmic density \(\overline\delta(X)=\limsup_{x\to\infty}(\log x)^{-1}\sum_{n\in X,n<x}1/n\). Determine the optimal universal constant \(c\) such that \(\max(\overline\delta(S(A)),\overline\delta(S(B)))\ge c\) for every partition. Ordinary upper natural density is not interchangeable with upper logarithmic density.

A small example

Partition \([1,30]\) into odds and evens. Enumerating subsets and truncating sums at 30 gives 29 positive sums for odd elements and 15 for even elements; even-element sums remain even, while odd sums include most but not all integers in this short range. The exact constant \((2+\sqrt3)/4\) is a published infinite logarithmic-density value, not extracted from this finite partition.

What is known

Erdős [Er80,p.113],[Er82c],[Er82d] observed one of the two subset-sum sets must have upper natural density 1, although both may have lower density 0. The maintained https://www.erdosproblems.com/1211 reports Conlon–Fox–Pham [CFP22] PROVED

\[ c=\frac{2+\sqrt3}{4}\approx0.9330127. \]

An extremizing construction partitions integers according to parity of \(\lfloor\log_b\log n\rfloor\), with \(b=2+\sqrt3\). A base-4 example yields logarithmic density \(14/15\) for both colors, which is larger than the optimal \(c\). Original theorem and density-limsup arguments remain to be independently replayed.

GCL's current state

Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.

What remains

Read CFP22 to verify upper and lower constructions, the limsup logarithmic weights and the precise distinct-summands convention. Independently check the finite subset-sum routine, but do not infer sharp infinite density from finite counts.

Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.

Sources and claim boundaries

https://www.erdosproblems.com/1211 ; [Er80,p.113],[Er82c],[Er82d],[CFP22].

Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.

Catalogue and evidence provenance

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