Section 6.1 gave every element of an ordered field
a record, the set
of
rationals below it, and showed that in an Archimedean
field the record determines the element (Lemma 6.1.3).
This section turns the record into a map. Given an
Archimedean field
and a complete field , we send to the element of
with the same
record. The result is the main theorem of the chapter in
its one-sided form: there is exactly one
order-preserving field map . Section 6.3 applies it twice, in both
directions, to compare two complete ordered fields.
Two fields are in play throughout, so every proof
here keeps
and
visible. Only the two lemmas, each about one field,
write for .
What the
map must be
Suppose is an order-preserving field map (Definition 6.1.1).
By Proposition 6.1.1
it fixes the rationals, , and it preserves and reflects
order. So for and , In the notation of Section 6.1: . The image of has exactly the
rationals below it that has.
That already shows there can be at most one such map
when is
Archimedean: two candidates for would have the
same rationals below them, and rationals separate. For
existence, we need an element of with a prescribed set
of rationals below it. When is complete there is a
natural candidate: the least element of that lies above all the
copies ,
,
that is, their supremum.
The check that this candidate respects sums and
products goes through the record, not through suprema.
For that we need to know how the rationals below and below are made from those
below and .
Sums and
products, measured by rationals
A rational
lies below
exactly when it splits into a rational below and a rational below
.
Lemma
6.2.1 (Rationals below a Sum)
Let be an
Archimedean ordered field, and . Then if
and only if there is with In other words, .
Idea. One direction is addition of
inequalities. For the other, split as with a rational just below
: we need in the gap between
and , which is non-empty
exactly because , and density supplies it.
For products the same idea works for positive
elements and positive rationals, with in place of .
Lemma
6.2.2 (Rationals below a Product)
Let be an
Archimedean ordered field, with and , and with . Then if and
only if there is with For , holds always.
In words: below a product of positives, a
positive rational splits as a product of a rational
below each factor. Exercise B1 asks for the proof;
the fold below has it.
↺Second readingThe
proof of the product lemma (try Exercise B1
first)
Idea. As for sums, with division in
place of subtraction: split as with a rational in the gap
between and
, a gap of
positive elements.
Proof. We write for ; since preserves
products and for , it preserves quotients, so in
.
If , then
by
(O4). Let .
Let
with and . Since (Proposition 2.5.2
(a), (O4)), Proposition 2.3.5
(c) gives ; since , it gives . So
.
Let .
Multiplying by (Proposition 2.5.2
(a), Proposition 2.3.5
(c)) gives , and by (O4). By Theorem 4.2.5
there is
with . Then , so in ,
since
reflects order. Multiplying by gives , and
multiplying by gives .
Quick check. In , with , and , find a
rational as in Lemma 6.2.1.
Which rationals
work?
Solution. We need and , that is,
. For example : then . Exactly the rationals of the
open gap between and work, as the proof predicts.
The map
into a complete field
Here is the theorem. Its proof is the first key proof
of the chapter.
Theorem
6.2.3 (Embedding an Archimedean Field in a
Complete One)
Let be an
Archimedean ordered field and a complete ordered
field. Then there is exactly one
order-preserving field map .
It is given by the supremum taken in , and it satisfies
Try it first (ten minutes): if exists and fixes
, which element
of must be?
Idea. The natural first attempt
defines on
the copy of , by
, and then tries to
“extend”. It stalls at once: an element that is not a
rational has no formula, and nothing in names it. What we do
know, from the previous subsection, is its record: must have
exactly the rationals below it. So we
construct a point as a supremum: is the least
upper bound in of
the copies of those rationals, and says the
construction has the right record. After that, sums,
products and uniqueness are checked the same way:
compute the record of both sides (for sums and products
by the two lemmas) and let rationals separate in . Monotonicity needs
only one rational between and .
Step roadmap: ① exists; ②
; ③ fixes the
rationals; ④ is strictly
increasing; ⑤ sums; ⑥ products and the unit; ⑦
uniqueness. Before reading on: where is completeness
of used, and
where the Archimedean property of ?
Proof. By Theorem 6.1.2,
is Archimedean.
So Theorem 4.2.5,
Lemma 6.1.3,
Lemma 6.2.1
and Lemma 6.2.2
apply in as well
as in . For write .
Step 1: is
defined. Let . Since
is Archimedean, there is with , so (Proposition 2.3.5
(a)), and : the set is non-empty. Applied
to , the
Archimedean property gives with . For , , so because reflects order,
and . So is an upper
bound of . Since
is complete,
has a supremum
in , and it is
unique;
is that supremum. So is a function.
Step 2: . Let
and .
Let
. By
density in there
is with
. Then , so and
, since is an upper
bound. Also (reflection in ), so , and .
Let
. Since is the
least upper bound of , is not an
upper bound, so there is with (totality). Then (reflection in
), so , and .
Step 3: fixes the
rationals. Let . By and the first
example after Definition 6.1.2,
used in and in
, By Lemma 6.1.3
in , . In particular and
.
Step 4: is strictly
increasing. Let in . By density in there is with .
Then (by (O1)), so by , and
by totality. And , so . Hence .
Step 5: sums. Let and . Then by , Lemma 6.2.1
in , twice, and Lemma 6.2.1
in . By Lemma 6.1.3
in , .
Step 6: products and the unit. First
let and
. By Steps
3 and 4, and ; and
, by (O4). Let . If , then , and , by the last clause
of Lemma 6.2.2
in and in . If , then by , Lemma 6.2.2
in , twice, and Lemma 6.2.2
in (with ). By Lemma 6.1.3
in , for .
Now the signs. By Steps 5 and 3, , so
(Proposition 2.3.2
(a)). If or
, both sides
of are (Step 3 and Proposition 2.3.2
(b)). If , then (Proposition 2.3.5
(a)) and (Proposition 2.3.2
(c)), so The case follows by (F6), and if , then and . Finally by
Step 3. With Steps 4 and 5, is an
order-preserving field map.
Step 7: uniqueness. Let be
any order-preserving field map, and let , . By Proposition 6.1.1,
. If , then
. If ,
that is, , then ,
because
reflects order (the remark after Definition 6.1.1).
So the second equality by . By Lemma 6.1.3
in , .
Since was
arbitrary, . This proves the theorem.
The answer to the prompt. Completeness of is used in Step 1,
where the supremum must exist, and in Step 2 , where its
leastness turns “below ” into “below
some ”.
The Archimedean property of is used in Step 1 for
the bounds and
, in Steps 2 and 4
through density in , and in Steps 5 and 6
through the two lemmas applied in . Completeness of is used a third time,
indirectly: it makes Archimedean (Theorem 6.1.2),
which Steps 3, 5, 6 and 7 need for rationals to separate
in and for the
lemmas in .
Warning. The supremum in the
definition of is taken
in , of the copies
. It
cannot be taken in , or in . In : the set of Example (The Rationals below the Square Root of Two)
(with as in
Section 6.1) has no supremum in . It contains the set
of Theorem 2.6.2,
and its other elements are negative, so below ; hence the two
sets have the same upper bounds in , and has no least one. In
: the supremum of
always exists and is itself, since is an upper bound and,
by density in (Theorem 4.2.5),
every lies
below some . So it is an element of the wrong field.
Quick check. Take , a complete
ordered field. Which map does Theorem 6.2.3
produce, and why, without computing a single
supremum?
Solution. The identity. The theorem
says there is exactly one order-preserving field map
( is Archimedean by Theorem 6.1.2),
and is one
(the first example after Definition 6.1.1).
So .
This is the argument Section 6.3 builds on.
Exercises
A. Check your
understanding
Exercise
(A1)
These questions are about the proof of Theorem 6.2.3.
- (a) Which steps use
that is complete,
and which that is
Archimedean? Which steps use that is Archimedean, and
where does that come from?
- (b) Run the
definition of with and , the constructed
reals. What is ?
- (c) State the idea
of the proof in two sentences.
- (d) Why may Step 1
not define as a supremum
taken in ?
Solution.
(a) complete: Step 1 (the
supremum exists) and Step 2 (its
leastness).
Archimedean: Step 1 (the bounds , ), Steps 2 and 4
(density in ), and
Steps 5 and 6 (Lemma 6.2.1
and Lemma 6.2.2
applied in ).
Archimedean:
Steps 3, 5, 6 and 7, through Lemma 6.1.3
in and the two
lemmas in . It
comes from the completeness of , by Theorem 6.1.2.
(b) . By Step 3, for every , and is the
identity (Chapter 4, after Theorem 4.2.2).
So , which is by Theorem 5.4.1
(d). Concretely, is the
supremum in of
, and that supremum is .
(c) An
order-preserving map that fixes the rationals must send
to an element
with the same rationals below it, and in a complete
the supremum of
their copies is such an element. Every field identity
for is then
checked by comparing the rationals below the two sides,
which the sum and product lemmas compute, and rationals
separate in .
(d) In the supremum of always
exists, since is
Archimedean, and it is itself (Exercise B2 of
Section 6.1): an element of , not of . So it does not give a
map into . The
supremum must be of the copies , taken in
.
B. Practice
Exercise
(B1)
Prove Lemma 6.2.2:
let be an
Archimedean ordered field, with , and with ; show that if and
only if some rational has and . Show
also that for every rational .
Hint: imitate the proof of Lemma 6.2.1,
with division in place of subtraction.
Solution. Write for . Since preserves
products, for , so (Lemma 4.1.1
(a)) and in .
If , then
by
(O4).
Let .
Let
, , . Then (Proposition 2.5.2
(a), (O4)), so Proposition 2.3.5
(c) gives , and, as , . Hence .
Let .
Since , Proposition 2.3.5
(c) gives , and . By Theorem 4.2.5
there is
with . Then , so since reflects order.
From and
, ; multiplying by
,
. This
is as
required.
Exercise
(B2: Cube roots)
Let be a
complete ordered field and with . Let . The following steps prove that some has .
- (1) is non-empty () and bounded
above by : if
, then
, so . Let
.
Then ,
since has , so , and .
- (2) For , and , which is unless (if , then by Proposition 2.3.5
(e), (c) and the square is , so the sum is
positive by (b); if and , the expression is by (e)). Hence
, for all .
- (3) The case is impossible.
Let . Since and , , so , against being an upper
bound.
- (4) The case is impossible.
Name the move, then complete it.
- (5) Hence .
Then explain how to get a cube root of and of , and why every
has
exactly one cube root.
Solution. The move is
construct a point as a supremum: is built as , and each of the
two wrong cases of trichotomy is refuted by exhibiting a
point that contradicts one clause of the supremum. In
step (3) it was an element of above , against (S1). In step
(4) it is an upper bound below , against (S2).
Suppose . Let ; it is positive, since by (1). Also
: this says
,
which holds because and . So , and since , and . Let . By (2), , so . Hence every element of is , and is an upper bound
of smaller than
, against being the least upper
bound.
Steps (3) and (4) leave only , by trichotomy
(O1).
For , . For , has a cube root
by the above, and
(Proposition 2.3.2
(c)). Uniqueness: if , then neither nor can hold, since by (2) either would make the
cubes differ; so . So every element of a complete ordered field
has exactly one cube root.
C. Going deeper
Exercise
(C1: Exit check: at most one map into an Archimedean
field)
Let and be Archimedean ordered
fields, and let be order-preserving field
maps. Prove that .
Solution (Hint 1). Compare the
rationals below and below .
Solution. Let and . By Proposition 6.1.1
(which needs no order hypothesis), for every . Since is strictly
increasing and reflects order (the remark after Definition 6.1.1),
So . Since is Archimedean, Lemma 6.1.3
gives . As was arbitrary, . (This is
Step 7 of Theorem 6.2.3
with in
place of ;
completeness of
is not needed, and neither is the Archimedean property
of .)
Why must
be Archimedean (remark, not proved here). The last
step separates from by a rational
strictly between them, which is density of in , and density needs
Archimedes (Theorem 4.2.5).
In the non-Archimedean field of Example (A Non-Archimedean Ordered Field),
the elements
and are
different and have the same rationals below them, namely
all : a
positive rational
has in
for some (Theorem 2.5.3),
so ,
because (Example (A Non-Archimedean Ordered Field)).
So the separating step fails in such a field. For the
stronger statement proved above, with arbitrary, the
hypothesis on
cannot be dropped: on , the substitution
keeps degrees and leading coefficients, so it is an
order-preserving field map
different from the identity (school polynomial algebra,
as flagged in Example (A Non-Archimedean Ordered Field)).
An example with
Archimedean needs more algebra than this volume has, and
we give none.
Marking scheme. (10 points) - 2:
each fixes
, with the
reason (Proposition 6.1.1,
or directly: induction for , then negatives and
quotients). - 3: links the rationals below to those below , using that
fixes and reflects order.
Either gives the full equivalence , or, for the squeeze route of
the next item, applies reflection by and to a rational
strictly between and . - 3: concludes
by rationals separating, or by a
rational strictly between the two, invoking the
Archimedean property of . - 2: states
the conclusion for every . Fatal errors (0 for the step): using
density in
without a hypothesis that gives it; assuming surjective.
Exercise
(C2: Dense image, and when the map is onto)
Let be an
Archimedean ordered field, a complete ordered
field, and the map of Theorem 6.2.3.
- (a) Prove that is dense in
: for all in there is with .
- (b) Prove that if
is complete, then
is
surjective.
- (c) Prove that if
is
surjective, then
is complete.
Solution (Hint 1). For (b), given
, look at
the set and its copy in .
Solution (Hint 2). For (b): is non-empty
and bounded above in ; let , and show .
Solution. By Theorem 6.1.2,
is
Archimedean.
(a) Let in . By Theorem 4.2.5
in there is with .
By Step 3 of the proof of Theorem 6.2.3,
, so
works.
(b) Let be complete and . Let .
Since is
Archimedean, there are with and . So
, and every
has , hence and . So is non-empty
and bounded above in , and exists.
We show . Let . By density in
there is with ; then and , so . Let . Then
is not
an upper bound of , so for some ; hence and , so .
By ,
, so by Lemma 6.1.3
in .
- (c) Let be surjective. It
is injective (strictly increasing), so bijective, with
an inverse (Sets, Relations, and Cardinality, Theorem 1.5.4).
Let
be non-empty with an upper bound . Then is non-empty
and bounded above by , since gives . As is complete, exists; let . Upper bound: for
, , so , because reflects order
(and is injective, for the case of equality).
Least: if is an upper bound of
, then is an upper
bound of , so , and as before. So (Sets, Relations, and Cardinality, Definition 2.6.5),
and is
complete.
So is an
order-preserving field isomorphism exactly when is complete. Section
6.3 reaches the “if” direction by a different route,
which computes no supremum at all.
Marking scheme. (10 points) - 2: (a)
is Archimedean
(Theorem 6.1.2),
so some
lies strictly between and , and (Step 3). - 2: (b) is non-empty
and bounded above in (Archimedes in , transferred through
), so
exists by completeness of . - 2: (b) , both
inclusions; uses density
in . - 1: (b)
by , hence by Lemma 6.1.3
in . - 3: (c) for
non-empty bounded above by , is bounded
above by , and is an upper bound of and the least one, both
using that
reflects order and is bijective. Fatal errors (0 for the
step): using density of in without the Archimedean
property of ; in
(b), taking a supremum in before checking that
the set is non-empty and bounded above; in (c), assuming
preserves order without justification.