Logic and Proof, Section 7.1 needed, in one
of its checks, the fact that every complex number has a
complex square root, and took it there as a school fact
about polar form. This section proves it, with no angles
at all: a square root of a complex number is built from
two square roots of non-negative reals, which Number
Systems: From
to ,
Chapter 6 provides (Number Systems: From to , Proposition 6.1.4).
The quadratic formula follows, for complex coefficients.
Then we see what has lost on the way
from : it has no
order compatible with its arithmetic, and the rule has no complex version.
Square
roots from real square roots
The question is: given , find with . Since , comparing real and imaginary
parts turns the question into two real equations, The answer is an explicit formula in , and .
Proposition
1.4.1 (Square Roots of Complex Numbers)
Let with and , and let . Put if and if , and Then:
- (a) ;
- (b) for , if and only if
or ;
- (c) .
For : if and only if
.
In words: every non-zero complex number has
exactly two square roots, and , and the formula finds
one of them; has
exactly one.
Try it first (ten minutes): find with by writing
. What do
you do with the two equations you get?
Idea. For the two equations
are
and . The
natural attempt eliminates and arrives at , a
quartic; it can be solved, but it hides what is going
on, and in general it needs the quadratic formula before
we have it. The missing piece is a
third equation, and it comes from the
modulus. If , then by Theorem 1.2.2 (d),
that is, . Now the first equation and the third give
and by adding and
subtracting: , . That fixes and up to sign, and the
second equation says which signs go together: has the sign of . For : , , , , so .
The proof runs this forward: define and by the formulas, check
, and get
“only ” from
the field axioms.
Before reading on: why does the sign of decide whether and have the same
sign?
The proof uses one small rule about real square
roots: for with , Both sides are non-negative (a product of
non-negative reals is non-negative), and the square of
the left side is , by commutativity; so the left
side is the non-negative number whose square is , which is the right
side by the uniqueness in Number Systems: From to , Proposition 6.1.4.
The rule is about non-negative reals
only; the last part of this section shows that it has no
complex version.
Proof. The roots exist. By
Lemma 1.3.1, , so (Number Systems: From to , Proposition 4.1.3
(d)). Hence and (Number Systems: From to , Proposition 2.3.5
(a), (b)). Halving keeps this: for , either and then (Number Systems: From to , Proposition 4.1.2
(b), with ), or and then (Number Systems: From to , Proposition 2.3.2
(b)). So and . So the two square roots in the definition of
and exist (Number Systems: From to , Proposition 6.1.4).
(a) Since , For the imaginary part, the rule for real
square roots gives Here the third equality is , by the same rule and ; the fourth
uses (Definition 1.2.1);
the fifth holds because and (Number Systems: From to , Proposition 4.1.3
(a), (b)), with uniqueness in Number Systems: From to , Proposition 6.1.4;
and the last because by the
definitions of
and of (Number Systems: From to , Definition 4.1.1),
in each of the two cases and . Hence , by the
multiplication rule of Definition 1.1.1.
(b) Let . Since is a commutative
ring, (Proposition 1.1.2,
Number Systems: From to , Proposition 2.3.2
(c)). If ,
then by (a), so . Since is a field (Theorem 1.2.4), it
has no zero divisors (Number Systems: From to , Lemma 4.1.1
(d)), so
or , that
is, or . Conversely by (a), and by Number Systems: From to , Proposition 2.3.2
(c).
(c) First , since and . Suppose . Then . But in : it is the real
number , which is
positive in (Number Systems: From to , Proposition 2.3.5
(h)), and by the injective embedding of Proposition 1.1.1.
So with
and contradicts the
absence of zero divisors. Hence .
Finally, for : , and if , then by Number Systems: From to , Lemma 4.1.1
(d). This proves the proposition.
The answer to the prompt: is non-negative by
construction, and
is times a
non-negative number, so is times a non-negative
number, and
must equal . If
, then
and must both be non-zero
with the same sign; if , opposite signs. When the choice of does not matter,
because then one of is .
The proposition proves what Logic and Proof,
Section 7.1 assumed, and it is stronger: it counts the
roots. It uses only the field , its modulus, and
square roots of non-negative reals; no angle, cosine or
sine appears. That matters later: Algebraic
Preliminaries, Chapter 4 proves the Fundamental
Theorem of Algebra using square roots in exactly this
form.
Example
(Square Roots of )
Find all with .
Solution. Write with . Comparing
real and imaginary parts in gives Taking moduli, by Theorem 1.2.2 (d),
. Adding
and subtracting, and , so and . Since ,
and have opposite
signs. Hence or . Check: , and .
The formula of Proposition 1.4.1
gives the same root: , , so ; , and . By part (b) there are no
other roots.
Quick check. Find the square roots
of and of .
Solution. For : , , , so and
;
the roots are , and indeed . For : , , , so and
; the roots
are , and
.
With square roots in hand, a quadratic equation with
complex coefficients is solved exactly as in school:
complete the square. The only difference is that we
never need to ask whether the discriminant is
negative.
Here are
complex numbers, in a departure from the chapter’s habit
of reserving these letters for reals; the statement is
the school formula, and keeps its letters. The choice of
does not matter:
the other square root is (Proposition 1.4.1
(b)), which swaps the two solutions.
Idea. Complete the square, as in
school: after multiplying by , the equation says
that is a
square root of . The square roots of are exactly
and , and solving the two
linear equations gives the formula.
Proof. Multiply by and complete the
square. By the ring laws (Proposition 1.1.2)
and Number Systems: From to , Proposition 2.3.2
(d), Now , since in
(as for in the
proof of Proposition 1.4.1
(c)) and ,
and has no zero
divisors (Theorem 1.2.4, Number Systems: From to , Lemma 4.1.1
(d)). So if and only if , that
is, , as in the proof of Proposition 1.4.1
(b). By the absence of zero divisors again, this holds
if and only if or . Since , these say or .
The two solutions coincide if and only if , that is, , that is, (as ). And if and only if
(no zero
divisors), that is, . This proves the corollary.
Example. Solve . Here , and the discriminant is The formula of Proposition 1.4.1,
applied to
(real part ,
imaginary part , modulus ), gives and
, so ; indeed . The solutions are Check: their sum is and their product
is , the
negative of the middle coefficient and the constant
term, as they should be for .
No order on
the complex numbers
In , and in
every ordered field, a non-zero square is positive (Number Systems: From to , Proposition 2.3.5
(e)). In , is non-zero and its
square is . If
carried an
order of the kind has, would have to be
positive, and so would . That is already the
proof.
Proof. Suppose is a relation on
with which
is an ordered
field. Since , Number Systems: From to , Proposition 2.3.5
(e) gives , that is, (Proposition 1.1.1:
).
Since in
the field , the
same part (e) gives . Adding, by Number Systems: From to , Proposition 2.3.5
(b), . But is impossible: (O1), with both elements equal
to , says that
exactly one of and holds, and does. So no such relation exists.
The proof never asks whether or : part (e) covers
both at once. It also never assumes that the
hypothetical order agrees with the order of on real numbers. It
concludes
and in
whatever order is supposed, and that is the
contradiction.
Warning. An inequality between complex
numbers means nothing: by Proposition 1.4.3
no order on is
compatible with its arithmetic. Apart from arguments
that suppose an order on in order to reach a
contradiction (the proof above and Exercises B2 and C2),
every inequality in this chapter compares
real numbers in the order of : moduli, real parts,
imaginary parts, or quantities proved to be real, as
was in Section 1.3. Writing leads, by the
proof above, to ; so does writing .
Quick check. Is the following a
proof that
cannot be ordered? “Every real square is , and . So is not a square of
anything, a contradiction.”
Solution. No. The argument proves
nothing about orders on . “” is a statement
in ’s order, and
a hypothetical order on need not agree with
it on the reals; the argument never even introduces the
hypothetical order. And “ is not a square” is
false: by Proposition 1.4.1.
The correct proof works inside the supposed order, where
because
.
The
square-root rule does not survive
In , for : that is the rule for real square roots
used above. A non-zero complex number has two square
roots and no preferred one, and no way of preferring one
keeps the rule alive.
Warning. No choice of “the” square
root of
each complex can
satisfy for all . Whatever is
chosen for , it is or (Proposition 1.4.1
(b)), and in both cases . But , and the rule itself forces : since is a square root
of , . So the rule would
give , which
is false in
(the real parts differ). So in this volume the symbol is
applied only to non-negative reals; for any other , say “a square root of
” and solve .
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) True or false:
if and
, then
. Justify your
answer, and state what is true.
- (b) Run the formula
of Proposition 1.4.1
on : compute
and both square roots.
- (c) Where in the
proof of Proposition 1.4.1
is
used?
- (d) State the idea
of the proof of Proposition 1.4.1
in two sentences.
Solution.
(a) False: , have and . What is true:
implies
or , since and
has no zero divisors (this is the argument of Proposition 1.4.1
(b)).
(b) , , , (as ), ,
. So , and the square roots are .
(c) To take the
square roots at all: gives and , so and exist.
(d) Comparing
parts gives and ; taking moduli gives a third equation , and the
first and third give and by adding and
subtracting. The signs are then fixed by , and the absence
of zero divisors shows that are the only
roots.
B. Practice
Exercise
(B1)
- (a) Find all with .
- (b) Hence solve
.
Solution.
(a) Write . Comparing
parts, and . Taking moduli (Theorem 1.2.2
(d)), . Adding and
subtracting, and . Since ,
and have the same
sign, so
or , and
by Proposition 1.4.1
(b) there are no others. Check: .
(b) By Corollary 1.4.2
with , , : the
discriminant is , with square root
by (a), since . So Equivalently, completing the square, , so . Check: .
Exercise
(B2: Put the proof in order)
The nine lines below include the seven lines of a
proof of Proposition 1.4.3,
shuffled, and two lines that do not belong. Write the
seven lines in an order that makes a proof, and say what
is wrong with each of the other two.
- (i) , so .
- (ii) Since , we have .
- (iii) Suppose is a relation on
that makes
an ordered
field.
- (iv) is impossible by
(O1), so no such relation exists.
- (v) So , because
non-zero squares are positive in an ordered field.
- (vi) , so .
- (vii) , because
in .
- (viii) , since .
- (ix) Adding, .
Solution. An admissible order is
(iii), (viii), (v), (i), (vi), (ix), (iv). The
constraints are what each line uses: (v), (vi), (i),
(ix) and (iv) work in the supposed order, so they come
after (iii); (v) also uses (viii); (i) uses (v); (ix)
uses (i) and (vi); (iv) uses (ix). Line (viii) is a fact
about and uses
no order, so it may stand anywhere before (v), even
before (iii); line (vi) may stand anywhere after (iii)
and before (ix). For instance (iii), (vi), (viii), (v),
(i), (ix), (iv) and (viii), (iii), (v), (i), (vi), (ix),
(iv) are also admissible. The admissible orders are
exactly those that respect these constraints.
Line (ii) drops a case: from , trichotomy (O1)
gives
or , and the line keeps only the first. That is
(N7) of Logic and Proof, Example (What is not allowed),
a missing case. Line (v) needs neither case, which is
why the proof does not split.
Line (vii) cites a reason that is not available: the
supposed order on is arbitrary, and
nothing says that it agrees with the order of on the real numbers.
The proposition is about every relation
on , and (vii)
quietly replaces “every” by “one that extends ’s order”. (The
inequality does hold in any ordered field, by Number Systems: From to , Proposition 2.3.5
(a) applied to , so the line could be repaired by citing
that; as written its reason is (N9) of Logic and Proof, Example (What is not allowed),
a fact that is not available.)
Exercise
(B3)
Let with and . Prove that the equation has
exactly the two solutions in ,
and that they are conjugate to each other.
Solution. Since (Number Systems: From to , Proposition 2.3.5
(a)), exists, , and satisfies . So Corollary 1.4.2
with this gives
exactly the two solutions displayed, and they are
distinct since . Since are real and , the two solutions are with the same real part and opposite imaginary
parts: each is the conjugate of the other (Definition 1.2.1).
For instance has , , and the solutions .
C. Going deeper
Exercise
(C1: Find the error)
Here is an argument.
Claim. For , if , then or .
Proof. If , then , so , since has no zero divisors.
If , put
,
which exists because is a field; then
.
Taking square roots, . In particular, or . Multiplying by
, or .
Is the claim true? Does the argument prove it? If
not, name the line that fails and the reason, give a
counterexample to that line, and repair the
argument.
Solution. The claim is true: it is
the argument of Proposition 1.4.1
(b), and it also follows directly from and the absence of zero divisors in .
The argument does not prove it. The failing line is
“”. It uses the rule “ whenever
is a
non-negative real”, which is neither proved nor true: it
is a general “fact” of the kind (N9) of Logic and Proof, Example (What is not allowed)
forbids. The symbol is
defined only on non-negative reals, and is a complex number;
even for real ,
, not . Counterexample to the
step: has
, but .
The next line, “ or ”, is a valid weakening of (a disjunction
follows from either part), so it is not itself an error;
it only papers over the loss of the root one line earlier. The
rest of the argument (the case , the division, and
multiplying back by ) is correct.
Repair: replace the two middle lines by “Then , and
has no zero divisors, so or .”
Marking scheme. (10 points) - 2:
says the claim is true, with a reason. - 3: names the
line as the failing one, and its
illegal rule . - 2: a counterexample to
that step (, or any with , ). - 3: a correct
repair, by factoring and using no zero divisors (or by Proposition 1.4.1
(b) applied to ). Fatal errors (0 for the step): declaring
the claim false; naming the “In particular” line instead
of the line
as the failing one, since it is a valid weakening.
Exercise
(C2: A second proof that there is no order)
- (a) Use Proposition 1.4.1
to give a second proof of Proposition 1.4.3
in which the element is never
mentioned.
- (b) Say why the
argument in (a) does not need the special element .
- (c) Is the converse
of the principle behind (a) true? That is: if a
commutative ring with admits no order, must be a square in it?
Test the ring .
Solution (Hint 1). In an ordered
field, which elements can be squares? For (c), list the
squares of the three classes.
Solution.
(a) Suppose makes an ordered field.
Every square is then : a non-zero square is positive by Number Systems: From to , Proposition 2.3.5
(e), and .
First, ,
since otherwise (Number Systems: From to , Proposition 2.3.2
(a)), against in the field (Theorem 1.2.4). By
Proposition 1.4.1
(a), applied to the non-zero number , some has . So , and as
, . By part (e)
again, .
Adding (Number Systems: From to , Proposition 2.3.5
(b)), , which (O1) forbids. This is the argument of
Number Systems: From to , Exercise (C1: A field that cannot be ordered),
with the square root of supplied by a
formula.
(b) The argument
uses only that
is a square in ,
and that is a property of the field, not of any named
element. It does not matter that the formula of Proposition 1.4.1,
applied to ,
happens to produce (, , : , ). The same argument
shows that no field in which is a square can be
ordered; in particular no field in which
every element is a square.
(c) No. The ring
is a
commutative ring with (Number Systems: From to , Theorem 3.4.3
(a), (c)), and no relation makes it an ordered
commutative ring (Number Systems: From to , Theorem 3.4.3
(e)). Its three elements are (part (b)
there), with squares , , . So the squares are and , while . Hence is not a square in
, and yet
the ring cannot be ordered: the obstacle there is , not a
square root of .