Section 1.1 built and showed that it is
a commutative ring with (Proposition 1.1.2).
One field axiom is still missing: (F8), which asks for
an inverse of every non-zero element. To divide by , we want a number
to multiply by that lands in the real numbers, where
division is familiar. The product of Example (First Computations in )
shows which number does the job. This section gives its
two ingredients names, the conjugate and the modulus,
proves the rules they obey, and concludes that is a field.
Conjugate
and modulus
A complex number is a point of the plane. Two pieces of plane geometry
turn out to be algebra in disguise: the mirror image of
in the horizontal
axis, and the distance of from . The mirror image
changes the sign of . The distance, by
Pythagoras, is the square root of , the very
number that appeared in Example (First Computations in ).
Square roots of non-negative real numbers exist and are
unique in every complete ordered field (Number Systems: From to , Proposition 6.1.4),
so we may use them in : for with , is the
unique with and .
Conjugating reflects a point in the real axis;
the modulus is its distance from the origin.
Definition
1.2.1 (Conjugate and Modulus)
Let with . The complex conjugate of
is The modulus (or absolute
value) of is the
real number the non-negative square root
of Number Systems: From to , Proposition 6.1.4
in .
In words: the conjugate keeps the real part and flips
the sign of the imaginary part, and . The modulus is a
real number, never negative, and its
square is .
Well-definedness. Since determines and (compare real and
imaginary parts, Section 1.1), the right-hand sides
depend only on .
The square root exists because its argument is
non-negative: and (Number Systems: From to , Proposition 2.3.5
(e), with
when the number is ), so (Number Systems: From to , Proposition 2.3.5
(b)). And is
complete (Number Systems: From to , Theorem 5.6.3),
which is the hypothesis of Number Systems: From to , Proposition 6.1.4.
This is where the completeness of enters the chapter.
Over alone the
definition would break down at once: would have to
be a rational number whose square is , and there is none (Number Systems: From to , Theorem 2.6.1).
Examples.
A point with integer distance. For : , and
. The last step is the uniqueness
clause of Number Systems: From to , Proposition 6.1.4:
and , so is the
non-negative square root of .
The unit . , and , since and .
The degenerate case . and . We show below that is the
only complex number with modulus ; that one fact is what
makes division possible.
A real number. For , and . The
symbol
already had a meaning for real : the absolute value of
an ordered field (Number Systems: From to , Definition 4.1.1).
The next proposition shows the two meanings agree, so
the notation does not clash.
Proof. Write . Then ,
since by (F6) and Number Systems: From to , Proposition 2.3.2
(b), and
because
and negatives are unique (Number Systems: From to , Proposition 2.3.2
(a)), all in the commutative ring . The modulus of is , the unique non-negative real number
whose square is . The absolute value
of the
ordered field
is non-negative and satisfies (Number Systems: From to , Proposition 4.1.3
(a), (b)). By the uniqueness clause of Number Systems: From to , Proposition 6.1.4,
the two are equal.
So the modulus extends the absolute
value: on it is the old , and every
result about for real stays true with the new
reading. For instance , whichever
definition we use.
Quick check. Find and for and for . For which of
the two is ?
Solution. For :
and , since and . For : and
. In neither case is : comparing
imaginary parts, needs , that is ,
and both numbers have non-zero imaginary part.
Why this definition. The square root
is what makes the modulus a length. Without it, the
simpler quantity would do some of the same
jobs: it is , and it vanishes only at . But on real numbers it
is , not
, so it does
not extend the absolute value: . And it is not a
sensible distance: , while , so the “side” from to would be longer than
the two sides through . The modulus keeps the
convenient algebra of , since , and
adds the right size. Section 1.3 exploits exactly this
square.
Warning. The modulus squared is
,
not . In general : for
, but . The two agree
only when is
real. For , and ; if
they are equal, comparing real parts gives , so
. Since
in (Number Systems: From to , Proposition 2.3.5
(h)), , so
by part
(f), and by
part (e). Conversely, for real , .
Rules for
conjugate and modulus
The following rules are used constantly, in this
chapter and much later for complex inner products. They
say that conjugation respects both operations, and that
the modulus respects products.
Theorem
1.2.2 (Properties of Conjugation and
Modulus)
For all :
- (a) and ;
- (b) ;
- (c)
and ;
- (d) and ;
- (e) if and only
if .
Idea. Parts (a)–(c) and (e) are
direct computations with real and imaginary parts. For
(d), expanding directly is
legitimate but messy, since a square root of a long sum
appears. It is cleaner to square: by (c) a squared
modulus is a product with a conjugate, and (b) lets the
conjugate split across the product. Two non-negative
real numbers with the same square are equal, and that
brings us back from squares to moduli.
Proof. Let and with .
(a) We have ,
since : , and negatives are
unique (Number Systems: From to , Proposition 2.3.2
(a) in ). And
, so , by Number Systems: From to , Proposition 2.3.2
(a) in .
(b) Since , we get . On the other hand, by Definition 1.1.1
and Number Systems: From to , Proposition 2.3.2
(c) in ,
(c) By Example (First Computations in ),
, and because is a square root
of . Also
.
(d) By (c), then
(b), then Proposition 1.1.2
to regroup and reorder the four factors, In ,
(Proposition 1.1.3
(c)), and : it is if one factor is (Number Systems: From to , Proposition 2.3.2
(b)), and positive otherwise, since a product of two
positive elements of an ordered field is positive ((O4)
of Number Systems: From to , Definition 2.3.2).
So and
are
both non-negative real numbers whose square is . By
the uniqueness clause of Number Systems: From to , Proposition 6.1.4
they are equal. Finally , since
(Number Systems: From to , Proposition 2.3.2
(c)).
(e) If , then .
Conversely, let , so . If , then (Number Systems: From to , Proposition 2.3.5
(e)) and ,
so
(Number Systems: From to , Proposition 2.3.5
(b)), a contradiction; hence . Then , and the same
rule gives .
So . This
proves the theorem.
The proof of (d) is our first use of a move that runs
through the whole chapter: a statement about a modulus
becomes a
statement about , which is algebra; we compute there,
and come back by taking non-negative square roots.
Section 1.3 names it, square the modulus, and
uses it to prove the triangle inequality.
Two remarks on what the theorem says. First, (a) and
(b) say that conjugation respects sums and products, and
it fixes . Not
every reflection does: the reflection in the vertical
axis, , respects sums, but it sends to , and to , while the product of
the images is . Second, (d) says that the size of a product
is the product of the sizes. In the plane picture,
multiplying by
stretches every length by ; Section 1.5
completes this picture with angles.
Division
The first payoff is division. If , then by (e), so
is a
strictly positive real number, and we
may divide by it in .
Proposition
1.2.3 (Inverse of a Complex Number)
Let
with . Then
satisfies . We write or for this
.
The hypothesis is used exactly once, to make non-zero, so
that
exists. For
there is nothing to rescue: for
every (Number Systems: From to , Proposition 2.3.2
(b)). The proposition gives one inverse; that it is the
only one is a fact about all fields, which we can cite
as soon as we know that is one.
Theorem
1.2.4 (The Complex Numbers Form a Field)
The set ,
with the operations of Definition 1.1.1,
is a field in the sense of Number Systems: From to , Definition 2.3.1.
Moreover (Proposition 1.1.1)
is closed under the field operations of : for , the sum
, the product
, the negative
and, if , the inverse
, computed in
, are the real
numbers computed in .
Proof. By Proposition 1.1.2
and the remark after it, satisfies (F1)–(F7)
and (F9), and in .
By Proposition 1.2.3,
every non-zero has an element with , which is
(F8). So is a
field.
For , the sum and product are those of by Proposition 1.1.1.
The real negative satisfies in , hence in , so it is the
negative of in
, by uniqueness
of negatives (Number Systems: From to , Proposition 2.3.2
(a)). If ,
the real inverse satisfies in , hence in ; and in , since is injective. So
is the
inverse of in
, by uniqueness
of inverses in the field (Number Systems: From to , Lemma 4.1.1
(a)).
Everything proved for an arbitrary field now holds in
, without a new
proof. From Number Systems: From to , Lemma 4.1.1:
the inverse
is the only with , and
for non-zero ;
fractions add and multiply by the usual rules; and
has no
zero divisors: forces or . By Proposition 1.1.3
(d),
whenever .
These are the facts that the rest of the chapter uses
when it cancels a non-zero factor.
In practice, a quotient is computed by “multiplying
top and bottom by the conjugate”. For , Proposition 1.2.3
gives which is the fraction multiplied by
(here , since by Theorem 1.2.2 (d),
(e)) and simplified with the product rule for fractions
(Number Systems: From to , Lemma 4.1.1
(b)): the new denominator is real.
Example
(Dividing Complex Numbers)
Write and in the form with .
Solution. For the first, and
, so by Proposition 1.2.3
Check: , so the product with is .
For the second, and , so
This agrees with
from Example (First Computations in ):
since ,
the quotient is the only with . Indeed,
if , then , by
(F7), (F8) and (F5) in the field (Theorem 1.2.4).
Quick check. Compute in
two ways: by multiplying first, and by Theorem 1.2.2 (d).
Then compute .
Solution. Multiplying first, , so the modulus is . By (d), it
is , since . And ; check: .
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define the
complex conjugate and the modulus
of , where . Which
earlier result guarantees that exists?
- (b) True or false,
with a reason: is a non-negative real number for
every .
- (c) Where exactly is
the hypothesis used in the proof of Proposition 1.2.3?
- (d) Write in the form
with .
Solution.
(a)
and , the non-negative square root.
It exists by Number Systems: From to , Proposition 6.1.4,
since is a
complete ordered field and .
(b) True. By Theorem 1.2.2 (c),
, the square of a real number, and
squares of real numbers are non-negative (Number Systems: From to , Proposition 2.3.5
(e) when , and by Number Systems: From to , Proposition 2.3.2
(b) when ).
(c) It gives
by Theorem 1.2.2 (e),
hence , so that exists in
. Nowhere
else.
(d) and , so .
Check: .
B. Practice
Exercise
(B1: Arithmetic)
Write each of the following in the form with , or as a
real number where indicated.
- (a) .
- (b) .
- (c) ,
without expanding the product.
- (d) and .
Solution.
(a) .
(b) By Proposition 1.2.3,
multiply by and divide by : Check: .
(c) By Theorem 1.2.2 (d),
,
since ( and ).
(d) , so the
real part is
and the imaginary part is .
Exercise
(B2)
Let .
Prove:
- (a) and ;
- (b) if and only if
;
- (c)
if and only if .
Solution. Write with .
(a) By Theorem 1.2.2 (c),
,
and , so
. Also , and , so , using and (F5), (F8), (F7) in the field
(Theorem 1.2.4).
(b) means , which by
comparing imaginary parts holds if and only if , that is , that is (as in ). And means .
(c) means , which
by comparing parts holds if and only if (the imaginary
parts agree), that is , that is (as in (b)).
Exercise
(B3)
Let
with . Prove
that and .
Hint: start from .
Solution. Let , so . By Theorem 1.2.2 (b),
. Here : by Theorem 1.2.2 (d),
(e). Multiplying by gives .
Likewise, by Theorem 1.2.2 (d),
, with by (e).
Dividing by
in gives .
C. Going deeper
Solution. (b). Let , . Then , so . And . The two agree.
(d). By (c), (b), and commutativity and
associativity of multiplication (Proposition 1.1.2
(a), (b)), Both and are
non-negative ( is if a factor is , by Number Systems: From to , Proposition 2.3.2
(b), and positive by (O4) of Number Systems: From to , Definition 2.3.2
otherwise), so both are the non-negative square root of
, and they are equal by the uniqueness
clause of Number Systems: From to , Proposition 6.1.4.
Also .
Inverse. Let . By (e), , so (Number Systems: From to , Proposition 2.3.5
(e)), and exists in . With ,
Proposition 1.1.2
and (c) give , where the last
product is computed in , which agrees with
the product in
(Proposition 1.1.1).
(F8). Every non-zero has an element
with , which is (F8) of
Number Systems: From to , Definition 2.3.1.
Marking scheme. (10 points) - 2: (b)
by expanding both sides in real and imaginary parts and
comparing. - 3: (d) via and (b), with commutativity named
for the reordering. - 1: equal non-negative squares give
equal numbers, with a reason (uniqueness of the
non-negative square root, or Number Systems: From to , Proposition 2.3.5
(g) with trichotomy). - 2: for
, with a
reason. - 2:
for , and the conclusion
stated as (F8). Fatal errors (0 for the step): dividing
by or by before showing it
is non-zero; “ because the modulus is a length
and multiplication scales lengths” (circular: the
scaling picture is a consequence of (d)). A second route
to (d), expanding
and then taking square roots, earns the 3 points of the
(d) step in full.
Exercise
(C2: Gaussian rationals)
Let , where
as in Number Systems: From to , Chapter 5 (Number Systems: From to , Theorem 5.6.3).
Prove that
is closed under addition, negatives, multiplication,
inverses of non-zero elements, and conjugation.
Solution. Under the identification
of with , sends sums,
products, negatives and inverses of non-zero rationals
to the same operations in (Number Systems: From to , Theorem 5.4.1
(a), (c)), so the copy of in is closed under , , negatives and
inverses of non-zero elements.
Let
and with
.
Then , and have rational parts, and so
does . If , then by Theorem 1.2.2 (e),
and . By Proposition 1.2.3,
whose parts are quotients of rational numbers
by a non-zero rational number, hence rational. So all
five operations stay in . For example,
.
Chapter 2 calls a subset of a field a subfield when
it contains and
and has these
closure properties. contains and , and it is one
of the examples there.
Marking scheme. (10 points) - 2: the
copy of in
is closed under
, , negatives and
inverses of non-zero elements, with a reason (Number Systems: From to , Theorem 5.4.1
(a), (c)). - 2: , and
have
rational real and imaginary parts. - 2: has rational parts. - 3: for , is non-zero (Theorem 1.2.2 (e))
and rational, and the formula of Proposition 1.2.3
then gives rational parts. - 1: the conclusion that all
five operations stay in . Fatal errors (0
for the step): dividing by without first
using to
show it is non-zero; assuming without a reason that
is closed under the operations.