1.2 The Real Numbers as a Complete Ordered Field
Thirteen axioms describe $\mathbb{R}$ completely: the field rules, the order rules, and one more — every nonempty set that is bounded above has a least upper bound. Everything in analysis grows from that last axiom.
The rational numbers already form an excellent number system: we can add, subtract, multiply and divide, and we can compare any two of them. Yet $\mathbb{Q}$ is full of holes. The rationals $1,\ 1.4,\ 1.41,\ 1.414,\ 1.4142,\dots$ creep up on a number whose square is $2$, and no rational number is there to be reached. The sequence is increasing and bounded, but in $\mathbb{Q}$ it converges to nothing. Calculus cannot live with such holes: the intermediate value theorem, the existence of maxima, the convergence of monotone sequences and of Cauchy sequences, even the existence of $\sqrt2$ — all of them fail in $\mathbb{Q}$.
This section describes $\mathbb{R}$ by the properties that matter: it is an ordered field (like $\mathbb{Q}$) that is also complete — every nonempty set that is bounded above has a least upper bound. From this single extra axiom we derive the Archimedean property, the density of rationals and irrationals, the existence of roots, the nested interval property, and decimal and binary expansions. In CSIR NET these ideas are examined directly (computing a supremum, deciding which ordered field is complete or Archimedean, which sets are dense) and, far more often, indirectly: nearly every proof in Chapters 2–7 starts with "let $u=\sup S$".
Ordered Fields and Absolute Value
A field is a set $F$ with two operations $+$ and $\cdot$ and two distinct elements $0,1$ such that for all $x,y,z\in F$:
An ordered field is a field $F$ with a subset $P$ (the positive elements) such that (O1) for every $x\in F$ exactly one of $x\in P$, $x=0$, $-x\in P$ holds (trichotomy); and (O2) if $x,y\in P$ then $x+y\in P$ and $xy\in P$. We write $x\lt y$ (or $y\gt x$) when $y-x\in P$, and $x\le y$ when $x\lt y$ or $x=y$. Examples: $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{Q}(\sqrt2)=\{a+b\sqrt2:a,b\in\mathbb{Q}\}$ with the order inherited from $\mathbb{R}$.
Proof. (a) If $y-x\in P$ and $z-y\in P$ then $z-x=(z-y)+(y-x)\in P$ by (O2); trichotomy for $y-x$ is (O1). (b) $(y+z)-(x+z)=y-x$. (c) $yz-xz=(y-x)z$ is a product of two positives; if $z\lt0$, $xz-yz=(y-x)(-z)\in P$. (d) If $x\in P$, $x^2=x\cdot x\in P$; if $-x\in P$, $x^2=(-x)(-x)\in P$. Since $1\ne0$, $1=1^2\gt0$. (e) If $x^{-1}$ were negative, $1=x\cdot x^{-1}=-\left(x\cdot(-x^{-1})\right)$ would be negative. For $0\lt x\lt y$: $x^{-1}-y^{-1}=(y-x)\,x^{-1}y^{-1}\gt0$. (f) $n\cdot1$ is a sum of positive terms, hence positive and nonzero; so $m\cdot1\ne n\cdot1$ for $m\ne n$, and $\tfrac{m}{n}\mapsto(m\cdot1)(n\cdot1)^{-1}$ embeds $\mathbb{Q}$ in $F$ preserving $+$, $\cdot$ and order. ∎
Two quick consequences are popular exam traps. $\mathbb{C}$ cannot be ordered: in any order $i^2=-1$ would be positive by (d), and also $1=1^2\gt0$, so $0=1+(-1)$ would be positive — contradicting trichotomy. No finite field can be ordered: in $\mathbb{Z}_p$ the positive element $p\cdot1$ equals $0$, contradicting (f).
Proof. (a), (b) follow by checking the signs case by case. (c) From $-|x|\le x\le|x|$ and $-|y|\le y\le|y|$, adding gives $-(|x|+|y|)\le x+y\le|x|+|y|$, which is $|x+y|\le|x|+|y|$ by (b). If $xy\ge0$, $x$ and $y$ have the same sign and equality is clear. If $xy\lt0$ then $$(x+y)^2=x^2+2xy+y^2\lt x^2+2|x||y|+y^2,$$ which is $(|x|+|y|)^2$; since both $|x+y|$ and $|x|+|y|$ are $\ge0$ this forces $|x+y|\lt|x|+|y|$. (d) $|x|=|(x-y)+y|\le|x-y|+|y|$ gives $|x|-|y|\le|x-y|$; exchanging $x$ and $y$ gives $|y|-|x|\le|x-y|$; combine with (b). (e) If $x\ne0$, take $\varepsilon=|x|/2\gt0$: then $|x|\le|x|/2$, so $|x|\le0$, contradicting (a). ∎
Part (e) is the analyst's way of proving equalities: to show $a=b$, show $|a-b|\le\varepsilon$ for every $\varepsilon\gt0$.
Completeness: Supremum and Infimum
Let $S$ be a subset of an ordered field $F$.
- $u\in F$ is an upper bound of $S$ if $s\le u$ for every $s\in S$; $S$ is bounded above if it has one. Lower bounds and "bounded below" are defined symmetrically; bounded means bounded above and below.
- $u$ is a supremum (least upper bound) of $S$, written $u=\sup S$, if $u$ is an upper bound of $S$ and $u\le v$ for every upper bound $v$ of $S$. Similarly $\ell=\inf S$ (greatest lower bound).
- If $\sup S\in S$ it is called the maximum $\max S$; if $\inf S\in S$, the minimum $\min S$.
- $s\le u$ for every $s\in S$, and
- for every $\varepsilon\gt0$ there is $s\in S$ with $s\gt u-\varepsilon$.
Proof. (a) If $u$ and $u'$ are both suprema, each is an upper bound and each is $\le$ every upper bound, so $u\le u'$ and $u'\le u$. (b) Suppose $u=\sup S$ and $\varepsilon\gt0$. Then $u-\varepsilon\lt u$, so $u-\varepsilon$ is not an upper bound (it is smaller than the least one): some $s\in S$ has $s\gt u-\varepsilon$. Conversely, assume 1 and 2. Then $u$ is an upper bound. If $v$ were an upper bound with $v\lt u$, put $\varepsilon=u-v\gt0$; by 2 some $s\in S$ has $s\gt u-\varepsilon=v$, contradicting that $v$ is an upper bound. So $u\le v$ for every upper bound $v$. (c) Apply 2 with $\varepsilon=1/n$ for each $n$. ∎
Proof. If $\ell$ is a lower bound of $S$, then $-\ell$ is an upper bound of $-S$, which is nonempty; let $u=\sup(-S)$. For $s\in S$, $-s\le u$, so $s\ge-u$: $-u$ is a lower bound. If $\ell$ is any lower bound, $-\ell$ is an upper bound of $-S$, so $u\le-\ell$, i.e. $\ell\le-u$. Hence $-u$ is the greatest lower bound. ∎
- $\sup(A+B)=\sup A+\sup B$;
- $\sup(cA)=c\sup A$ for $c\gt0$, and $\sup(cA)=c\inf A$ for $c\lt0$ (if $A$ is bounded below);
- $A\subseteq B\Rightarrow\sup A\le\sup B$ (and $\inf A\ge\inf B$ when the infima exist);
- $\sup(A\cup B)=\max(\sup A,\sup B)$;
- if $A,B\subseteq[0,\infty)$ then $\sup(AB)=\sup A\cdot\sup B$.
Proof. (1) Let $\alpha=\sup A$, $\beta=\sup B$. Every $a+b\le\alpha+\beta$, so $\alpha+\beta$ is an upper bound of $A+B$. Given $\varepsilon\gt0$, choose $a\in A$ with $a\gt\alpha-\varepsilon/2$ and $b\in B$ with $b\gt\beta-\varepsilon/2$ (Theorem 1.20); then $a+b\gt\alpha+\beta-\varepsilon$. By Theorem 1.20, $\sup(A+B)=\alpha+\beta$. (2) For $c\gt0$, $x\le u\iff cx\le cu$, so the upper bounds of $cA$ are exactly $c$ times those of $A$, and the least ones correspond. For $c\lt0$, multiplication by $c$ reverses the order and turns lower bounds of $A$ into upper bounds of $cA$. (3) Every upper bound of $B$ is an upper bound of $A$. (4) $m=\max(\sup A,\sup B)$ bounds $A\cup B$; and any upper bound of $A\cup B$ bounds both $A$ and $B$, so it is $\ge\sup A$ and $\ge\sup B$. (5) is Example 3(c). ∎
- Explore. Write out the first terms; split by parity or by the sign of $(-1)^n$; note monotone pieces and their limits. Make a guess $u$.
- Bound. Prove $s\le u$ for every $s\in S$ (an inequality, often a one-line estimate).
- Approach. For a given $\varepsilon\gt0$ produce an explicit $s\in S$ with $s\gt u-\varepsilon$ — usually by the Archimedean property ("choose $n\gt1/\varepsilon$"). If some $s$ equals $u$, step 3 is automatic and $u=\max S$.
- Attained? Decide whether $u\in S$. For multi-parameter sets ($\{1/m-1/n\}$) treat each parameter separately: push one to its best value and let the other run off to infinity.
The Archimedean Property and Density
Proof. (a) If $\mathbb{N}$ were bounded above, completeness would give $u=\sup\mathbb{N}$. Then $u-1$ is not an upper bound, so some $n\in\mathbb{N}$ has $n\gt u-1$; but then $n+1\in\mathbb{N}$ and $n+1\gt u$, a contradiction. (b) By (a) choose $n\gt y/x$. (c) Take $x=\varepsilon$, $y=1$ in (b). Then $0$ is a lower bound of $\{1/n\}$ and no $\varepsilon\gt0$ is one. (d) By (a) there are integers $k\gt-x$ and so $-k\lt x$: the set $Z_x=\{k\in\mathbb{Z}:k\le x\}$ is nonempty and bounded above by $x$. Let $s=\sup Z_x$; some $m\in Z_x$ has $m\gt s-1$, and every integer $k\gt m$ satisfies $k\ge m+1\gt s$, so $k\notin Z_x$. Thus $m=\max Z_x$: $m\le x$ and $m+1\notin Z_x$, i.e. $x\lt m+1$. If $m,m'$ both work then $|m-m'|\lt1$, so $m=m'$. ∎
Notice that the proof of (a) used only completeness. So every complete ordered field is Archimedean — and an ordered field that is not Archimedean cannot be complete (Example 5).
Proof. Let $S=\{t\in\mathbb{R}:t\ge0,\ t^2\lt2\}$. It contains $1$, and $2$ is an upper bound (if $t\gt2$ then $t^2\gt4$). Let $x=\sup S$; then $1\le x\le2$. We show that both $x^2\lt2$ and $x^2\gt2$ are impossible.
If $x^2\lt2$: for $0\lt h\le1$, $(x+h)^2=x^2+h(2x+h)\le x^2+5h$ (as $2x+h\le5$). By the Archimedean property choose $n$ with $\tfrac1n\lt\tfrac{2-x^2}{5}$ and put $h=\tfrac1n$. Then $(x+h)^2\lt2$, so $x+h\in S$ — contradicting that $x$ is an upper bound.
If $x^2\gt2$: for $0\lt h\lt x$, $(x-h)^2=x^2-2xh+h^2\gt x^2-2xh\ge x^2-4h$. Choose $n\ge2$ with $\tfrac1n\lt\tfrac{x^2-2}{4}$ and $h=\tfrac1n$ (then $h\le\tfrac12\lt x$). Then $(x-h)^2\gt2$; for every $t\in S$, $t^2\lt2\lt(x-h)^2$ with $t\ge0$ and $x-h\gt0$, so $t\lt x-h$. Thus $x-h$ is a smaller upper bound — a contradiction.
Hence $x^2=2$. If also $y\gt0$, $y^2=2$ and $y\ne x$, say $y\lt x$, then $y^2\lt x^2$ — impossible; so $x$ is unique. If $x=p/q$ in lowest terms, $p^2=2q^2$ makes $p$ even, $p=2k$, so $q^2=2k^2$ makes $q$ even — contradicting lowest terms. For $n$-th roots the same argument works with the binomial estimate $(x\pm h)^n=x^n\pm h\cdot(\text{bounded})$. Finally, the whole argument above can be run inside $\mathbb{Q}$ (the $h=1/n$ are rational): a rational supremum $r$ of $\{t\in\mathbb{Q}:t\ge0,\ t^2\lt2\}$ would satisfy $r^2=2$, which is impossible. ∎
Proof. By the Archimedean property choose $n\in\mathbb{N}$ with $\tfrac1n\lt b-a$, i.e. $nb-na\gt1$. Let $m=\lfloor na\rfloor+1$. Then $m-1\le na\lt m$, so $$na\lt m\le na+1\lt nb,$$ and $r=m/n$ satisfies $a\lt r\lt b$. For the irrational: apply this to $\tfrac{a}{\sqrt2}\lt\tfrac{b}{\sqrt2}$ to get a rational $r$ between them; if $r=0$ (possible only when $a\lt0\lt b$) apply it again to $0\lt\tfrac{b}{\sqrt2}$ to get a rational $r\ne0$. Then $t=r\sqrt2$ lies in $(a,b)$, and $t$ is irrational because otherwise $\sqrt2=t/r$ would be rational. Applying the result to $(a,b)$, then to $(a,r)$, $(a,r')$, … gives infinitely many. ∎
Nested Intervals, Extended Reals and Expansions
Proof. Nesting means $a_1\le a_2\le\cdots$ and $b_1\ge b_2\ge\cdots$. For any $m,n$ let $k=\max(m,n)$; then $a_m\le a_k\le b_k\le b_n$. So every $b_n$ is an upper bound of $\{a_m\}$, and $\alpha=\sup a_m$ exists with $\alpha\le b_n$ for all $n$; hence $\alpha$ is a lower bound of $\{b_n\}$ and $\alpha\le\beta=\inf b_n$. If $\alpha\le x\le\beta$ then $a_n\le\alpha\le x\le\beta\le b_n$ for every $n$, so $x\in\bigcap I_n$. Conversely, if $x\in\bigcap I_n$ then $a_n\le x\le b_n$ for all $n$, so $\alpha\le x\le\beta$. Finally $0\le\beta-\alpha\le b_n-a_n$ for every $n$; if the infimum of the lengths is $0$ then $\beta-\alpha\le0$ and $\alpha=\beta$. ∎
All three hypotheses are needed: the open intervals $(0,\tfrac1n)$ and the unbounded closed intervals $[n,\infty)$ are nested with empty intersection, and in $\mathbb{Q}$ the nested rational intervals $[1.4,1.5]\supseteq[1.41,1.42]\supseteq[1.414,1.415]\supseteq\cdots$ (decimal truncations of $\sqrt2$) close in on a point that is not there.
Proof (by bisection). Let $S\subseteq F$ be nonempty and bounded above. Pick $s_0\in S$ and an upper bound $b_1$; put $a_1=s_0-1$, which is not an upper bound. Given $[a_n,b_n]$ with $a_n$ not an upper bound and $b_n$ an upper bound, let $c$ be the midpoint; set $[a_{n+1},b_{n+1}]=[a_n,c]$ if $c$ is an upper bound and $[c,b_n]$ otherwise. The intervals are nested, $b_n-a_n=(b_1-a_1)/2^{n-1}$, and since $2^{n-1}\ge n$ the Archimedean property makes these lengths eventually smaller than any $\varepsilon\gt0$. By hypothesis (and the argument of Theorem 1.26) there is exactly one point $x$ in every $[a_n,b_n]$.
$x$ is an upper bound: if some $s\in S$ had $s\gt x$, choose $n$ with $b_n-a_n\lt s-x$; then $b_n\le a_n+(b_n-a_n)\le x+(b_n-a_n)\lt s$, contradicting that $b_n$ is an upper bound. $x$ is the least one: if $v\lt x$ were an upper bound, choose $n$ with $b_n-a_n\lt x-v$; then $a_n\ge b_n-(b_n-a_n)\ge x-(b_n-a_n)\gt v$, so $a_n$ would be an upper bound — but no $a_n$ is. Hence $x=\sup S$. ∎
The Archimedean hypothesis cannot be dropped: there are non-Archimedean ordered fields (built in non-standard analysis) in which every nested sequence of closed bounded intervals has a common point, yet $\mathbb{N}$ is bounded with no supremum.
Proof. Let $I_0=[a,b]$. Given a closed interval $I_{n-1}$ of positive length, divide it into three closed thirds. The point $x_n$ lies in at most two of them (two only if it is a common end point), so at least one closed third does not contain $x_n$; call it $I_n$. The intervals $I_n$ are nested, closed and bounded, so by Theorem 1.26 some $y$ lies in all of them. For each $n$, $y\in I_n$ and $x_n\notin I_n$, so $y\ne x_n$. ∎
Unlike the diagonal proof of §1.1, this one uses no expansions at all — only completeness. It also shows that the uncountability of $\mathbb{R}$ is a consequence of the completeness axiom: $\mathbb{Q}$ fails both.
| $n$ | midpoint $c$ | $c^2$ | $I_n$ | digit |
|---|---|---|---|---|
| 1 | 1.5 | 2.25 > 2 | [1, 1.5] | 0 |
| 2 | 1.25 | 1.5625 < 2 | [1.25, 1.5] | 1 |
| 3 | 1.375 | 1.890625 < 2 | [1.375, 1.5] | 1 |
| 4 | 1.4375 | 2.06640625 > 2 | [1.375, 1.4375] | 0 |
| 5 | 1.40625 | 1.9775390625 < 2 | [1.40625, 1.4375] | 1 |
| 6 | 1.421875 | 2.021728515625 > 2 | [1.40625, 1.421875] | 0 |
The extended real line is $\overline{\mathbb{R}}=\mathbb{R}\cup\{-\infty,+\infty\}$ with the order $-\infty\lt x\lt+\infty$ for every $x\in\mathbb{R}$. Arithmetic: $x+(\pm\infty)=\pm\infty$ for real $x$; $(+\infty)+(+\infty)=+\infty$; $x\cdot(\pm\infty)=\pm\infty$ for $x\gt0$ and $\mp\infty$ for $x\lt0$; $x/(\pm\infty)=0$. The expressions $\infty-\infty$ and $\pm\infty/\pm\infty$ are undefined; $0\cdot(\pm\infty)$ is undefined in limits, but set equal to $0$ by convention in measure and integration theory (Chapter 4).
We put $\sup S=+\infty$ if $S\subseteq\mathbb{R}$ is not bounded above, $\inf S=-\infty$ if it is not bounded below, and $\sup\varnothing=-\infty$, $\inf\varnothing=+\infty$. With these conventions every subset of $\overline{\mathbb{R}}$ has a supremum and an infimum in $\overline{\mathbb{R}}$. $\overline{\mathbb{R}}$ is not a field.
Proof (sketch with all key steps). Put $t_n=\lfloor b^nx\rfloor/b^n$. Since $d_k=b^k(t_k-t_{k-1})$, the sum telescopes: $t_n=\sum_{k\le n}d_kb^{-k}$. By definition of the floor, $t_n\le x\lt t_n+b^{-n}$. Since $b^{-n}\le\tfrac1n$, the Archimedean property gives, for each $\varepsilon\gt0$, an $n$ with $t_n\gt x-\varepsilon$; with $t_n\le x$ this is Theorem 1.20, so $x=\sup t_n$. The digit bound: for $y=b^{k-1}x$, $b\lfloor y\rfloor\le\lfloor by\rfloor\lt b\lfloor y\rfloor+b$. If $d_k=b-1$ for all $k\gt n$, then $x-t_n=\sum_{k\gt n}(b-1)b^{-k}=b^{-n}$, contradicting $x\lt t_n+b^{-n}$. Two different expansions $(e_k)\ne(f_k)$ of the same number first differing at place $n$ with $e_n\lt f_n$ force $e_n+1=f_n$, $e_k=b-1$ and $f_k=0$ for all $k\gt n$ (otherwise the tails cannot make up the difference $b^{-n}$); this is the case $x=m/b^n$. An eventually periodic expansion is a finite sum plus a geometric series, hence rational. Conversely, for $x=p/q$ the digits come from long division, and the remainders take at most $q$ values, so a remainder repeats and from then on the digits repeat. ∎
- $\mathbb{Q}$ is Archimedean but not complete: $\{t\in\mathbb{Q}:t^2\lt2\}$ is bounded above with no rational supremum.
- $\mathbb{R}(t)$ is ordered but neither Archimedean nor complete: $t\gt n$ for all $n$, and $\mathbb{N}$ has no supremum.
- Some fields cannot be ordered at all: $\mathbb{C}$ ($i^2=-1$ would be positive) and every finite field $\mathbb{Z}_p$ ($p\cdot1=0$).
- A supremum need not be a maximum: $\sup(0,1)=1\notin(0,1)$. A maximum exists iff the supremum belongs to the set.
- An upper bound is not the supremum: $2$ bounds $(0,1)$ above but is not least; always check the $\varepsilon$-condition.
- Strict inequalities do not survive suprema: $s_n\lt1$ for all $n$ gives only $\sup s_n\le1$ (take $s_n=1-\tfrac1n$).
- Products and differences: $\sup(AB)\ne\sup A\sup B$ for $A=B=\{-2,1\}$; $\sup(A-B)=\sup A-\inf B$, not $\sup A-\sup B$.
- Nested intervals need closed and bounded: $\bigcap(0,\tfrac1n)=\varnothing$ and $\bigcap[n,\infty)=\varnothing$; but nested open intervals may still meet, e.g. $\bigcap(-\tfrac1n,\tfrac1n)=\{0\}$.
- Dense is not uncountable, and dense sets need not be "big": $\mathbb{Q}$ and the dyadic rationals are countable and dense; $\{n\sqrt2:n\in\mathbb{Z}\}$ is infinite but not dense; $\{p/q:p,q\in\mathbb{N}\}$ is dense in $(0,\infty)$ but not in $\mathbb{R}$.
- Irrational + irrational can be rational: $\sqrt2+(-\sqrt2)=0$, $\sqrt2\cdot\sqrt2=2$; but rational $+$ irrational and (nonzero rational)$\times$irrational are always irrational.
- Two expansions: $0.4999\ldots=0.5$ and $0.0111\ldots_2=0.1_2$. Countably many numbers (the $m/b^n$) have two expansions; a "terminating in decimal" number such as $0.1$ may be non-terminating in binary.
- $\pm\infty$ are not real numbers: $\infty-\infty$ is undefined; "$\sup S=\infty$" is shorthand for "$S$ is not bounded above".
- Equality in the triangle inequality needs $xy\ge0$; $|x-y|\ge|x|-|y|$, not $|x|+|y|$.
Exercises
- 1 In an ordered field prove: if $0\lt a\lt b$ then $a^2\lt b^2$; and if $a\lt b$ then $a\lt\tfrac{a+b}{2}\lt b$.
- 2 Prove $\big||x|-|y|\big|\le|x-y|$, and show that $|x+y|=|x|+|y|$ iff $xy\ge0$.
- 3 Solve $|2x-3|\lt|x+1|$.
- 4 Solve $|x-1|\,|x+1|\le3$.
- 5 Prove that $\mathbb{C}$ admits no order making it an ordered field.
- 6 Prove that the field $\mathbb{Z}_5$ cannot be ordered.
- 7 Prove: if $x\le y+\varepsilon$ for every $\varepsilon\gt0$, then $x\le y$.
- 8 Prove Bernoulli's inequality $(1+x)^n\ge1+nx$ for $x\ge-1$ and $n\in\mathbb{N}$, and use it to show that $\inf\{2^{-n}:n\in\mathbb{N}\}=0$.
- 1 $\left\{1-\dfrac{(-1)^n}{n}:n\in\mathbb{N}\right\}$
- 2 $\left\{\dfrac{n}{2n+1}:n\in\mathbb{N}\right\}$
- 3 $\{x\in\mathbb{R}:x^2-3x+2\lt0\}$
- 4 $\left\{\dfrac mn:m,n\in\mathbb{N},\ m\lt n\right\}$
- 5 $\left\{\dfrac1m+\dfrac{(-1)^n}{n}:m,n\in\mathbb{N}\right\}$
- 6 $\{x\in\mathbb{Q}:x^3\lt2\}$ — is it bounded below? Does it have a supremum in $\mathbb{Q}$?
- 7 Prove that $\sup(cA)=c\inf A$ for $c\lt0$ and $A$ nonempty and bounded below.
- 8 Let $A$ be nonempty and bounded. Prove $\inf A\le\sup A$, with equality iff $A$ is a single point.
- 9 For bounded $f,g:D\to\mathbb{R}$ prove $\sup_D(f+g)\le\sup_Df+\sup_Dg$, and give an example with strict inequality.
- 10 Let $u=\sup S$ with $u\notin S$. Prove that $S$ contains a strictly increasing sequence converging to $u$, and hence that $S$ is infinite.
- 1 Prove from the Archimedean property that $\inf\left\{\tfrac{1}{n}:n\in\mathbb{N}\right\}=0$ and $\inf\left\{\tfrac{n}{n^2+1}:n\in\mathbb{N}\right\}=0$.
- 2 Use the method of Theorem 1.25 to find a rational number in $(\sqrt3,\sqrt3+0.01)$.
- 3 Show that $a+\dfrac{b-a}{\sqrt2}$ is an irrational number between the rationals $a\lt b$.
- 4 Prove that every open interval contains infinitely many rationals.
- 5 Prove that $\sqrt3$ and $\sqrt2+\sqrt3$ are irrational.
- 6 Show that $\{t\ge0:t^2\lt3\}$ has supremum $x$ with $x^2=3$ by adapting the proof of Theorem 1.24.
- 7 Let $G\ne\{0\}$ be an additive subgroup of $\mathbb{R}$ and $\alpha=\inf(G\cap(0,\infty))$. Prove: if $\alpha\gt0$ then $G=\alpha\mathbb{Z}$; if $\alpha=0$ then $G$ is dense. Deduce that $\{m+n\sqrt2:m,n\in\mathbb{Z}\}$ is dense in $\mathbb{R}$.
- 8 Show that in the ordered field $\mathbb{Q}$ the set $\{t\in\mathbb{Q}:t\gt0,\ t^2\gt2\}$ has no infimum.
- 1 Find the intersection of each nested family: (a) $[0,\tfrac1n]$; (b) $(0,\tfrac1n]$; (c) $[-\tfrac1n,1+\tfrac1n]$; (d) $(1-\tfrac1n,1+\tfrac1n)$.
- 2 Find the binary expansions of $\tfrac58$ and $\tfrac15$ and the decimal expansion of $\tfrac17$.
- 3 Write $0.2\overline{45}=0.24545\ldots$ as a fraction in lowest terms.
- 4 Prove that $0.999\ldots=1$.
- 5 In $\overline{\mathbb{R}}$ find $\sup$ and $\inf$ of $\varnothing$, $\mathbb{N}$ and $\{-n:n\in\mathbb{N}\}$. Which of $\infty+\infty$, $\infty-\infty$, $(-\infty)(-3)$, $5/\infty$ are defined?
- 6 Let $(x_n)$ be any sequence in $[0,1]$. Explain how to choose nested closed intervals $I_n\subseteq[0,1]$ with $x_n\notin I_n$, and conclude that $[0,1]$ is uncountable.
- 7 Applied. An engineer locates the root of $x^3+x-1=0$ in $[0,1]$ by bisection. How many bisections guarantee that the root lies in an interval of length less than $10^{-6}$? Give the root to six decimal places.
E1. CSIR Part B GATE MA Let $S=\left\{\dfrac1m+\dfrac1n:m,n\in\mathbb{N}\right\}$. Then (A) $\sup S=2$ and $\inf S=0$, both attained; (B) $\sup S=2$ is attained and $\inf S=0$ is not attained; (C) $\sup S=2$ and $\inf S=0$, neither attained; (D) $\sup S=1$ and $\inf S=0$.
E2. CSIR Part B Let $F$ be any ordered field. Which statement is necessarily true? (A) $F$ is Archimedean; (B) $F$ contains a subfield order-isomorphic to $\mathbb{Q}$; (C) every nonempty subset of $F$ that is bounded above has a supremum in $F$; (D) every positive element of $F$ has a square root in $F$.
E3. CSIR Part B Let $a_n\lt b_n$ for all $n$, with $(a_n)$ strictly increasing and $(b_n)$ strictly decreasing, and let $I_n=(a_n,b_n)$ (open intervals). Then $\bigcap_nI_n$ is (A) always empty; (B) always nonempty; (C) nonempty if and only if $b_n-a_n\to0$; (D) always a single point.
E4. CSIR Part C Let $A,B$ be nonempty bounded subsets of $\mathbb{R}$. Which of the following are true? (One or more options may be correct.) (A) $\sup(A\cup B)=\max(\sup A,\sup B)$; (B) if $A\cap B\ne\varnothing$ then $\sup(A\cap B)\le\min(\sup A,\sup B)$; (C) $\sup(A-B)=\sup A-\sup B$, where $A-B=\{a-b\}$; (D) $\inf(AB)=\inf A\cdot\inf B$.
E5. CSIR Part C Which of the following subsets of $\mathbb{R}$ are dense in $\mathbb{R}$? (A) $\{m/2^n:m\in\mathbb{Z},\ n\in\mathbb{N}\}$; (B) $\{m+n\sqrt2:m,n\in\mathbb{Z}\}$; (C) $\{n\sqrt2:n\in\mathbb{Z}\}$; (D) $\{p/q:p\in\mathbb{N},\ q\text{ prime}\}$.
E6. CSIR Part C Let $x\in(0,1)$. Which of the following are true? (A) $x$ has at most two decimal expansions. (B) If $x$ has two distinct binary expansions, then $x$ is rational. (C) The set of $x\in(0,1)$ that have two distinct decimal expansions is uncountable. (D) The binary expansion of $x$ terminates if and only if its decimal expansion terminates.
Suggested plan — 2 lectures × 60 min (a third for weaker groups).
- Ordered fields and completeness. Axioms (Definition 1.8) quickly; Theorem 1.18 with the two traps ($\mathbb{C}$, $\mathbb{Z}_p$); triangle inequality and Example 1. Supremum, the completeness axiom, and Theorem 1.20 proved in full — then project Interactive 1, first with $1-1/n$ (witness moves) and then with $1+(-1)^n/n$ (witness frozen at $n=2$: attained). Example 2 on the board; Example 3(a) as a quick poll.
- Consequences of completeness. Archimedean property (stress that the proof uses only completeness), Theorem 1.24 in full (students should be able to reproduce it), density with Example 4, the non-Archimedean field of Example 5 as a five-minute aside. Nested intervals (Theorem 1.26, Example 6) with Interactive 2 in base 2 for $\sqrt2$, then base 2 for $1/10$ to show periodicity. Finish with Theorem 1.28 and E3 or E5 from the Exam corner.
Discussion questions. (1) Is there a smallest positive real number? A smallest positive rational? What about in $\mathbb{R}(t)$? (2) Which results of this section use completeness, which only the Archimedean property, and which hold in every ordered field? (3) "$\sqrt2=1.41421356\ldots$" — is this a definition of $\sqrt2$? What would we need to know first?
Misconceptions to watch for. Confusing $\sup$ with $\max$; choosing the witness before $\varepsilon$ (quantifier order); believing nested open intervals always have empty intersection, or that the nested interval property needs lengths $\to0$; dividing an inequality by a quantity of unknown sign; thinking $0.999\ldots$ is "just less than" $1$; treating $\pm\infty$ as numbers.
Suggested homework. I(3, 4, 5, 8), II(1, 2, 5, 7, 9, 10), III(2, 5, 7), IV(1, 3, 6, 7); Exam corner E1, E4, E6.
Research question. Which axioms of a complete ordered field survive inside a computer's floating-point numbers — and what happens when one of them fails?
Why it matters. Engineering simulations, weather and climate models, and financial software all compute with IEEE-754 floating-point numbers, a finite set pretending to be $\mathbb{R}$. In 1991 a Patriot air-defence battery in Dhahran, Saudi Arabia, failed to intercept an incoming missile partly because its clock counted time in tenths of a second, and $\tfrac1{10}$ has a non-terminating binary expansion (Example 7): the value stored in a 24-bit register was slightly too small, and the error grew with every tick.
What to do.
- In Python, compare
(0.1+0.2)+0.3with0.1+(0.2+0.3). Which field axiom fails? - Find the largest $k$ for which
1 + 2**-k != 1. Interpret $2^{-k}$ as a kind of "smallest $\varepsilon$" — which property of $\mathbb{R}$ (Theorem 1.19(e), Theorem 1.23) has no analogue here? - Truncate the binary expansion of $\tfrac1{10}$ after $23$ binary places. Compute the error per tick exactly, then the accumulated error after $100$ hours of operation ($3.6\times10^6$ ticks).
- Explain why "every bounded set has a supremum" holds trivially for floating-point numbers, and why that does not make them a complete ordered field.
Tools: Python (with fractions.Fraction for exact arithmetic) or a spreadsheet.
Hand in: A one-page note listing the axioms you saw fail, your two computed errors, and one sentence on how interval arithmetic (nested intervals!) is used to make computations rigorous.
Going further. Read about Kahan summation, or about verified computing, in which a computer proves a numerical statement by enclosing every quantity in a small closed interval.
🧪 Self-check quiz
Q1. $\sup\left\{1-\tfrac1n:n\in\mathbb{N}\right\}$ is
Q2. Which ordered field is not Archimedean?
Q3. $u=\sup S$ if and only if $u$ is an upper bound of $S$ and for every $\varepsilon\gt0$ there is $s\in S$ with
Q4. Which nested family has empty intersection?
Q5. The binary expansion of $\tfrac1{10}$ is