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 #
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
Small cuts #
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.
- infLeft (s : Set Surreal) [Small.{u, u + 1} ↑s] : (sInf (⇑leftSurreal '' s)).Small
- supRight (s : Set Surreal) [Small.{u, u + 1} ↑s] : (sSup (⇑rightSurreal '' s)).Small
Instances
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
- x.player = if ∃ (s : Set Surreal), Small.{?u.1, ?u.1 + 1} ↑s ∧ sInf (⇑Surreal.Cut.leftSurreal '' s) = x then Player.left else Player.right