AC Obtaining the Reals from the Rationals

Skip to main content

\(\newcommand{\set}[1]{\{1,2,\dotsc,#1\,\}} \newcommand{\ints}{\mathbb{Z}} \newcommand{\posints}{\mathbb{N}} \newcommand{\rats}{\mathbb{Q}} \newcommand{\reals}{\mathbb{R}} \newcommand{\complexes}{\mathbb{C}} \newcommand{\twospace}{\mathbb{R}^2} \newcommand{\threepace}{\mathbb{R}^3} \newcommand{\dspace}{\mathbb{R}^d} \newcommand{\nni}{\mathbb{N}_0} \newcommand{\nonnegints}{\mathbb{N}_0} \newcommand{\dom}{\operatorname{dom}} \newcommand{\ran}{\operatorname{ran}} \newcommand{\prob}{\operatorname{prob}} \newcommand{\Prob}{\operatorname{Prob}} \newcommand{\height}{\operatorname{height}} \newcommand{\width}{\operatorname{width}} \newcommand{\length}{\operatorname{length}} \newcommand{\crit}{\operatorname{crit}} \newcommand{\inc}{\operatorname{inc}} \newcommand{\HP}{\mathbf{H_P}} \newcommand{\HCP}{\mathbf{H^c_P}} \newcommand{\GP}{\mathbf{G_P}} \newcommand{\GQ}{\mathbf{G_Q}} \newcommand{\AG}{\mathbf{A_G}} \newcommand{\GCP}{\mathbf{G^c_P}} \newcommand{\PXP}{\mathbf{P}=(X,P)} \newcommand{\QYQ}{\mathbf{Q}=(Y,Q)} \newcommand{\GVE}{\mathbf{G}=(V,E)} \newcommand{\HWF}{\mathbf{H}=(W,F)} \newcommand{\bfC}{\mathbf{C}} \newcommand{\bfG}{\mathbf{G}} \newcommand{\bfH}{\mathbf{H}} \newcommand{\bfF}{\mathbf{F}} \newcommand{\bfI}{\mathbf{I}} \newcommand{\bfK}{\mathbf{K}} \newcommand{\bfP}{\mathbf{P}} \newcommand{\bfQ}{\mathbf{Q}} \newcommand{\bfR}{\mathbf{R}} \newcommand{\bfS}{\mathbf{S}} \newcommand{\bfT}{\mathbf{T}} \newcommand{\bfNP}{\mathbf{NP}} \newcommand{\bftwo}{\mathbf{2}} \newcommand{\cgA}{\mathcal{A}} \newcommand{\cgB}{\mathcal{B}} \newcommand{\cgC}{\mathcal{C}} \newcommand{\cgD}{\mathcal{D}} \newcommand{\cgE}{\mathcal{E}} \newcommand{\cgF}{\mathcal{F}} \newcommand{\cgG}{\mathcal{G}} \newcommand{\cgM}{\mathcal{M}} \newcommand{\cgN}{\mathcal{N}} \newcommand{\cgP}{\mathcal{P}} \newcommand{\cgR}{\mathcal{R}} \newcommand{\cgS}{\mathcal{S}} \newcommand{\bfn}{\mathbf{n}} \newcommand{\bfm}{\mathbf{m}} \newcommand{\bfk}{\mathbf{k}} \newcommand{\bfs}{\mathbf{s}} \newcommand{\bijection}{\xrightarrow[\text{onto}]{\text{$1$--$1$}}} \newcommand{\injection}{\xrightarrow[]{\text{$1$--$1$}}} \newcommand{\surjection}{\xrightarrow[\text{onto}]{}} \newcommand{\nin}{\not\in} \newcommand{\prufer}{\text{prüfer}} \DeclareMathOperator{\fix}{fix} \DeclareMathOperator{\stab}{stab} \DeclareMathOperator{\var}{var} \newcommand{\inv}{^{-1}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} \)

Section B.17 Obtaining the Reals from the Rationals

A full discussion of this would take us far away from a discrete math class, but let’s at least provide the basic definitions. A subset \(S\subset \rats\) of the rationals is called a cut (also, a Dedekind cut), if it satisfies the following properties:

\(\emptyset\neq S\neq \rats\text{,}\) i.e, \(S\) is a proper non-empty subset of \(\rats\text{.}\)
\(x\in S\) and \(y\lt x\) in \(\rats\) implies \(y\in S\text{,}\) for all \(x,y\in \rats\text{.}\)
For every \(x\in S\text{,}\) there exists \(y\in S\) with \(x\lt y\text{,}\) i.e., \(S\) has no greatest element.

Cuts are also called real numbers, so a real number is a particular kind of set of rational numbers. For every rational number \(q\text{,}\) the set \(\bar{q}= \{p\in \rats: p\lt q\}\) is a cut. Such cuts are called rational cuts. Inside the reals, the rational cuts behave just like the rational numbers and via the map \(h(q)=\bar{q}\text{,}\) we abuse notation again (we are getting used to this) and say that the rational numbers are a subset of the real numbers.

But there are cuts which are not rational. Here is one: \(\{p\in \rats: p\le 0\}\cup \{p\in \rats: p^2\lt 2\}\text{.}\) The fact that this cut is not rational depends on the familiar proof that there is no rational \(q\) for which \(q^2=2\text{.}\)

The operation of addition on cuts is defined in the natural way. If \(S\) and \(T\) are cuts, set \(S+T=\{s+t:s\in S, t\in T\}\text{.}\) Order on cuts is defined in terms of inclusion, i.e., \(S\lt T\) if and only if \(S\subsetneq T\text{.}\) A cut is positive if it is greater than \(\bar{0}\text{.}\) When \(S\) and \(T\) are positive cuts, the product \(ST\) is defined by

\begin{equation*} ST= \bar{0}\cup\{st:s\in S, t\in T, s\ge0, t\ge 0\}. \end{equation*}

One can easily show that there is a real number \(r\) so that \(r^2=\bar{2}\text{.}\) You may be surprised, but perhaps not, to learn that this real number is denoted \(\sqrt2\text{.}\)

There are many other wonders to this story, but enough for one day.

You have attempted of activities on this page.