Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
586 views
114 pages
Surreal Numbers (PDFDrive)
Mathematics issues
Uploaded by
Manuel Guardia Araujo
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save Surreal Numbers ( PDFDrive ) For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
0 ratings
0% found this document useful (0 votes)
586 views
114 pages
Surreal Numbers (PDFDrive)
Mathematics issues
Uploaded by
Manuel Guardia Araujo
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save Surreal Numbers ( PDFDrive ) For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
Download
Save Surreal Numbers ( PDFDrive ) For Later
You are on page 1
/ 114
Search
Fullscreen
how two ex-students turned on to pure mathematics and found total happiness 1 ee oes eft by D. E. Knuth SURREAL NUMBERS Sik dag a mathematical novelette wv ADDISON WESLEYThis book has been typeset with TeX, in Computer Modern with Albertus chapter headings. The cover and illustrations were designed by Jill C. Knuth. Internet page http: //www-cs-faculty.stanford.edu/~knuth/sn.html contains current information about this book and related books. Copyright © 1974 by Addison—Wesley Publishing Company, Inc. Phillippines copyright 1974 by Addison—Wesley Publishing Company, Inc. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher. Printed in the United States of America. Pub- lished simultaneously in Canada. Library of Congress Catalog Card No. 74-5998. ISBN 0-201-03812-9 171819 BKMBKM 09876 Seventeenth printing, April 2006CONTENTS I 2 3 4 5 6 7 8 ? 10 I 12 13 14 15 16 The Rock ..............0.0.- 1 Symbols . . : B60 odo oo oo OG 8 roots es 14 Bad Numbers: 19 Progress ... 2... 2... ee eee eee 27 The Third Day .............0.0. 34 Discovery ... 2... 2... eee ee 41 (Addition 48 mle AnsWen 55 Theorems ..... 1... 2... eee eee 63 The Proposal .............-4.4. 71 Disaster. 2 2 2. 76 Recovery .. 2... ee ee ee eee 82 The Universe ... 2... 2... ...04. 89 Infinity 2... .........2.2.-2028. 97 Multiplication .............04. 106 [Heciyess 5 5 9 46 6 6 5 5 50 5 6 5 ob oo 113I THE ROCKA. Bill, do you think you’ve found yourself? B. What? A. I mean — here we are on the edge of the Indian Ocean, miles away from civilization. It’s been months since we ran off to avoid getting swept up in the system, and “to find ourselves.” I’m just wondering if you think we’ve done it.B. Actually, Alice, I’ve been thinking about the same thing. These past months together have been really great — we’re completely free, we know each other, and we feel like real people again in- stead of like machines. But lately I’m afraid I’ve been missing some of the things we’ve “escaped” from. You know, I’ve got this fantastic craving for a book to read— any book, even a textbook, even a math textbook. It sounds crazy, but I’ve been lying here wishing I had a crossword puzzle to work on. A. Oh, c’mon, not a crossword puzzle; that’s what your parents like to do. But I know what you mean, we need some mental stimulation. It’s kinda like the end of summer vacations when we were kids. In May every year we couldn’t wait to get out of school, and the days simply dragged on until vacation started, but by September we were real glad to be back in the classroom. B. Of course, with a loaf of bread, a jug of wine, and thou beside me, these days aren’t exactly “dragging on.” But I think maybe the most important thing I’ve learned on this trip is that the simple, romantic life isn’t enough for me. I need something com- plicated to think about. A. Well, I’m sorry I’m not complicated enough for you. Why don’t we get up and explore some more of the beach? Maybe we’ll find some pebbles or something that we can use to make up some kind of a game. B. (sitting up) Yeah, that’s a good idea. But first I think I’ll take a little swim. A. (running toward the water) Me, too— bet you can’t catch me! B. Hey, what’s that big black rock half-buried in the sand over there?. Search me, I’ve never seen anything like it before. Look, it’s got some kind of graffiti on the back. . Let’s see. Can you help me dig it out? It looks like a museum piece. Unnh! Heavy, too. The carving might be some old Ara- bian script ... no, wait, I think it’s maybe Hebrew; let’s turn it around this way. . Hebrew! Are you sure? . Well, I learned a lot of Hebrew when I was younger, and I can almost read this. ... . I heard there hasn’t been much archeological digging around these parts. Maybe we’ve found another Rosetta Stone or some- thing. What does it say, can you make anything out? . Wait a minute, gimme a chance. ... Up here at the top right is where it starts, something like “In the beginning everything was void, and ...” . Far out! That sounds like the first book of Moses, in the Bible. Wasn’t he wandering around Arabia for forty years with his followers before going up to Israel? You don’t suppose ... . No, no, it goes on much different from the traditional account. Let’s lug this thing back to our camp, I think I can work out a translation. . Bill, this is wild, just what you needed! . Yeah, I did say I was dying for something to read, didn’t I. Al- though this wasn’t exactly what I had in mind! I can hardly wait to get a good look at it —some of the things are kinda strange, and I can’t figure out whether it’s a story or what. There’s something about numbers, and ... . It seems to be broken off at the bottom; the stone was origi- nally longer.B. A good thing, or we’d never be able to carry it. Of course it’ll be just our luck to find out the message is getting interesting, right when we come to the broken place. A. Here we are. I’ll go pick some dates and fruit for supper while you work out the translation. Too bad languages aren’t my thing, or I'd try to help you. B. Okay, Alice, I’ve got it. There are a few doubtful places, a cou- ple signs I don’t recognize; you know, maybe some obsolete word forms. Overall I think I know what it says, though I don’t know what it means. Here’s a fairly literal translation: In the beginning, everything was void, and J. H. W. H. Conway began to create numbers. Conway said, “Let there be two rules which bring forth all numbers large and small. This shall be the first rule: Every number corresponds to two sets of previously created numbers, such that no member of the left set is greater than or equal to any member of the right set. And the second rule shall be this: 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 no member of the second number’s right set is less than or equal to the first number.” And Conway examined these two rules he had made, and behold! They were very good. And the first number was created from the void left set and the void right set. Conway called this number “zero,” and said that it shall be a sign to separate positive num- bers from negative numbers. Conway proved that zero was less than or equal to zero, and he saw that it was good. And the evening and the morning were the day of zero. On the next day, two more numbers were created, onewo with zero as its left set and one with zero as its right set. And Conway called the former number “one,” and the latter he called “minus one.” And he proved that minus one is less than but not equal to zero and zero is less than but not equal to one. And the evening ... That’s where it breaks off. . Are you sure it reads like that? . More or less. I dressed it up a bit. . But “Conway” ... that’s not a Hebrew name. You’ve got to be kidding. . No, honest. Of course the old Hebrew writing doesn’t show any vowels, so the real name might be Keenawu or something; maybe related to the Khans? I guess not. Since I’m translating into English, I just used an English name. Look, here are the places where it shows up on the stone. The J. H. W. H. might also stand for “Jehovah.” . No vowels, eh? So it’s real. ... But what do you think it means? . Your guess is as good as mine. These two crazy rules for num- bers. Maybe it’s some ancient method of arithmetic that’s been obsolete since the wheel was invented. It might be fun to figure them out, tomorrow; but the sun’s going down pretty soon so we'd better eat and turn in. . Okay, but read it to me once more. I want to think it over, and the first time I didn’t believe you were serious. . (pointing) “In the beginning, ...”2 SYMBOLS oO anata 3 os Hae tas a oe yf OE carey wn fore alA. B. I think your Conway Stone makes sense after all, Bill. I was thinking about it during the night. So was I, but I dozed off before getting anywhere. What’s the secret? It’s not so hard, really; the trouble is that it’s all expressed in words. The same thing can be expressed in symbols and then you can see what’s happening.. You mean we’re actually going to use the New Math to decipher this old stone tablet. . [hate to admit it, but that’s what it looks like. Here, the first rule says that every number z is really a pair of sets, called the left set xz, and the right set xp: z= (cL, £R). . Wait asec, you don’t have to draw in the sand, I think we still have a pencil and some paper in my backpack. Just a minute. ... Here, use this. x= (rz, 2p). These xz and xp are not just numbers, they’re sets of numbers; and each number in the set is itself a pair of sets, and so on. . Hold it, your notation mixes me up. I don’t know what’s a set and what’s a number. . Okay, I’ll use capital letters for sets of numbers and small letters for numbers. Conway’s first rule is that z= (Xz1,Xr), where Xr + Xr. (1) This means if x, is any number in Xz and if rr is any number in Xp, they must satisfy x, + zp. And that means 7, is not greater than or equal to rp. . (scratching his head) I’m afraid you’re still going too fast for me. Remember, you’ve already got this thing psyched out, but Tm still at the beginning. If a number is a pair of sets of num- bers, each of which is a pair of sets of numbers, and so on and so on, how does the whole thing get started in the first place? . Good point, but that’s the whole beauty of Conway’s scheme. Each element of X; and Xp must have been created previ- ously, but on the first day of creation there weren’t any previous 10number to work with; so both X; and Xp were taken to be the empty set! Boi never thought I’d live to see the day when the empty set was meaningful. That’s really creating something out of nothing, eh? But is Xz, + Xp when X;, and Xp are both equal to the empty set? How can you have something unequal itself? Oh yeah, yeah, that’s okay since it means no element of the empty set is greater than or equal to any element of the empty set — it’s a true statement because there aren’t any elements in the empty set. A. So everything gets started all right, and that’s the number called zero. Using the symbol ? to stand for the empty set, we can write 0= (0,6). B. Incredible. A. Now on the second day, it’s possible to use 0 in the left or right set, so Conway gets two more numbers —1= (0, {0}) and = 1 = ({0}, 9). B. Let me see, does this check out? For —1 to be a number, it has to be true that no element of the empty set is greater than or equal to 0. And for 1, it must be that 0 is not greater than any element of the empty set. Man, that empty set sure gets around! Someday I think I’ll write a book called Properties of the Empty Set. A. You’d never finish. If X, or Xp is empty, the condition Xz, + Xp is true no matter what is in the other set. This means that infinitely many num- bers are going to be created. 11. Okay, but what about Conway’s second rule? . That’s what you use to tell whether X; t Xp, when both sets are nonempty; it’s the rule defining less-than-or-equal. Symboli- cally, a
x. . Yeah, you’re right. Hey, wait a sec, look here at these carvings off to the side: eo= « | =
0, we know that, so 0 < —1. He was right. . I wonder if Conway also tested —1 against 1; I suppose he did, although the rock doesn’t say anything about it. If the rules are any good, there should be a way to prove that —1 is less than 1. . Well, let’s see: —1 is (0, {0}) and 1 is ({0},0), so once again the empty set makes —1 < 1 by rule (2). On the other hand, 1 < —1 is the same as saying that 0 $ —land1 + 0, according to rule (2), but we know that both of these are false. Therefore 1 < —1, and it must be that —1 < 1. Conway’s rules seem to be working. . Yes, but so far we’ve been using the empty set in almost every argument, so the full implications of the rules aren’t clear yet. 16Have you noticed that almost everything we’ve proved so far can be put into a framework like this: “If X and Y are any sets of numbers, then z = (0, X) and y = (Y,@) are numbers, and gz < y.” . It’s neat the way you’ve just proved infinitely many things, by looking at the pattern I used in only a couple of cases. I guess that’s what they call abstraction, or generalization, or something. But can you also prove that your z is strictly less than y? That was true in all the simple cases and I bet it’s true in general. . Ub huh ... Well no, not when X and Y are both empty, since that would mean 0 $ 0. But otherwise it looks very interesting. Let’s look at the case when X is the empty set and Y is not empty; is it true that 0 is less than (Y,0)? . If so, then I’d call (Y,@) a “positive” number. That must be what Conway meant by zero separating the positive and nega- tive numbers. . Yes, but look. According to rule (2), we will have (Y,@) < 0 if and only if no member of Y is greater than or like 0. So if, for example, Y is the set {—1}, then (Y,@) < 0. Do you want positive numbers to be < 0? Too bad I didn’t take you up on that bet. . Hmm. You mean (Y,9) is going to be positive only when Y contains some number that is zero or more. I suppose you’re right. But at least we now understand everything that’s on the stone. A. Everything up to where it’s broken off. . You mean ...? A. I wonder what happened on the third day. 17. Yes, we should be able to figure that out, now that we know the rules. It might be fun to work out the third day, after lunch. . You’d better go catch some fish; our supply of dried meat is getting kinda low. I’ll go try and find some coconuts. 184 BAD NUMBERS. I’ve been working on that Third Day problem, and I’m afraid it’s going to be pretty hard. When more and more numbers have been created, the number of possible sets goes up fast. I bet that by the seventh day, Conway was ready for a rest. . Right. I’ve been working on it too and I get seventeen numbers on the third day. 21B. Really? I found nineteen; you must have missed two. Here’s my list: (:> <=—3)
) (I> <—e:> (—I:>
(eft) <:=—> <:e> C> <—e> C=)
(:—el> {—e>
(—e:1) <—eI> A. I see you’re using the Stone’s notation. But why did you include €: > ? That was created already on the first day. B. Well, we have to test the new numbers against the old, in order to see how they fit in. A. But I only considered new numbers in my list of seventeen, so there must actually be twenty different at the end of the third day. Look, you forgot to include «—21> in your list. B. (blinking) So I did. Hmm ... 20 by 20, that’s 400 different cases we'll have to consider in rule (2). A lot of work, and not much fun either. But there’s nothing else to do, and I know it’ll bug me until I know the answer. A. Maybe we’ll think of some way to simplify the job once we get started. B. Yeah, that would be nice. ... Well, I’ve got one result, 1 is less than ({1},0). First I had to prove that 0 + ({1}, 0). A. I’ve been trying a different approach. Rule (2) says we have to test every element of Xz, to see that it isn’t greater than or like y, but it shouldn’t be necessary to make so many tests. If 22any element of Xz, is > y, then the largest element of X;, ought to be > y. Similarly, we need only test xz against the smallest element of Yr. . Yeah, that oughta be right. ... I can prove that 1 is less than ({0, 1}, @) just like I proved it was less than ({1}, 0); the extra “0” in Xz, didn’t seem to make any difference. . If what I said is true, it will save us a lot of work, because each number (X,,XpR) will behave in all < relations exactly as if X, were replaced by its largest element and XR by its smallest. We won’t have to consider any numbers in which X;, or Xp have two or more elements; ten of those twenty numbers in the list will be eliminated! . I’m not sure I follow you, but how on earth can we prove such a thing? . What we seem to need is something like this: if oy and y <2, then z
z, or there is a number zr in ZR for which x > zz. With all these facts about z, y, and z, we ought to be able to prove something. . Well, since zy, is in Xz, it can’t be greater than or like y. Say it’s less than y. But y < z, so rz must be... no, sorry, I can’t use facts about numbers we haven’t proved. Going the other way, we know that y < zandz < gz, and y € 21; so this gives us three more bad numbers, and we can get more facts again. But that looks hopelessly complicated. 24wo . Bill! You’ve got it. . Have I? . If (x,y,z) are three bad numbers, there are two possible cases. Case 1, some xy, > z: Then (y,z, xz) are three more bad num- bers. Case 2, some zp < x: Then (zp, 2,y) are three more bad num- bers. . But aren’t you still going in circles? There’s more and more bad numbers all over the place. . No, in each case the new bad numbers are simpler than the original ones; one of them was created earlier. We can’t go on and on finding earlier and earlier sets of bad numbers, so there can’t be any bad sets at all! . (brightening) Oho! What you’re saying is this: Each num- ber x was created on some day d(z). If there are three bad numbers (2, y, 2), for which the sum of their creation days is d(x) + d(y) + d(z) = n, then one of your two cases applies and gives three bad numbers whose day-sum is less than n. Those, in turn, will produce a set whose day-sum is still less, and so on; but that’s impossible since there are no three numbers whose day-sum is less than 3. . Right, the sum of the creation days is a nice way to express the proof. If there are no three bad numbers (z, y, z) whose day-sum is less than n, the two cases show that there are none whose day-sum equals n. I guess it’s a proof by induction on the day-sum. . You and your fancy words. It’s the idea that counts. . True; but we need a name for the idea, so we can apply it more easily next time. . Yes, I suppose there will be a next time. ... 25Okay, I guess there’s no reason for me to be uptight any more about the New Math jargon. You know it and I know it, we’ve just proved the transitive law. . (sigh) Not bad for two amateur mathematicians! . It was really your doing. I hereby proclaim that the transitive law (T1) shall be known henceforth as Alice’s Theorem. . C’mon. I’m sure Conway discovered it long ago. . But does that make your efforts any less creative? I bet every great mathematician started by rediscovering a bunch of “well known” results. . Gosh, let’s not get carried away dreaming about greatness! Let’s just have fun with this. 265 PROGRESS go ects: ro anteoe cia eet ta spied tbs caer” ~ B. I just thought of something. Could there possibly be two num- bers that aren’t related to each other at all? I mean aty and y <2, like one of them is out of sight or in another dimension or some- thing. It shouldn’t happen, but how would we prove it? 29> . [suppose we could try the same technique that worked before. If z and y are bad numbers in this sense, then either some rr >y or r > some yr. . Hmm. Suppose y < zy. Then if rz, < x, we would have y < z by our transitive law, and we have assumed that y £ x. So ry ¢ x. In the other case, yr < x, the same kind of figuring would show that y £ YR- . Hey, that’s very shrewd! All we have to do now, to show that such a thing can’t happen, is prove something I’ve suspected for a long time. Every number z must lie between all the elements of its sets X; and Xp. I mean, X,
7, or else there is a number rR in XR with x, > xR. But the second case can’t happen, by rule (1). . I knew we were going to use rule (1) sooner or later. But what can we do with zz? I don’t like double subscripts. . Well, zzz is an element of the left set of xz. Since rz was cre- ated earlier than x, we can at least assume that rzz, < xz, by induction. . Lead on. . Let’s see, zzz < ry, says that rprr + ry and... . (interrupting) I don’t want to look at this—your subscripts are getting worse. . You're a big help. . Look, I am helping, I’m telling you to keep away from those hairy subscripts! 30. But I... Okay, you’re right, excuse me for going off on such a silly tangent. We have x < xy, and zy1 < “1, so the transitive law tells us that « < x 1. This probably gets around the need for extra subscripts. . Aha, that does it. We can’t have x < 2x 1, because that would mean X;, $ x1, which is impossible since xz, is one of the ele- ments of X_. A. Good point, but how do you know that rz, < zy. . What? You mean we’ve come this far and haven’t even proved that a number is like itself? Incredible ... there must be an easy proof. . Maybe you can see it, but I don’t think it’s obvious. At any rate, let’s try to prove geo. (T3) This means that X;, + zand ax + XR. . It’s curiously like (T2). But uh-oh, here we are in the same spot again, trying to show that x < zr, is impossible. . This time it’s all right, Bill. Your argument shows that 7 < xy, implies rz, + 21, which is impossible by induction. . Beautiful! That means (T3) is true, so everything falls into place. We’ve got the “X,; < 2” half of (T2) proved—and the other half must follow by the same argument, interchanging left and right everywhere. . And like we said before, (T2) is enough to prove that all num- bers are related; in other words if «fy, then y
y when X, is not the same as Y;,? . Sure, we saw something like that before lunch. Don’t you re- member, we found that 0 < y and y < 0 when y = ({—1},9). And I think ({0, 1}, 0) will turn out to be like ({1}, 9). . You’re right. When x < y and x > y, I guess z and y are effec- tively equal for all practical purposes, because the transitive law tells us that x < z if and only if y < z. They’re interchangeable. . Another thing, we’ve also got two more transitive laws. I mean if z
<—< (—3® <@< (031) << <13) so seven of the numbers are placed already and it’s just a matter of fitting the others in. You know, now that it’s getting easier, this is much more fun than a crossword puzzle. A. We also know, for example, that (—31) lies somewhere between == and ( . Let’s check it against the middle element, zero. B. Hmn, it’s both < and > 0, so it must be like 0, according to rule (2). As I said yesterday, it’s effectively equal to 0, so we might as well forget it. That’s eight down and twelve to go. A. Let’s try to get rid of those ten cases where X; or Xp have more than one element, like I tried to do yesterday morning. I had an idea during the night, which might work. Suppose x = (X1,,Xp) is a number, and we take any other sets of num- bers Y; and Yr, where Year
= (eI), <2—@ = (=> and so on. . So we're left with only two cases: «(—:> and <3 >. . Actually, (T7) applies to both of them, too, with z = 0! . Cle-ver. So the Third Day is now completely analyzed; only those seven numbers we listed before are essentially different. 37A. I wonder if the same thing won’t work for the following days, too. Suppose the different numbers at the end of n days are 1 < 22 < +++ < Im. Then maybe the only new numbers created on the (n + 1)st day will be (0, {21}), ({x1}, {z2}), od ({@m—1}, {2m}), ({2m}, 9). B. Alice, you’re wonderful! If we prove this, it will solve infinitely many days in one swoop! You’ll get ahead of the Creator him- self. A. But maybe we can’t prove it. B. Anyway let’s try some special cases. Like, what if we had the number ({xi-1}, {zi41}); it would have to be equal to one of the others. A. Sure, it equals z;, because of (T7). Look, each element of X;z is < xi-1, and each element of Xr is > 2j41. Therefore, by (T7) we have “y= (Xin U {xi-1}, XiRnU {xj41}). And again by (T7), ({xi—1}, {zi41}) = ({ti-1} U Xiz, {2i41} U Xin). By the transitive law, 2; = ({zi-1}, {vi+1}). B. (shaking his head) Incredible, Holmes! A. Elementary, my dear Watson. One simply uses deduction. B. Your subscripts aren’t very nice, but I’ll ignore them this time. What would you do with the number ({2;-1}, {2j41}) ifi
j41- . Yes, you’re right, I hadn’t noticed that. But all those elements Zi, Li41,.--, Zj in between might interfere. . I suppose so... No, I’ve got it! Let x be the one of 2;, 2:41, ..., 23 that was created first. Then X; and Xp can’t involve any of the others! So ({z;-1}, {2j41}) ==. . Allow me to give you a kiss for that. . (smiling) The problem isn’t completely solved, yet; we have to consider numbers like (0, {;41}) and ({zi-1},0). But in the first case, we get the first-created number of 7), £2, ..., 2. And in the second case it’s the first-created number of 2;, Lit1, +++) Um- . What if the first-created number wasn’t unique? I mean, what if more than one of the z;, ..., 2; were created on that earli- est day? . Whoops ... No, it’s okay, that can’t happen, because the proof is still valid and it would show that the two numbers are both like each other, which is impossible. . Neato! You’ve solved the problem of all the days at once. . With your help. Let’s see, on the fourth day there will be 8 new numbers, then on the fifth day there are 16 more, and so on. . Yes, after the nth day, exactly 2” — 1 numbers will have been created. 39. You know, I don’t think that guy Conway was so smart after all. I mean, he could have just given much simpler rules, with the same effect. There’s no need to talk about sets of numbers, and all that nonsense; he simply would have to say that the new numbers are created between existing adjacent ones, or at the ends. . Rubbish. Wait until you get to infinite sets. . What was that? Did you hear something? It sounded like thun- der. . I'm afraid we’ll be getting into the monsoon season pretty soon. 407 DISCOVERYre att A. Well, we’ve solved everything on that rock, but I can’t help feeling there’s still a lot missing. B. What do you mean? A. I mean, like we know what happened on the third day; four numbers were created. But we don’t know what Conway called them. 43. Well, one of the numbers was bigger than 1, so I suppose he called it “2.” And another was between 0 and 1, so maybe he called it “3.” . That’s not the point. What really bothers me is, why are they numbers? I mean, in order to be numbers you have to be added, subtracted, and that sort of thing. . (frowning) I see. You think Conway gave some more rules, in the broken-off part of the rock, which made the numbers numer- ical. All we have is a bunch of objects ordered neatly in a line, but we haven’t got anything to do with them. . I don’t think I’m clairvoyant enough to guess what he did. If he did do something. . That means we’re stuck — unless we can find the missing part of that rock. And I don’t even remember where we found the first part. . Oh, I remember that; I was careful to note exactly where it was in case we ever wanted to go back. . What would I ever do without you? Come on, let’s go! . Hey wait, don’t you think we should have a little lunch first? . Right, I got so wrapped up in this I forgot all about food. Okay, let’s grab a quick bite and then start digging. . (digging) Oh, Bill, I’m afraid this isn’t going to work. The dirt under the sand is so hard, we need special tools. . Yeah, just scraping away with this knife isn’t getting us very far. Uh oh— here comes the rain, too. Should we dash back to camp? 44. Look, there’s a cave over by that cliff. Let’s wait out the storm in there. Hey, it’s really pouring! . Sure is dark in here. Ouch! I stubbed my toe on something. Of all the... . Bill! You’ve found it! You stubbed your toe on the other part of the Conway Stone! . (wincing) Migosh, it look’s like you’re right. Talk about fate! But my toe isn’t as pleased about it as the rest of me is. . Can you read it, Bill? Is it really the piece we want, or is it something else entirely? . It’s too dark in here to see much. Help me drag it out in the rain, the water will wash the dust off and ... Yup, I can make out the words “Conway” and “number,” so it must be what we’re looking for. . Oh, good, we’ll have plenty to work on. We’re saved! . The info we need is here all right. But I’m going back in the cave, it can’t keep raining this hard for very long. . (following) Right, we’re getting drenched. . I wonder why this mathematics is so exciting now, when it was so dull in school. Do you remember old Professor Landau’s lec- tures? I used to really hate that class: Theorem, proof, lemma, remark, theorem, proof, what a total drag. . Yes, I remember having a tough time staying awake. But look, wouldn’t our beautiful discoveries be just about the same? 45. True. I’ve got this mad urge to get up before a class and present our results: Theorem, proof, lemma, remark. I’d make it so slick, nobody would be able to guess how we did it, and every- one would be so impressed. . Or bored. . Yes, there’s that. I guess the excitement and the beauty comes in the discovery, not the hearing. . But it ts beautiful. And I enjoyed hearing your discoveries al- most as much as making my own. So what’s the real difference? . I guess you’re right, at that. I was able to really appreciate what you did, because I had already been struggling with the same problem myself. . It was dull before, because we weren’t involved at all; we were just being told to absorb what somebody else did, and for all we knew there was nothing special about it. . From now on whenever I read a math book, I’m going to try to figure out by myself how everything was done, before looking at the solution. Even if I don’t figure it out, I think I’ll be able to see the beauty of a proof then. . And I think we should also try to guess what theorems are com- ing up; or at least, to figure out how and why anybody would try to prove such theorems in the first place. We should imagine ourselves in the discoverer’s place. The creative part is really more interesting than the deductive part. Instead of concen- trating just on finding good answers to questions, it’s more im- portant to learn how to find good questions! . You’ve got something there. I wish our teachers would give us problems like, “Find something interesting about 2,” instead of “Prove x.” . Exactly. But teachers are so conservative, they’d be afraid of scaring off the “grind” type of students who obediently and 46mechanically do all the homework. Besides, they wouldn’t like the extra work of grading the answers to nondirected questions. The traditional way is to put off all creative aspects until the last part of graduate school. For seventeen or more years, stu- dents are taught examsmanship; then suddenly after passing enough exams in graduate school they’re told to do something original. . Right. I doubt if many of the really original students have stuck around that long. . Oh, I don’t know, maybe they’re original enough to find a way to enjoy the system. Like putting themselves into the subject, as we were saying. That would make the traditional college courses tolerable, maybe even fun. . You always were an optimist. I’m afraid you’re painting too rosy a picture. But look, the rain has stopped. Let’s lug this rock back to camp and see what it says. 478 ADDITIONA. The two pieces fit pretty well, it looks like we’ve got almost the whole message. What does it say? B. This part is a little harder to figure out — there are some ob- scure words — but I think it goes like this: ... day. And Conway said, “Let the numbers be added to each other in this wise: The left set of the sum of two numbers shall be the sums of all left parts of each number 4950 with the other; and in like manner the right set shall be from the right parts, each according to its kind.” Conway proved that every number plus zero is unchanged, and he saw that addition was good. And the evening and the morning were the third day. And Conway said, “Let the negative of a number have as its sets the negatives of the number’s opposite sets; and let subtraction be addition of the negative.” And it was so. Conway proved that subtraction was the inverse of addition, and this was very good. And the evening and the morning were the fourth day. And Conway said to the numbers, “Be fruitful and mul- tiply. Let part of one number be multiplied by another and added to the product of the first number by part of the other, and let the product of the parts be subtracted. This shall be done in all possible ways, yielding a number in the left set of the product when the parts are of the same kind, but in the right set when they are of opposite kinds.” Conway proved that every number times one is unchanged. And the evening and the morning were the fifth day. And behold! When the numbers had been created for infinitely many days, the universe itself appeared. And the evening and the morning were ¥ day. And Conway looked over all the rules he had made for numbers, and saw that they were very, very good. And he commanded them to be for signs, and series, and quo- tients, and roots. Then there sprang up an infinite number less than infinity. And infinities of days brought forth multiple orders of infinities.That’s the whole bit. . What a weird ending. And what do you mean “aleph day”? . Well, aleph is a Hebrew letter and it’s just standing there by itself, look: X. It seems to mean infinity. Let’s face it, it’s heavy stuff and it’s not going to be easy to figure out what this means. . Can you write it all down while I fix supper? It’s too much for me to keep in my head, and I can’t read it. . Okay —that’ll help me get it clearer in my own mind too. . It’s curious that the four numbers created on the third day aren’t mentioned. I still wonder what Conway called them. . Maybe if we try the rules for addition and subtraction we could figure out what the numbers are. . Yeah, if we can figure out those rules for addition and subtrac- tion. Let’s see if we can put the addition rule into symbolic form, in order to see what it means. ... I suppose “its own kind” must signify that left goes with left, and right with right. What do you think of this: a+y=((Xit+y)U(¥,+2), (Xrty)U(Yr+2)). (3) . Looks horrible. What does your rule mean? . To get the left set of z + y, you take all numbers of the form zyt+y, where x; is in X;, and also all numbers y, + x where yz, is in Y;. The right set is from the right parts, “in like manner.” . I see, a “left part” of z is an element of X,. Your symbolic definition certainly seems consistent with the prose one. . And it makes sense too, because each x, + y and yy + x ought to be less than z + y. 51
You might also like
Introductory Statistics A Problem Solving Approach - 2nd Edition
PDF
100% (2)
Introductory Statistics A Problem Solving Approach - 2nd Edition
890 pages
Solutions Manual To Naive Set Theory by Paul Halmos PDF
PDF
100% (1)
Solutions Manual To Naive Set Theory by Paul Halmos PDF
59 pages
Gordon 1979
PDF
No ratings yet
Gordon 1979
168 pages
Donald E. Knuth - Surreal Numbers
PDF
100% (1)
Donald E. Knuth - Surreal Numbers
65 pages
(Numerical Methods in Engineering Series) Alain Dervieux, Frédéric Alauzet, Adrien Loseille, Bruno Koobus - Mesh Adaptation for Computational Fluid Dynamics, Volume 1_ Continuous Riemannian Metrics an
PDF
No ratings yet
(Numerical Methods in Engineering Series) Alain Dervieux, Frédéric Alauzet, Adrien Loseille, Bruno Koobus - Mesh Adaptation for Computational Fluid Dynamics, Volume 1_ Continuous Riemannian Metrics an
246 pages
Calculus and Combinatorics
PDF
No ratings yet
Calculus and Combinatorics
367 pages
Machinelearningsalon Kit 28-12-2014
PDF
No ratings yet
Machinelearningsalon Kit 28-12-2014
155 pages
Matrix Calculus Kronecker Product Applications C++ Programs: and With and
PDF
No ratings yet
Matrix Calculus Kronecker Product Applications C++ Programs: and With and
263 pages
We Dare You To Solve This!
PDF
No ratings yet
We Dare You To Solve This!
132 pages
(Donald E. Knuth) Surreal Numbers How Two Ex-Stud (BookFi) PDF
PDF
No ratings yet
(Donald E. Knuth) Surreal Numbers How Two Ex-Stud (BookFi) PDF
113 pages
Alexander Graham - Kronecker Products and Matrix Calculus With Applications
PDF
No ratings yet
Alexander Graham - Kronecker Products and Matrix Calculus With Applications
129 pages
An Intuitive Introduction To Limits
PDF
No ratings yet
An Intuitive Introduction To Limits
108 pages
الطرائد
PDF
No ratings yet
الطرائد
310 pages
Debisutujame Anton Calculus A New Horizon PDF Xirubuzuzazali
PDF
No ratings yet
Debisutujame Anton Calculus A New Horizon PDF Xirubuzuzazali
4 pages
Direct Hits Vol 2
PDF
100% (2)
Direct Hits Vol 2
176 pages
Mercer, J.W. The Calculus For Beginners (1914)
PDF
No ratings yet
Mercer, J.W. The Calculus For Beginners (1914)
466 pages
خواطر سطحية سخيفة عن الحياة والبشر أحمد خالد توفيق #فور - ريد PDF
PDF
No ratings yet
خواطر سطحية سخيفة عن الحياة والبشر أحمد خالد توفيق #فور - ريد PDF
193 pages
Martin Gardner, Isaac Asimov-Science Fiction Puzzle Tales-Random House Value Publishing (1981) PDF
PDF
50% (2)
Martin Gardner, Isaac Asimov-Science Fiction Puzzle Tales-Random House Value Publishing (1981) PDF
156 pages
1573927449GardnerWhys PDF
PDF
100% (1)
1573927449GardnerWhys PDF
270 pages
1573927449GardnerWhys PDF
PDF
100% (1)
1573927449GardnerWhys PDF
270 pages
KNUTH, Donald E. - Surreal Numbers: How Two Ex-Students Turned On To Pure Mathematics and Found Total Happiness: A Mathematical Novelette (1974) PDF
PDF
50% (2)
KNUTH, Donald E. - Surreal Numbers: How Two Ex-Students Turned On To Pure Mathematics and Found Total Happiness: A Mathematical Novelette (1974) PDF
113 pages
The Big Book of Mind-Bending Puzzles
PDF
100% (2)
The Big Book of Mind-Bending Puzzles
338 pages
Vdoc - Pub - Primality Testing For Beginners
PDF
No ratings yet
Vdoc - Pub - Primality Testing For Beginners
258 pages
Surreal Numbers - Donald E Knuth
PDF
100% (4)
Surreal Numbers - Donald E Knuth
113 pages
Number Theory Frontbackmatter
PDF
100% (1)
Number Theory Frontbackmatter
47 pages
S (1) - Lefschetz-Algebraic Topology
PDF
No ratings yet
S (1) - Lefschetz-Algebraic Topology
396 pages
List of Books - PDF
PDF
100% (1)
List of Books - PDF
335 pages
Cryptanalysis of Symmetric-Key Primitives
PDF
No ratings yet
Cryptanalysis of Symmetric-Key Primitives
214 pages
Gardner, Martin - The Colossal Book of Mathematics
PDF
No ratings yet
Gardner, Martin - The Colossal Book of Mathematics
742 pages
Surreal Numbers
PDF
No ratings yet
Surreal Numbers
25 pages
978 94 011 4209 0
PDF
No ratings yet
978 94 011 4209 0
260 pages
Grinstead C.M, Peterson W.P, Snell J.L. - (2011) Probability Tales
PDF
No ratings yet
Grinstead C.M, Peterson W.P, Snell J.L. - (2011) Probability Tales
250 pages
Compiler Design - Theory Tools and Examples PDF
PDF
No ratings yet
Compiler Design - Theory Tools and Examples PDF
320 pages
1 31817 El Enigma Cuantico
PDF
100% (1)
1 31817 El Enigma Cuantico
100 pages
2025 - Euclid (E) 2025-4-2 105530 2
PDF
100% (1)
2025 - Euclid (E) 2025-4-2 105530 2
6 pages
James Singer-Elements of Numerical Analysis-Academic Press PDF
PDF
100% (1)
James Singer-Elements of Numerical Analysis-Academic Press PDF
407 pages
Compiling With Dependent Types
PDF
No ratings yet
Compiling With Dependent Types
281 pages
MGRE ChicagoREU
PDF
No ratings yet
MGRE ChicagoREU
68 pages
Differential Geometry PDF
PDF
100% (1)
Differential Geometry PDF
223 pages
Scam0114 PDF
PDF
100% (1)
Scam0114 PDF
76 pages
Streetwise French - Speak and Understand Everyday French (PDFDrive)
PDF
No ratings yet
Streetwise French - Speak and Understand Everyday French (PDFDrive)
239 pages
Antimirov, Kolyshkin, Vaillancourt A Course in Complex Variable Theory (AP, 1998) (462s) - MCC
PDF
No ratings yet
Antimirov, Kolyshkin, Vaillancourt A Course in Complex Variable Theory (AP, 1998) (462s) - MCC
462 pages
Gardner Martin Logic Machines and Diagrams PDF
PDF
No ratings yet
Gardner Martin Logic Machines and Diagrams PDF
165 pages
The Big Book of Mind-Bending Puzzles
PDF
100% (5)
The Big Book of Mind-Bending Puzzles
339 pages
Arca-Swiss Ballhead Manual
PDF
No ratings yet
Arca-Swiss Ballhead Manual
4 pages
Sudoku Game Project Report
PDF
No ratings yet
Sudoku Game Project Report
21 pages
Ain Explained 2021
PDF
100% (1)
Ain Explained 2021
100 pages
Aspen Xtra BigFoot Catalogue - UK
PDF
No ratings yet
Aspen Xtra BigFoot Catalogue - UK
112 pages
Laplace Transformations
PDF
No ratings yet
Laplace Transformations
29 pages
The Complete Raspberry Pi Manual - September 2019
PDF
No ratings yet
The Complete Raspberry Pi Manual - September 2019
163 pages
Physics of Quantum Information
PDF
100% (1)
Physics of Quantum Information
326 pages
American Scientist - SeptemberOctober 2021
PDF
No ratings yet
American Scientist - SeptemberOctober 2021
68 pages
Surreal Numbers
PDF
100% (2)
Surreal Numbers
113 pages
McGill MATH - 140
PDF
No ratings yet
McGill MATH - 140
2 pages
Cambridge STEP 2018
PDF
No ratings yet
Cambridge STEP 2018
53 pages
Discover 2021-01 Amp 3B02
PDF
No ratings yet
Discover 2021-01 Amp 3B02
76 pages
MIT Technology Review - Volume 124 Issue 2 MarchApril 2021
PDF
No ratings yet
MIT Technology Review - Volume 124 Issue 2 MarchApril 2021
92 pages
Screw Compressor Air Cooled Chiller Catalog
PDF
No ratings yet
Screw Compressor Air Cooled Chiller Catalog
64 pages
Fisher I A Brief Introduction To The Infinitesimal Calculus 1921
PDF
No ratings yet
Fisher I A Brief Introduction To The Infinitesimal Calculus 1921
106 pages
Math GRE Exercises: Charlie Marshak
PDF
No ratings yet
Math GRE Exercises: Charlie Marshak
48 pages
Ch07 Basic Knowledge Representation in First Order Logic
PDF
100% (1)
Ch07 Basic Knowledge Representation in First Order Logic
30 pages
Nets Puzzles and Postmen An Exploration of Mathematical Connections
PDF
No ratings yet
Nets Puzzles and Postmen An Exploration of Mathematical Connections
256 pages
Girard - Linear Logic (1987)
PDF
No ratings yet
Girard - Linear Logic (1987)
101 pages
Peter Smith - DIY Logic
PDF
No ratings yet
Peter Smith - DIY Logic
77 pages
2020 Time Delay Catalog 05 18 20
PDF
No ratings yet
2020 Time Delay Catalog 05 18 20
52 pages
Stochastic Processes Notes
PDF
100% (1)
Stochastic Processes Notes
22 pages
Chapter 13: Basic Ring Theory: Matthew Macauley
PDF
No ratings yet
Chapter 13: Basic Ring Theory: Matthew Macauley
24 pages
Dunham Bush WCFX E R134A
PDF
No ratings yet
Dunham Bush WCFX E R134A
11 pages
PQRST 08 Puzzle Competition Equate: PUZZLE 01 (10 Points Penalty For A Wrong Answer) 30 Points
PDF
No ratings yet
PQRST 08 Puzzle Competition Equate: PUZZLE 01 (10 Points Penalty For A Wrong Answer) 30 Points
5 pages
Build Your Reputation On Ours: Fan Coil Technical Catalog
PDF
No ratings yet
Build Your Reputation On Ours: Fan Coil Technical Catalog
32 pages
60hz Medium Static Type Concealed Duct Unit Service Manual - Editado New
PDF
No ratings yet
60hz Medium Static Type Concealed Duct Unit Service Manual - Editado New
26 pages
Samsung DVM S Eco Installation Manual - English
PDF
No ratings yet
Samsung DVM S Eco Installation Manual - English
50 pages
Asymptotic Analysis
PDF
No ratings yet
Asymptotic Analysis
56 pages
Math Models of Physics Problems
PDF
No ratings yet
Math Models of Physics Problems
29 pages
Math Symbol Tables: B.1 Hebrew and Greek Letters
PDF
No ratings yet
Math Symbol Tables: B.1 Hebrew and Greek Letters
20 pages
Calculus of Inductive Constructions
PDF
No ratings yet
Calculus of Inductive Constructions
18 pages
44th International Mathematical Olympiad.. Short-Listed Problems and Solutions (Tokyo, 2003) (71s) - MSCH
PDF
No ratings yet
44th International Mathematical Olympiad.. Short-Listed Problems and Solutions (Tokyo, 2003) (71s) - MSCH
71 pages
BGD200D03 R1
PDF
No ratings yet
BGD200D03 R1
2 pages
ERRATA For The Solutions Manual of T. Shifrin's Multivariable Mathematics
PDF
No ratings yet
ERRATA For The Solutions Manual of T. Shifrin's Multivariable Mathematics
2 pages
Smullyan
PDF
No ratings yet
Smullyan
6 pages
PQRST 06 Puzzle Competition
PDF
No ratings yet
PQRST 06 Puzzle Competition
5 pages
DVM S System Refrigerant Pump Down Guideline - 052013A
PDF
No ratings yet
DVM S System Refrigerant Pump Down Guideline - 052013A
2 pages