Real Numbers

We already defined them, as the completion of the Rational Numbers using linear orderings.

Lemma: for every x∈R and n∈N+, there exists r,s∈Q such that r<x≤s and s−r≤1/n

Def: Let x,y∈R. We let x+y=inf{r+s∣r,s∈Q,x≤r,y≤s}. The symbol inside the set is the sum of the rationals. We note the the infimum always exist since it is complete linear ordering.

Lemma: Let x,y,z∈R

We denote R+:={x∈R∣x>0}

Def: Let x,y∈R+. We let x⋅y=inf{r⋅s∣r,s∈Q,x≤r,y≤s}

Lemma 1: Let x,y,z∈R+:

We define the absolute value for real numbers, let x∈R, then $$ |x| = \begin{cases}x & x \ge 0 \-x & x < 0\end{cases}$$
and notice that if x≠0, the |x|∈R+.

Def: Let x,y∈R, we let $$x\cdot y = \begin{cases}|x|\cdot |y|& x, y >0 \lor x, y <0 \
-(|x|\cdot|y|) & x>0, y<0 \lor x <0, y>0 \
0 & x = 0 \lor y = 0\end{cases}$$
Lemma 2: Let x,y,z∈R:

We define division by a nonzero real number x: as y÷x=y⋅(1/x)

A structure U=(A,<,+,⋅,0,1) where < is a linear ordering, + and ⋅ are binary operations and 0,1 are constants such that all properties of lemma 1 and lemma 2 are satisfied is called an ordered field in algebra. So the contents of lemma 1 and 2, can be summarized as the real numbers are an ordered field. As the ordering of the real numbers is complete, they are a complete ordered field

Th: The structure R=(R,<,+,⋅,0,1) is a complete ordered field. It is in fact unique up to isomorphism. If U is also a complete ordered field, then U and R are isomorphic.

Th (Expansion of real numbers in base p)
Let p≥2 be a natural number. For every 0≤a<1 there is a unique sequence of natural numbers ⟨an⟩n∈N+ such that

We can also consider them the completion of the rational numbers as a metric space

If we decide to do this we have that is a complete metric space by construction, the thing we get stuck on is the order.

Let's take (an)n∈N and (bn)n∈N be Cauchy sequences of rational numbers, we say that (an)n∈N∼(bn)n∈N, iff for every p>0, there's N∈N, such that n≥N, |an−bn|<p (this feels like liman−bn=0).

We would like to consider a pre-order on the set of all Cauchy sequences of rationals C. The preorder is as follows: we say that (an)n∈N≲(bn)n∈N iff for every p>0, there's an N∈N such that n≥N, an−bn<p, and according to gpt, we consider lim supan−bn≤0, which can be a bit problematic since Q is not complete.

We know that ∼ is an equivalence relation on C

Also ≲ is a preorder on C, and the natural equivalence relation from the preorder is actually ∼, so C/∼, will have an order induced by the preorder.

And we have the ordered set C/∼ is a complete ordered field, inhereting a lot of these s properties from Q, then C/∼ is isomorphic to R.