Skip to content

Erdős Problem #1220

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

For any two-coloring of the edges between members of a set of size \(\lambda\), a partition relation such as

\[ \lambda\longrightarrow(\lambda,\aleph_1)^2 \]

asserts that there must be either a color-0 homogeneous set of size \(\lambda\), or a color-1 homogeneous set of size \(\aleph_1\). The two alternatives have different sizes.

Erdős Problem #1220 asks about this assertion when \(\lambda\) is a singular cardinal: an infinite cardinal approached by an increasing sequence of fewer than \(\lambda\) smaller cardinals. Its cofinality \(\mathrm{cf}(\lambda)\) is the least length of such a cofinal sequence.

There is a strong arithmetic hypothesis: both \(\lambda\) and \(\mathrm{cf}(\lambda)\) are \(\aleph_0\)‑inaccessible, meaning, for each relevant cardinal \(\kappa\),

\[ \mu^{\aleph_0}<\kappa\quad\text{for every cardinal }\mu<\kappa. \]

The question is whether these assumptions force the stated two-color relation in ZFC.

A small example

Even in finite graph coloring, monochromatic cliques need not be large. Place five vertices on a pentagon. Color its five perimeter edges red and its five diagonals blue. Both the red graph and blue graph are five-cycles, which have no triangle. Thus \(5\nrightarrow(3,3)^2\): this coloring has no homogeneous triple of either color.

This checks the meaning of partition notation, not the singular-cardinal hypothesis. Finite examples cannot settle a forcing or independence question about ZFC.

What is known

The pinned Erdős catalogue records the problem as open. Shelah and Stanley, A theorem and some consistency results in partition calculus (1987), present relevant relative-consistency arguments involving failures of partition relations. The exact bridge from their model construction to both \(\aleph_0\)‑inaccessibility assumptions of Problem #1220 requires care.

A September 2026 Palomar entry describes an external Lean development claiming that the affirmative assertion is not provable in ZFC. This is a research lead, not a result that GCL has independently replayed or certified. Furthermore, “ZFC cannot prove the universal assertion” does not entail “ZFC proves its negation.”

GCL's current state

The authenticated source return identifies Shelah–Stanley (1987), the precise two-cardinal arithmetic obligations and the reported later formalization. It explicitly leaves the key forcing-model hypotheses unverified. The original issue also includes deliberately malformed event-intake canary comments; these are not research returns.

No mathematical-status change or independently verified formal result is asserted by this explanatory draft.

What remains

Read and hash-lock the full primary article; reproduce its exact theorem and forcing assumptions; verify singularity, cofinality and both exponentiation conditions in the proposed countermodel. Locate any formal proof at immutable commits and check its target formula, model-theoretic interpretation, dependency axioms and kernel replay. Only then can the source and formalization claims be adjudicated.

Sources and claim boundaries

Catalogue and evidence provenance

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