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 are sets of surreals, then there is some surreal such that . The classical proof is simplified by observing that, for every set of surreals, there exists a surreal such that, for every surreal , we have if and only if the restriction of to the length of is . Hence if and only if satisfies the above condition, as well as its symmetrical version with respect to . It is now enough to check that if , then the two conditions are compatible.
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