The fields met so far sit inside one another. , and each is a field with the sum and
product of the next: inside through the
identification of Number Systems: From to , Section 5.4 (Number Systems: From to , Definition 5.4.1),
and inside
through Proposition 1.1.1.
Between and
lies the set
of
numbers with rational. Sums and products of two such
numbers are again of that form, but is ? This
section gives a short test that settles such questions
once, and it finds, inside every field, a smallest
field.
Throughout, and for
, as in Definition 2.1.1, and the
rules of Theorem 2.1.1 are used
freely, each cited by its letter.
Fields
inside fields
A subset of a
field inherits
two operations, but only in a weak sense: and are defined for , as elements
of . For to be a field with
these operations, the sum and the product must land in
, and the elements
that the axioms (F3), (F4), (F7) and (F8) ask for must
be found in . The
natural guess is that nothing else needs checking.
A subfield is a subset that a field’s own
arithmetic never leaves.
Definition
2.3.1 (Subfield)
Let be a
field. A subfield of is a subset such
that
- and
;
- is
closed under sums and products: and for
all ;
- is
closed under negatives: for
every ;
- is
closed under inverses: for
every non-zero .
Here , , , , and are those of .
In words: the first clause asks for the two special
elements of ; the
second says that the operations of do not leave ; the last two say that
the negatives and inverses which provides already lie in
.
Examples.
-
itself is a subfield of . It is the largest one,
and the degenerate case: every clause holds because
.
- in
. Under
the identification of a rational with , the
embedding
sends , , sums, products,
negatives and inverses of rationals to the same things
in (Number Systems: From to , Theorem 5.4.1
(a), (c)). So all four clauses hold, and is a subfield of
.
- in
.
Chapter 1 checked the four clauses for the copy of in . The zero and the one
of (Proposition 1.1.2
(d)) are the real numbers and under the
identification that follows Proposition 1.1.1,
and Theorem 1.2.4
gives closure under sums, products, negatives and
inverses. So is
a subfield of ,
and so is ,
since a subfield of a subfield is a subfield: each
clause of the inner one is a statement about the
operations of the outer field.
Non-examples.
- is closed under sums, products, negatives
and inverses (the last vacuously), and does not contain
, since in a field.
- contains and and is closed under
sums and products, but not under negatives, since , nor under
inverses, since (as for below).
- satisfies every clause except closure under
inverses: , since has no solution
(Number Systems: From to , Corollary 3.1.3
(a)).
These are the non-examples (i)–(iii) of Example (Four Systems That Are Not Fields),
now seen from inside (the fourth, , is not a subset
of ): each fails
as a subfield exactly where it failed as a field.
The
subfield test
The guess above is right, and it comes with a
converse and a shortcut. The converse says that a subset
closed under the operations which happens to be a field
cannot have its own zero or one: they must be those of
. The shortcut,
part (c), reduces the four clauses to three checks.
Proposition
2.3.1 (The Subfield Test)
Let be a field
and .
- (a) If is a subfield of , then , with the restrictions
of and to , is a field
(Definition 2.1.1). Its zero
is , its one is
, and the
negative and the inverse of an element of are those of .
- (b) Conversely,
suppose that and for all , and that with the restricted
operations is a field. Then is a subfield of : its zero is , its one is , and its negatives
and inverses are those of .
- (c) is a subfield of if and only
if , for all , and for all with .
Idea.
(a) The axioms
(F1), (F2), (F5), (F6) and (F9) are identities that hold
for all elements of , so in particular for
all elements of ;
nothing about
needs checking. The other axioms ask for elements, , , , , and the four
clauses of Definition 2.3.1 put them
in . We call this
move test inside the big field: the
identities come free, and only closure and the special
elements cost anything.
(b) runs the
other way. An equation true in is an equation in , where cancellation and
the uniqueness of negatives and inverses are available;
so and are forced to be
and .
(c) builds , , , and out of and the two operations
“subtract” and “divide”.
Before reading on: in (b), where is it used that
is a field, and
not just a commutative ring?
Proof.
(a) Since is closed under sums
and products, and
restrict to
functions . Axioms (F1), (F2), (F5), (F6) and (F9) hold
for all elements of , hence for all elements
of . (F3): , and for . (F4): for , by closure under
negatives, and . (F7): , for , and because this holds in . (F8): for non-zero
, by closure
under inverses, and . So
is a field, and , , , witness its
axioms; by the uniqueness of these elements in the field
(Theorem 2.1.1 (a), (c),
applied in ), they
are its zero, its one, its negatives and its
inverses.
(b) Write , for the zero and one
of the field . In
, by (F3);
in , . So in
, and additive
cancellation in
(Theorem 2.1.1 (b)) gives
. Next,
by (F7) in , and
by (F7) in . Since
,
multiplicative cancellation in (Theorem 2.1.1 (b)) gives
. Now let
, and let
be its
negative in :
,
so by the
uniqueness of negatives in (Theorem 2.1.1 (c)).
Likewise, if , that is , its inverse satisfies , so by the uniqueness of inverses in . Hence , is closed under the
negatives and inverses of , and with the
hypothesis on sums and products, is a subfield.
(c) by definition.
For ,
, so ,
by closure under negatives and sums. For , , so , by closure
under inverses and products.
First, , since by (F4). For , , by (F1) and (F3). For
non-zero ,
, by (F6) and (F7). For , and (Number Systems: From to , Proposition 2.3.2
(a)), so . For the product, let . If , then by Theorem 2.1.1 (d) and (F6).
If , then
, and
, since
while ; so , and
(Theorem 2.1.1 (g)) gives
. So contains and and is closed under
sums, products, negatives and inverses: it is a
subfield.
The answer to the prompt. Part (b) uses that is a field in the step
: canceling the factor
means
multiplying by its inverse in , which exists because
and (F8)
holds in . The
additive step uses only negatives, which every
commutative ring has. The warning below shows the
multiplicative step failing in a ring.
So to show that a subset is a field, we rarely check
nine axioms: we check (c), three closure statements, and
(a) does the rest.
Warning. A subset of a ring can be
a field with another one. In the ring
, the
subset
is closed under
and : and
.
With these operations it is a field with two elements, a
copy of , but
its one is , not
. Part (b) has
no counterpart here: , and cannot be canceled,
since is
not a field.
Likewise, a field structure with other
operations does not make a subset a subfield:
the set with the tables of is a field, but it
is not a subfield of , because the sum of
gives .
Square
roots of two and of minus one
The question of the opening is now one application of
the test. Recall that is a complete ordered
field (Number Systems: From to , Theorem 5.6.3),
so by Number Systems: From to , Proposition 6.1.4
there is exactly one with and , and . The set is that of
Number Systems: From to , Definition 6.4.2.
Example
(The Field Generated by the Square Root of Two)
Show that is a field, namely a subfield of , and find the inverse
of .
Solution. We check the three
conditions of Proposition 2.3.1 (c). All
computations are in the field , with , and they
expand brackets by (F5), (F6), (F9) and Number Systems: From to , Proposition 2.3.2
(c).
One. .
Differences. For , , and .
Products, used below. , again in .
Inverses. Let , with . First, the
conjugate is not . If and , then
, and , against Number Systems: From to , Theorem 2.6.1.
If , then
. Now a rational number, and by Theorem 2.1.1 (f) in , both factors being
non-zero. Put .
Then , so
by
the uniqueness of inverses (Theorem 2.1.1 (c)).
Finally, for , by the product formula.
By Proposition 2.3.1 (c),
is a
subfield of ,
and by (a) it is a field.
The inverse of . Here , and , so Check: .
The move “multiply by the conjugate” is the one that
inverted complex numbers in Proposition 1.2.3.
Number Systems: From to , Section 6.4,
proved the same facts about as part of
an ordered field (Number Systems: From to , Proposition 6.4.5),
and showed that it does not contain a square root of
(Number Systems: From to , Proposition 6.4.6).
Quick check. Is a subfield of ?
Solution. No. It contains , but not
. If
with
and , then
would be rational, against Number Systems: From to , Theorem 2.6.1;
and if , then
.
So it is not closed under inverses. It satisfies the
other three clauses, exactly as
does.
The same test works inside , where plays the part
of ,
and as above.
Example
(Rational and Integer Complex Numbers)
Let and , subsets of .
- (i) Show that is a subfield of
.
- (ii) Show that contains and and is closed under
differences and products, but is not a subfield of .
- (iii) Summarize the
subfields of
met so far.
Solution. Real and imaginary parts
are compared as in Definition 1.1.1:
with holds exactly when and .
(i) We use Proposition 2.3.1 (c).
. Differences: . Products: , from
. Inverses:
let with ; then . The rational number is
positive: is an
ordered field (Number Systems: From to , Theorem 2.5.1),
a non-zero square is positive (Number Systems: From to , Proposition 2.3.5
(e)) and (Number Systems: From to , Proposition 2.3.2
(b)), so every square is non-negative, and a sum of a
positive and a non-negative element is positive (Number Systems: From to , Proposition 2.3.5
(b)). So .
Since , the element satisfies , so
(Theorem 2.1.1 (c)), and
then for by the product formula. So is a subfield of
.
(ii) and lie in , and the
difference and product formulas of (i), with integer
, give
integer parts. But has no inverse in . Suppose had
. Then in , by the uniqueness of
inverses (Theorem 2.1.1 (c)) and
because the inverse of in is the real number
(Theorem 1.2.4), so
,
and comparing real parts gives . So
is not
closed under inverses.
(iii) , , and are subfields of
, and is a
subfield of ,
hence of : For
in there is a
second way to see it: by Proposition 1.1.1
the copy
of in is closed under and , since and . It is a field with these operations.
Every element of is for some , so each
identity among the axioms carries over from through these two
equations; for instance . In the same way , , and, for , serve as
the zero, the negatives, the one and the inverses; and
, and
exactly when , because is injective. Proposition 2.3.1 (b) then
says that it is a subfield, with the zero and one of
.
The
smallest subfield
Subfields can be intersected, and that gives, for any
set of elements,
a smallest field containing them.
Proposition
2.3.2 (Intersections of Subfields)
Let be a
field.
- (a) If is a
non-empty set of subfields of , then is a subfield
of .
- (b) For every subset
there
is a smallest subfield of containing : a subfield with ,
contained in every subfield of that contains . It is ,
where is the
set of subfields of that contain .
Proof.
(a) The
intersection is defined because is a non-empty set of
subsets of (Sets, Relations, and Cardinality, Definition 1.2.4).
We check Proposition 2.3.1 (c).
Every
contains , so
.
If , then for every , so for every , by (c) applied to ; hence . In
the same way, when .
(b) is a set, by
Separation (Z6) from the power set of , which exists by (Z5)
(Number Systems: From to , Axiom 1.1.1).
It is non-empty, since . By (a), is a subfield of . Every contains
, so . And if
is a subfield
containing , then
, so
.
Two smallest subfields containing would each contain the
other, so is
the only one.
The case asks for no element at all, and gives
a subfield contained in every subfield. It has a
name.
Definition
2.3.2 (Prime Subfield)
The prime subfield of a field is the smallest
subfield of , that
is,
of Proposition 2.3.2 (b): the
intersection of the set of all
subfields of .
In words: the prime subfield is what every subfield
of contains.
Section 2.5 identifies it in every field, as a copy of
or of exactly
one . One case
can be settled now: the prime subfield of is itself, because
has no other
subfield. Indeed, let be a subfield of . It contains and is closed under
, so it contains
every multiple with , the multiples of Number Systems: From
to , Section 2.3
(“Multiples”): , and if , then , so induction (Logic and Proof, Axiom 4.2.1)
covers every . In
, (Number Systems: From to , Theorem 3.4.3
(d)), and every element is for some
(Number Systems: From to , Theorem 3.4.3
(b)). So .
The smallest subfield containing a given element is
often easy to name. Exercise B2 shows that is the
smallest subfield of containing ; the reason to
expect it is that a subfield containing contains , hence every rational,
and is closed under the sums and products that build
.
Exercises
A. Check your
understanding
Exercise
(A1)
These parts are about Proposition 2.3.1 (b).
- (a) Why must the one
of a field , closed under the operations of the field
, be ? Name the step of the
proof.
- (b) Run the proof of
(b) on inside the ring (the warning).
Which steps go through, and which step fails?
- (c) In Example (The Field Generated by the Square Root of Two),
is the commutativity (F6) of checked, or
inherited? From where?
- (d) State the idea
of the subfield test, parts (a) and (b), in two
sentences.
Solution.
(a) In , , and ; multiplicative cancellation in (Theorem 2.1.1 (b)) removes
the factor and
gives .
(b) The zero step
goes through:
is the zero of both, and cancels in any commutative
ring. The negative step also goes through (, so in both). The
one step fails: , but has no inverse in
(
for every ), so it
cannot be canceled, and indeed . The inverse
step then has nothing to say.
(c) Inherited.
(F6) holds for all elements of (Number Systems: From to , Theorem 5.2.3),
hence for all elements of the subset ; Proposition 2.3.1 (a)
records this. The solution of the example checks only
the three conditions of (c).
(d) The
identities among the field axioms hold for all elements
of the big field, hence for the elements of any subset,
so only closure and the special elements need
checking. Conversely, the zero and one of a field
sitting inside
with ’s operations
are forced, by cancellation in , to be those of .
B. Practice
Exercise
(B1: Putting a proof in order)
Here are the lines of the proof of Proposition 2.3.1 (c) , shuffled,
together with two lines that do not belong. Put the
correct lines in an admissible order, say which other
orders are admissible, and say what is wrong with each
of the other two lines.
- (i) Assume , for all , and for all
with
.
- (ii) .
- (iii) For , .
- (iv) For non-zero
, .
- (v) For , .
- (vi) For : if , then and (as ), so ; if , .
- (vii) So is a subfield of .
The two extra lines: “(ii′) , since for any ”, and “(vi′)
, because
is closed under
multiplication”.
Solution. An admissible order is
(i), (ii), (iii), (iv), (v), (vi), (vii). The
constraints are what each line uses: (i) comes first and
(vii) last; (ii) comes before (iii), which uses , and before (vi),
whose case
uses ; (iii)
comes before (v), which uses ; (iv) comes
before (vi), which uses (line (vi)
itself checks before applying (i) to it). Any order
respecting these is admissible; for instance (i), (ii),
(iv), (iii), (vi), (v), (vii).
(ii′) is false: , not ,
and exists
only for .
(vi′) is circular: closure under products is part of
what the proof must establish, so the line cites the
goal. This is entry (N9) of Logic and Proof, Example (What is not allowed).
Exercise
(B2)
Show that is the smallest subfield of containing , in the sense of
Proposition 2.3.2 (b).
Solution. Let be a subfield of with . Since
and is closed under , for every
, by
induction (Logic and Proof, Axiom 4.2.1)
as for above;
and in , (Number Systems: From to , Theorem 5.4.1
(d), under the identification). Then by closure under
negatives, so every integer lies in (every integer is or with , Number Systems: From to , Proposition 2.2.3
(c)). For
and , , so by closure under inverses and products;
and every rational is of this form (Number Systems: From to , Proposition 2.4.4
(b)). So , and then for all , by closure
under sums and products. Hence .
Conversely, is a subfield of (Example (The Field Generated by the Square Root of Two))
containing . So it is the smallest such
subfield.
Exercise
(B3)
Inside (with
),
show that .
Solution. A rational
is and .
Let
with . The number is real, so
its imaginary part is ; the imaginary part of
is . Comparing parts (Definition 1.1.1),
and . If
, then , against Number Systems: From to , Theorem 2.6.1.
So , and .
By Proposition 2.3.2 (a), this
also shows again that is a subfield of
.
Solution. The claim stated with Number Systems: From to , Proposition 6.4.6
says: if and , no rational squares to . We use it for and , since and .
is a subfield. Exactly as in Example (The Field Generated by the Square Root of Two),
with in place of
: the product is
; for ,
the conjugate is non-zero (if , it would make rational,
against the claim with ), , and .
Not in . If , then , a square root of
in , against Number Systems: From to , Proposition 6.4.6.
Not in . If it were, then , say
with .
Squaring, If , then , against the
claim with .
So , and then
. If
, then , against Number Systems: From to , Theorem 2.6.1.
If , then
, so , against the
claim with .
The union. and ,
but their sum is in neither. So is not closed under sums, and is not a
subfield of ,
although both pieces are.
C. Going deeper
Exercise
(C1: A finite subset closed under the operations)
Let be a field
and a
finite subset with , closed under
and . Show that , that is closed under
negatives and under inverses of non-zero elements, and
hence that is a
subfield of . Then
show that the hypothesis “finite” cannot be dropped.
Solution (Hint 1). For , which maps can you build
from and the two
operations?
Solution (Hint 2). The maps and go from
to . Why are they
injective, and what does finiteness then give?
Solution. A finite set has no
injection onto a proper part. Let be
injective. If
were not surjective, its image (Sets, Relations, and Cardinality, Definition 1.6.1)
would be a proper subset of , and , with codomain , would be a
bijection , against Sets, Relations, and Cardinality, Theorem 3.1.9.
So every injective map is surjective.
Zero. Let , , a
map into because
is closed under
and . It is injective:
gives by (F1), so by additive
cancellation in
(Theorem 2.1.1 (b)). So it
is surjective, and some has , so by (F1); canceling, . So .
Negatives. Let . The map is injective in the same way,
hence surjective, and is a value: for some . By the uniqueness of negatives in , .
Inverses. Let , . The map goes from to and is injective by
multiplicative cancellation in , which uses . So it is
surjective,
for some ,
and by
the uniqueness of inverses in .
So is a
subfield. Note that need not be assumed: .
Finiteness is needed.
contains and is
closed under and
, and . The
argument breaks at “injective, hence surjective”: is
injective on ,
and is not a
value.
Marking scheme. (10 points) - 2: a
finiteness argument with its reason: an injective map
from a finite set to itself is surjective (Sets, Relations, and Cardinality, Theorem 3.1.9,
or a count), or pigeonhole on a sequence in (Sets, Relations, and Cardinality, Theorem 3.1.2).
- 2: , from
a translation map and cancellation, or from a repetition
with and cancellation in ,
before is used. - 2:
negatives, from surjectivity of and
uniqueness of negatives in , or from a repetition
with , giving . - 2: inverses, with the
cancellation by
justified by (injectivity of , or with giving and ). - 2: a witness that finiteness
is needed (, or for inverses). Fatal errors (0
for the step): using or to build the translation before proving it;
“injective, hence surjective” (or pigeonhole) without
finiteness.
Exercise
(C2: Find the error)
Here is an argument. Is its conclusion true? Does the
argument prove it? If not, name the line that fails and
why.
“ is
closed under inverses. (1) Let be non-zero. (2) Then (3) Both coefficients are rational, so the
inverse lies in .”
Solution. The conclusion is
true (Example (The Field Generated by the Square Root of Two)).
The argument does not prove it.
Line (2) fails. Its first equality uses the
general “fact” , which is neither proved nor true; so
the line cites nothing, entry (N9) of Logic and Proof, Example (What is not allowed).
It also divides by and by , either of which may be
(for ,
). The second
equality, , is correct for .
Counterexample to the step. in : , while
. In
the case at hand, : the formula gives , and
;
the true inverse is .
Repair. Multiply by the conjugate, as in Example (The Field Generated by the Square Root of Two):
.