AI ALIGNMENT FORUM
AF

Wikitags
Main
1
DEDEKIND CUT DEFINITION
3
Cauchy sequence definition
2

Real number (as Dedekind cut)

Edited by Joe Zeng, et al. last updated 15th Jul 2016

The rational numbers have a problem that makes them unsuitable for use in calculus — they have "gaps" in them. This may not be obvious or even make sense at first, because the rational numbers are a dense space — between any two rational numbers you can always find infinitely many other rational numbers. How could there be gaps in a set like that?

But using the construction of Dedekind cuts, we can suss out these gaps into plain view. A Dedekind cut of a totally ordered set S is a pair of sets (A,B) such that:

  1. Every element of S is in exactly one of A or B. (That is, (A,B) is a partition of S.)
  2. Every element of S in A is less than every rational number in B.

One example of such a cut might be the set where A is the negative rational numbers and B is the nonnegative rational numbers (positive or zero). We see that it satisfies the two properties of a Dedekind cut:

  1. Every rational number is either negative or nonnegative, but not both.
  2. Every rational number which is negative is less than a rational number that is nonnegative.

In fact, Dedekind cuts are intended to represent sets of rational numbers that are less than or greater than a specific real number (once we've defined them). To represent this, let's call them Q≤ and Q≥.

Completion of a space

If a space is complete (doesn't have any gaps in it), then in any Dedekind cut (Q≤,Q≥), either Q≤ will have a greatest element or Q≥ will have a least element. (We can't have both at the same time — why?)

Show solution

Suppose Q≤ had a greatest element qu and Q≥ had a least element qv. We can't have qu=qv, because the same number would be in both sets. So then because the rational numbers are a dense space, there must exist a rational number r so that qu<r<qv. Then r is not in either Q≤ or Q≥, contradicting property 1 of a Dedekind cut.

But in the rational numbers, we can find a Dedekind cut where neither Q≤ nor Q≥ have a greatest or least element respectively.

Consider the pair of sets (Q≤,Q≥) where Q≤={x∈Q | x3≤2} and Q≥={x∈Q | x3≥2}.

  1. Every rational number has a cube either greater than 2 or less than 2,
  2. Because f(x)=x3 is a monotonically increasing function, we have that p<q⟺p3<q3, which means that every element in Q≤ is less than every element in Q≥.

So (Q≤,Q≥) is a Dedekind cut. However, there is no rational number whose cube is equal to 2, so Q≤ has no greatest element and Q≥ has no least element.

This represents a gap in the numbers, because we can invent a new number to place in that gap (in this case 3√2), which is "between" any two numbers in Q≤ and Q≥.

Definition of real numbers

Before we move on, we will define one more structure that makes the construction more elegant. Define a one-sided Dedekind cut as any Dedekind cut (Q≤,Q≥) with the additional property that the set Q≤ has no greatest element (in which case we now call it Q<). The case where Q≤ has a greatest element qg can be trivially transformed into the equivalent case on the other side by moving qg to Q≥ where it is automatically the least element due to being less than any other element in Q≥.

Then we define the real numbers as the set of one-sided Dedekind cuts of the rational numbers.

  • A rational number r is mapped to itself by the Dedekind cut where r itself is the least element of Q≥. (If the cuts weren't one-sided, r would also be mapped to the set where r was the greatest element of Q≤, which would make the mapping non-unique.)
  • An irrational number q is newly defined by the Dedekind cut where all the elements of Q< are less than q and all the elements of Q≥ are (strictly) greater than q.

Now we can define the comparison_operator ≤ for two real numbers numbers a=(Q<a,Q≥a) and b=(Q<b,Q≥b) as follows: a≤b when Q<a⊆Q<b.

Using this, we can show that unlike in the Cauchy sequence definition, we don't need to define any equivalence classes — every real number is uniquely defined by a one-sided Dedekind cut.

Proof

If a=b, then a≤b and b≤a. By the definition of the comparison operator, we have that Q<a⊆Q<b and Q<b⊆Q<a, which means that Q<a=Q<b, which means that the Dedekind cuts corresponding to a and b are also equal.

Parents:
Real number
Children:
The reals (constructed as Dedekind cuts) form a field
3
3
Discussion0
Discussion0