Surreal number

From testwiki
Revision as of 21:24, 17 March 2025 by imported>Dan Polansky (drop "but don't forget that on on Wikiversity, [https://www.youtube.com/watch?v=qo6lPifGnGA '''anything goes!''']": that is misleading since, as per various previous practice, Wikiversity does not tolerate pure nonsense, and therefore, it is untrue that anything is acceptable)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

All readers are welcome to contribute to this resource. Try to follow the notation of Wikipedia:Surreal number. To create an essay or article start with a title that not already on the list below. It is very easy to change a title.. If you need help, leave a message at User talk:Guy vandegrift. Template:RoundBoxTop<inputbox> type=create width=110 buttonlabel=Create subpage break=no prefix=Surreal number/ placeholder=Title of subpage </inputbox>Template:RoundBoxBottom

Subpage abstracts

Each "abstract" begins with a and a link to a subpage. The abstract is just a transclusion of the first few lines.

Abstracts for beginners

Template:/The dyadics
Template:/Root 2

Template:/Counting

Russell's paradox resembles Pinocchio paradox in that it involves self-referencing. Pinocchio's words are in conflict with his nose: If his words are true, his nose would not grow. But since his nose is growing, we know his words are false. In short:

  • His words are false if his words are true.
  • His words are true if his words are false.

With Russell's paradox, the self-referencing conflict is between a set's definition and the items that are in the set. The paradox is important when sets are allowed be contain sets as members, as is the case with the pair of sets used to define surreal numbers.


Advanced abstracts

Template:/Simplicity


Essential reading for advanced students

So far, the subpages to this resource are target the absolute beginner. I hope that changes, but for now people already familiar with the basics might want to look at the following websites:

Meet the surreal numbers (Jim Simons)

Meet the surreal numbers (by Jim Simons) is 39 pages long. The internet is full of introductions to surreal numbers. Many contain the same essential insight can be found on Wikipedia's Surreal number. But Jim Simon's article contains useful insights that most authors neglect to adequately cover. His discussion of ordinal numbers begins with this introduction:

Just as we don’t need much set theory, we don’t need to know much about ordinals, but it is helpful to know a little. Ordinals extend the idea of counting into the infinite in the simplest way imaginable: just keep on counting. So we start with the natural numbers: 0, 1, 2, 3, 4, . . ., but we don’t stop there, we keep on with a new number called ω, then ω + 1, ω + 2, ω + 3 and so on. After all those we come to ω + ω = ω·2. Carrying on we come to ω·3, ω·4 etc and so on to ω2 . Carrying on past things like ω 2·7 + ω·42 + 1, we’ll come to ω3 , ω4 and so on to ωω , and this is just the beginning. To see a bit more clearly where this is heading, we’ll look at von Neumann’s construction of the ordinals.

Simplicity theorem

The Simplicity Theorem. (If) x is a number, and z is a number with the earliest possible birthday that lies strictly between the left and right options of x, then x = z

I find this easier to understand than the what appears in Wikipedia:Surreal number.

A Short Guide to Hackenbush (Padraic Bartlett)

A Short Guide to Hackenbush is 25 pages long. It will give insight as to what inspired the invention of surreal numbers. It turns out that the surreal numbers are inspired by an effort to attach a value to a game, not unlike go or chess, but some peculiarities that make it easy to attach a rational number that predicts how the game will end if both sides play flawlessly. Non-negative values correspond to games where the person who moves first will lose, and the magnitude (absolute value) tells us something about the margin or victory. A value of zero corresponds to a position where the loser is the person whose turn it is to move (ties are impossible in red-blue hackenbush.) For those who love math as a beautiful tool for solving real-life problems, this application to game theory is the most likely way to make surreal numbers seem "useful".

Tree diagram shown at Wikipedia:Surreal number

Beyond ω (with Andi Fugard)

numbers – Andi Fugard presents a slightly different picture of ω/2. The image to the right is from the Wikipedia article, and I am confused by the tree diagram starting at ω. Compare the image to the right with this image. All the dyadic (real) numbers are placed on a tree formation where each parent has two children. They display two types of infinite series:

  1. The positive and negative integers are exterior elements and grow as
    Template:Spaces{1, 2, 3,...}.
  2. Interior dyadics cut as fractions that get smaller, for example as
    Template:Spaces{ ½, ¼, ⅛, ...}.

Look at the tree that begins at ω: Both sides match the tree that begins with 0, i.e., by adding or subtracting 1 from each previous element. To the left we get smaller with {ω, ω-1, ω-2,..., ω/2}. See also this image and this article. I am quite confused by the fact that the left side of this tree doesn't continue with {ω, ω-1, ω-2,..., 0}.[1] It is true that the square root of ω is smaller than every element in the series {ω, ω-1, ω-2,..., 0}. But how do we know that 2ω has the same birthday as ω/2?

Answer: Quoting page 30 of Meet the surreal numbers:

x = {ℕ | ω − ℕ} can hardly be ω − ω because that is equal to 0.[2] So what it it? x = {ℕ | ω − ℕ}, and x + x = {x + ℕ | x + ω − ℕ}. Now x < ω − n for any n ∈ ℕ, so x + n < ω, ie so all the left option of x + x are less than ω, but are infinite. Similarly, x > n, so x + ω − n > ω, ie all the right options of x + x are bigger than ω. Therefore x + x = ω, and x = ω/2.

Surreal Numbers – An Introduction (Claus Tøndering)

Surreal Numbers – An Introduction is 51 pages of careful rigor. It employs the notation of logic and set theory. Each surreal number can be expressed in a variety of "forms" (each consisting of a pair of sets.) On page 25 Tøndering proves that if x is the oldest surreal number between a and b, then {a | b} = x.

Math576 Combinatorial Game Theory

Lecture note for Math576 Combinatorial Game Theory.pdf is an 84 page document that thoroughly connects surreal numbers to hackenbush.

Surreal Numbers and Transseries

www.fields.utoronto.ca/talk-media/1/50/58/slides concisely presents 12 pages of insight into how both real numbers, as well as von Neumann's ordinal numbers, embedded in the surreals.

Video

HACKENBUSH: a window to a new world of math is an hour-long video that begins with a solid introduction to hackenbush, but also goes far beyond.

Other useful (but informal) discussions

Wikiversity/Wikipedia/Wikibooks

Conway names, the simplicity hierarchy and the surreal number tree (PHILIP EHRLICH)

Template:Colbegin

Template:Colend




proof of conways simplicity rule

https://math.stackexchange.com/questions/816540/proof-of-conways-simplicity-rule-for-surreal-numbers

0={|}

n+1={n|}

n1={|n}

2p+12q+1={p2q|p+12q}

Limits and analysis

Infinity is easy to imagine, but difficult to incorporate into rigorous mathematics. The following "logic" certainly violates the rules of mathematics and is therefore nonsensical:

limϵ01ϵ= and limϵ02ϵ= implies =2.

This is why expressions like / and 0/0 of often called indeterminant. Most of the time, mistakes like this can be avoided by utilizing concepts taught in a course on mathematical analysis.

Images

Template:Wide image

Infinitesimals (ε) and infinities (ω) on the hyperreal number line (1/ε = ω/1). This image appears in the Wikipedia articles w:Hyperreal number, w:Infinitesimal, and w:Infinity.

Template:Clear

Using Latex {matrix}

With Latex, it is easier to use dots instead of arrows to highlight how parents give rise to children. The following two trees (starting from 1 and 0, respectively) are written as latex matrices:

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

1122143411231838587811413421241163165167169161116131615161181381581782142343125

Starting from zero

0112121223112341414341123421213411478583818183858781141342124

With sets

Template:Cot {L|R}[.5ex]-abc



0{|0}[.5ex]-11{|1}[.5ex]-2{1|0}[.5ex]-12122{|2}[.5ex]-3{2|1}[.5ex]-112{1|12}[.5ex]-34{12|0}[.5ex]-1414341123{|3}[.5ex]-4{3|2}[.5ex]-212{2|112}[.5ex]-134{112|1}[.5ex]-114{1|34}[.5ex]-785838{14|0}[.5ex]-18183858781141342124

Template:Cob

Categories

Draft:Surreal number Template:Center

  1. Here, 0 might not be a member of the set, but merely a point to which the series converges.
  2. Here, ℕ refers to , or the natural numbers.