Skip to content

Erdős Problem #1219

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (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

An infinite version of Ramsey's theorem asks how large a completely uniform set must appear when every pair of points has been colored red or blue. The notation

\[ \kappa\longrightarrow(\alpha)^2_2 \]

means that every red/blue coloring of the two-element subsets of a set of cardinality \(\kappa\) has a monochromatic subset of cardinality \(\alpha\).

Erdős Problem #1219 considers a strictly increasing sequence of indices \((n_k)_{k<\omega}\) for which the cardinal powers \(2^{\aleph_{n_k}}\) strictly increase and \(2^{\aleph_{n_0}}>\aleph_\omega\). It asks whether

\[ \sum_{k<\omega}2^{\aleph_{n_k}} \longrightarrow(\aleph_\omega)^2_2. \]

These are infinite cardinalities, not real-valued powers or ordinary numerical sums. The delicate point is the first limit cardinal \(\aleph_\omega\).

A small example

In a finite analogy, take six vertices labeled \(1,\ldots,6\) and color the edge \(\{i,j\}\) red if \(i+j\) is even, blue otherwise. Both \(\{1,3,5\}\) and \(\{2,4,6\}\) form red monochromatic triples: a sum of two odd numbers, or two even numbers, is even. This directly illustrates how an edge coloring can contain large homogeneous sets.

The example is not a verification of an infinite-cardinal partition relation. The latter must hold for every coloring at the stated cardinality.

What is known

The frozen catalogue lists the problem as proved. Shelah's 1975 paper Notes on Partition Calculus (Sh:40), particularly its early canonization and partition results, is the primary literature cited for the affirmative resolution in ZFC. Roughly, its methods first regularize edges among carefully chosen large blocks and then apply Ramsey's theorem to the countably many block indices. The precise hypotheses of these reductions matter, and that paraphrase is not a replacement for the published proof.

A public Lean project by Ji Ho Bae has also been reported as formalizing this problem in 2026. Its existence, source code, and reported axiom checks are external evidence, not an independently replayed GCL certification.

GCL's current state

The original authenticated source return identifies Shelah (1975), reported formalization dependencies and a possible reusable unbalanced Erdős–Rado lemma. It specifies a bounded upstream extraction task. The return has been located through live GitHub reconciliation; full source-fidelity inspection and independent Lean replay remain separate gates.

No new mathematical theorem or certification is asserted by this explanatory draft.

What remains

Pin and inspect the precise 1975 theorem and corollary as printed; verify that the exact source-cardinal sum and cardinal-exponent hypotheses in the problem match the literature; then replay any external Lean artifact at its immutable source and toolchain commits before claiming mechanical certification. A narrower constructive successor is to isolate the unbalanced partition lemma in Mathlib's standard API, with a clean build and recorded axioms.

Sources and claim boundaries

Catalogue and evidence provenance

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