{"id":120,"date":"2006-08-17T17:06:27","date_gmt":"2006-08-17T17:06:27","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2006\/08\/17\/introducing-the-surreal-numbers\/"},"modified":"2006-08-17T17:06:27","modified_gmt":"2006-08-17T17:06:27","slug":"introducing-the-surreal-numbers","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2006\/08\/17\/introducing-the-surreal-numbers\/","title":{"rendered":"Introducing the Surreal Numbers"},"content":{"rendered":"

Surreal numbers are a beautiful, simple, set-based construction that allows you to create and represent all real numbers, so that they behave properly; and<\/em> in addition, it allows you to create infinitely large and infinitely small values, and have them<\/em> behave and interact in a consistent way with the real numbers in their surreal representation.<\/p>\n

The surreals were invented by John Horton Conway (yes, that<\/em> John Conway, the same guy who invented the “Life” cellular automaton, and did all that amazing work in game theory). The name for surreal numbers was created by Don Knuth (yes, that<\/em> Don Knuth!).<\/p>\n

Surreal Numbers are something that has come up in discussions in the comments on a number of posts around here. Before they were first mentioned in a comment back when this blog was on Blogger, I had never heard of them. After someone said a little about them, I thought they sounded so cool that I rushed out and got the two main books that have been written about them: Conway’s “On Numbers and Games”, and Knuth’s “Surreal Numbers”.<\/p>\n

The Basic Rules<\/h3>\n

The basic idea of surreal numbers is that you can represent any<\/em> real number * using two sets: a set L which contains numbers less than<\/em> N, and a set R which contains numbers greater than<\/em> N. To make it easy to write, surreals are generally written N={ L | R }, where L is the definition of the set of values less than<\/em> N, and R is the definition of the set of values greater than<\/em> N.<\/p>\n

There are two fundamental rules for surreal numbers:<\/p>\n

    \n
  1. The Construction Rule<\/em>: If L and R are two sets of surreal numbers, and ∀ l ∈ L, r ∈ R : l < r, then { L | R } is a valid surreal number.<\/li>\n
  2. The Comparison Rule,\/em>: If x = {XL<\/sub> | XR<\/sub>} and y = {YL<\/sub> | YR<\/sub>} then x ≤ y if\/f:
    \n<\/em> ¬ ∃ xi<\/sub> ∈ XL<\/sub> : y ≤ xi<\/sub> (y is not less than and member of the left set of X)<\/em>, and ¬ ∃ yi<\/sub> ∈ YR<\/sub> : yi<\/sub> ≤ x. (x is not greater than any member of the right set of Y.)<\/em>.<\/li>\n<\/ol>\n

    In addition, we need two basic axioms: finite induction, and equality. Finite induction is basically the induction rule from the Peano axioms, so I won’t repeat it here. The equality rule for surreals is also very simple: x = y if\/f x ≤ y ∧ y ≤ x.<\/p>\n

    Constructing Integers<\/h3>\n

    With the rules set, we can start creating numbers. The first one we create is 0: we say that by definition<\/em>, 0 is the number with the empty set as its L and R values: 0 = { ∅ | ∅ }, also written { | }.<\/p>\n

    Next we want to define the basic unit values, 1 and -1. So how do we define 1? Well, the only number we have so far is 0. So we define 1 as the value with 0 in its left set, and an empty right set: 1 = {0|}. -1 is pretty much the same deal, except that it uses 0 as its right<\/em> set: -1 = {|0}.<\/p>\n

    We follow the same basic pattern for all of the integers: the positive integer i<\/em> is a surreal number with all of the positive integers less than i<\/em> in its left set, and an empty right set: i = { 0, …, i-2, i-1 | }. Similarly for the negatives: a negative number -i = { | -i+1, -i+2, … 0}.<\/p>\n

    Now, if we look at the possibilities for surreals so far – we’re always using a null set for either the left, the right, or both sets. What happens if, for a positive number i<\/em>, we leave out, say, i-2<\/em> in its left set?<\/p>\n

    What happens is nothing<\/em>. It’s effectively exactly the same number. Just think of the definition above, and look at an example: 4 = {0, 1, 2, 3 |}, and {2, 3|}. Is {0, 1, 2, 3|} ≤ {2, 3|}? Yes. Is {2, 3|} ≤ {0, 1, 2, 3|}? Yes. So they’re the same. So each integer is actually an equivalence class<\/em>. Each positive integer i<\/em> is the equivalence class of the surreal numbers formed by: { {l|} where l ⊂ { 0, …, i-1 } && i-1 ∈ l }.<\/p>\n

    At this point, we’ve got the ability to represent integers in the surreal form. But we haven’t even gotten to fractions, much less to infinites and infinitessimals.<\/p>\n

    Constructing Fractions<\/h3>\n

    The way we construct fractions is by dividing the range between two other numbers in half. So, for example, we can create the fraction 1\/2, by saying it’s the simplest number between 0 and 1: {0 | 1}. We can write 3\/4 by saying it’s halfway between 1\/2 and 1: {1\/2 | 1}.<\/p>\n

    This is, obviously, sort of limited. Given a finite left and right set for a number, we can only represent fractions whos denominators are powers of 2. So 1\/3 is out of the question. We can create a value that is as close to 1\/3 as we want, but we can’t get it exactly with finite left and right sets. (Fortunately, we aren’t<\/em> restricted to finite left and right sets. So we’ll let ourselves be lazy and write 1\/3, with the understanding that it’s really something like a continued fraction in surreal numbers.)<\/p>\n

    Happy Birthday to 2<\/h3>\n

    One thing that’s important in understanding the surreals is the idea of a birthday<\/em>.<\/p>\n

    We started creating surreals with the number 0 = {|}. We say that 0 has the integer<\/em> 0<\/em> as its birthday.<\/p>\n

    Then we created 1 and negative one. So it took one step each to get from the set of surreals we knew about to get to the new set consisting of {|0}, {|}, {0|}, or -1, 0, and 1. So -1 and 1 have a birthday of 1<\/em>.<\/p>\n

    Once we had -1, 0, and 1, we could create -2, -1\/2, 1\/2, and 2 in one step. So they had a birthday of 2<\/em>.<\/p>\n

    What we’re doing here is creating an idea of ordinals<\/em>: the ordinal of a surreal number is its birthday – the number of steps it took until we could create that number.<\/p>\n

    Given any surreal number {L|R}, the value that it represents is the value between the largest value in L and the smallest value in R with the earliest birthday<\/em> (or, equivalently, the lowest ordinal).<\/p>\n

    So if we had, for example {1, 2, 3 |} (a surreal for 4), and {23|} (a surreal for 24), then then surreal number { {1, 2, 3|} | {23|} } would be 5<\/em> – because it’s the surreal between 4 and 24 with the earliest birthday.<\/p>\n

    What about infinity?<\/h3>\n

    I promised that you could talk about infinity in interesting ways.<\/p>\n

    Let’s call the size<\/em> of the set of natural numbers ω. What can we create with birthday ω + 1? Things with birthday ω+1 are things that require infinite<\/em> L and R sets. So, for example, in step ω+1, we can create a precise version of 1\/3.<\/p>\n

    How?<\/p>\n

      \n
    • Let’s give a name to the of all surreal numbers with birthday N. We’ll call it SN<\/sub><\/em>.<\/li>\n
    • The left set of 1\/3 is: { x\/2y<\/sup> ∈ Sω<\/sub> : 3x < 2y<\/sup>}<\/li>\n
    • The right set of 1\/3 is: { x\/2y<\/sup> ∈ Sω<\/sub> : 3x > 2y<\/sup> }<\/li>\n
    • So 1\/3 = { { x\/2y<\/sup> ∈ Sω<\/sub> : 3x < 2y<\/sup>} | { x\/2y<\/sup> ∈ Sω<\/sub> : 3x > 2y<\/sup> } }, and its birthday is ω+1.<\/li>\n
    • Using pretty much the same trick, we can create a number that represents the size<\/em> of the set of natural numbers, which we’ll call infinity. ∞ = { {x ∈ Sω<\/sub>} | }, with birthday ω+1. And then, obviously, ∞+1 = { ∞ | }, with birthday ω+2. And ∞\/2 = { 0 | ∞ }, also with birthday ω+2.<\/li>\n<\/ul>\n

      Infinitesimals are more of the same. To write an infinitely small number, smaller than any real<\/em> fraction, what we do is say: { 0 | { 1\/2, 1\/4, 1\/8, 1\/16, … } }, with birthday ω+1.<\/p>\n

      What about irrationals? No problem! They’re also in Sω+1<\/sub>. We use a powers-of-2 version of continued fractions.<\/p>\n

      π = {3, 25\/8, 201\/64, … | …, 101\/32, 51\/16, 13\/4, 7\/2, 4}, birthday=ω+1.<\/p>\n

      Coming Soon<\/h3>\n

      Either tomorrow or next monday (depending on how much time I have), I’ll show you how to do arithmetic with surreal numbers.<\/p>\n","protected":false},"excerpt":{"rendered":"

      Surreal numbers are a beautiful, simple, set-based construction that allows you to create and represent all real numbers, so that they behave properly; and in addition, it allows you to create infinitely large and infinitely small values, and have them behave and interact in a consistent way with the real numbers in their surreal representation. […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[43],"tags":[],"class_list":["post-120","post","type-post","status-publish","format-standard","hentry","category-numbers"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-1W","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/120","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/comments?post=120"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/120\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=120"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=120"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=120"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}