Skip to content

Erdős Problem #1128

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: disproved (not automatically the live result).
Subject areas: set theory, ramsey theory, hypergraphs.

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

Colour every ordered triple from three large sets with one of two colours. Must there be an infinite rectangular block of triples all having the same colour?

Erdős Problem #1128 asks this when each of three sets \(A,B,C\) has cardinality \(\aleph_1\). The proposed conclusion requires subsets

\[ A_1\subseteq A,\quad B_1\subseteq B,\quad C_1\subseteq C \]

of cardinality \(\aleph_0\) each, with the entire product \(A_1\times B_1\times C_1\) monochromatic.

The proposition has been disproved externally, although its original counterexample was apparently not published.

A small example

Colour the eight triples \((i,j,k)\in\{0,1\}^3\) by the parity of \(i+j+k\):

\[ \mathrm{colour}(i,j,k)=(i+j+k)\bmod 2. \]

The full \(2\times2\times2\) cube contains both colours. Thus the whole finite cube is not monochromatic.

However, this is not a counterexample to the actual question. The original sets must have cardinality \(\aleph_1\), and their monochromatic subproduct need only be countably infinite. A finite example cannot address these cardinal requirements.

What is known

The maintained catalogue attributes the question to Erdős and Hajnal, and credits Prikry and Mills (1978) with a negative solution. It cautions that the original construction appears to have been unpublished.

The negative result is instead reported in later sources attributed to Todorčević (1994) and Komjáth (2025). As a consequence, a source-fidelity review must use those actual published theorem statements rather than invent or assume the existence of a full Prikry–Mills paper.

This is a product-Ramsey phenomenon involving three coordinates and uncountable starting sets; it is not simply the ordinary finite Ramsey theorem.

GCL's current state

Authenticated source return #2399 records the exact \(\aleph_1\) and \(\aleph_0\) quantifiers and reproduces the finite parity colouring.

The original mathematical counterexample and its precise set-theoretic hypotheses have not yet been independently reconstructed. The negative disposition is source-attributed, not a GCL-certified construction.

What remains

Read the exact relevant statements in Todorčević (1994) and Komjáth (2025), identify the form of the colouring and whether additional set-theoretic assumptions enter, and reconstruct the actual countably infinite subproduct obstruction.

Sources and claim boundaries

Erdős #1128; Erdős (1981), p.33; Todorčević (1994); Komjáth (2025); GCL return. Externally disproved, primary counterexample not independently verified. Unaccepted draft.

Catalogue and evidence provenance

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

Back to catalogue · Compendium introduction