Skip to content

Erdős Problem #1171

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: not disprovable (not automatically the live result).
Subject areas: set theory, 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.

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 #1171 is classified NOT DISPROVABLE in the maintained catalogue.

For each finite \(k<\omega\), the question is whether the ordinal \(\omega_1^2\) has the positive \((k+1)\)‑color pair-partition property

\[ \omega_1^2\to(\omega_1\cdot\omega,3,\ldots,3)_{k+1}^{2}, \]

where there are \(k\) copies of the target \(3\) after the distinguished target \(\omega_1\cdot\omega\). The large homogeneous first-color set must have order type \(\omega_1\cdot\omega\); writing cardinal \(\aleph_1\) in its place loses ordinal information. For \(k=0\) this is a degenerate one-color instance; the genuinely difficult versions have multiple colors.

A small example

As a precise finite bookkeeping example, \(k=1\) means two colors, while \(k=2\) means three colors: one large-target color and two triangle-target colors. Merely renaming two red/blue edge colors cannot prove a three-color Ramsey property. The phase-20 fixture records this arity and the distinct ordinals \(\omega_1\cdot\omega\) and \(\omega_1^2\); no finite calculation decides a forcing-model statement.

What is known

The maintained page lists the status NOT DISPROVABLE and reports that Baumgartner [Ba89b] proved, assuming a variant of Martin's axiom, a positive two-color arrow \(\omega_1\cdot\omega\to(\omega_1\cdot\omega,3)^2\). That has a smaller ambient ordinal than the one in the general problem, but only two colors. It does not automatically establish the full family of \((k+1)\)‑color arrows for arbitrary finite \(k\). No independent model/forcing proof or ordinal implication has been checked by GCL.

GCL's current state

GCL posted an authenticated issue-bound research return and independently reproduced only the explicitly finite checks in ci/erdos_compendium_007_phase20_checks.py. This is an unaccepted editorial explanation, not an independent primary-paper verification or theorem proof.

What remains

Source-review Baumgartner 1989 precise axiom and ambient ordinal, independently verify any extension from two to finitely many colors, and source-lock whether the phrase 'all finite k' includes zero; do not assert the CH result of #1169 or this Martin's-axiom result settles the unconditional question.

The source-status and theorem-strength distinctions must be settled before final protected admission. The cohort still has mandatory independent critical-review obligations.

Sources and claim boundaries

https://www.erdosproblems.com/1171 ; [Ba89b],[Va99,7.84].

Phase20 exact receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE20.json. Source-fidelity PENDING; protected publication and V2 NOT ADMITTED.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2442 — 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