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.
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 isordinalSum.
Equations
- x ∶ y = !{fun (p : Player) => IGame.moves p x ∪ Set.range fun (z : ↑(IGame.moves p y)) => x ∶ ↑z}
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 isordinalSum.
Equations
- IGame.«term_∶_» = Lean.ParserDescr.trailingNode `IGame.«term_∶_» 70 70 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∶ ") (Lean.ParserDescr.cat `term 71))
Instances For
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.
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.
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.
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.
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.
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.