Skip to main content
Logo image

A First Course in Complex Analysis

Section 1.1 Definitions and Algebraic Properties

There are many equivalent ways to think about a complex number, each of which is useful in its own right. In this section, we begin with a formal definition of a complex number. We then interpret this formal definition in more useful and easier-to-work-with algebraic language. Later we will see several more ways of thinking about complex numbers.

Definition 1.1.1.

The complex numbers are pairs of real numbers,
\begin{equation*} \C \ := \ \left\{ (x,y) : \, x,y \in \R \right\} \, \text{,} \end{equation*}
equipped with the addition
\begin{equation} (x,y) + (a,b) \ := \ (x+a, \, y+b)\tag{1.2} \end{equation}
and the multiplication
\begin{equation} (x,y) \cdot (a,b) \ := \ (xa-yb, \, xb+ya) \,\text{.}\tag{1.3} \end{equation}
One reason to believe that the definitions of these binary operations are acceptable is that \(\C\) is an extension of \(\R\text{,}\) in the sense that the complex numbers of the form \((x,0)\) behave just like real numbers:
\begin{equation*} (x,0)+(y,0) \ = \ (x+y,0) \qquad \text{ and } \qquad (x,0) \cdot (y,0) \ = \ (xy,0) \, \text{.} \end{equation*}
So we can think of the real numbers being embedded in \(\C\) as those complex numbers whose second coordinate is zero.
The following result states the algebraic structure that we established with our definitions.
What we are stating here can be compressed in the language of algebra: equations (1.4)(1.8) say that \((\C,+)\) is an Abelian group with identity \((0,0)\text{;}\) equations (1.9)(1.14) say that \(\left( \C \setminus \{(0,0)\},\cdot \right)\) is an Abelian group with identity \((1,0)\text{.}\)
The proof of Proposition 1.1.2 is straightforward but nevertheless makes for good practice (see Exercise 1.5.14). We give one sample, for (1.8):

Proof.

By our definition for complex addition and properties of additive inverses in \(\R\text{,}\)
\begin{equation*} (x,y) + (-x, -y) \ = \ (x+(-x), \, y+(-y)) \ = \ (0,0) \, \text{.} \end{equation*}
The definition of complex multiplication implies the innocent looking statement
\begin{equation} (0,1) \cdot (0,1) \ = \ (-1,0) \,\text{.}\tag{1.15} \end{equation}
This identity together with the fact that
\begin{equation*} (a,0) \cdot (x,y) \ = \ (ax,ay) \end{equation*}
allows an alternative notation for complex numbers. The latter implies that we can write
\begin{equation*} (x,y) \ = \ (x,0) + (0,y) \ = \ (x,0) \cdot (1,0) + (y,0) \cdot (0,1) \,\text{.} \end{equation*}
If we think—in the spirit of our remark about embedding \(\R\) into \(\C\)—of \((x,0)\) and \((y,0)\) as the real numbers \(x\) and \(y\text{,}\) then this means that we can write any complex number \((x,y)\) as a linear combination of \((1,0)\) and \((0,1)\text{,}\) with the real coefficients \(x\) and \(y\text{.}\) Now \((1,0)\text{,}\) in turn, can be thought of as the real number 1. So if we give \((0,1)\) a special name, say \(i\text{,}\) then the complex number that we used to call \((x,y)\) can be written as \(x \cdot 1 + y \cdot i\) or
\begin{equation*} x+iy \, \text{.} \end{equation*}
We invite you to check that the definitions of our binary operations and Proposition 1.1.2 are coherent with the usual real arithmetic rules if we think of complex numbers as given in the form \(x+iy\text{.}\)
The open-source mathematics software SageMath can handle complex numbers and functions; we will provide sample code throughout this book to get you started.
 1 
In particular for readers of the print version of this book, you can execute sage commands, e.g., via the SageMathCell.
The second complex number in (1.14) is the (multiplicative) inverse of \(x+iy\text{.}\)

Definition 1.1.3.

The number \(x\) is called the real part and \(y\) the imaginary part
 2 
These names have historical reasons: people thought of complex numbers as unreal, imagined.
of the complex number \(x+iy\) and are often denoted as \(\Re(x+iy)=x\) and \(\Im(x+iy)=y\text{.}\)
The identity (1.15) now reads
\begin{equation*} i^2 = -1 \,\text{.} \end{equation*}
In fact, much more can now be said with the introduction of the square root of \(-1\text{.}\) It is not just that (1.1) has a root, but every nonconstant polynomial has a root in \(\C\text{:}\)
The proof of this theorem requires some (important) machinery, so we defer its proof and an extended discussion of it to Chapter 5 (see Theorem 5.3.2).