Documentation

CombinatorialGames.Game.Stops

Left and right stops #

The functions Surreal.Cut.leftGame and Surreal.Cut.rightGame, defined in Surreal.Cut, define the left and right stops of a game as cuts. Whenever the game is short, these cuts are always numeric, and their endpoints are dyadic rationals. This file defines the Dyadic-valued versions of these functions.

noncomputable def IGame.leftStop (x : IGame) [x.Short] :

The left stop of a short game is the dyadic number which defines leftGame (mk x).

Every surreal y with leftStop x < y satisfies x < y (lt_of_lt_rightStop), and every surreal y with y < leftStop x satisfies y ⧏ x (lf_of_lt_leftStop).

Equations
Instances For
    noncomputable def IGame.rightStop (x : IGame) [x.Short] :

    The right stop of a short game is the dyadic number which defines rightGame (mk x).

    Every surreal y with y < rightStop x satisfies y < x (lt_of_leftStop_lt), and every surreal y with rightStop x < y satisfies x ⧏ y (lf_of_rightStop_lt).

    Equations
    Instances For
      theorem IGame.lt_of_leftStop_lt {x y : IGame} [x.Short] [y.Numeric] (h : ↑x.leftStop < y) :
      x < y
      theorem IGame.lf_of_lt_leftStop {x y : IGame} [x.Short] [y.Numeric] (h : y < ↑x.leftStop) :
      ¬x ≤ y
      theorem IGame.lt_of_lt_rightStop {x y : IGame} [x.Short] [y.Numeric] (h : y < ↑x.rightStop) :
      y < x
      theorem IGame.lf_of_rightStop_lt {x y : IGame} [x.Short] [y.Numeric] (h : ↑x.rightStop < y) :
      ¬y ≤ x
      @[simp]
      @[simp]
      theorem IGame.leftStop_congr {x y : IGame} [x.Short] [y.Short] (h : x ≈ y) :
      theorem IGame.rightStop_congr {x y : IGame} [x.Short] [y.Short] (h : x ≈ y) :