Documentation

CombinatorialGames.Game.OrdinalSum

Ordinal sum of games #

The ordinal sum of two games x and y, written x ∶ y, is defined as {xᴸ, x ∶ yᴸ | xᴿ, x ∶ yᴿ}. Moving in y is done as in the ordinary sum, but a move in x destroys the other component y of the sum.

@[irreducible]

The ordinal sum of x and y is played like the ordinary sum, but making a move in x destroys the other component y of the sum.

Conventions for notations in identifiers:

  • The recommended spelling of ∶ in identifiers is ordinalSum.
Equations
Instances For

    The ordinal sum of x and y is played like the ordinary sum, but making a move in x destroys the other component y of the sum.

    Conventions for notations in identifiers:

    • The recommended spelling of ∶ in identifiers is ordinalSum.
    Equations
    Instances For
      theorem IGame.moves_ordinalSum (p : Player) (x y : IGame) :
      moves p (x ∶ y) = moves p x ∪ x.ordinalSum '' moves p y
      theorem IGame.forall_moves_ordinalSum {q : IGame → Prop} {p : Player} {x y : IGame} :
      (∀ z ∈ moves p (x ∶ y), q z) ↔ (∀ z ∈ moves p x, q z) ∧ ∀ z ∈ moves p y, q (x ∶ z)
      theorem IGame.exists_moves_ordinalSum {q : IGame → Prop} {p : Player} {x y : IGame} :
      (∃ z ∈ moves p (x ∶ y), q z) ↔ (∃ z ∈ moves p x, q z) ∨ ∃ z ∈ moves p y, q (x ∶ z)
      @[simp]
      theorem IGame.neg_ordinalSum (x y : IGame) :
      -(x ∶ y) = -x ∶ -y
      @[simp]
      theorem IGame.ordinalSum_zero (x : IGame) :
      x ∶ 0 = x
      @[simp]
      theorem IGame.zero_ordinalSum (x : IGame) :
      0 ∶ x = x
      theorem IGame.ordinalSum_assoc (x y z : IGame) :
      x ∶ y ∶ z = x ∶ (y ∶ z)
      @[simp]
      @[simp]
      theorem IGame.ordinalSum_lt_ordinalSum_iff_left {x y z : IGame} :
      x ∶ y < x ∶ z ↔ y < z
      @[simp]
      theorem IGame.ordinalSum_fuzzy_ordinalSum_iff_left {x y z : IGame} :
      x ∶ y ‖ x ∶ z ↔ y ‖ z
      @[simp]
      theorem IGame.ordinalSum_equiv_ordinalSum_iff_left {x y z : IGame} :
      x ∶ y ≈ x ∶ z ↔ y ≈ z
      theorem IGame.ordinalSum_le_ordinalSum_right (x : IGame) {y z : IGame} (h : y ≤ z) :
      x ∶ y ≤ x ∶ z
      theorem IGame.ordinalSum_lf_ordinalSum_right (x : IGame) {y z : IGame} (h : ¬z ≤ y) :
      ¬x ∶ z ≤ x ∶ y
      theorem IGame.ordinalSum_lt_ordinalSum_right (x : IGame) {y z : IGame} (h : y < z) :
      x ∶ y < x ∶ z
      theorem IGame.ordinalSum_fuzzy_ordinalSum_right (x : IGame) {y z : IGame} (h : y ‖ z) :
      x ∶ y ‖ x ∶ z
      theorem IGame.ordinalSum_right_congr (x : IGame) {y z : IGame} (h : y ≈ z) :
      x ∶ y ≈ x ∶ z
      theorem IGame.ordinalSum_le_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      x ∶ y ≤ z ↔ x ≤ z

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then x ∶ y ≤ z exactly when x ≤ z.

      theorem IGame.le_ordinalSum_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      z ≤ x ∶ y ↔ z ≤ x

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then z ≤ x ∶ y exactly when z ≤ x.

      theorem IGame.ordinalSum_lf_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      ¬z ≤ x ∶ y ↔ ¬z ≤ x

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then x ∶ y ⧏ z exactly when x ⧏ z.

      theorem IGame.lf_ordinalSum_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      ¬x ∶ y ≤ z ↔ ¬x ≤ z

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then z ⧏ x ∶ y exactly when z ⧏ x.

      theorem IGame.ordinalSum_lt_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      x ∶ y < z ↔ x < z

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then x ∶ y < z exactly when x < z.

      theorem IGame.lt_ordinalSum_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      z < x ∶ y ↔ z < x

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then z < x ∶ y exactly when z < x.

      theorem IGame.ordinalSum_fuzzy_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      x ∶ y ‖ z ↔ x ‖ z

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then x ∶ y ‖ z exactly when x ‖ z.

      theorem IGame.fuzzy_ordinalSum_iff_of_forall_wsubposition {x y z : IGame} (h : ∀ (c : IGame), c.WSubposition z → ¬x ≈ c) :
      z ‖ x ∶ y ↔ z ‖ x

      Part of Norton's Lemma: if z does not have a game equivalent to x as a subposition, then z ‖ x ∶ y exactly when z ‖ x.