ΘρϵηΠατπ

See also the Dedekind-cut construction of .

Rational Sequence
A rational sequence (an) is a sequence such that an
Cauchy Sequence
Let (an) be a rational sequence. We say that (an) is a cauchy sequence if for any ϵ+ there exists some N0 such that for every n,mN |anam|ϵ
A Convergent Rational Sequence is Cauchy
Suppose that anL for some L, then (an) is cauchy
Let ϵ+ since (an) converges to q then we know that there exists some M0 such that for any nN we have that |anL|<ϵ2, take N=M and let n,mM then we have |anam|=|(anL)(amL)||anL|+|amq|<ϵ2+ϵ2=ϵ where we've used the triangle inequality
A Cauchy Sequence is Bounded
If (an) is a cauchy sequence, then there exists some M such that |an|M

Since (an) is cauchy then with ϵ=1 we get an N0 such that for any m,nN we have that |anam|<1. Specificially since N+1N then we would know that |aN+1am|1 which is the same as aN+11<an<aN+1+1 so that |an|max(|aN+11|,|aN+1+1|)

Therefore set M=max(|a0|,|a1|,,|aN|,|aN+11|,|aN+1+1|) With this, let k0 then we know that if kN then |ak|M as they are directly included in our maximum, on the other hand if k>N then |ak|<max(|aN+11|,|aN+1+1|)M and therefore (an) is bounded.

The Collection of All Cauchy Sequence
We use the notation 𝒞 to denote the set of all cauchy sequences of rational numbers
Cauchy Subtraction Relation
Let (an),(bn)𝒞, and we define the relation such that they are related if anbn0
The Cauchy Subtraction Relation is an Equivalence Relation

Let (an),(bn),(cn)𝒞, let's show that the relation is reflexive, first we have to show that anan0 the sequence anan is zero for every index so it trivially tends to 0.

To show that the relation is symmetric we assume that anbn0, and we must show that bnan0, so let ϵ+, so we get some N0 such that for all n0 we have that |anbn|<ϵ but since we can move things around inside of the absolute value bars we get |bnan|<ϵ as needed.