surreal number



Surreal numbers (or Conway numbers, after John H. Conway) originally arose in the context of combinatorial games?, as a kind of generalized quantity for measuring strength of positions. The class of surreal numbers forms an ordered field in which any small ordered field may be embedded, so that the field of surreal numbers forms a universal field for expressing any set-bounded degree of infinite and infinitesimal quantities. Any ordinal number may be construed as a surreal number, and new surreal numbers may be defined from old ones by generalizing the notion of Dedekind cut. Surreal numbers are a very large extension of real numbers, where one may make sense of fanciful quantities such as

(ω 2+5ω13) 132ω+π(\omega^2 + 5\omega - 13)^{\frac1{3} - \frac{2}{\omega}} + \pi

The term “surreal number” was introduced by Donald Knuth, who wrote a short novel about a couple who check out from Western civilization and live on a remote beach in India and who, finding a mysterious engraved stone and with an abundance of time to spend on things besides food and sex, discover for themselves surreal numbers and their delightful properties.

Conway-style definitions

The notions of Conway game and Conway number, as given by Conway in his book On Numbers and Games, are disarmingly simple-looking. Here is a Conway-style definition of game:

  • A game GG consists of a set of games called left options of GG, and a set of games called right options of GG. All games are constructed this way.

The second sentence is a shorthand way of saying this is supposed to be a recursive or inductive definition: if a collection G LG^L of left options and a collection G RG^R is given, one can construct a game G={G L|G R}G = \{G^L \vert G^R\}. Games are built recursively, starting with G={|}G = \{\emptyset \vert \emptyset\}.

Here is a Conway-style definition of number:

  • A number xx consists of a set L xL_x of numbers and a set R xR_x of numbers, under the condition that no member of L xL_x is \geq any member of R xR_x

followed immediately by a recursive definition of \geq:

  • xyx \geq y if yxy \geq x' is false for any xR xx' \in R_x and yxy' \geq x is false for any yL yy' \in L_y.

Ultimately, each number xx is considered to be a (Dedekind) cut between the set of left options (which are ‘below’ xx) and the set of right options (which are ‘above’ xx).

Equality of numbers is a derived notion:

  • x=yx = y is defined to mean xyx \geq y and yxy \geq x.

Finally, field operations on surreal numbers are defined recursively:

  • x+yx + y is defined by letting L x+yL_{x+y} be the set {x+y|xL x}{x+y|yL y}\{x' + y \vert x' \in L_x\} \cup \{x + y' \vert y' \in L_y\}, and R x+yR_{x+y} the set {x+y|xR x}{x+y|yR y}\{x' + y \vert x' \in R_x\} \cup \{x + y' \vert y' \in R_y\};

  • x-x is defined by letting L xL_{-x} be the set of negatives of elements of R xR_x, and R xR_{-x} the set of negatives of L xL_x;

  • xyx y is defined by letting L xyL_{x y} be the set {xy+xyxy|x,xL x,y,yL y}{xy+xyxy|x,xR x,y,yR y}\{x' y + x y' - x'' y'' \vert x', x'' \in L_x, y', y'' \in L_y\} \cup \{x' y + x y' - x'' y'' \vert x', x'' \in R_x, y', y'' \in R_y\}, and R xyR_{x y} be the set {xy+xyxy|x,xL x,y,yR y}{xy+xyxy|x,xR x,y,yL y}\{x' y + x y' - x'' y'' \vert x', x'' \in L_x, y', y'' \in R_y\} \cup \{x' y + x y' - x'' y'' \vert x', x'' \in R_x, y', y'' \in L_y\}.

The style of such definitions is familiar from material set theory, where elements are conceived to be sets of elements, which themselves have elements, and so on, down to a bedrock established by a foundation axiom. In fact, games can be axiomatized as elements of a structure with two predicates L\in_L, R\in_R satisfying some set-theoretic axioms.

In constructive mathematics

The definition of \geq for numbers as formulated by Conway leans heavily upon properties of negation, and in particular the classical principle of excluded middle. However, it can be made more constructive by defining <\lt separately from \le:

  • A number xx consists of a set L xL_x of numbers and a set R xR_x of numbers, under the condition that every member of L xL_x is <\lt every member of R xR_x.
  • xyx \leq y if x<yx' \lt y is true for any xL xx' \in L_x, and x<yx \lt y' is true for any yR yy' \in R_y.
  • x<yx \lt y if there exists an xR xx'\in R_x such that xyx'\le y, or there exists a yL yy'\in L_y such that xyx\le y'.
  • x=yx = y is defined to mean xyx \le y and yxy \le x.

This approach works up to a point. However, it encounters a problem in proving that multiplication is well-defined, i.e. that it respects equality. We can prove that if x0x\ge 0 then yzxyxzy\le z \Rightarrow x y \le x z and hence y=zxy=xzy = z \Rightarrow x y = x z, and that if x0x\le 0 then yzxyxzy\le z \Rightarrow x y \ge x z and hence y=zxy=xzy = z \Rightarrow x y = x z; but without excluded middle we can’t say that every xx is either 0\ge 0 or 0\le 0, so how can we conclude that y=zxy=xzy = z \Rightarrow x y = x z? It is unknown whether there is a solution to this problem.

Structural approach

It is a routine matter to rewrite the definitions in a more structural fashion, say within ETCS. In outline, a game is a rooted tree with no infinite branches and equipped with a labeling of each edge by a symbol LL or RR. The nodes are called positions of the game. The root is the initial position, and starting from any position, there are positions that a player named LeftLeft may move to, and positions that the other player RightRight may move to, according to the edge-labelings. Any sequence of moves proceeding from the initial position (and not necessarily alternating between LeftLeft and RightRight) must eventually terminate, since there are no infinite branches.

Each position has a definite depth nn, where nn is the number of edges one must back-track through along the unique path that leads back to the initial position. A tree is thus an internal presheaf XX on the ordered set ω\omega, whose value at the initial object 0ω0 \in \omega is terminal (occupied by the initial position), and where X(n)X(n) is the set of positions at depth nn. A move is a morphism in the corresponding category of elements of the presheaf, and moves are labeled by LL or RR.

In this set-up, the condition of no infinite branches plays the role of a foundation axiom, and inductive arguments tend to devolve upon the use of the principle of dependent choice.

Numbers may be similarly elaborated within this context. The definition of \geq on numbers is ultimately derived from a posetal reflection of a category of games (with strategies as morphisms), and the definition of addition of numbers is derived from a Day convolution product on the category of games. More information may be found at Conway game?.

In homotopy type theory

In homotopy type theory, the surreal numbers can be defined as a higher inductive type, roughly following Conway’s definition but imposing the “defined” notion of equality as the “actual” equality with an identification-constructor. This can also be done constructively by separating <\lt from \le, as remarked above. See chapter 12 of the HoTT Book.

Properties of surreal numbers

The surreal numbers form a large (i.e., proper-class size) real closed field with exponentiation.

To some degree, and with appropriate caveats, one can do analysis and number theory on surreal numbers. We refer to Conway’s book for more information.


  • John H. Conway, On Numbers and Games (2 nd2^{nd} edition), A.K. Peters, Ltd (2001).

  • Donald E. Knuth, Surreal numbers, Addison-Wesley (1974)

  • The HoTT Book, chapter 12.

Revised on January 18, 2016 21:24:27 by Mike Shulman (