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 statement3 of 8

The unrestricted version of Erdős Problem 1167 (without the condition γ≥2\gamma \geq 2 from the original Erdős–Hajnal list) is false. Taking γ=1\gamma = 1, κ0=ℵ1\kappa_0 = \aleph_1, λ=ℵ0\lambda = \aleph_0: the premise 2ℵ0→(ℵ1+1)132^{\aleph_0} \to (\aleph_1 + 1)^3_1 holds since 2ℵ0≥ℵ12^{\aleph_0} \geq \aleph_1, but the conclusion ℵ0→(ℵ1)12\aleph_0 \to (\aleph_1)^2_1 fails since ℵ0<ℵ1\aleph_0 < \aleph_1.

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