The board / ramsey theory / #1219
Erdős Problem #1219
PROVEDdatabase updated 2026-09-12
The statement as posed is true, and a proof exists.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \((n_k)\) be an increasing sequence of integers such that \(2^{\aleph_{n_k}}\) is strictly increasing, and \(2^{\aleph_{n_0}} > \aleph_\omega\). Is it true that \[\sum_k 2^{\aleph_{n_k}} \to (\aleph_\omega)^2?\] Here \(\sum_k 2^{\aleph_{n_k}}\) is the cardinal sum, and the partition relation is the classical one with two colours: every \(2\)-colouring of the pairs of a set of that cardinality has a monochromatic set of cardinality \(\aleph_\omega\). A problem of Erdős, Hajnal, and Rado [ErHa71], proved by Shelah [Sh75].
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/1219.Prizenone
Topicsramsey theory, set theory
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1219
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.