Documentation

CombinatorialGames.Surreal.Birthday.Cut

Birthday of cuts #

We introduce the birthday of a (surreal) cut as Cut.birthday, and relate it to the birthdays of games and surreal numbers.

This definition doesn't exist in the literature, but it's useful in proving results about the birthdays of games. In particular, it allows us to prove the equality birthday_toGame : x.toGame.birthday = x.birthday for surreal numbers x. See https://mathoverflow.net/a/497645/147705 for a "plaintext" version of this proof.

Birthday of cuts #

noncomputable def Surreal.Cut.birthday (x : Cut) :

The birthday of a cut x is defined as the infimum of ⨆ a ∈ s, a.birthday + 1 over all sets s of surreals where either the infimum of the left cuts or the supremum of right cuts of s equals x.

The birthday takes values in WithTop NatOrdinal. Cuts with birthday ⊤ are precisely those where the set s is not small.

This isn't a term in the literature, but it's useful for proving that birthdays of surreals equal those of their associated games.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem Surreal.Cut.birthday_eq_sSup_birthday (x : Cut) :
    ∃ (s : Set Surreal), (sInf (⇑leftSurreal '' s) = x ∨ sSup (⇑rightSurreal '' s) = x) ∧ sSup ((fun (x : Surreal) => ↑x.birthday + 1) '' s) = x.birthday
    theorem Surreal.Cut.birthday_iInf_leftSurreal_le {ι : Type u_1} (f : ι → Surreal) :
    (⨅ (i : ι), leftSurreal (f i)).birthday ≤ ⨆ (i : ι), ↑(f i).birthday + 1
    theorem Surreal.Cut.birthday_iSup_rightSurreal_le {ι : Type u_1} (f : ι → Surreal) :
    (⨆ (i : ι), rightSurreal (f i)).birthday ≤ ⨆ (i : ι), ↑(f i).birthday + 1
    theorem Surreal.Cut.birthday_iInf_leftSurreal_le' {ι : Type u_1} (f : ι → Surreal) [Small.{u, u_1} ι] :
    (⨅ (i : ι), leftSurreal (f i)).birthday ≤ ↑(⨆ (i : ι), (f i).birthday + 1)
    theorem Surreal.Cut.birthday_iSup_rightSurreal_le' {ι : Type u_1} (f : ι → Surreal) [Small.{u, u_1} ι] :
    (⨆ (i : ι), rightSurreal (f i)).birthday ≤ ↑(⨆ (i : ι), (f i).birthday + 1)
    theorem Surreal.Cut.birthday_lt_sSup_birthday {a : Surreal} {s : Set Surreal} (ha : a ∈ s) :
    ↑a.birthday < sSup ((fun (x : Surreal) => ↑x.birthday + 1) '' s)
    theorem Surreal.Cut.exists_birthday_lt_of_mem_Ioo {x y z : Cut} (h : y ∈ Set.Ioo x z) :
    ∃ (a : Surreal), ↑a.birthday < y.birthday ∧ Fits a x z
    theorem Surreal.Cut.birthday_iInf_le {ι : Type u_1} (f : ι → Cut) :
    (⨅ (i : ι), f i).birthday ≤ ⨆ (i : ι), (f i).birthday
    theorem Surreal.Cut.birthday_iSup_le {ι : Type u_1} (f : ι → Cut) :
    (⨆ (i : ι), f i).birthday ≤ ⨆ (i : ι), (f i).birthday
    @[simp]

    The smallest birthday among numeric games equivalent to a surreal, is also the smallest birthday among all games in general.

    Small cuts #

    class inductive Surreal.Cut.Small (x : Cut) :

    We say that a cut is small when it's either the infimum of left cuts or the supremum of right cuts from a Small set of surreals.

    Instances
      instance Surreal.Cut.Small.iSup {ι : Type u_1} [Small.{u, u_1} ι] (f : ι → Cut) [∀ (i : ι), (f i).Small] :
      (⨆ (i : ι), f i).Small
      instance Surreal.Cut.Small.iInf {ι : Type u_1} [Small.{u, u_1} ι] (f : ι → Cut) [∀ (i : ι), (f i).Small] :
      (⨅ (i : ι), f i).Small
      theorem Surreal.Cut.Small.sSup {s : Set Cut} [Small.{u, u + 1} ↑s] (hs : ∀ x ∈ s, x.Small) :
      theorem Surreal.Cut.Small.sInf {s : Set Cut} [Small.{u, u + 1} ↑s] (hs : ∀ x ∈ s, x.Small) :
      instance Surreal.Cut.Small.vadd (x : Surreal) (y : Cut) [y.Small] :
      (x +ᵥ y).Small
      noncomputable def Surreal.Cut.player (x : Cut) [x.Small] :

      The player of a Small cut x is either left if x is the greatest lower bound of a Small set of surreals, or it's right if x is the least upper bound of a Small set of surreals. The sign expansion of a cut ends with a constant sequence of 1s iff its player is left, and it ends with a constant sequence of -1s iff its player is right.

      Equations
      Instances For
        @[simp]
        theorem Surreal.Cut.player_neg (x : Cut) [x.Small] :
        @[simp]
        theorem Surreal.Cut.player_vadd (x : Surreal) (y : Cut) [y.Small] :