English

A clean way to separate sets of surreals

Number Theory 2018-05-22 v3

Abstract

Let surreal numbers be defined by means of sign sequences. We give a proof that if S<TS < T are sets of surreals, then there is some surreal ww such that S<w<TS < w < T. The classical proof is simplified by observing that, for every set SS of surreals, there exists a surreal ss such that, for every surreal ww, we have S<wS<w if and only if the restriction of ww to the length of ss is s \geq s. Hence S<w<TS < w < T if and only if ww satisfies the above condition, as well as its symmetrical version with respect to TT. It is now enough to check that if S<TS < T, then the two conditions are compatible.

Keywords

Cite

@article{arxiv.1712.03500,
  title  = {A clean way to separate sets of surreals},
  author = {Paolo Lipparini},
  journal= {arXiv preprint arXiv:1712.03500},
  year   = {2018}
}

Comments

v.2, some further simplifications; v3 fixed a misprint in the main definition