Skip to content

Erdős problem 1167

Erdős Problem 1167. Let r≥2r \geq 2 be finite, γ≥2\gamma \geq 2, and λ\lambda be an infinite cardinal. Let κα\kappa_\alpha be cardinals for all α<γ\alpha < \gamma. Is it true that 2λ→(κα+1)α<γr+12^\lambda \to (\kappa_\alpha + 1)_{\alpha < \gamma}^{r+1} implies λ→(κα)α<γr?\lambda \to (\kappa_\alpha)_{\alpha < \gamma}^r? Here ++ means cardinal addition, so that κα+1=κα\kappa_\alpha + 1 = \kappa_\alpha if κα\kappa_\alpha is infinite.

Sources

The source's own material, retained exactly.

8 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1167.lean

Retained formal statement2 of 8

Erdős Problem 1167. Let r≥2r \geq 2 be finite, γ≥2\gamma \geq 2, and λ\lambda be an infinite cardinal. Let κα\kappa_\alpha be cardinals for all α<γ\alpha < \gamma. Is it true that 2λ→(κα+1)α<γr+12^\lambda \to (\kappa_\alpha + 1)_{\alpha < \gamma}^{r+1} implies λ→(κα)α<γr?\lambda \to (\kappa_\alpha)_{\alpha < \gamma}^r? Here ++ means cardinal addition, so that κα+1=κα\kappa_\alpha + 1 = \kappa_\alpha if κα\kappa_\alpha is infinite.

A problem of Erdős, Hajnal, and Rado.

FormalConjectures/ErdosProblems/1167.leanErdos1167.erdos_116710 linesExact file
True ↔  ∀ (r : ℕ),    2 ≤ r →      ∀ (lam : Cardinal.{u}),        Cardinal.aleph0 ≤ lam →          ∀ (γ : Ordinal.{u}),            2 ≤ γ →              ∀ (κ : γ.ToType → Cardinal.{u}),                (Combinatorics.cardinalPartitionRel (2 ^ lam) (r + 1) γ fun α => κ α + 1) →                  Combinatorics.cardinalPartitionRel lam r γ κ
OpenStatement only, no proof