Evanalysis
4.5Embedded interactionEstimated reading time: 9 min

4.5 Dedekind cuts and the embedding of Q

Turn the approximation idea into a rigorous object: Dedekind cuts, the copy of Q inside R, and the first definitions of order and arithmetic.

Course contents

MATH1090: Set theory

Rigorous course notes on logic, sets, number construction, the real numbers, limits, cardinality, and the first algebraic structures, written in linked sections with careful proofs and examples.

Chapter 7Sets with structure1 sections

Why cuts are the next step

The previous note ended with a picture:

  • a real number should determine everything in QQ that lies to its left;
  • it should also determine everything in QQ that lies to its right;
  • the real number itself should behave like the boundary between those two camps.

The next step is to turn that picture into a formal definition. The important move is this: instead of assuming the real number already exists and then asking what lies below it, we define the real number by the left-hand part of QQ itself.

That is the basic idea of a Dedekind cut.

Two equivalent definitions

Definition

Dedekind cut as a pair

A Dedekind cut is a pair (A,B) of nonempty subsets of QQ such that:

  • Q=ABQ=A\cup B;
  • for every aAa\in A and bBb\in B, we have a<ba<b;
  • AA has no maximum element.

In words, AA is the entire left side of the boundary, and BB is the entire right side. There is no overlap, nothing is missing, and the left side does not contain its own last point.

Definition

Dedekind cut as a single subset

Equivalently, a subset AQA\subset Q is called a Dedekind cut if:

  • AA\ne\varnothing and AQA\ne Q;
  • whenever xAx\in A and yQy\in Q satisfy y<xy<x, then yAy\in A;
  • for every xAx\in A, there exists yAy\in A with x<yx<y.

The second form is often easier to use. Once the left set AA is known, the right set is automatically QAQ\setminus A. So the cut is completely determined by which rationals count as "already to the left of the boundary".

What each condition is doing

The definition is short, but every clause has a job.

  • AA\ne\varnothing and AQA\ne Q prevent a fake cut with no left side or no right side.
  • Downward closure says that if a rational is already on the left, then every smaller rational must also be on the left.
  • The "no maximum" condition says the boundary itself is not stored as the last element of AA; there is always room to move a little farther right while staying on the left.

This last point is the subtle one. It is exactly what prevents one rational number from being represented twice.

Worked example

The cut for q=3/2

Let

A={xQx<3/2},B={xQx3/2}.A=\{x\in Q\mid x<3/2\}, \qquad B=\{x\in Q\mid x\ge 3/2\}.

Then AA and BB are both nonempty, every element of AA is smaller than every element of BB, and AA has no maximum.

To see the last point, start with any x<3/2 and define

y=x+3/22.y=\frac{x+3/2}{2}.

Then x<y<3/2, so yAy\in A and x was not maximal. Thus (A,B) is a Dedekind cut. This cut is the rational number 3/2 viewed inside the real number system built from cuts.

Rational cuts and the embedding of QQ

Call a cut (A,B) rational if BB has a minimum element. In that case the boundary is already achieved by a rational number.

If min(B)=q\min(B)=q, then necessarily

A={xQx<q}.A=\{x\in Q\mid x<q\}.

That motivates the notation

qR={xQx<q}.q_R=\{x\in Q\mid x<q\}.

So each rational number q gives a Dedekind cut qRq_R, and the map

i:QR,i(q)=qRi:Q\to R,\qquad i(q)=q_R

embeds QQ into the cut model of the reals.

Theorem

The rational numbers sit inside the cut model

Rational Dedekind cuts are in bijection with rational numbers. After this embedding is established, it is standard to identify q with its cut qRq_R. In particular, 0R0_R and 1R1_R play the roles of 0 and 1 inside RR.

This matters conceptually. The cut construction is not trying to throw away the rationals and start from scratch. It is enlarging QQ by adding new boundaries that were missing before.

Common mistake

Using xqx\le q instead of x<qx<q

The set {xQxq}\{x\in Q\mid x\le q\} is nonempty, proper, and downward closed, but it fails the "no maximum" condition because q itself is the largest element. If we allowed that set as well as qRq_R, then the same rational number would be represented in two different ways. The strict inequality is not cosmetic; it removes that ambiguity.

Order and the first operations on cuts

Defining the set RR of all cuts is not enough. To match the target from the previous note, we must also define order and arithmetic on RR.

For order, the natural rule is:

AAif and only ifAA.A\le A' \quad\text{if and only if}\quad A\subseteq A'.

This is exactly the right comparison for left sets. If every rational already on the left of AA is also on the left of A', then the boundary represented by AA cannot lie to the right of the boundary represented by A'.

For addition, define

A+A={a+aaA, aA}.A+A'=\{a+a' \mid a\in A,\ a'\in A'\}.

The idea is that the left side of a sum should consist of rational numbers that can already be reached by adding something strictly left of the first boundary to something strictly left of the second boundary.

For multiplication, first handle the case of nonnegative cuts and then extend the definition by sign rules. When 0RA0_R\le A and 0RA0_R\le A', they use

AA={aaaA, aA, a0, a0}{xQx<0}.A\cdot A' = \{aa' \mid a\in A,\ a'\in A',\ a\ge 0,\ a'\ge 0\}\cup\{x\in Q\mid x<0\}.

This is more technical than addition, but the guiding idea is the same: build the left side of the product from rational data that already lies to the left.

Worked example

Why 1R+1R=2R1_R+1_R=2_R

Write

1R={xQx<1}.1_R=\{x\in Q\mid x<1\}.

If a<1a<1 and a<1a'<1, then a+a<2a+a'<2, so every element of 1R+1R1_R+1_R lies in 2R2_R.

Conversely, if x<2x<2, then x/2<1, and

x=x2+x2.x=\frac{x}{2}+\frac{x}{2}.

So every rational in 2R2_R lies in 1R+1R1_R+1_R. Hence

1R+1R=2R.1_R+1_R=2_R.

This example shows that the cut definition really extends the ordinary rational operations rather than inventing new arithmetic.

Theorem

The cut model reaches the target from 4.4

Define ++, \cdot, and \le on Dedekind cuts and then check that the resulting structure is a complete ordered field containing the embedded copy of QQ.

The proofs are not short, but the overall message is clean: Dedekind cuts do exactly what chapter 4 asked a model of the real numbers to do.

Seeing the boundary on the number line

A Dedekind cut at sqrt(2)

Figure. A cut stores every rational to the left of a boundary. When the boundary is 2\sqrt{2}, the right side has no smallest rational element.

Compare rational and irrational cuts interactively

The explorer below places the rational boundary 3/2 next to the irrational boundary 2\sqrt{2}. The key structural question is whether the right-hand side starts with a least rational element.

Read and try

Inspect the two sides of a Dedekind cut

The explorer splits sample rationals into the left and right sides of a Dedekind cut so readers can see the structural difference between rational and irrational cuts.

What to notice

No rational equals sqrt(2), so the rationals to the right never start with a smallest one. This is the signature of an irrational cut.

A = { q ∈ Q | q < sqrt(2) }

B = { q ∈ Q | q > sqrt(2) }

1

A

6/5

A

7/5

A

10/7

B

3/2

B

8/5

B

17/10

B

sqrt(2)

Set A

1, 6/5, 7/5

Every displayed element is strictly left of sqrt(2), and more rationals can always be inserted still closer to the boundary.

Set B

10/7, 3/2, 8/5, 17/10

No rational equals sqrt(2), so the rationals to the right never start with a smallest one. This is the signature of an irrational cut.

Common mistakes

Common mistake

The pair version and the subset version are not two different theories

They describe the same object from two angles. The pair (A,B) records both sides of the boundary explicitly, while the subset form keeps only the left side and recovers the right side as QAQ\setminus A.

Common mistake

Order on cuts is not a comparison between every element of two sets

The statement AAA\le A' means AAA\subseteq A'. It does not mean that every element of AA is less than every element of A'. The two left sets usually overlap heavily, especially when one boundary lies to the left of the other.

Quick checks

Quick check

What is the cut 0R0_R?

Write it directly from the definition qR={xQx<q}q_R=\{x\in Q\mid x<q\}.

Solution

Answer

Quick check

If AAA\subseteq A', which boundary lies to the left?

Answer in terms of the cut order.

Solution

Answer

Exercises

Quick check

Show that qR={xQx<q}q_R=\{x\in Q\mid x<q\} is a Dedekind cut for every rational number q.

Check the three conditions in the subset definition.

Solution

Guided solution

Quick check

Why is C={xQx2}C=\{x\in Q\mid x\le 2\} not a Dedekind cut, even though it is nonempty, proper, and downward closed?

Identify the exact condition that fails and explain why it matters.

Solution

Guided solution

Read this after 4.4 Axioms for the reals and first approximations. Then continue with 4.6 Decimal expansions and irrational numbers, which reconnects cuts with familiar decimal notation and introduces 2\sqrt2 as an irrational cut.

Key terms in this unit