/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Erdős Problem 1169

Reference: erdosproblems.com/1169

References:

    [Ha71] Hajnal, A. A negative partition relation. Proc. Nat. Acad. Sci. U.S.A. 68 (1971), pp. 142–144.

@[expose] public sectionopen Cardinal Ordinalopen scoped Cardinalnamespace Erdos1169universe u

Is it true that $\omega_1^2 \not\to (\omega_1^2, 3)^2$?

A problem of Erdős and Hajnal. Hajnal [Ha71] proved this assuming the continuum hypothesis. The source's displayed relation has blue target $3$; its introductory $k$ does not occur in that relation. See also erdosproblems.com/592.

@[category research open, question, AMS 3] theorem erdos_1169 : ¬ OrdinalRamsey ((ω_ 1) ^ (2 : ℕ)) ((ω_ 1) ^ (2 : ℕ)) (3 : Ordinal) := ⊢ ¬OrdinalRamsey (ω_ 1 ^ 2) (ω_ 1 ^ 2) 3 All goals completed! 🐙/- ### Variants and known results -/ namespace erdos_1169.variants

The finite-blue-target form asks whether $\omega_1^2 \not\to (\omega_1^2, k)^2$ for every $k \ge 3$. The restriction excludes $k \le 2$, where the positive relation holds. A colouring witnessing the negative relation with blue target $3$ also witnesses this form.

@[category research open, question, AMS 3] theorem finite_blue_target : ∀ k : ℕ, 3 ≤ k → ¬ OrdinalRamsey ((ω_ 1) ^ (2 : ℕ)) ((ω_ 1) ^ (2 : ℕ)) (k : Ordinal) := ⊢ ∀ (k : ℕ), 3 ≤ k → ¬OrdinalRamsey (ω_ 1 ^ 2) (ω_ 1 ^ 2) ↑k All goals completed! 🐙

Hajnal (1971), assuming CH. Under the Continuum Hypothesis, $\omega_1^2 \not\to (\omega_1^2, k)^2$ holds for every finite $k \ge 3$.

@[category research solved, AMS 3] theorem hajnal_under_ch (hCH : 𝔠 = ℵ_ 1) : ∀ k : ℕ, 3 ≤ k → ¬ OrdinalRamsey ((ω_ 1) ^ (2 : ℕ)) ((ω_ 1) ^ (2 : ℕ)) (k : Ordinal) := hCH:𝔠 = ℵ_ 1⊢ ∀ (k : ℕ), 3 ≤ k → ¬OrdinalRamsey (ω_ 1 ^ 2) (ω_ 1 ^ 2) ↑k All goals completed! 🐙end erdos_1169.variants

Monotonicity in the blue side. If the ordinal Ramsey relation holds with blue target $\gamma$, it holds with any smaller blue target $\gamma' \le \gamma$.

α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γ⊢ (∃ s, red.IsClique s ∧ typeLT ↑s = β) ∨ ∃ s, blue.IsClique s ∧ typeLT ↑s = γ' α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2⊢ (∃ s, red.IsClique s ∧ typeLT ↑s = β) ∨ ∃ s, blue.IsClique s ∧ typeLT ↑s = γ' α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)⊢ (∃ s, red.IsClique s ∧ typeLT ↑s = β) ∨ ∃ s, blue.IsClique s ∧ typeLT ↑s = γ' α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)⊢ blue.IsClique tα:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)⊢ typeLT ↑t = γ' α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)⊢ blue.IsClique t -- t is a blue clique α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)a:γ'.ToTypeb:γ'.ToTypehne:(Subtype.val ∘ ⇑g) a ≠ (Subtype.val ∘ ⇑g) b⊢ blue.Adj ((Subtype.val ∘ ⇑g) a) ((Subtype.val ∘ ⇑g) b) α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)a:γ'.ToTypeb:γ'.ToTypehne:(Subtype.val ∘ ⇑g) a ≠ (Subtype.val ∘ ⇑g) b⊢ ↑(g a) ≠ ↑(g b) α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h✝:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)a:γ'.ToTypeb:γ'.ToTypehne:(Subtype.val ∘ ⇑g) a ≠ (Subtype.val ∘ ⇑g) bh:↑(g a) = ↑(g b)⊢ False α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h✝:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)a:γ'.ToTypeb:γ'.ToTypehne:(Subtype.val ∘ ⇑g) a ≠ (Subtype.val ∘ ⇑g) bh:↑(g a) = ↑(g b)⊢ (Subtype.val ∘ ⇑g) a = (Subtype.val ∘ ⇑g) b All goals completed! 🐙 α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)⊢ typeLT ↑t = γ' -- typeLT t = γ' α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)emb:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2 := { toFun := fun a ↦ ⟨↑(g a), ⋯⟩, inj' := ⋯, map_rel_iff' := ⋯ }⊢ typeLT ↑t = γ' α:Ordinal.{u}β:Ordinal.{u}γ:Ordinal.{u}γ':Ordinal.{u}h:OrdinalRamsey α β γhγ:typeLT γ'.ToType ≤ γred:SimpleGraph α.ToTypeblue:SimpleGraph α.ToTypehCompl:IsCompl red blues:Set α.ToTypehblue:blue.IsClique shtype:typeLT ↑s = γg:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2t:Set α.ToType := Set.range (Subtype.val ∘ ⇑g)emb:(fun x1 x2 ↦ x1 < x2) ↪r fun x1 x2 ↦ x1 < x2 := { toFun := fun a ↦ ⟨↑(g a), ⋯⟩, inj' := ⋯, map_rel_iff' := ⋯ }hsurj:Function.Surjective ⇑emb⊢ typeLT ↑t = γ' All goals completed! 🐙end Erdos1169