Erdős Problem #847
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (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
The three-term-arithmetic-progression analogue of the infinite planar coloring problem is also negative. Every finite subset of the constructed infinite set has a large progression-free part, yet no finite coloring of the whole set avoids monochromatic progressions.
Let A be an INFINITE subset of positive integers. Assume some fixed epsilon>0 such that every finite B subset A contains a 3-term-AP-free subset of cardinality at least epsilon|B|. Does A admit a partition into finitely many 3AP-free parts? NO. The local finite independent-ratio property does not guarantee finite global hypergraph chromatic number.
A small example
Take B={1,2,3,4}. Its maximum 3AP-free subset has cardinality three: e.g. {1,2,4} works; full set contains 1,2,3 and 2,3,4 arithmetic progressions. This finite calculation illustrates an independent ratio 3/4 but does not address any infinite coloring obstruction.
This finite calculation tests definitions, not a result quantified over all large N or infinite sets.
What is known
Maintained https://www.erdosproblems.com/latex/847 read 2026-10-14 credits Reiher–Rödl–Sales [RRS24], Colouring versus density in integers and Hales–Jewett cubes, JLMS (2024), Paper e12987: for every 0<mu<1/2 construct infinite A for which EVERY finite coloring admits a monochromatic three-term AP, yet every finite B subset A has an AP-free subset of size >=mu |B|. This disproves the partition conjecture. Proof not independently replayed.
For a finite B the maximum cardinality of a three-term-progression-free subset is a hypergraph independence number. Positive uniform lower fraction in each finite B does not bound the chromatic number of the entire infinite hypergraph. Reiher, Rödl and Sales construct an infinite set with this exact separation for any specified proportion below one half. B={1,2,3,4} illustrates the local definition: it has maximum AP-free subset size three, for example {1,2,4}, whereas B itself contains both 1,2,3 and 2,3,4 progressions.
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: REIHER_RODL_SALES2024_THEOREM_FULL_PROOF_NOT_REPLAYED; INFINITE_COMPACTNESS_SCOPE.
What remains
Implement exact AP-free maximum by subset enumeration for B={1,2,3,4}, powers of two. Source-lock RRS24 Theorem 1.7 quantifier uniformity and prove source translation into statement.
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
- Erdős problem #847 and maintained LaTeX/bibliography, read 14 October 2026.
- Authenticated source-audit return, including mathematical scope and outstanding primary-paper obligations.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml; external proof claims not independently certified by GCL.
- 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: #2118 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.