Erdős Problem #1169
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 #1169 is classified NOT DISPROVABLE in the maintained catalogue.
For the ordinal \(\omega_1^2\) (not the cardinal arithmetic product \(\aleph_1^2=\aleph_1\)), ask whether
The negative arrow asserts there exists a two-coloring of unordered pairs of the ordinal with no order-type‑\(\omega_1^2\) homogeneous first-color subset and no first-order triangle in the other color. The current source starts with 'for all finite \(k<\omega\)' but \(k\) is absent from its displayed formula. This is a genuine binder/notation issue, not an extra parameter one may silently invent.
A small example
Finite Ramsey theory supplies a useful sharp contrast: there is a two-edge-coloring of \(K_5\) with no monochromatic triangle, while every two-coloring of \(K_6\) has one. Exact exhaustive enumeration of \(2^{15}\) colorings confirms \(R(3,3)=6\). This does not test the color-1 exclusion of order type \(\omega_1^2\) and cannot decide the CH-free question.
What is known
Hajnal [Ha71] proved this negative partition relation under the continuum hypothesis (CH), according to Vardi [Va99,7.85], and the website therefore classifies it NOT DISPROVABLE, a relative-consistency notion. The site comment documents a January 2026 correction of a formerly missing negative arrow; that correction does not resolve the unused quantifier \(k\). CH sufficiency does not imply a ZFC theorem, nor does it prove full independence. Related ordinal partition problem #592 has a different (countable) ambient ordinal.
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
Read Hajnal 1971 and Vardi §7.85 originals to determine whether \(k\) was intended to index a target, a color count, or is simply erroneous prose. Check ordinal multiplication conventions and whether the printed CH theorem corresponds exactly to this two-color arrow. Keep the CH-relative positive evidence separate from ZFC proof claims.
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/1169 ; https://www.erdosproblems.com/latex/1169 ; [Ha71],[Va99,7.85], #592.
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: #2440 — 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.