Erdős Problem #164
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, 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.
The question in plain language
A set \(A\) of integers greater than one is primitive when no distinct element of \(A\) divides another. Erdős asked whether, among all finite or infinite primitive sets, the weighted reciprocal sum
is largest when \(A\) is the set of all primes. The logarithm is the natural logarithm. The exclusion of one is necessary because \(\log1=0\).
This is a global extremal inequality for arbitrary primitive sets, not a statement that primes give the largest summand one element at a time.
A small example
The set \(A=\{4,9\}\) is primitive because neither divides the other, but the set \(\{2,4\}\) is not, as \(2\) divides \(4\). The prime set is primitive by unique factorization. Although individual composite terms may be smaller than nearby prime terms, infinitely many composite numbers could in principle compete in aggregate; that is why the theorem is nontrivial.
Erdős proved in 1935 that \(f(A)\) converges for any primitive set and is uniformly bounded. Convergence alone does not identify the maximizing set.
What is known
PROVED. Jared Duker Lichtman, A proof of the Erdős primitive set conjecture, Forum of Mathematics, Pi 11 (2023), e18, proved
for every primitive set of integers greater than one. The primary Cambridge publisher article supplies the precise hypotheses, and its arXiv version is arXiv:2202.02384.
A later, alternative proof by Alexeev, Barreto, Li, Lichtman, Price, Shah, Tang and Tao is cited by the maintained Erdős #164, updated May 2026. The maintained site reports Lean verification, but GCL has not independently replayed that third-party formal project and cannot equate a reported Lean proof with protected GCL kernel admission. The 2023 published proof already settles the original conjecture independently of the newer route.
GCL's current state
The pinned and maintained catalogue mark #164 PROVED. Original issue: #1433. The primary proof statement and its assumption \(a>1\) were confirmed; the article does not claim a new extremal result or independent reproduction of Lichtman's entire argument.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded successor checks finite primitive subsets of \([2,40]\), calculates exact divisibility, and compares finite partial weighted sums against corresponding prime partial sums at matching cutoffs. Acceptance: verify primitive-set detection and the exclusion of one, and explicitly state that comparison with truncated prime sums is only a finite fixture, not a consequence of the global theorem for every truncation. A separate formal gate can reproduce the third-party Lean proof at a named commit with an axiom audit.
Sources and claim boundaries
- Lichtman, Forum of Mathematics, Pi 11 (2023), primary proof.
- Erdős #164, updated alternate-proof and external formalization claim.
- Original issue #1433.
No new primitive-set inequality, independent Lean certification or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1433 — 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.