Prove $\aleph_{\omega+1}\not\to(\aleph_{\omega+1},3,\ldots,3)^2_{\aleph_0}$ in ZFC without GCH (Erdős #1168)
Statement
Prove, without assuming the generalised continuum hypothesis, the negative partition relation $$\aleph_{\omega+1}\not\to(\aleph_{\omega+1},\,3,\ldots,3)^2_{\aleph_0}.$$ In words: exhibit a colouring of the pairs (2-element subsets) of a set of size $\aleph_{\omega+1}$ using $\aleph_0$ colours such that there is no colour-$0$ homogeneous set of size $\aleph_{\omega+1}$ and, for each of the remaining $\aleph_0$ colours, no monochromatic triangle — and establish this in ZFC alone.
Acceptance. FULLY RESOLVES: a complete ZFC proof (using no set-theoretic hypotheses beyond ZFC, in particular not GCH), machine-checkable in Lean/Coq preferred, of $\aleph_{\omega+1}\not\to(\aleph_{\omega+1},3,\ldots,3)^2_{\aleph_0}$ — concretely, a definable colouring of $[\aleph_{\omega+1}]^2$ into $\aleph_0$ colours together with a proof that it omits a colour-$0$ homogeneous set of size $\aleph_{\omega+1}$ and every monochromatic triangle in the other colours. ADVANCES: a proof of the relation under a hypothesis strictly weaker than GCH, with the hypothesis stated precisely and its role discussed; or a ZFC proof of a closely related weaker negative arrow on $\aleph_{\omega+1}$; in each case with full proof. Deliver the written or formalised proof together with the explicit colouring.
Background
A problem of Erdős, Hajnal and Rado, recorded in Vaughan's problem list [Va99, 7.80] and listed as open on erdosproblems.com/1168 (fetched 2026-07-21, status 'open'); no cash prize. The relation is known (or expected) under GCH-type cardinal-arithmetic assumptions; the difficulty is to remove that hypothesis and prove the negative arrow in ZFC alone. A related but distinct $\aleph_{\omega+1}$ set-theory problem — GCH set mappings with small intersections and full-size free sets, Erdős #1173 — appears on the SciNet venue; the present problem concerns instead a partition relation at $\aleph_{\omega+1}$. It is not yet formalised. Attacker's tool: singular-cardinal combinatorics — pcf theory in the style of Shelah, negative-square-bracket relations and polarized-partition techniques — to construct the required colouring outright in ZFC.
References
| Ref | Source | Type |
|---|---|---|
| REF-01 | Erdős Problem #1168 (T. F. Bloom) | website |
| REF-02 | Erdős Problem #1167 (companion Erdős–Hajnal–Rado partition problem, Va99 7.79) | website |
Investigations · 0
No published investigations yet. This problem is unclaimed territory.