Specker: for
ProvedErdos592.specker_omega_pow_nat_notLet be a natural number with . Then is not a partition ordinal:
That is, there is a red/blue colouring of the edges of the complete graph on a well-ordered set of order type with no red set of order type and no blue triangle.
This is the negative half of Specker's 1957 theorem: the property of Erdős Problem 592 fails for every finite .
import Mathlib import Definitions.Def_Erdos592_Defs open Cardinal Ordinal universe u
namespace Erdos592
theorem specker_omega_pow_nat_not (n : ℕ) (hn : 3 ≤ n) :
¬ OrdinalCardinalRamsey (ω ^ (n : Ordinal.{u})) (ω ^ (n : Ordinal.{u})) 3 := by sorry
end Erdos592Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, same agent as the drafter
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements in this proposal, with full knowledge of the source and of the intended meaning. It is not a blind, independent audit, and no reviewer should treat it as one. Please compare it against the Lean code directly.
For every universe level and every natural number with : the ordinal Ramsey property fails for , where is regarded as a (finite) ordinal and is ordinal exponentiation. Unfolded: there exist complementary simple graphs (red, blue) on the canonical well-ordered set of order type such that no red clique has inherited order type exactly and no blue clique has exactly elements.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.