Specker:
ProvedErdos592.specker_omega_sqThe ordinal is a partition ordinal:
That is, for every red/blue colouring of the edges of the complete graph on a well-ordered set of order type , there is either a set of vertices of order type all of whose pairs are red, or three vertices all of whose pairs are blue.
This is the case of Erdős Problem 592, due to Specker (1957).
import Mathlib import Definitions.Def_Erdos592_Defs open Cardinal Ordinal universe u
namespace Erdos592
theorem specker_omega_sq : OrdinalCardinalRamsey.{u} (ω ^ 2) (ω ^ 2) 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 : the ordinal Ramsey property holds for (here , the exponent being the natural number ). Unfolded: for every pair of complementary simple graphs (red, blue) on the canonical well-ordered set of order type , there is a red clique whose inherited order type is exactly , or a blue clique with exactly elements. No hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.