Erdős Problem #70
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: graph theory, ramsey theory, set 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
Suppose every three-element subset of the continuum is colored red or blue. Erdős #70 asks whether, for every countable ordinal \(\beta\) and every finite \(n\ge2\), one necessarily gets either a red homogeneous set of order type \(\beta\), or a blue homogeneous set of cardinality \(n\). Its conventional partition notation is
Order type matters. The order \(\omega+1\) has infinitely many increasing points followed by a final point; it is not order-isomorphic to \(\omega\).
A small example
For \(n=2\) the blue alternative is vacuous: a two-element set has no triples. For \(n=3\), either some triple is blue or every triple is red. In the second case the initial ordinal \(\mathfrak c\) contains every countable order type. This proves the problem for \(n\le3\) without higher set theory.
Another helpful example is \(\omega+\omega+1\), two infinite ordered blocks followed by a final element. Adding one further endpoint gives \(\omega+\omega+2\). The apparently small difference exposes a significant boundary in existing partition theorems.
What is known
The overall problem remains OPEN. Albin L. Jones proved in 2018 that
Every coloring on \([\mathfrak c]^3\) restricts to \([\omega_1]^3\) because \(\omega_1\le\mathfrak c\). Thus Jones's theorem proves the continuum statement whenever \(\beta\le\omega\cdot2+1\). Coupled with the trivial finite alternatives, cases with \(n\ge4\) and \(\beta\ge\omega\cdot2+2\) are not covered by these arguments. This description does not establish that every parameter pair in the remaining region is independently open.
The 2018 source gives a stronger theorem than elementary infinite Ramsey theory, whose homogeneous subsets need not have such prescribed ordinal order type. GCL has not independently checked the forcing arguments in the full paper.
GCL's current state
The original assignment is ERDOS-CATALOGUE-0070-S01. Source status was pinned OPEN at catalogue revision 536408716724a2402bdfa7c1d764bf83d64a8c89. The local work verified the \(n=2,3\) cases, monotonic restriction, and the 2018 result at primary bibliographic/abstract depth. This is a pending source-bound draft, not a new theorem.
The original GitHub issue now contains the authenticated RESULT/1 source report. This does not imply independent mathematical review or editorial admission.
What remains
A bounded successor is to state a precise candidate two-orientation cross-triple lemma for blocks \(A<B\) and test it against finite colorings before attempting \(\omega\cdot2+2\). Every hypothesis on color, triple orientation, cardinality, and order must be recorded; neither a finite successful test nor the 2018 result automatically establishes the next ordinal case. Full primary Proposition 5.2 page checking and protected Lean statement fidelity remain outstanding.
Sources and claim boundaries
- Jones, Even more on partitioning triples of countable ordinals, Proc. Amer. Math. Soc. 146 (2018), 3529–3539, primary abstract checked, proof not audited.
- Erdős problem #70.
- GCL original issue #1339.
No new GCL proof, formal verification or editorial acceptance is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1339 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- 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.