Documentation

CombinatorialGames.Nimber.Omega

Omega numbers are algebraically closed #

We prove that for x ≠ 0, the nimbers ∗ω_ x are algebraically closed, and that there are ω_ x algebraically closed nimbers below ∗ω_ x.

For Mathlib #

theorem InitialSeg.le_of_strictMono {α : Type u_1} {β : Type u_2} [LinearOrder α] [LinearOrder β] [WellFoundedLT α] (f : α ≤i β) {g : α → β} (hg : StrictMono g) (x : α) :
f x ≤ g x
theorem Order.enum_le_of_strictMono {α : Type u_1} [LinearOrder α] [WellFoundedLT α] [IsRegularCardinalOrder α] {s : Set α} (hs : IsCofinal s) {x y : α} {f : ↑(Set.Iio x) → ↑s} (hf : StrictMono f) (hy : y < x) :
(enum s hs) y ≤ f ⟨y, hy⟩
theorem Ordinal.enum_lt_of_lt_ord_cof {s : Set Ordinal.{u_1}} (hs : IsCofinal s) {x y : Ordinal.{u_1}} (hx : ∀ a < x, ∃ b ∈ s, b ∈ Set.Ico a x) (hy : y < x.cof.ord) :
↑((Order.enum s hs) y) < x
theorem Ordinal.enum_ord_cof_le {s : Set Ordinal.{u_1}} (hs : IsClub s) {x : Ordinal.{u_1}} (hx : ∀ a < x, ∃ b ∈ s, b ∈ Set.Ico a x) (hx' : Order.IsSuccLimit x) :
↑((Order.enum s ⋯) x.cof.ord) ≤ x

ω is a field #

Cardinality of closures #