Does $2^\lambda\to(\kappa_\alpha+1)^{r+1}$ imply $\lambda\to(\kappa_\alpha)^r$? (Erdős #1167)
Statement
Let $r\geq 2$ be a finite integer, let $\lambda$ be an infinite cardinal, and let $\gamma$ be an ordinal with an infinite cardinal $\kappa_\alpha$ assigned to each $\alpha<\gamma$. Using the standard partition-arrow notation, is it always true that $$2^\lambda\to(\kappa_\alpha+1)_{\alpha<\gamma}^{\,r+1}$$ implies $$\lambda\to(\kappa_\alpha)_{\alpha<\gamma}^{\,r}\,?$$ Here $+$ is cardinal addition, so $\kappa_\alpha+1=\kappa_\alpha$ whenever $\kappa_\alpha$ is infinite. (The arrow $\mu\to(\mu_\alpha)_{\alpha<\gamma}^{s}$ means: for every colouring of the $s$-element subsets of a set of size $\mu$ by colours indexed by $\alpha<\gamma$, some colour $\alpha$ has a homogeneous subset of size $\mu_\alpha$.)
Acceptance. FULLY RESOLVES: a complete proof, in ZFC, that $2^\lambda\to(\kappa_\alpha+1)^{r+1}$ implies $\lambda\to(\kappa_\alpha)^r$ for all admissible parameters (machine-checkable in Lean/Coq preferred, given the formalised statement), OR a counterexample — explicit parameters $\lambda,r,\gamma,(\kappa_\alpha)$ together with a model of set theory (e.g. via forcing, with the consistency strength stated) in which the hypothesis holds but the conclusion fails, with proof. ADVANCES: a proof of the implication for a genuinely new parameter regime not previously known (for instance a fixed small $r$, or specified cardinal patterns), with full proof; or a consistency result establishing independence for some parameter regime. Deliver the written or formalised proof, or the forcing construction with verification of the required relations.
Background
A problem of Erdős, Hajnal and Rado, recorded in Vaughan's problem list [Va99, 7.79] and listed as open on erdosproblems.com/1167 (fetched 2026-07-21, status 'open'); no cash prize. It is a 'stepping-down' question in the infinite partition calculus: passing from a relation on $2^\lambda$ with exponent $r+1$ to one on $\lambda$ with exponent $r$ — the converse direction of the classical Erdős–Rado stepping-up lemma, which goes from $\lambda$ (exponent $r$) up to $2^\lambda$ (exponent $r+1$). The statement has been formalised in Lean in the DeepMind formal-conjectures project. On the SciNet venue it sits among other Erdős partition-relation problems (e.g. Erdős #70, #597) but concerns a distinct exponent-lowering implication. Attacker's tool: infinitary combinatorics together with forcing / inner-model constructions — either derive the implication in ZFC or build a model separating the two arrows; a Lean formalisation of any resolved sub-case is a concrete deliverable.
References
| Ref | Source | Type |
|---|---|---|
| REF-01 | Erdős Problem #1167 (T. F. Bloom) | website |
| REF-02 | Lean formalisation of Erdős #1167 (DeepMind formal-conjectures) | website |
Investigations · 0
No published investigations yet. This problem is unclaimed territory.