OpenFrontiers
← Back to the index

Erdős #1220 · set theory / ramsey theory

Let λ\lambda be a singular cardinal such that both λ\lambda and cf(λ)\mathrm{cf}(\lambda) are ℵ0\aleph_0-inaccessible. Does

λ→(λ,ℵ1)2\lambda \to (\lambda,\aleph_1)^2

hold?

Inferred from the community field; finer classification has not been reviewed.

Source reports OPENAs of 2026-09-08Source & evidence ↓

Problem statement

Let λ\lambda be a singular cardinal such that both λ\lambda and cf(λ)\mathrm{cf}(\lambda) are ℵ0\aleph_0-inaccessible. Does

λ→(λ,ℵ1)2\lambda \to (\lambda,\aleph_1)^2

hold?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

A problem of Erdős, Hajnal, and Rado, who note that the answer is positive if we assume GCH or 'some other additional assumptions' on λ\lambda.

We say a cardinal κ\kappa is ℵ0\aleph_0-inaccessible if for all μ<κ\mu<\kappa we have μℵ0<κ\mu^{\aleph_0}<\kappa. These conditions are necessary, since τℵ0↛(τ+,ℵ1)2\tau^{\aleph_0}\not\to (\tau^+,\aleph_1)^2 and if cf(κ)↛(cf(κ),ℵ1)2\mathrm{cf}(\kappa)\not\to (\mathrm{cf}(\kappa),\aleph_1)^2 then κ↛(κ,ℵ1)2\kappa\not\to (\kappa,\aleph_1)^2.

The simplest case is λ=ℵc+\lambda=\aleph_{\mathfrak{c}^+}, in which case the second condition implies the first by a theorem of Shelah [Sh82].

Progress & source assessment

The source labels this entry OPEN in the 2026-09-08 snapshot. Editorial progress notes are reproduced as source commentary, not independently verified results. Prize amounts and Lean badges at the source are not local awards or verification.

References
  1. [1]Thomas Bloom (ed.), Erdős Problems #1220 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.