Documentation

CombinatorialGames.SignExpansion.Surreal

Sign expansions #

In this file we define the correspondence between surreals and sign expansions. This map can be uniquely characterized as the order-preserving map such that every surreal gets mapped to a sign sequence whose length equals its birthday.

theorem sign_sub_eq_of_notMem_Icc {α : Type u_1} [LinearOrder α] [AddGroup α] [AddRightMono α] {x y z : α} (hxy : x ≤ y) (hz : z ∉ Set.Icc x y) :
theorem sign_sub_lt_of_mem_Icc {α : Type u_1} [LinearOrder α] [AddGroup α] [AddRightMono α] {x y z : α} (hxy : x < y) (hz : z ∈ Set.Icc x y) :
def SignType.recZeroNegOne {motive : SignType → Sort u_1} (zero : motive 0) (neg_one : motive (-1)) (one : motive 1) (t : SignType) :
motive t

Recursor for SignType using the preferred forms 0, -1, and 1.

Equations
Instances For
    @[simp]
    theorem SignType.recZeroNegOne_zero {motive : SignType → Sort u_1} (zero : motive 0) (neg_one : motive (-1)) (one : motive 1) :
    recZeroNegOne zero neg_one one 0 = zero
    @[simp]
    theorem SignType.recZeroNegOne_neg_one {motive : SignType → Sort u_1} (zero : motive 0) (neg_one : motive (-1)) (one : motive 1) :
    recZeroNegOne zero neg_one one (-1) = neg_one
    @[simp]
    theorem SignType.recZeroNegOne_one {motive : SignType → Sort u_1} (zero : motive 0) (neg_one : motive (-1)) (one : motive 1) :
    recZeroNegOne zero neg_one one 1 = one
    @[simp]
    theorem SignType.recZeroNegOne_neg {motive : SignType → Sort u_1} (zero : motive 0) (neg_one : motive (-1)) (one : motive 1) (t : SignType) :
    recZeroNegOne zero neg_one one (-t) = recZeroNegOne zero one neg_one t
    noncomputable def Surreal.trunc (o : NatOrdinal) :

    The truncation of a surreal to an ordinal o is the unique surreal trunc o x with birthday (trunc o x) ≤ o which compares the same to every y with birthday y < o.

    Equations
    Instances For
      @[simp]
      theorem Surreal.trunc_lt_iff_lt {x y : Surreal} {o : NatOrdinal} (hy : y.birthday < o) :
      (trunc o) x < y ↔ x < y
      theorem Surreal.lt_trunc_iff_lt {x y : Surreal} {o : NatOrdinal} (hy : y.birthday < o) :
      y < (trunc o) x ↔ y < x
      theorem Surreal.trunc_le_iff_le {x y : Surreal} {o : NatOrdinal} (hy : y.birthday < o) :
      (trunc o) x ≤ y ↔ x ≤ y
      theorem Surreal.le_trunc_iff_le {x y : Surreal} {o : NatOrdinal} (hy : y.birthday < o) :
      y ≤ (trunc o) x ↔ y ≤ x
      theorem Surreal.trunc_eq_of_birthday_le_of_forall_lt_gt_iff {x y : Surreal} {o : NatOrdinal} (hy : y.birthday ≤ o) (hlt : ∀ (z : Surreal), z.birthday < o → (y < z ↔ x < z)) (hgt : ∀ (z : Surreal), z.birthday < o → (z < y ↔ z < x)) :
      (trunc o) x = y
      theorem Surreal.trunc_eq_of_birthday_le_of_forall_le_ge_iff {x y : Surreal} {o : NatOrdinal} (hy : y.birthday ≤ o) (hle : ∀ (z : Surreal), z.birthday < o → (y ≤ z ↔ x ≤ z)) (hge : ∀ (z : Surreal), z.birthday < o → (z ≤ y ↔ z ≤ x)) :
      (trunc o) x = y
      @[simp]
      theorem Surreal.trunc_trunc {x : Surreal} {o₁ o₂ : NatOrdinal} :
      (trunc o₂) ((trunc o₁) x) = (trunc (min o₁ o₂)) x

      To every surreal is associated a unique sign expansion, which can be seen as a sequence of directions along an ordinal-depth complete binary tree. The o'th term of this sign sequence is + if trunc o x < x, - if x < trunc o x, and 0 if trunc o x = x.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For