Skip to content

Erdős Problem #1217

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

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 #1217 currently has source status PROVED — 2026 IMPROVEMENT.

For increasing \(A=\{a_1<a_2<\cdots\}\) with positive lower logarithmic density, seek a subsequence forming an infinite divisibility chain \(a_{n_1}\mid a_{n_2}\mid\cdots\), whose chain counting function, normalized by \(\log\log x\), has upper limit at least

\[ \limsup_{x\to\infty}\frac1{\log\log x}\sum_{\substack{a\in A\\a<x}}\frac1{a\log a}. \]

The left counts chain elements, while the right weights all source elements reciprocally. The placement of the \(\limsup\) on both sides is essential. Source says the logarithmic density assumption can be removed in the definitive theorem; do not silently substitute natural density.

A small example

The list \((2,4,8,16,32)\) is a divisibility chain: each term divides the next. Its reciprocal-log weight \(\sum1/(a\log a)\) is approximately 0.993355647945, verified by the phase25 fixture. Finite chains cannot determine upper limits normalized by \(\log\log x\) and do not independently establish the strengthened 2026 theorem.

What is known

Davenport–Erdős [DaEr51] proved existence of a divisibility chain under positive lower logarithmic density. Erdős–Sárközy–Szemerédi [ESS66] obtained a weaker quantitative bound when the source's weighted limsup equals \(c>0\). Maintained https://www.erdosproblems.com/1217 reports the full inequality PROVED in 2026 by Alexeev–Barreto–Li–Lichtman–Price–Shah–Tang–Tao [ABLLPSTT26], even without the lower logarithmic density hypothesis, with related GPT-5.4 Pro work. The original 2026 proof and exact inequality are not independently certified by GCL.

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 ABLLPSTT26 and ESS66 originals, validate whether the positive lower logarithmic density premise is genuinely removed, and source-check the exact comparison of two limsup expressions. Derive a rigorous chain-selection argument independently before upgrading theorem fidelity.

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/1217 ; [DaEr51],[ESS66],[ABLLPSTT26].

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: #2488 — 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