Let (an) be a rational sequence. We say that (an) is a cauchy sequence if for any ϵ∈R+ there exists some N∈N0 such that for every n,m≥N|an−am|≤ϵ
A Convergent Rational Sequence is Cauchy
Suppose that an→L for some L∈R, then (an) is cauchy
Let ϵ∈R+ since (an) converges to q then we know that there exists some M∈N0 such that for any n≥N we have that |an−L|<ϵ2, take N=M and let n,m≥M then we have
|an−am|=|(an−L)−(am−L)|≤|an−L|+|am−q|<ϵ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∈Q such that |an|≤M
Since (an) is cauchy then with ϵ=1 we get an N∈N0 such that for any m,n≥N we have that |an−am|<1. Specificially since N+1≥N then we would know that |aN+1−am|≤1which is the same asaN+1−1<an<aN+1+1so that|an|≤max(|aN+1−1|,|aN+1+1|)
Therefore set
M=max(|a0|,|a1|,…,|aN|,|aN+1−1|,|aN+1+1|)
With this, let k∈N0 then we know that if k≤N then |ak|≤M as they are directly included in our maximum, on the other hand if k>N then |ak|<max(|aN+1−1|,|aN+1+1|)≤M and therefore (an) is bounded.
The Collection of All Cauchy Sequence
We use the notation CQ to denote the set of all cauchy sequences of rational numbers
Cauchy Subtraction Relation
Let (an),(bn)∈CQ, and we define the relation such that they are related if an−bn→0
The Cauchy Subtraction Relation is an Equivalence Relation
Let (an),(bn),(cn)∈CQ, let's show that the relation is reflexive, first we have to show that an−an→0 the sequence an−an is zero for every index so it trivially tends to 0.
To show that the relation is symmetric we assume that an−bn→0, and we must show that bn−an→0, so let ϵ∈R+, so we get some N∈N0 such that for all n≥N0 we have that |an−bn|<ϵ but since we can move things around inside of the absolute value bars we get |bn−an|<ϵ as needed.