2.3  Subfields

The fields met so far sit inside one another. Q⊆R⊆C, and each is a field with the sum and product of the next: Q inside R through the identification of Number Systems: From N to R, Section 5.4 (Number Systems: From N to R, Definition 5.4.1), and R inside C through Proposition 1.1.1. Between Q and R lies the set Q(2) of numbers a+b2 with a,b rational. Sums and products of two such numbers are again of that form, but is 1/(1+22)? This section gives a short test that settles such questions once, and it finds, inside every field, a smallest field.

Throughout, a−b:=a+(−b) and a/b:=ab−1 for b≠0, as in Definition 2.1.1, and the rules of Theorem 2.1.1 are used freely, each cited by its letter.

2.3.1. Fields inside fields

A subset K of a field L inherits two operations, but only in a weak sense: a+b and ab are defined for a,b∈K, as elements of L. For K to be a field with these operations, the sum and the product must land in K, and the elements that the axioms (F3), (F4), (F7) and (F8) ask for must be found in K. 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 L be a field. A subfield of L is a subset K⊆L such that

  • 0∈K and 1∈K;
  • K is closed under sums and products: a+b∈K and ab∈K for all a,b∈K;
  • K is closed under negatives: −a∈K for every a∈K;
  • K is closed under inverses: a−1∈K for every non-zero a∈K.

Here 0, 1, +, ⋅, −a and a−1 are those of L.

In words: the first clause asks for the two special elements of L; the second says that the operations of L do not leave K; the last two say that the negatives and inverses which L provides already lie in K.

Examples.

  • L itself is a subfield of L. It is the largest one, and the degenerate case: every clause holds because K=L.
  • Q in R. Under the identification of a rational q with κ(q)∈R, the embedding κ sends 0, 1, sums, products, negatives and inverses of rationals to the same things in R (Number Systems: From N to R, Theorem 5.4.1 (a), (c)). So all four clauses hold, and Q is a subfield of R.
  • R in C. Chapter 1 checked the four clauses for the copy of R in C. The zero 0=(0,0) and the one 1=(1,0) of C (Proposition 1.1.2 (d)) are the real numbers 0 and 1 under the identification a=(a,0) that follows Proposition 1.1.1, and Theorem 1.2.4 gives closure under sums, products, negatives and inverses. So R is a subfield of C, and so is Q, 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.

  • {0}⊆Q is closed under sums, products, negatives and inverses (the last vacuously), and does not contain 1, since 1≠0 in a field.
  • N⊆Q contains 0 and 1 and is closed under sums and products, but not under negatives, since −1∉N, nor under inverses, since 2−1=1/2∉N (as for Z below).
  • Z⊆Q satisfies every clause except closure under inverses: 2−1=1/2∉Z, since 2x=1 has no solution x∈Z (Number Systems: From N to R, Corollary 3.1.3 (a)).

These are the non-examples (i)–(iii) of Example (Four Systems That Are Not Fields), now seen from inside Q (the fourth, Z/6Z, is not a subset of Q): each fails as a subfield exactly where it failed as a field.

2.3.2. 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 L. The shortcut, part (c), reduces the four clauses to three checks.

Proposition 2.3.1 (The Subfield Test)

Let L be a field and K⊆L.

  • (a) If K is a subfield of L, then K, with the restrictions of + and ⋅ to K×K, is a field (Definition 2.1.1). Its zero is 0L, its one is 1L, and the negative and the inverse of an element of K are those of L.
  • (b) Conversely, suppose that a+b∈K and ab∈K for all a,b∈K, and that K with the restricted operations is a field. Then K is a subfield of L: its zero 0K is 0L, its one 1K is 1L, and its negatives and inverses are those of L.
  • (c) K is a subfield of L if and only if 1∈K, a−b∈K for all a,b∈K, and ab−1∈K for all a,b∈K with b≠0.

Idea.

  • (a) The axioms (F1), (F2), (F5), (F6) and (F9) are identities that hold for all elements of L, so in particular for all elements of K; nothing about K needs checking. The other axioms ask for elements, 0, −a, 1, a−1, and the four clauses of Definition 2.3.1 put them in K. 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 K is an equation in L, where cancellation and the uniqueness of negatives and inverses are available; so 0K and 1K are forced to be 0L and 1L.

  • (c) builds 0, −b, b−1, a+b and ab out of 1 and the two operations “subtract” and “divide”.

Before reading on: in (b), where is it used that L is a field, and not just a commutative ring?

Proof.

  • (a) Since K is closed under sums and products, + and ⋅ restrict to functions K×K→K. Axioms (F1), (F2), (F5), (F6) and (F9) hold for all elements of L, hence for all elements of K. (F3): 0∈K, and a+0=a for a∈K. (F4): for a∈K, −a∈K by closure under negatives, and a+(−a)=0. (F7): 1∈K, a⋅1=a for a∈K, and 1≠0 because this holds in L. (F8): for non-zero a∈K, a−1∈K by closure under inverses, and aa−1=1. So K is a field, and 0L, 1L, −a, a−1 witness its axioms; by the uniqueness of these elements in the field K (Theorem 2.1.1 (a), (c), applied in K), they are its zero, its one, its negatives and its inverses.

  • (b) Write 0K, 1K for the zero and one of the field K. In K, 0K+0K=0K by (F3); in L, 0K+0L=0K. So 0K+0K=0K+0L in L, and additive cancellation in L (Theorem 2.1.1 (b)) gives 0K=0L. Next, 1K⋅1K=1K by (F7) in K, and 1K⋅1L=1K by (F7) in L. Since 1K≠0K=0L, multiplicative cancellation in L (Theorem 2.1.1 (b)) gives 1K=1L. Now let a∈K, and let x∈K be its negative in K: a+x=0K=0L, so x=−a by the uniqueness of negatives in L (Theorem 2.1.1 (c)). Likewise, if a≠0K, that is a≠0L, its inverse y∈K satisfies ay=1K=1L, so y=a−1 by the uniqueness of inverses in L. Hence 0L,1L∈K, K is closed under the negatives and inverses of L, and with the hypothesis on sums and products, K is a subfield.

  • (c) (⇒) 1∈K by definition. For a,b∈K, −b∈K, so a−b=a+(−b)∈K, by closure under negatives and sums. For b≠0, b−1∈K, so ab−1∈K, by closure under inverses and products.

(⇐) First, 0=1−1∈K, since 1+(−1)=0 by (F4). For b∈K, −b=0+(−b)=0−b∈K, by (F1) and (F3). For non-zero b∈K, b−1=1⋅b−1∈K, by (F6) and (F7). For a,b∈K, −b∈K and −(−b)=b (Number Systems: From N to R, Proposition 2.3.2 (a)), so a+b=a−(−b)∈K. For the product, let a,b∈K. If b=0, then ab=0∈K by Theorem 2.1.1 (d) and (F6). If b≠0, then b−1∈K, and b−1≠0, since bb−1=1≠0 while b⋅0=0; so a(b−1)−1∈K, and (b−1)−1=b (Theorem 2.1.1 (g)) gives ab∈K. So K contains 0 and 1 and is closed under sums, products, negatives and inverses: it is a subfield.

The answer to the prompt. Part (b) uses that L is a field in the step 1K⋅1K=1K⋅1L⇒1K=1L: canceling the factor 1K means multiplying by its inverse in L, which exists because 1K≠0 and (F8) holds in L. 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 Z/6Z, the subset {[0],[3]} is closed under + and ⋅: [3]+[3]=[6]=[0] and [3][3]=[9]=[3]. With these operations it is a field with two elements, a copy of F2, but its one is [3], not [1]. Part (b) has no counterpart here: [3][3]=[3][1], and [3] cannot be canceled, since Z/6Z is not a field.

Likewise, a field structure with other operations does not make a subset a subfield: the set {0,1}⊆Q with the tables of F2 is a field, but it is not a subfield of Q, because the sum of Q gives 1+1=2∉{0,1}.

2.3.3. Square roots of two and of minus one

The question of the opening is now one application of the test. Recall that R is a complete ordered field (Number Systems: From N to R, Theorem 5.6.3), so by Number Systems: From N to R, Proposition 6.1.4 there is exactly one r∈R with r≥0 and r2=2, and 2:=r. The set Q(2) is that of Number Systems: From N to R, Definition 6.4.2.

Example (The Field Generated by the Square Root of Two)

Show that Q(2):={a+b2:a,b∈Q}⊆R is a field, namely a subfield of R, and find the inverse of 1+22.

Solution. We check the three conditions of Proposition 2.3.1 (c). All computations are in the field R, with (2)2=2, and they expand brackets by (F5), (F6), (F9) and Number Systems: From N to R, Proposition 2.3.2 (c).

One. 1=1+02∈Q(2).

Differences. For a,b,c,d∈Q, (a+b2)−(c+d2)=(a−c)+(b−d)2, and a−c,b−d∈Q.

Products, used below. (a+b2)(c+d2)=(ac+2bd)+(ad+bc)2, again in Q(2).

Inverses. Let y=c+d2≠0, with c,d∈Q. First, the conjugate c−d2 is not 0. If d≠0 and c−d2=0, then 2=c/d∈Q, and (c/d)2=2, against Number Systems: From N to R, Theorem 2.6.1. If d=0, then c−d2=c=y≠0. Now N:=(c+d2)(c−d2)=c2−2d2, a rational number, and N≠0 by Theorem 2.1.1 (f) in R, both factors being non-zero. Put y′:=c/N−(d/N)2∈Q(2). Then yy′=(c+d2)(c−d2)N−1=NN−1=1, so y′=y−1 by the uniqueness of inverses (Theorem 2.1.1 (c)). Finally, for x∈Q(2), xy−1∈Q(2) by the product formula.

By Proposition 2.3.1 (c), Q(2) is a subfield of R, and by (a) it is a field.

The inverse of 1+22. Here c=1, d=2 and N=1−8=−7, so (1+22)−1=−17+272=−1+227. Check: (1+22)(−1+22)=−1+22−22+8=7.

The move “multiply by the conjugate” is the one that inverted complex numbers in Proposition 1.2.3. Number Systems: From N to R, Section 6.4, proved the same facts about Q(2) as part of an ordered field (Number Systems: From N to R, Proposition 6.4.5), and showed that it does not contain a square root of 3 (Number Systems: From N to R, Proposition 6.4.6).

Quick check. Is {a+b2:a,b∈Z} a subfield of R?

Solution. No. It contains 2=2+02, but not 2−1=1/2. If a+b2=1/2 with a,b∈Z and b≠0, then 2=(1/2−a)/b would be rational, against Number Systems: From N to R, Theorem 2.6.1; and if b=0, then a=1/2∉Z. So it is not closed under inverses. It satisfies the other three clauses, exactly as Z⊆Q does.

The same test works inside C, where i2=−1 plays the part of (2)2=2, and Q⊆R⊆C as above.

Example (Rational and Integer Complex Numbers)

Let Q(i):={a+bi:a,b∈Q} and Z[i]:={a+bi:a,b∈Z}, subsets of C.

  • (i) Show that Q(i) is a subfield of C.
  • (ii) Show that Z[i] contains 0 and 1 and is closed under differences and products, but is not a subfield of C.
  • (iii) Summarize the subfields of C met so far.

Solution. Real and imaginary parts are compared as in Definition 1.1.1: a+bi=c+di with a,b,c,d∈R holds exactly when a=c and b=d.

  • (i) We use Proposition 2.3.1 (c). 1=1+0i∈Q(i). Differences: (a+bi)−(c+di)=(a−c)+(b−d)i. Products: (a+bi)(c+di)=(ac−bd)+(ad+bc)i, from i2=−1. Inverses: let y=c+di≠0 with c,d∈Q; then (c,d)≠(0,0). The rational number M:=c2+d2 is positive: Q is an ordered field (Number Systems: From N to R, Theorem 2.5.1), a non-zero square is positive (Number Systems: From N to R, Proposition 2.3.5 (e)) and 02=0⋅0=0 (Number Systems: From N to R, 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 N to R, Proposition 2.3.5 (b)). So M≠0. Since (c+di)(c−di)=c2+d2=M, the element y′:=c/M−(d/M)i∈Q(i) satisfies yy′=MM−1=1, so y−1=y′∈Q(i) (Theorem 2.1.1 (c)), and then xy−1∈Q(i) for x∈Q(i) by the product formula. So Q(i) is a subfield of C.

  • (ii) 0=0+0i and 1=1+0i lie in Z[i], and the difference and product formulas of (i), with integer a,b,c,d, give integer parts. But 2∈Z[i] has no inverse in Z[i]. Suppose u=a+bi∈Z[i] had 2u=1. Then u=2−1=1/2 in C, by the uniqueness of inverses (Theorem 2.1.1 (c)) and because the inverse of 2 in C is the real number 1/2 (Theorem 1.2.4), so a+bi=1/2+0i, and comparing real parts gives a=1/2∉Z. So Z[i] is not closed under inverses.

  • (iii) Q, Q(i), R and C are subfields of C, and Q(2) is a subfield of R, hence of C: Q⊆Q(2)⊆R⊆C,Q⊆Q(i)⊆C. For R in C there is a second way to see it: by Proposition 1.1.1 the copy ι(R) of R in C is closed under + and ⋅, since ι(a)+ι(c)=ι(a+c) and ι(a)ι(c)=ι(ac). It is a field with these operations. Every element of ι(R) is ι(a) for some a∈R, so each identity among the axioms carries over from R through these two equations; for instance ι(a)(ι(c)+ι(e))=ι(a(c+e))=ι(ac+ae)=ι(a)ι(c)+ι(a)ι(e). In the same way ι(0), ι(−a), ι(1) and, for a≠0, ι(a−1) serve as the zero, the negatives, the one and the inverses; and ι(1)≠ι(0), and ι(a)≠ι(0) exactly when a≠0, because ι is injective. Proposition 2.3.1 (b) then says that it is a subfield, with the zero and one of C.

2.3.4. The smallest subfield

Subfields can be intersected, and that gives, for any set S of elements, a smallest field containing them.

Proposition 2.3.2 (Intersections of Subfields)

Let L be a field.

  • (a) If K is a non-empty set of subfields of L, then ⋂K is a subfield of L.
  • (b) For every subset S⊆L there is a smallest subfield of L containing S: a subfield KS with S⊆KS, contained in every subfield of L that contains S. It is KS=⋂KS, where KS is the set of subfields of L that contain S.

Proof.

  • (a) The intersection ⋂K={x∈L:x∈K for every K∈K} is defined because K is a non-empty set of subsets of L (Sets, Relations, and Cardinality, Definition 1.2.4). We check Proposition 2.3.1 (c). Every K∈K contains 1, so 1∈⋂K. If a,b∈⋂K, then a,b∈K for every K∈K, so a−b∈K for every K∈K, by (c) applied to K; hence a−b∈⋂K. In the same way, ab−1∈⋂K when b≠0.

  • (b) KS is a set, by Separation (Z6) from the power set of L, which exists by (Z5) (Number Systems: From N to R, Axiom 1.1.1). It is non-empty, since L∈KS. By (a), KS:=⋂KS is a subfield of L. Every K∈KS contains S, so S⊆KS. And if K is a subfield containing S, then K∈KS, so KS⊆K. Two smallest subfields containing S would each contain the other, so KS is the only one.

The case S=∅ 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 L is the smallest subfield of L, that is, K∅ of Proposition 2.3.2 (b): the intersection of the set of all subfields of L.

In words: the prime subfield is what every subfield of L contains. Section 2.5 identifies it in every field, as a copy of Q or of exactly one Fp. One case can be settled now: the prime subfield of Fp is Fp itself, because Fp has no other subfield. Indeed, let K be a subfield of Fp. It contains 1 and is closed under +, so it contains every multiple k⋅1 with k∈N, the multiples of Number Systems: From N to R, Section 2.3 (“Multiples”): 0⋅1=0∈K, and if k⋅1∈K, then (k+1)⋅1=k⋅1+1∈K, so induction (Logic and Proof, Axiom 4.2.1) covers every k. In Z/pZ, k⋅[1]=[k] (Number Systems: From N to R, Theorem 3.4.3 (d)), and every element is [k] for some k∈{0,…,p−1} (Number Systems: From N to R, Theorem 3.4.3 (b)). So K=Fp.

The smallest subfield containing a given element is often easy to name. Exercise B2 shows that Q(2) is the smallest subfield of R containing 2; the reason to expect it is that a subfield containing 2 contains 1, hence every rational, and is closed under the sums and products that build a+b2.

2.3.5. Exercises

A. Check your understanding

Exercise (A1)

These parts are about Proposition 2.3.1 (b).

  • (a) Why must the one of a field K⊆L, closed under the operations of the field L, be 1L? Name the step of the proof.
  • (b) Run the proof of (b) on K={[0],[3]} inside the ring Z/6Z (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 Q(2) checked, or inherited? From where?
  • (d) State the idea of the subfield test, parts (a) and (b), in two sentences.

Solution.

  • (a) In L, 1K⋅1K=1K=1K⋅1L, and 1K≠0K=0L; multiplicative cancellation in L (Theorem 2.1.1 (b)) removes the factor 1K and gives 1K=1L.

  • (b) The zero step goes through: [0] is the zero of both, and [0]+[0]=[0]+[0] cancels in any commutative ring. The negative step also goes through ([3]+[3]=[0], so −[3]=[3] in both). The one step fails: [3][3]=[3]=[3][1], but [3] has no inverse in Z/6Z ([3][x]∈{[0],[3]} for every x), so it cannot be canceled, and indeed [3]≠[1]. The inverse step then has nothing to say.

  • (c) Inherited. (F6) holds for all elements of R (Number Systems: From N to R, Theorem 5.2.3), hence for all elements of the subset Q(2); 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 0,1,−a,a−1 need checking. Conversely, the zero and one of a field sitting inside L with L’s operations are forced, by cancellation in L, to be those of L.

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 1∈K, a−b∈K for all a,b∈K, and ab−1∈K for all a,b∈K with b≠0.
  • (ii) 0=1−1∈K.
  • (iii) For b∈K, −b=0−b∈K.
  • (iv) For non-zero b∈K, b−1=1⋅b−1∈K.
  • (v) For a,b∈K, a+b=a−(−b)∈K.
  • (vi) For a,b∈K: if b≠0, then b−1∈K and b−1≠0 (as bb−1=1≠0=b⋅0), so ab=a(b−1)−1∈K; if b=0, ab=0∈K.
  • (vii) So K is a subfield of L.

The two extra lines: “(ii′) 0∈K, since 0=bb−1 for any b∈K”, and “(vi′) ab∈K, because K 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 0∈K, and before (vi), whose case b=0 uses 0∈K; (iii) comes before (v), which uses −b∈K; (iv) comes before (vi), which uses b−1∈K (line (vi) itself checks b−1≠0 before applying (i) to it). Any order respecting these is admissible; for instance (i), (ii), (iv), (iii), (vi), (v), (vii).

(ii′) is false: bb−1=1, not 0, and b−1 exists only for b≠0.

(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 Q(2) is the smallest subfield of R containing 2, in the sense of Proposition 2.3.2 (b).

Solution. Let K be a subfield of R with 2∈K. Since 1∈K and K is closed under +, n⋅1∈K for every n∈N, by induction (Logic and Proof, Axiom 4.2.1) as for Fp above; and in R, n⋅1=n (Number Systems: From N to R, Theorem 5.4.1 (d), under the identification). Then −n∈K by closure under negatives, so every integer lies in K (every integer is n or −n with n∈N, Number Systems: From N to R, Proposition 2.2.3 (c)). For m∈Z and n∈Z>0, n≠0, so m/n=mn−1∈K by closure under inverses and products; and every rational is of this form (Number Systems: From N to R, Proposition 2.4.4 (b)). So Q⊆K, and then a+b2∈K for all a,b∈Q, by closure under sums and products. Hence Q(2)⊆K.

Conversely, Q(2) is a subfield of R (Example (The Field Generated by the Square Root of Two)) containing 2=0+12. So it is the smallest such subfield.

Exercise (B3)

Inside C (with R⊆C), show that Q(2)∩Q(i)=Q.

Solution. (⊇) A rational a is a+02 and a+0i.

(⊆) Let x=a+b2=c+di with a,b,c,d∈Q. The number a+b2 is real, so its imaginary part is 0; the imaginary part of c+di is d. Comparing parts (Definition 1.1.1), d=0 and a+b2=c. If b≠0, then 2=(c−a)/b∈Q, against Number Systems: From N to R, Theorem 2.6.1. So b=0, and x=a∈Q.

By Proposition 2.3.2 (a), this also shows again that Q is a subfield of C.

Exercise (B4)

Let 3 be the non-negative real number with square 3 (Number Systems: From N to R, Proposition 6.1.4), and Q(3):={a+b3:a,b∈Q}⊆R. Show that Q(3) is a subfield of R, and that 2+3∉Q(2)∪Q(3). Hence deduce that the union of two subfields need not be a subfield.

Hint: the claim stated with Number Systems: From N to R, Proposition 6.4.6 says which integers are not squares of rationals.

Solution. The claim stated with Number Systems: From N to R, Proposition 6.4.6 says: if n,k∈N and k2<n<(k+1)2, no rational squares to n. We use it for (n,k)=(3,1) and (6,2), since 1<3<4 and 4<6<9.

Q(3) is a subfield. Exactly as in Example (The Field Generated by the Square Root of Two), with 3 in place of 2: the product is (a+b3)(c+d3)=(ac+3bd)+(ad+bc)3; for y=c+d3≠0, the conjugate c−d3 is non-zero (if d≠0, it would make 3=c/d rational, against the claim with (3,1)), N:=c2−3d2≠0, and y−1=c/N−(d/N)3.

Not in Q(2). If 2+3∈Q(2), then 3=(2+3)−2∈Q(2), a square root of 3 in Q(2), against Number Systems: From N to R, Proposition 6.4.6.

Not in Q(3). If it were, then 2=(2+3)−3∈Q(3), say 2=a+b3 with a,b∈Q. Squaring, 2=(a2+3b2)+2ab3,that is,(a2+3b2−2)+2ab3=0. If ab≠0, then 3=(2−a2−3b2)/(2ab)∈Q, against the claim with (3,1). So ab=0, and then a2+3b2=2. If b=0, then a2=2, against Number Systems: From N to R, Theorem 2.6.1. If a=0, then 3b2=2, so (3b)2=6, against the claim with (6,2).

The union. 2∈Q(2) and 3∈Q(3), but their sum is in neither. So Q(2)∪Q(3) is not closed under sums, and is not a subfield of R, although both pieces are.

C. Going deeper

Exercise (C1: A finite subset closed under the operations)

Let L be a field and K⊆L a finite subset with 1∈K, closed under + and ⋅. Show that 0∈K, that K is closed under negatives and under inverses of non-zero elements, and hence that K is a subfield of L. Then show that the hypothesis “finite” cannot be dropped.

Solution (Hint 1). For b∈K, which maps K→K can you build from b and the two operations?

Solution (Hint 2). The maps x↦x+b and x↦bx go from K to K. Why are they injective, and what does finiteness then give?

Solution. A finite set has no injection onto a proper part. Let f:K→K be injective. If f were not surjective, its image f(K) (Sets, Relations, and Cardinality, Definition 1.6.1) would be a proper subset of K, and f, with codomain f(K), would be a bijection K→f(K), against Sets, Relations, and Cardinality, Theorem 3.1.9. So every injective map K→K is surjective.

Zero. Let t:K→K, t(x):=x+1, a map into K because K is closed under + and 1∈K. It is injective: x+1=x′+1 gives 1+x=1+x′ by (F1), so x=x′ by additive cancellation in L (Theorem 2.1.1 (b)). So it is surjective, and some x∈K has x+1=1=0+1, so 1+x=1+0 by (F1); canceling, x=0. So 0∈K.

Negatives. Let b∈K. The map x↦x+b is injective in the same way, hence surjective, and 0∈K is a value: x+b=0 for some x∈K. By the uniqueness of negatives in L, x=−b.

Inverses. Let b∈K, b≠0. The map x↦bx goes from K to K and is injective by multiplicative cancellation in L, which uses b≠0. So it is surjective, bx=1 for some x∈K, and x=b−1 by the uniqueness of inverses in L.

So K is a subfield. Note that K≠∅ need not be assumed: 1∈K.

Finiteness is needed. N⊆Q contains 1 and is closed under + and ⋅, and −1∉N. The argument breaks at “injective, hence surjective”: x↦x+1 is injective on N, and 0 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 K (Sets, Relations, and Cardinality, Theorem 3.1.2). - 2: 0∈K, from a translation map and cancellation, or from a repetition m⋅1=n⋅1 with m<n and cancellation in L, before 0 is used. - 2: negatives, from surjectivity of x↦x+b and uniqueness of negatives in L, or from a repetition i⋅b=j⋅b with i<j, giving −b=(j−i−1)⋅b. - 2: inverses, with the cancellation by b justified by b≠0 (injectivity of x↦bx, or bi=bj with i<j giving bj−i=1 and b−1=bj−i−1). - 2: a witness that finiteness is needed (N⊆Q, or Z⊆Q for inverses). Fatal errors (0 for the step): using 0∈K or −b∈K 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.

“Q(2) is closed under inverses. (1) Let a+b2∈Q(2) be non-zero. (2) Then (a+b2)−1=1a+1b2=1a+12b2. (3) Both coefficients are rational, so the inverse lies in Q(2).”

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” 1/(x+y)=1/x+1/y, 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 a and by b, either of which may be 0 (for 2=0+12, a=0). The second equality, 1/(b2)=(1/(2b))2, is correct for b≠0.

Counterexample to the step. x=y=1 in Q: 1/(1+1)=1/2, while 1/1+1/1=2. In the case at hand, a=b=1: the formula gives 1+122, and (1+2)(1+122)=2+322≠1; the true inverse is −1+2.

Repair. Multiply by the conjugate, as in Example (The Field Generated by the Square Root of Two): (a+b2)−1=(a−b2)/(a2−2b2).