Skip to content

Erdős Problem #1218

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

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 #1218 currently has source status OPEN GCH PARTITION OBSTRUCTION.

Assume the generalized continuum hypothesis (GCH). Let \(\beta=\omega_{\omega+1}\) be an ordinal, not the cardinal \(\aleph_{\omega+1}\). The Erdős–Hajnal–Rado problem asks whether the following negative triple partition relation holds:

\[ \aleph_{\beta+1}\not\to(\aleph_\beta,4,4,\ldots)^3, \]

with countably infinitely many colors other than the distinguished \(\aleph_\beta\)‑homogeneous target. To prove the negative arrow one must construct a coloring of unordered triples on \(\aleph_{\beta+1}\) avoiding an \(\aleph_\beta\)‑sized homogeneous set in its first color and any monochromatic four-set in each other color. A finite 3-hypergraph with a coloring cannot prove this cardinal relation.

A small example

On a five-vertex finite set there are \(\binom53=10\) unordered triples. This is only a counting and arity check, accompanied by a receipt explicitly recording \(\beta\) as an ordinal, GCH as a hypothesis, countably many additional color classes, the ambient cardinal \(\aleph_{\beta+1}\) and first target \(\aleph_\beta\). It supplies no coloring at the necessary cardinality or independence/consistency argument.

What is known

Maintained https://www.erdosproblems.com/1218 lists OPEN, sourced to Erdős–Hajnal–Rado [EHR65,p.131], Erdős–Hajnal [ErHa71,p.20] and Komjáth [Ko25b,p.2]. The more general conjecture is expressed using cofinality \(\mathrm{cf}(\beta)\) and a critical-rank notation \(\mathrm{cr}(\beta)\), with an exceptional \(r\ge3\) range not settled by their otherwise wide GCH partition theorem. Source says \(\beta=\omega_{\omega+1}\) is the smallest ordinal fitting the exceptional inequalities. Whether current online proof claims alter this status requires expert source review; no finite or ordinary Ramsey theorem settles the GCH problem.

GCL's current state

Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.

What remains

Read EHR65 p.131, ErHa71 p.20 and Ko25b p.2 to source-lock \(\mathrm{cr}\), \(\mathrm{cf}\), cardinal successor and color-index conventions; check available online proof claim against exact GCH assumptions. Define an independently verifiable combinatorial construction/reduction or identify the precise unresolved obstruction without claiming a finite simulation solves it.

Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.

Sources and claim boundaries

https://www.erdosproblems.com/1218 ; [EHR65,p.131],[ErHa71,p.20],[Ko25b,p.2].

Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2489 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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