Help with Knuth’s Surreal Numbers

surreal-numbers

I'm reading D. E. Knuth's book "Surreal Numbers". And I'm completely stuck in chap. 6 (The Third Day) because there is a proof I don't understand. Alice says

Suppose at the end of $n$ days, the numbers are $$x_1<x_2<\dots<x_m$$

She demonstrates that $x_i \equiv (\{x_{i-1}\},\{x_{i+1}\})$ and she begins the proof by saying

Look, each element of $X_{iL}$ is $\le x_{i-1}$, and each element of
$X_{iR}$ is $\ge x_{i+1}$.

That first step of the proof is the one I don't understand. Can someone show me how to demonstrate that statement?

Best Answer

Conway's second rule says that

One number is less than or equal to another number if and only if no member of the first number's left set is greater than or equal to the second number, and [other stuff].

So $x_i=x_i$ implies that no member of $X_{iL}$ is $\ge x_i$; hence every member of $X_{iL}$ is strictly less than $x_i$. With the additional assumption that the only numbers created so far are $x_1 < x_2 < \ldots <x_m$, this means that every member of $X_{iL}$ is $\le x_{i-1}$. The proof that every member of $X_{iR}$ is $\ge x_{i+1}$ is exactly analogous.

Related Question