Erdős problem 1128
Erdős Problem 1128 (disproved by Prikry–Mills, 1978):
Sources
FormalConjectures/ErdosProblems/
1128.lean
Retained formal statement
Explicit form of Prikry–Mills:
There exists a 2-colouring of such that for every countably infinite , the box is not monochromatic.
This is the content of the Prikry–Mills theorem (1978, unpublished), stated using Lean's ordinal type {o : Ordinal // o < ω_ 1} as the representation of .
∃ f, ∀ (A₁ : Set { o // o < Ordinal.omega 1 }) (B₁ : Set { o // o < Ordinal.omega 1 }) (C₁ : Set { o // o < Ordinal.omega 1 }), Cardinal.mk ↑A₁ = Cardinal.aleph 0 → Cardinal.mk ↑B₁ = Cardinal.aleph 0 → Cardinal.mk ↑C₁ = Cardinal.aleph 0 → ¬Erdos1128.IsMonochromaticBox f A₁ B₁ C₁SolvedStatement only, no proof