0.6  Complex Numbers

The equation x2+1=0 has no real solution, because the square of a real number is never negative. For most of school mathematics this gap is harmless. In linear algebra it is not: later in the book we meet real matrices, such as a rotation of the plane, whose most useful data cannot be found among the real numbers. This section builds the complex numbers, the number system that closes the gap, and collects the facts about them that the rest of the book uses.

0.6.1. The complex numbers as pairs of reals

The quick way to introduce complex numbers is to say “invent a symbol i with i2=−1 and compute as usual”. That raises a fair worry. How do we know that such a symbol does not lead to a contradiction, the way “invent a number z with 0⋅z=1” does? The answer is to build the new numbers out of objects we already trust: pairs of real numbers.

Here is the recurring expression that suggests the definition. If we pretend i2=−1 and expand, we get (a+bi)(c+di)=ac+adi+bci+bdi2=(ac−bd)+(ad+bc)i. So a “number a+bi” is really the pair (a,b), and the product should be the pair (ac−bd,ad+bc). We take this formula as the definition, so nothing is pretended.

A complex number is a pair of real numbers, multiplied as if i2=−1.

Definition 0.6.1 (Complex Numbers)

The set of complex numbers is C:=R2={(a,b):a,b∈R}, with addition and multiplication defined for every (a,b),(c,d)∈C by (a,b)+(c,d):=(a+c,b+d),(a,b)(c,d):=(ac−bd,ad+bc). We write a for (a,0) and i for (0,1), so that (a,b)=a+bi. For z=a+bi with a,b∈R, the real part of z is Rez:=a and the imaginary part of z is Imz:=b.

In words: addition is coordinate by coordinate, as for points of the plane. Multiplication is the formula found by expanding. The last sentence is a naming convention: the real number a is identified with the point (a,0) on the horizontal axis, and i is the point one unit up. Note that the imaginary part b is a real number; it is not bi.

Two things need checking before this convention is safe.

  • The notation a+bi is honest. By the definitions, a+bi=(a,0)+(b,0)(0,1)=(a,0)+(0,b)=(a,b). Two complex numbers are equal exactly when they are equal as pairs, so a+bi=c+di with a,b,c,d∈R means a=c and b=d. This is how we “compare real and imaginary parts”.
  • Identifying a with (a,0) does not change real arithmetic. We have (a,0)+(c,0)=(a+c,0) and (a,0)(c,0)=(ac−0,0+0)=(ac,0). So adding or multiplying two real numbers inside C gives the same answer as in R.

With these in place, the equation that motivated everything is now a computation: i2=(0,1)(0,1)=(0⋅0−1⋅1,0⋅1+1⋅0)=(−1,0)=−1.

Example (First Computations in C)

Compute (2+3i)(1−i), the powers i0,i1,…,i7, and the product (a+bi)(a−bi) for real a,b.

Solution. By the multiplication rule with a=2, b=3, c=1, d=−1, (2+3i)(1−i)=(2⋅1−3⋅(−1))+(2⋅(−1)+3⋅1)i=5+i. For the powers, i0=1, i1=i, i2=−1, i3=i2⋅i=−i and i4=(−i)i=−i2=1. From then on the pattern repeats with period 4: i5=i, i6=−1, i7=−i.

Finally, (a+bi)(a−bi)=(a2−b(−b))+(a(−b)+ba)i=a2+b2. This product is a real number, and it is non-negative. We will meet it again as |z|2.

The degenerate case deserves a look too. A real number a=a+0i is a complex number whose imaginary part is zero, and the number 0=0+0i is the only complex number with both parts zero. Every computation with real numbers is also a computation in C, by the second check above.

A non-example by minimal change. Change one sign in the multiplication rule: define (a,b)∗(c,d):=(ac+bd,ad+bc), which is what expanding gives if we pretend j2=+1 instead. Addition is unchanged, and this product is still commutative and has (1,0) as a unit. But (1,1)∗(1,−1)=(1−1,−1+1)=(0,0), so two non-zero elements multiply to zero. Division also breaks down: (1,1)∗(c,d)=(c+d,c+d) can never equal the unit (1,0), because that would need c+d=1 and c+d=0 at once. So the non-zero element (1,1) has no inverse. The single sign in ac−bd is what makes the complex numbers a number system in which we can divide, as we are about to see.

Quick check. Using the definition, compute i10 and (1+i)2. Is Im(3−4i) equal to −4i?

Solution. Since the powers of i repeat with period 4 and 10=8+2, we get i10=i2=−1. Next, (1+i)2=(1−1)+(1+1)i=2i. No: the imaginary part is the real number −4, not −4i.

The usual rules of arithmetic hold. Before computing freely, we should confirm that rearranging, regrouping and expanding brackets are legal in C. The definition does not promise this; it has to be checked.

Proposition 0.6.1 (Arithmetic Laws in C)

For all z,w,u∈C:

  • (a) z+w=w+z and zw=wz;
  • (b) (z+w)+u=z+(w+u) and (zw)u=z(wu);
  • (c) z(w+u)=zw+zu;
  • (d) z+0=z, z⋅1=z, and z+(−z)=0, where −(a+bi):=(−a)+(−b)i.

Idea. Every law reduces to the corresponding law for real numbers once both sides are written as pairs. Addition is coordinate by coordinate, so its laws are immediate. For multiplication the only real work is associativity: expand both sides and see that they produce the same four terms in each coordinate.

Proof. Let z=a+bi, w=c+di and u=e+fi with a,b,c,d,e,f∈R. Since addition acts coordinate by coordinate, the laws for addition in (a), (b) and (d) follow from the same laws in R, applied to each coordinate.

  • (a) By definition zw=(ac−bd)+(ad+bc)i and wz=(ca−db)+(cb+da)i. These are equal because real multiplication and addition are commutative.

  • (b) Expanding with the definition twice gives (zw)u=((ac−bd)e−(ad+bc)f)+((ac−bd)f+(ad+bc)e)i and z(wu)=(a(ce−df)−b(cf+de))+(a(cf+de)+b(ce−df))i. Multiplying out, both real parts equal ace−adf−bcf−bde and both imaginary parts equal acf+ade+bce−bdf. Hence (zw)u=z(wu).

  • (c) We have w+u=(c+e)+(d+f)i, so z(w+u)=(a(c+e)−b(d+f))+(a(d+f)+b(c+e))i=((ac−bd)+(ae−bf))+((ad+bc)+(af+be))i, which is zw+zu by the definitions of the product and the sum.

  • (d) With 1=1+0i, we get z⋅1=(a⋅1−b⋅0)+(a⋅0+b⋅1)i=a+bi=z. Also z+(−z)=(a−a)+(b−b)i=0. This proves the proposition.

From now on we compute in C exactly as in R: expand brackets, collect terms, and replace i2 by −1. The proposition is what makes that habit legitimate.

0.6.2. Conjugate and modulus

Division is still missing. To divide by 3+4i we want some number to multiply by that lands in the real numbers, where division is familiar. The computation (a+bi)(a−bi)=a2+b2 in Example (First Computations in C) shows exactly which number does the job. Both ingredients get names.

Conjugating reflects a point in the real axis; the modulus is its distance from the origin.

Definition 0.6.2 (Conjugate and Modulus)

Let z=a+bi∈C with a,b∈R. The complex conjugate of z is z―:=a−bi. The modulus (or absolute value) of z is the real number |z|:=a2+b2≥0, the non-negative square root.

In words: the conjugate keeps the real part and flips the sign of the imaginary part. The modulus is the length of the segment from 0 to the point (a,b), by Pythagoras. For a real number a=a+0i, we get a―=a and |a|=a2, the usual absolute value, so the notation does not clash with its real meaning. For example, 3+4i―=3−4i, |3+4i|=5, i―=−i and |i|=1.

The following rules are used constantly, in this section and much later for complex inner products.

Theorem 0.6.2 (Properties of Conjugation and Modulus)

For all z,w∈C:

  • (a) z+w―=z―+w― and z――=z;
  • (b) zw―=z―w―;
  • (c) zz―=|z|2 and z+z―=2Rez;
  • (d) |zw|=|z||w| and |z―|=|z|.

Idea. Parts (a)–(c) are direct computations with real and imaginary parts. For (d), expanding |zw| directly is legitimate but messy. 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.

Proof. Let z=a+bi and w=c+di with a,b,c,d∈R.

  • (a) We have z+w―=(a+c)−(b+d)i=(a−bi)+(c−di)=z―+w―, and z――=a−bi―=a+bi=z.

  • (b) Since zw=(ac−bd)+(ad+bc)i, we get zw―=(ac−bd)−(ad+bc)i. On the other hand, z―w―=(a−bi)(c−di)=(ac−(−b)(−d))+(a(−d)+(−b)c)i=(ac−bd)−(ad+bc)i.

  • (c) By the computation in Example (First Computations in C), zz―=a2+b2=|z|2. Also z+z―=2a=2Rez.

  • (d) By (c), then (b), then Proposition 0.6.1 to reorder the four factors, |zw|2=(zw)zw―=zwz―w―=(zz―)(ww―)=|z|2|w|2. Both |zw| and |z||w| are non-negative real numbers with the same square, so they are equal. Finally |z―|=a2+(−b)2=|z|. This proves the theorem.

The first payoff is division. If z≠0, then |z|2=a2+b2 is a strictly positive real number, so we may divide by it.

Proposition 0.6.3 (Inverse of a Complex Number)

Let z∈C with z≠0. Then w:=1|z|2z― satisfies zw=1. We write z−1 or 1z for this w.

Proof. Write z=a+bi. Since z≠0, at least one of a,b is non-zero, so |z|2=a2+b2>0. By Proposition 0.6.1 and Theorem 0.6.2 (c), zw=1|z|2(zz―)=1|z|2|z|2=1, as claimed.

In practice, “multiply top and bottom by the conjugate”. For instance 13+4i=3−4i(3+4i)(3−4i)=3−4i25,5+i1−i=(5+i)(1+i)(1−i)(1+i)=4+6i2=2+3i, which agrees with (2+3i)(1−i)=5+i from Example (First Computations in C). Only one inverse exists; this is a special case of a general fact about fields proved in the next section.

The triangle inequality. The modulus measures distance: |z−w| is the distance between the points z and w of the plane. The side of a triangle is never longer than the other two sides together, and this is the algebraic form of that fact.

Theorem 0.6.4 (Triangle Inequality)

For all z,w∈C, |z+w|≤|z|+|w|.

Idea. Moduli are square roots, which are awkward to add. Both sides are non-negative, so it suffices to compare their squares. Expand |z+w|2 using |u|2=uu―: the cross terms combine into 2Re(zw―). A real part is never bigger than the modulus, and that single estimate finishes the proof.

Proof. First, for any u=x+yi with x,y∈R, we have Reu=x≤|x|=x2≤x2+y2=|u|, since the square root is increasing.

Now let z,w∈C. By Theorem 0.6.2 (c), (a) and Proposition 0.6.1, |z+w|2=(z+w)(z―+w―)=zz―+zw―+wz―+ww―=|z|2+(zw―+zw――)+|w|2, where we used wz―=zw――, which follows from Theorem 0.6.2 (b) and (a). By Theorem 0.6.2 (c) the bracket equals 2Re(zw―). Therefore, using Reu≤|u| and then Theorem 0.6.2 (d), |z+w|2≤|z|2+2|zw―|+|w|2=|z|2+2|z||w|+|w|2=(|z|+|w|)2. Both |z+w| and |z|+|w| are non-negative, so taking square roots preserves the inequality. This proves the triangle inequality.

The route “square, expand, bound the cross term” is worth remembering: it is exactly the route we will take for norms in inner product spaces. The inequality is often strict. For z=1 and w=−1, the left side is 0 and the right side is 2.

0.6.3. Two things that do not carry over from the reals

Complex numbers obey the rules of arithmetic, but not every habit from the real line survives.

The first loss is order. On R we use two facts about positivity: for every x, exactly one of x>0, x=0, −x>0 holds, and sums and products of positive numbers are positive. Suppose some relation > on C had both properties. Since i≠0, either i>0 or −i>0, and in both cases the product rule gives i2=(−i)2=−1>0. The same argument applied to 1≠0 gives 1=12=(−1)2>0. Then both 1 and −1 are positive, so their sum 0 is positive, which contradicts “exactly one”.

Warning. There is no ordering on C compatible with addition and multiplication, so an inequality such as z<w between complex numbers means nothing. Inequalities in this book compare real numbers: moduli |z|, real parts, or quantities known to be real. Writing i>0 leads, as shown above, to 0>0.

The second loss is the square-root rule xy=xy, which on R is only claimed for x,y≥0.

Warning. Every non-zero complex number has two square roots, and no choice of “the” square root makes zw=zw true for all z,w. With −1=i: −1⋅−1=i2=−1, but (−1)(−1)=1=1. Avoid the symbol z for non-real z; say “a square root of z” and solve w2=z instead.

Solving w2=z is a finite computation, done by comparing real and imaginary parts.

Example (Square Roots of 5−12i)

Find all w∈C with w2=5−12i.

Solution. Write w=x+yi with x,y∈R. Then w2=(x2−y2)+2xyi, so comparing real and imaginary parts, w2=5−12i holds exactly when x2−y2=5andxy=−6. Taking moduli in w2=5−12i and using Theorem 0.6.2 (d) gives |w|2=|5−12i|=25+144=13, that is x2+y2=13. Adding and subtracting this and the first equation gives x2=9 and y2=4, so x=±3 and y=±2. The condition xy=−6<0 says x and y have opposite signs. Hence w=3−2i or w=−3+2i. Both work: (3−2i)2=9−12i+4i2=5−12i, and (−3+2i)2=(3−2i)2.

0.6.4. Polar form: multiplication rotates and scales

Addition in C is the familiar addition of arrows in the plane. Multiplication has a geometric meaning too, and it only becomes visible when we describe a point by its distance from 0 and its angle, instead of by its coordinates.

Let z≠0 and put r=|z|>0. The number z/r has modulus 1 by Theorem 0.6.2 (d), so it lies on the unit circle. From trigonometry, every point (x,y) with x2+y2=1 is (cos⁡θ,sin⁡θ) for some real θ. We abbreviate eiθ:=cos⁡θ+isin⁡θ(θ∈R), and then every non-zero complex number can be written as z=reiθ,r=|z|>0,θ∈R. This is the polar form of z, and θ is an argument of z. The word “an” matters: θ and θ+2πk give the same point for every integer k. Conversely, if reiθ=seiφ with r,s>0, then taking moduli gives r=s (as |eiθ|=cos2⁡θ+sin2⁡θ=1). Comparing real and imaginary parts then gives cos⁡θ=cos⁡φ and sin⁡θ=sin⁡φ, which from trigonometry means θ−φ is an integer multiple of 2π.

For now eiθ is only a name for cos⁡θ+isin⁡θ. The next result is the reason the name is a good one: these numbers multiply the way exponentials do.

Theorem 0.6.5 (Multiplication in Polar Form)

For all θ,φ∈R, eiθeiφ=ei(θ+φ). Consequently, if z=reiθ and w=seiφ with r,s>0, then zw=rsei(θ+φ).

Proof. By the multiplication rule, eiθeiφ=(cos⁡θcos⁡φ−sin⁡θsin⁡φ)+(cos⁡θsin⁡φ+sin⁡θcos⁡φ)i=cos⁡(θ+φ)+isin⁡(θ+φ), where the last equality uses the addition formulas for cosine and sine. This is ei(θ+φ). For the second statement, zw=(rs)(eiθeiφ) by Proposition 0.6.1, and the first statement finishes the proof.

In words: to multiply two complex numbers, multiply their moduli and add their arguments. Multiplying by a fixed w=seiφ is therefore a rotation of the plane about 0 by the angle φ, combined with a stretch by the factor s. The picture shows z, w and zw for |z|=1.5, |w|=1.2 and arguments 20∘ and 50∘.

Diagram. Labels: operatorname Re, operatorname Im, z, w, zw, small 20^circ, small 50^circ, small 1

The arrow for zw has length 1.5×1.2=1.8 and makes the angle 20∘+50∘=70∘ with the positive real axis: it is the arrow for z, turned by w’s angle and stretched by w’s length. The small arc marks the argument of z, the large arc marks the extra turn by the argument of w, and the dashed arc is the unit circle, where the numbers eiθ live.

Two special cases are worth isolating. Multiplying by i=eiπ/2 is a quarter turn counterclockwise, which explains i2=−1: two quarter turns send 1 to −1. And eiθe−iθ=e0=1, so (eiθ)−1=e−iθ=eiθ―.

Repeating Theorem 0.6.5 gives powers.

Theorem 0.6.6 (De Moivre’s Formula)

For every θ∈R and every n∈N, (eiθ)n=einθ,that is,(cos⁡θ+isin⁡θ)n=cos⁡nθ+isin⁡nθ. Consequently (reiθ)n=rneinθ for every real r>0.

Proof. We use induction on n (Theorem 0.2.7). For n=0, both sides equal 1, since ei⋅0=cos⁡0+isin⁡0=1. Suppose (eiθ)n=einθ for some n∈N. Then (eiθ)n+1=(eiθ)neiθ=einθeiθ=ei(n+1)θ by the induction hypothesis and Theorem 0.6.5. The consequence follows by the same induction, since (reiθ)n+1=(rneinθ)(reiθ)=rn+1ei(n+1)θ by Theorem 0.6.5.

Powers that are painful to expand become one line in polar form.

Example (A Power via Polar Form)

Compute (3+i)6.

Solution. The modulus is |3+i|=3+1=2, and 3+i=2(32+12i)=2(cos⁡π6+isin⁡π6)=2eiπ/6. By Theorem 0.6.6, (3+i)6=26ei⋅6π/6=64(cos⁡π+isin⁡π)=−64. Expanding (3+i)6 with the binomial theorem gives the same answer after seven terms and some cancellation.

Quick check. Use polar form to compute (1+i)8.

Solution. We have |1+i|=2 and 1+i=2(12+12i)=2eiπ/4. By Theorem 0.6.6, (1+i)8=(2)8ei⋅8π/4=16e2πi=16. As a cross-check, (1+i)2=2i, so (1+i)8=(2i)4=16i4=16.

0.6.5. Roots of unity

Polar form also turns the equation zn=c into a question about angles. The most important case is c=1.

Example (Roots of Unity)

Let n≥1 be an integer. Find all z∈C with zn=1, and draw them for n=6.

Solution. Since 0n=0≠1, every solution is non-zero, so we may write z=reiθ with r>0. By Theorem 0.6.6, zn=rneinθ, and 1=1⋅ei0. By uniqueness of the polar form up to multiples of 2π, zn=1 holds exactly when rn=1 and nθ=2πk for some integer k. Since r>0 is real, rn=1 forces r=1. Hence the solutions are e2πik/n,k∈Z. Put ω:=e2πi/n. By Theorem 0.6.6, e2πik/n=ωk for k≥0. Two integers k,l give the same number exactly when 2π(k−l)/n is a multiple of 2π, that is, when n divides k−l. So there are exactly n distinct solutions, 1,ω,ω2,…,ωn−1, the n-th roots of unity. They sit on the unit circle at equally spaced angles. For n≥3 they are the corners of a regular polygon with n corners, one of them at 1; for n=2 they are ±1.

For n=6, the angles are multiples of 60∘, and the roots are 1,12+32i,−12+32i,−1,−12−32i,12−32i.

Diagram. Labels: operatorname Re, operatorname Im, 1, omega^2, omega^3 = -1, omega^4, omega^5

The six roots sum to 0: since ω3=eiπ=−1, we have ωk+3=−ωk, so the roots cancel in the opposite pairs {1,ω3}, {ω,ω4}, {ω2,ω5}. In the picture, the hexagon is symmetric about its center 0. The sum of the n-th roots of unity is 0 for every n≥2; see Exercise (C2: Roots of Unity Sum to Zero).

0.6.6. The Fundamental Theorem of Algebra

We built C so that one polynomial equation, z2+1=0, has a solution. It turns out that nothing more ever needs to be added: every polynomial equation already has a solution in C. Here a complex polynomial of degree n means an expression anzn+⋯+a1z+a0 with a0,…,an∈C and an≠0; polynomials are studied properly in a later section of this chapter.

Theorem 0.6.7 (Fundamental Theorem of Algebra, Statement)

Let n≥1 and let a0,a1,…,an∈C with an≠0. Then there exists z∈C with anzn+an−1zn−1+⋯+a1z+a0=0.

We do not prove this theorem here. Its proof needs tools we have not built, and it is proved in Chapter 6. Nothing in Chapters 0–5 depends on it.

Remark. Combined with division of polynomials (also in Chapter 6), the theorem gives the form in which it is usually applied: every complex polynomial of degree n≥1 splits into linear factors, anzn+⋯+a0=an(z−z1)(z−z2)⋯(z−zn) for some z1,…,zn∈C, not necessarily distinct. For linear algebra this is the fact that every complex square matrix has an eigenvalue, the starting point of the theory of canonical forms.

One companion fact needs no heavy machinery. If the coefficients a0,…,an are real and p(z)=anzn+⋯+a0 has p(z0)=0, then applying Theorem 0.6.2 (a) and (b) term by term, and ak―=ak, gives p(z0―)=p(z0)―=0―=0. So the non-real roots of a real polynomial come in conjugate pairs. For example, z2−2z+5 has the roots 1+2i and 1−2i: indeed (1+2i)2−2(1+2i)+5=(−3+4i)−(2+4i)+5=0.

0.6.7. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the complex conjugate z― and the modulus |z| of z=a+bi, where a,b∈R.
  • (b) State the triangle inequality for complex numbers.
  • (c) True or false: |z+w|=|z|+|w| for all z,w∈C. Justify your answer.
  • (d) True or false: zz― is a non-negative real number for every z∈C. Justify your answer.
  • (e) True or false: if z,w∈C and z2=w2, then z=w. Justify your answer.
  • (f) State the Fundamental Theorem of Algebra.

Solution.

  • (a) See Definition 0.6.2: z―=a−bi and |z|=a2+b2≥0.

  • (b) See Theorem 0.6.4: |z+w|≤|z|+|w| for all z,w∈C.

  • (c) False. For z=1 and w=−1, |z+w|=0 but |z|+|w|=2.

  • (d) True. By Theorem 0.6.2 (c), zz―=|z|2=a2+b2, which is real and non-negative.

  • (e) False. For z=1 and w=−1, z2=w2=1 but z≠w. (What is true is that z2=w2 implies z=w or z=−w.)

  • (f) See Theorem 0.6.7: every complex polynomial anzn+⋯+a0 with n≥1 and an≠0 has a root in C.

B. Practice

Exercise (B1: Arithmetic)

Write each of the following in the form a+bi with a,b∈R, or as a real number where indicated.

  • (a) (3−2i)(4+i).
  • (b) 1+2i2−i.
  • (c) |(3+4i)(5−12i)|, without expanding the product.
  • (d) Re11+i and Im11+i.

Solution.

  • (a) Expanding and using i2=−1: (3−2i)(4+i)=12+3i−8i−2i2=14−5i.

  • (b) Multiplying top and bottom by 2−i―=2+i (Proposition 0.6.3), 1+2i2−i=(1+2i)(2+i)(2−i)(2+i)=2+i+4i+2i24+1=5i5=i.

  • (c) By Theorem 0.6.2 (d), |(3+4i)(5−12i)|=|3+4i||5−12i|=25⋅169=5⋅13=65.

  • (d) By Proposition 0.6.3, 11+i=1−i|1+i|2=1−i2=12−12i. Hence the real part is 12 and the imaginary part is −12.

Exercise (B2: A Square Root)
  • (a) Find all w∈C with w2=−3+4i.
  • (b) Hence solve z2+2z+4−4i=0.

Hint: for (b), complete the square.

Solution.

  • (a) Write w=x+yi with x,y∈R. Comparing real and imaginary parts in (x2−y2)+2xyi=−3+4i gives x2−y2=−3 and xy=2. Taking moduli, by Theorem 0.6.2 (d), x2+y2=|w|2=|−3+4i|=5. Adding and subtracting, x2=1 and y2=4. Since xy=2>0, x and y have the same sign. Therefore w=1+2i or w=−1−2i. Check: (1+2i)2=1+4i−4=−3+4i, and (−1−2i)2=(1+2i)2.

  • (b) Completing the square, z2+2z+4−4i=(z+1)2−1+4−4i=(z+1)2−(−3+4i). So the equation holds exactly when (z+1)2=−3+4i. By (a), this means z+1=1+2i or z+1=−1−2i. Hence the solutions are z=2i and z=−2−2i.

Exercise (B3)

Let z∈C with z≠0. Prove that 1z=z― if and only if |z|=1.

Solution. By Proposition 0.6.3, 1z=1|z|2z―.

(⇐) Suppose |z|=1. Then 1z=11z―=z―.

(⇒) Suppose 1z=z―. Then 1|z|2z―=z―. Since z≠0, also z―≠0, so multiplying both sides by (z―)−1 gives 1|z|2=1, that is, |z|2=1. As |z|≥0, this forces |z|=1. This proves the equivalence.

Exercise (B4: Polar Form)
  • (a) Compute (1−3i)6.
  • (b) Find all z∈C with z3=−8i, in the form a+bi.

Solution.

  • (a) We have |1−3i|=1+3=2 and 1−3i=2(cos⁡(−π3)+isin⁡(−π3))=2e−iπ/3. By Theorem 0.6.6, (1−3i)6=64e−2πi=64(cos⁡2π−isin⁡2π)=64.

  • (b) Since 03≠−8i, write z=reiθ with r>0. Also −8i=8e−iπ/2. By Theorem 0.6.6, z3=r3e3iθ. By uniqueness of polar form up to multiples of 2π, z3=−8i holds exactly when r3=8 and 3θ=−π2+2πk for some integer k. Therefore r=2 and θ=−π6+2πk3. The values k=0,1,2 give θ=−π6,π2,7π6, and every other k differs from one of these by a multiple of 3, which changes θ by a multiple of 2π. Hence the solutions are 2e−iπ/6=3−i,2eiπ/2=2i,2e7iπ/6=−3−i. Check: (2i)3=8i3=−8i.

C. Going deeper

Exercise (C1: Reverse Triangle Inequality)

Prove that ||z|−|w||≤|z−w| for all z,w∈C.

Hint: write z=(z−w)+w.

Solution. Let z,w∈C. Since z=(z−w)+w, the triangle inequality (Theorem 0.6.4) gives |z|≤|z−w|+|w|, so |z|−|w|≤|z−w|. Swapping the roles of z and w gives |w|−|z|≤|w−z|. Moreover |w−z|=|(−1)(z−w)|=|−1||z−w|=|z−w| by Theorem 0.6.2 (d). The real number ||z|−|w|| equals one of |z|−|w| and |w|−|z|, and both are at most |z−w|. This proves the inequality.

Exercise (C2: Roots of Unity Sum to Zero)

Let n≥2 and ω=e2πi/n.

  • (a) Prove that 1+ω+ω2+⋯+ωn−1=0.
  • (b) Deduce that ∑k=0n−1cos⁡2πkn=0 and ∑k=0n−1sin⁡2πkn=0.

Hint: compare S with ωS, where S is the sum in (a).

Solution.

  • (a) Let S=1+ω+⋯+ωn−1. By Theorem 0.6.6, ωn=e2πi=1. Therefore ωS=ω+ω2+⋯+ωn−1+ωn=ω+ω2+⋯+ωn−1+1=S, so (ω−1)S=0. Since n≥2, we have 0<2π/n≤π, so Reω=cos⁡(2π/n)<1 and ω≠1. Hence ω−1≠0, and multiplying (ω−1)S=0 by (ω−1)−1 (Proposition 0.6.3) gives S=0.

  • (b) By Theorem 0.6.6, ωk=cos⁡2πkn+isin⁡2πkn for each k. Since addition in C is coordinate by coordinate, the real part of S is ∑k=0n−1cos⁡2πkn and the imaginary part is ∑k=0n−1sin⁡2πkn. By (a), S=0, so both sums are 0.

Exercise (C3: Symmetries of C Fixing R)

Let σ:C→C be a function with σ(z+w)=σ(z)+σ(w) and σ(zw)=σ(z)σ(w) for all z,w∈C, and σ(a)=a for every a∈R.

  • (a) Prove that σ(i)2=−1.
  • (b) Prove that the only complex numbers u with u2=−1 are i and −i.
  • (c) Deduce that either σ(z)=z for every z∈C, or σ(z)=z― for every z∈C.
  • (d) Show that z↦z― does satisfy all three conditions on σ.

Hint: for (b), write u=x+yi and compare real and imaginary parts.

Solution.

  • (a) Since σ respects products and fixes the real number −1, we get σ(i)2=σ(i⋅i)=σ(−1)=−1.

  • (b) Let u=x+yi with x,y∈R and u2=−1. Comparing real and imaginary parts in (x2−y2)+2xyi=−1 gives x2−y2=−1 and xy=0. If y=0, then x2=−1, which is impossible for real x. Hence x=0, so y2=1 and y=±1. Therefore u=i or u=−i, and both satisfy u2=−1.

  • (c) By (a) and (b), σ(i)=i or σ(i)=−i. Let z=a+bi with a,b∈R. Since σ respects sums and products and fixes a and b, σ(z)=σ(a)+σ(b)σ(i)=a+bσ(i). If σ(i)=i, this gives σ(z)=z for every z. If σ(i)=−i, it gives σ(z)=a−bi=z― for every z.

  • (d) By Theorem 0.6.2 (a) and (b), conjugation respects sums and products. For a∈R, a―=a+0i―=a−0i=a. So conjugation satisfies all three conditions.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.