Erdős Problem #721
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory, additive combinatorics, 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.
The question in plain language
Let W(3,k) be the smallest N such that every red/blue colouring of {1,...,N} yields either a RED three-term arithmetic progression or a BLUE k-term arithmetic progression. Erdős asked for nontrivial lower bounds and an upper bound W(3,k)<exp(k^c) for some absolute c<1. The maintained page marks SOLVED because both specific challenges have been met, but the true asymptotic growth remains unsettled.
A small example
For k=3, the classical van der Waerden number W(3,3)=9. Every red/blue colouring of {1,...,9} contains a monochromatic three-term progression, while there exists a colouring of eight positions without one. The orientation red/blue is irrelevant when k=3 but matters for k>3, so this is only a finite check of the definition.
What is known
The maintained #721 attributes a superpolynomial lower bound to Ben Green [Gr22], improved by Zachary Hunter [Hu22] to W(3,k)≥exp(c(log k)²/loglog k). Schoen [Sc21] first proved a subexponential upper bound exp(k^c) for some c<1; Kelley–Meka and Bloom–Sisask methods yield an improved upper bound W(3,k)≤exp(O((log k)^9)) as presented by the catalogue (last edited Apr 4 2026). The upper is subexponential in k, but the large gap between exp((log k)²/loglog k) and exp((log k)^9) remains. The named original manuscripts and exact constant conditions have not been independently read in full.
GCL's current state
The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.
Critical source-scope distinction: both specific W(3,k) challenges solved while sharp growth remains open.
What remains
ERDOS-721-MIXED_PROGRESS_REPLAY. Reproduce an exhaustive two-colouring certificate for W(3,3)=9, then source-check Schoen's subexponential upper proof and Hunter's lower construction. Determine what bounds can be stated with constants independent of k and justify why the special challenges are solved but exact growth is not.
Sources and claim boundaries
Maintained Erdős Problem #721; authenticated issue audit. Full original proof text and branch-protected formal dependencies not independently replayed. No protected publication, browser MathJax review or V2 admission.
Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1992 — 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.