Definition of complex numbers

Here we will formally define the complex numbers ${\displaystyle \mathbb {C} }$ and prove that they form a field. First of all we will clarify what the addition and multiplication of complex numbers should look like.

Complex numbers have the form ${\displaystyle a+b\,\mathrm {i} }$, where ${\displaystyle a,b}$ are real numbers and the imaginary unit ${\displaystyle \mathrm {i} }$ satisfies the equation ${\displaystyle \mathrm {i} ^{2}=-1}$. However, we lack a mathematical definition for this new form of a number. So we will derive now a reasonable and precise definition.

A complex number ${\displaystyle a+b\,\mathrm {i} }$ is described by the two real numbers ${\displaystyle a}$ and ${\displaystyle b}$. Furthermore, complex numbers can be represented as points in a plane. ${\displaystyle a}$ is the ${\displaystyle x}$-coordinate of the point and the imaginary part ${\displaystyle b}$ is the ${\displaystyle y}$-coordinate:

Now points within the plane can be described as tuples ${\displaystyle (a,b)}$ of the set ${\displaystyle \mathbb {R} \times \mathbb {R} =\mathbb {R} ^{2}}$. So we can assign to a tuple ${\displaystyle (a,b)}$ in ${\displaystyle \mathbb {R} \times \mathbb {R} }$ the complex number ${\displaystyle a+b\,\mathrm {i} }$. So we identify ${\displaystyle (a,b){\hat {=}}a+b\,\mathrm {i} }$, which provides a one-to-one identification of the complex set of numbers ${\displaystyle \mathbb {C} }$ with the set ${\displaystyle \mathbb {R} \times \mathbb {R} }$.

The tuple is a precisely defined mathematical concept, we can use it for the formal definition of the complex numbers. To this we say that complex numbers ${\displaystyle a+b\,\mathrm {i} }$ are in fact tuples ${\displaystyle (a,b)}$ within a special notation and that allow for a multiplication (to be defined later).

It would be nice to calculate with complex numbers like with real numbers, by adding and multiplying them. Let us first consider the addition of two complex numbers ${\displaystyle a+b\,\mathrm {i} }$ and ${\displaystyle c+d\,\mathrm {i} }$. The result should again be a complex number, i.e. of the form ${\displaystyle x+y\,\mathrm {i} }$. For this we add the two complex numbers, arrange the summands and factor out:

${\displaystyle {\begin{aligned}(a+b\,\mathrm {i} )+(c+d\,\mathrm {i} )&=a+b\,\mathrm {i} +c+d\,\mathrm {i} \\&=a+c+b\,\mathrm {i} +d\,\mathrm {i} \\&=(a+c)+(b+d)\,\mathrm {i} \end{aligned}}}$

The result is again of the form ${\displaystyle x+y\,\mathrm {i} }$. The real and the imaginary parts are added up. For the formal definition of the addition we use the tuple notation ${\displaystyle (a,b)}$in ${\displaystyle \mathbb {R} \times \mathbb {R} }$, with identification ${\displaystyle (a,b)\ {\hat {=}}\ a+b\,\mathrm {i} }$. With this we translate the above calculation into the tuple notation:

${\displaystyle {\begin{aligned}(a,b)+(c,d)\ &{\hat {=}}\ (a+b\,\mathrm {i} )+(c+d\,\mathrm {i} )=(a+c)+(b+d)\,\mathrm {i} \\&{\hat {=}}(a+c,b+d)\end{aligned}}}$

We see that summing nothing else than a component-wise addition in ${\displaystyle \mathbb {R} \times \mathbb {R} }$. This is exactly the vector addition in the plane ${\displaystyle \mathbb {R} \times \mathbb {R} }$. The multiplication of complex numbers is more complicated. We consider the product of two complex numbers ${\displaystyle a+b\,\mathrm {i} }$ and ${\displaystyle c+d\,\mathrm {i} }$ and multiply out the product:

${\displaystyle {\begin{aligned}&(a+b\,\mathrm {i} )\cdot (c+d\,\mathrm {i} )\\[0.3em]&{\color {OliveGreen}\left\downarrow \ {\text{multiply out}}\right.}\\[0.3em]&=a\cdot c+a\cdot d\,\mathrm {i} +b\,\mathrm {i} \cdot c+b\,\mathrm {i} \cdot d\,\mathrm {i} \\[0.3em]&=a\cdot c+(a\cdot d)\,\mathrm {i} +(b\cdot c)\,\mathrm {i} +(b\cdot d)\,\mathrm {i} ^{2}\\[0.3em]&{\color {OliveGreen}\left\downarrow \ \mathrm {i} ^{2}=-1\right.}\\[0.3em]&=a\cdot c+(a\cdot d)\,\mathrm {i} +(b\cdot c)\,\mathrm {i} -(b\cdot d)\\[0.3em]&{\color {OliveGreen}\left\downarrow \ {\text{re-arrange summands}}\right.}\\[0.3em]&=(a\cdot c-b\cdot d)+(a\cdot d+b\cdot c)\,\mathrm {i} \end{aligned}}}$

Translated in the tuple-notation, we have:

${\displaystyle (a,b)\cdot (c,d)=(a\cdot c-b\cdot d,a\cdot d+b\cdot c)}$

The complex numbers are defined as tuples in ${\displaystyle \mathbb {R} \times \mathbb {R} }$ with the appropriate addition and multiplication.

Definition (Set of complex numbers ${\displaystyle \mathbb {C} }$)

We define the set of complex numbers as the set ${\displaystyle \mathbb {C} :=\mathbb {R} \times \mathbb {R} }$ together with two mappings "addition" and "multiplication". Complex numbers are thus tuples ${\displaystyle (a,b)}$, where ${\displaystyle a}$ and ${\displaystyle b}$ are real numbers. Addition and multiplication are defined by

${\displaystyle {\begin{aligned}(a,b)+(c,d)&:=(a+c,b+d)\\(a,b)\cdot (c,d)&:=(a\cdot c-b\cdot d,a\cdot d+b\cdot c)\end{aligned}}}$

A complex number ${\displaystyle z=(a,b)}$, can be described as a point in the plane. It is uniquely defined by its coordinates ${\displaystyle a}$ and ${\displaystyle b}$. These coordinates have special names. ${\displaystyle a}$ is called real part and ${\displaystyle b}$ imaginary part of the complex number.

We can calculate with complex numbers as with real numbers. The addition corresponds to the vector addition in ${\displaystyle \mathbb {R} \times \mathbb {R} }$. Thus it inherits all properties of the addition in a vector space and fulfils for example the associative law ${\displaystyle (z+w)+u=z+(w+u)}$ and the commutative law ${\displaystyle z+w=w+z}$. The multiplication in the complex numbers has similar properties as the multiplication in the real numbers.

Like in the real numbers we can form fractions of the form ${\displaystyle {\tfrac {w}{z}}}$ in ${\displaystyle \mathbb {C} }$. This requires inverting a complex number ${\displaystyle z=(a,b)}$ to ${\displaystyle z^{-1}=(c,d)}$. The reciprocal number should satisfy the equation ${\displaystyle z\cdot z^{-1}=1}$. So we need to choose ${\displaystyle (c,d)}$ such that ${\displaystyle (1,0)=(a,b)\cdot (c,d)=(ac-bd,ad+bc)}$ holds. We will see that this system of equations is uniquely solvable for all ${\displaystyle (a,b)\in \mathbb {C} \setminus \{0\}}$.

Altogether the addition and the multiplication fulfil the so-called Körperaxiome, as it does for the real numbers. Thus, calculations in ${\displaystyle \mathbb {C} }$ work with a similar structure compared to those within the real numbers.

Theorem

Let ${\displaystyle \mathbb {C} =\mathbb {R} ^{2}}$ be the set of complex numbers with addition and multiplication:

${\displaystyle {\begin{aligned}(a,b)+(c,d)&:=(a+c,b+d)\\(a,b)\cdot (c,d)&:=(a\cdot c-b\cdot d,a\cdot d+b\cdot c)\end{aligned}}}$

This set satisfies the field axioms.

How to get to the proof?

We now want to check the validity of the field axioms in the complex numbers one after the other. For this we will start from the definitions of addition and multiplication in ${\displaystyle \mathbb {C} }$ and use the properties of the real numbers.

Let us consider, for example, the commutativity of multiplication. To prove this, we have to prove the following equation:

${\displaystyle (a,b)\cdot (c,d)=\ldots =(c,d)\cdot (a,b)}$

What transformation steps do we have to take to get from the left side of the term om the right? First, it is helpful to apply the definition of multiplication in the complex numbers, i.e. ${\displaystyle (a,b)\cdot (c,d)=(ac-bd,ad+bc)}$ and ${\displaystyle (c,d)\cdot (a,b)=(ca-db,da+bc)}$. Thus we obtain

${\displaystyle (a,b)\cdot (c,d)=(ac-bd,ad+bc)=\ldots =(ca-db,da+cb)=(c,d)\cdot (a,b)}$

This way, most of the proof is already done. What remains to be shown is the equality ${\displaystyle (ac-bd,ad+bc)=(ca-db,da+cb)}$, which we obtain directly from the properties of ${\displaystyle \mathbb {R} }$: Since ${\displaystyle a,b,c,d}$ are from the field of real numbers, we know, due to the commutativity of the multiplication, that ${\displaystyle ac-bd=ca-db}$ and ${\displaystyle ad+bc=da+cb}$ holds. Hence we have proved the commutativity of multiplication in complex numbers. In a very similar way the other field axioms for complex numbers can be shown.

Besides the associativity and commutativity of addition and multiplication we have to prove the existence of the neutral and inverse element of addition and multiplication in ${\displaystyle \mathbb {C} }$. We do this by constructing such an element and showing by explicit calculation that it has the properties required in the field axioms.

The neutral element of addition is not difficult to find: We suspect the origin of the complex plane to take this role, which corresponds to the zero in the complex number plane or a zero vector. The point ${\displaystyle (0,0)}$ should therefore be the complex zero. Also from the definition of addition it is easy to see that ${\displaystyle 0_{\mathbb {C} }=(0_{\mathbb {R} },0_{\mathbb {R} })}$ must be valid, so that ${\displaystyle (a,b)+(0,0)=(a,b)}$ is fulfilled.

We can easily determine the additive inverse of a complex number ${\displaystyle (a,b)}$ by determining the additive inverse of the two real numbers ${\displaystyle a,b}$. We obtain ${\displaystyle -(a,b)=(-a,-b)}$, which can be shown to be the the additive inverse of ${\displaystyle (a,b)}$ by explicit calculation.

Regarding the neutral element of the multiplication, we assume that, as with the neutral element of the addition, an analogy to the real numbers applies. On the real number line, 1 is the neutral element of the multiplication. In the complex plane this corresponds to the point with the coordinates ${\displaystyle (1,0)}$. And we can explicitly verify that ${\displaystyle 1_{\mathbb {C} }=(1_{\mathbb {R} },0_{\mathbb {R} })}$ has the desired properties.

Now we still have to find the multiplicative inverse. This is somewhat more difficult than the additive inverse because multiplication is defined in a more complicated way than addition. For a given ${\displaystyle (a,b)\in \mathbb {C} }$ with ${\displaystyle (a,b)\neq (0,0)}$ we search for a complex number ${\displaystyle (c,d)\in \mathbb {C} }$ with ${\displaystyle (a,b)\cdot (c,d)=(1,0)}$. Here, ${\displaystyle (1,0)}$ is the "one" already found in the complex numbers.

What conditions must ${\displaystyle (c,d)}$ fulfil as the inverse of ${\displaystyle (a,b)}$? According to the definition of multiplication, ${\displaystyle (a,b)\cdot (c,d)=(ac-bd,ad+bc)}$. Thus ${\displaystyle (ac-bd,ad+bc)=(1,0)}$ must apply. This requires 2 equations to be fulfilled:

${\displaystyle {\begin{aligned}ac-bd&=1\\ad+bc&=0\end{aligned}}}$

This is a system of equations with two unknowns, namely ${\displaystyle c}$ and ${\displaystyle d}$, and two equations. We can try to solve this system of equations, i.e. solve the equations for ${\displaystyle c}$ and ${\displaystyle d}$. If you have 10 minutes (perhaps, it takes far less), take a pen and paper and try to solve the two equations for ${\displaystyle c}$ and ${\displaystyle d}$.

We present here an elegant solution that does not require any case distinction due to division by zero. But it is not intuitive and few people would do the same on the first try. First we multiply the first equation with ${\displaystyle a}$ and the second with ${\displaystyle b}$:

${\displaystyle {\begin{aligned}{\begin{array}{rcr}ac-bd=1&\implies &a^{2}c-abd=a\\[0.3em]ad+bc=0&\implies &abd+b^{2}c=0\end{array}}\end{aligned}}}$

We add both equations and obtain:

${\displaystyle {\begin{aligned}{\begin{array}{rrl}&a^{2}c+0+b^{2}c&=a+0\\[0.3em]\implies &(a^{2}+b^{2})c&=a\\[0.3em]&&{\color {OliveGreen}\left\downarrow \ {\begin{array}{l}a^{2}+b^{2}\neq 0,\\{\text{since }}(a,b)\neq (0,0)\end{array}}\right.}\\[0.3em]\implies &c&={\frac {a}{a^{2}+b^{2}}}\end{array}}\end{aligned}}}$

Now, we multiply the other way round, i.e. the first equation with ${\displaystyle b}$ and the second one with ${\displaystyle a}$:

${\displaystyle {\begin{aligned}{\begin{array}{rcr}ac-bd=1&\implies &abc-b^{2}d=b\\[0.3em]ad+bc=0&\implies &a^{2}d+abc=0\end{array}}\end{aligned}}}$

Subtracting the first equation from the second, we get:

${\displaystyle {\begin{aligned}{\begin{array}{rrl}&a^{2}d+0+b^{2}d&=-b\\[0.3em]\implies &(a^{2}+b^{2})d&=-b\\[0.3em]&&{\color {OliveGreen}\left\downarrow \ {\begin{array}{l}a^{2}+b^{2}\neq 0,\\{\text{since }}(a,b)\neq (0,0)\end{array}}\right.}\\[0.3em]\implies &d&={\frac {-b}{a^{2}+b^{2}}}\end{array}}\end{aligned}}}$

So we found ${\displaystyle (c,d)=\left({\tfrac {a}{a^{2}+b^{2}}},{\tfrac {-b}{a^{2}+b^{2}}}\right)\in \mathbb {C} }$ as the inverse of ${\displaystyle (a,b)}$. In the proof we willverify that indeed ${\displaystyle (a,b)\cdot (c,d)=(1,0)}$.

Proof

We must verify all field axioms. Let ${\displaystyle a,b,c,d,e,f\in \mathbb {R} }$ be given arbitrarily.

Proof step: Associative law for addition

${\displaystyle {\begin{aligned}(a,b)+{\bigg (}(c,d)+(e,f){\bigg )}&=(a,b)+(c+e,d+f)\\&=(a+(c+e),b+(d+f))\\&{\color {OliveGreen}\left\downarrow \ {\text{associative law in }}\mathbb {R} \right.}\\[0.3em]&=((a+c)+e,(b+d)+f)\\&=(a+c,b+d)+(e,f)\\&={\bigg (}(a,b)+(c,d){\bigg )}+(e,f)\end{aligned}}}$

Proof step: Commutative law for addition

${\displaystyle {\begin{aligned}(a,b)+(c,d)&=(a+c,b+d)\\&{\color {OliveGreen}\left\downarrow \ {\text{commutative law in }}\mathbb {R} \right.}\\[0.3em]&=(c+a,d+b)\\&=(c,d)+(a,b)\end{aligned}}}$

Proof step: Existence of a zero elemen

The zero element in ${\displaystyle \mathbb {C} }$ is given by ${\displaystyle (0,0)}$, since

${\displaystyle {\begin{aligned}(0,0)+(a,b)&=(a+0,b+0)\\&{\color {OliveGreen}\left\downarrow \ {\text{definition of }}0{\text{ in }}\mathbb {R} \right.}\\[0.3em]&=(a,b)\end{aligned}}}$

Proof step: Existence of the additive inverse

In ${\displaystyle \mathbb {C} }$ there is ${\displaystyle -(a,b)=(-a,-b)}$, since

${\displaystyle {\begin{aligned}(a,b)+(-a,-b)&=(a-a,b-b)\\&{\color {OliveGreen}\left\downarrow \ {\text{additive inverse in }}\mathbb {R} \right.}\\[0.3em]&=(0,0)\end{aligned}}}$

Proof step: Associative law for multiplikation

${\displaystyle {\begin{aligned}(a,b)\cdot {\bigg (}(c,d)\cdot (e,f){\bigg )}&=(a,b)\cdot (ce-df,cf+ed)\\&=(a\cdot (ce-df)-b\cdot (cf+ed),a\cdot (cf+ed)+b\cdot (ce-df))\\&{\color {OliveGreen}\left\downarrow \ {\text{distributive law in }}\mathbb {R} \right.}\\[0.3em]&=(ace-adf-bcf-bed,acf+aed+bce-bdf)\\&=((ac-bd)\cdot e-(ad+bc)\cdot f,(ac-bd)\cdot f+(ad+bc)\cdot e)\\&{\color {OliveGreen}\left\downarrow \ {\text{distributive law in }}\mathbb {R} \right.}\\[0.3em]&=(ac-bd,ad+bc)\cdot (e,f)\\&={\bigg (}(a,b)\cdot (c,d){\bigg )}\cdot (e,f)\end{aligned}}}$

Proof step: Commutative law for multiplikation

${\displaystyle {\begin{aligned}(a,b)\cdot (c,d)&=(ac-bd,ad+bc)\\&{\color {OliveGreen}\left\downarrow \ {\text{commutative law in }}\mathbb {R} \right.}\\[0.3em]&=(ca-db,da+cb)\\&=(c,d)\cdot (a,b)\end{aligned}}}$

Proof step: Existence of a unit element

The unit element in ${\displaystyle \mathbb {C} }$ is ${\displaystyle (1,0)}$: there is ${\displaystyle (1,0)\neq (0,0)}$ and

${\displaystyle {\begin{aligned}(1,0)\cdot (a,b)&=(1\cdot a-0\cdot b,1\cdot b+0\cdot a)\\&{\color {OliveGreen}\left\downarrow \ {\text{properties of }}0{\text{ and }}1{\text{ in }}\mathbb {R} \right.}\\[0.3em]&=(a-0,b+0)\\&=(a,b)\end{aligned}}}$

Proof step: Existence of the multiplicative inverse

Let ${\displaystyle z=(a,b)}$ a complex number with ${\displaystyle (a,b)\neq (0,0)}$. The inverse of this number is ${\displaystyle (a,b)^{-1}=\left({\frac {a}{a^{2}+b^{2}}},{\frac {-b}{a^{2}+b^{2}}}\right)}$. This number is well defined, since ${\displaystyle (a,b)\neq (0,0)}$ and hence ${\displaystyle a^{2}+b^{2}>0}$. And there is

${\displaystyle {\begin{aligned}(a,b)\cdot (a,b)^{-1}&=(a,b)\cdot \left({\frac {a}{a^{2}+b^{2}}},{\frac {-b}{a^{2}+b^{2}}}\right)\\[0.3em]&=\left(a\cdot {\frac {a}{a^{2}+b^{2}}}-b\cdot {\frac {-b}{a^{2}+b^{2}}},a\cdot {\frac {-b}{a^{2}+b^{2}}}+b\cdot {\frac {a}{a^{2}+b^{2}}}\right)\\[0.3em]&=\left({\frac {aa+bb}{a^{2}+b^{2}}},{\frac {-ab+ba}{a^{2}+b^{2}}}\right)\\[0.3em]&=\left({\frac {a^{2}+b^{2}}{a^{2}+b^{2}}},{\frac {0}{a^{2}+b^{2}}}\right)\\[0.3em]&{\color {OliveGreen}\left\downarrow \ {\text{multiplicative inverse of }}a^{2}+b^{2}{\text{ in }}\mathbb {R} \right.}\\[0.3em]&=(1,0)\end{aligned}}}$

Proof step: Distributive law

${\displaystyle {\begin{aligned}(a,b)\cdot {\bigg (}(c,d)+(e,f){\bigg )}&=(a,b)\cdot (c+e,d+f)\\&=(a\cdot (c+e)-b\cdot (d+f),a\cdot (d+f)+b\cdot (c+e))\\&{\color {OliveGreen}\left\downarrow \ {\text{distributive law in }}\mathbb {R} \right.}\\[0.3em]&=(ac+ae-bd-bf,ad+af+bc+be)\\&=(ac-bd,ad+bc)+(ae-bf,af+be)\\&=(a,b)\cdot (c,d)+(a,b)\cdot (e,f)\end{aligned}}}$

We identify the complex numbers ${\displaystyle \mathbb {C} }$ with the plane ${\displaystyle \mathbb {R} \times \mathbb {R} }$. Here the ${\displaystyle x}$ axis lying in the complex plane is the real number line. So it makes sense that the real numbers ${\displaystyle \mathbb {R} }$ are a subset of the complex numbers ${\displaystyle \mathbb {C} }$.

We also know that both ${\displaystyle \mathbb {R} }$ and ${\displaystyle \mathbb {C} }$ are fields. So ${\displaystyle \mathbb {R} }$ should be a sub-field of ${\displaystyle \mathbb {C} }$. In order to verify this, we have to show more than that ${\displaystyle \mathbb {R} }$ is a subset of ${\displaystyle \mathbb {C} }$. We must also prove that the addition and multiplication of real numbers in ${\displaystyle \mathbb {C} }$ again leads to real numbers. Mathematically, two statements have to be shown: ${\displaystyle \mathbb {R} }$ is a subset of ${\displaystyle \mathbb {C} }$ and the arithmetic operations preserve the real numbers in ${\displaystyle \mathbb {C} }$.

The first statement is easily confirmed. Strictly speaking, ${\displaystyle \mathbb {R} }$ is not subset of ${\displaystyle \mathbb {C} }$, since ${\displaystyle \mathbb {C} =\mathbb {R} \times \mathbb {R} =\{(a,b)|a,b\in \mathbb {R} \}}$ is a set of tuples and ${\displaystyle \mathbb {R} }$ just a set of single. So the elements of ${\displaystyle \mathbb {R} }$ and of ${\displaystyle \mathbb {C} }$ are different.

However, we can identify the real numbers with a subset of the complex numbers, which behaves similar to ${\displaystyle \mathbb {R} }$. To find this subset, we use the visualization of the complex numbers in the plane. The subset we are looking for is the real axis in the complex plane. A complex number ${\displaystyle z=(a,b)\in \mathbb {C} }$ lies on this axis exactly when its imaginary part is zero, i.e. ${\displaystyle b=0}$. Thus the real line is identified with the set ${\displaystyle \{(a,0)|a\in \mathbb {R} \}=\mathbb {R} \times \{0\}\subseteq \mathbb {C} }$.

Now, a quick mathematical investigation of the identification of ${\displaystyle \mathbb {R} \times \{0\}}$ with the real numbers follows. Intuitively, there is nothing to do: the real line looks like the real axis within the complex plane. Mathematically, there is still some work to be done: we need a one-to-one relationship (bijective mapping) of ${\displaystyle \mathbb {R} }$ to ${\displaystyle \mathbb {R} \times \{0\}}$. Or we define an injective mapping ${\displaystyle \iota \colon \mathbb {R} \to \mathbb {C} }$ (called embedding) with ${\displaystyle \iota (\mathbb {R} )=\mathbb {R} \times \{0\}}$. Then ${\displaystyle \iota }$ bijectively maps the real numbers to ${\displaystyle \mathbb {R} \times \{0\}}$.

And we need that ${\displaystyle \mathbb {R} \times \{0\}}$ has the same structure as the real numbers. Our embedding map ${\displaystyle \iota }$ should preserve the structure of ${\displaystyle \mathbb {R} }$ in the image. This means, sums in ${\displaystyle \mathbb {R} }$ should be mapped from ${\displaystyle \iota }$ to sums in ${\displaystyle \mathbb {C} }$ and the same with products. And the neutral elements ${\displaystyle 0}$ and ${\displaystyle 1}$ shall be mapped from the real numbers to the corresponding neutral elements in the complex numbers. (A mapping with such properties is also called field homomorphism).

How should we choose ${\displaystyle \iota }$? Let us look again at our visualization of the complex plane. We want to map the real number line ${\displaystyle \mathbb {R} }$ to the real axis ${\displaystyle \mathbb {R} \times \{0\}}$. The easiest way to do this is to just embed the number line into the two-dimensional plane. In other words, map a real number ${\displaystyle a\in \mathbb {R} }$ to ${\displaystyle (a,0)\in \mathbb {R} \times \{0\}}$:

It remains to be shown that our picture fulfils the characteristics of an injective field homomorphism. Such an injective body homohorphism is also called field monomorphism:

How to get to the proof? (Embedding of the real numbers is a field homomorphism)

To show that any function ${\displaystyle f\colon L\to K}$ between two fields ${\displaystyle L}$ and ${\displaystyle K}$ is a field homomorphism, the following properties must be verified:

• The two neutral elements with respect to the field ${\displaystyle L}$ must be mapped to the neutral elements from the field ${\displaystyle K}$, i.e.
  ${\displaystyle {\begin{aligned}f(0_{L})&=0_{K}\\f(1_{L})&=1_{K}\end{aligned}}}$

  Here ${\displaystyle 0_{L}}$/ ${\displaystyle 1_{L}}$ are the neutral element of the addition/ multiplication in the set ${\displaystyle L}$ and ${\displaystyle 0_{K}}$/ ${\displaystyle 1_{K}}$ are the neutral elements in ${\displaystyle K}$.

• Linearity with regard to addition, i.e. for all ${\displaystyle a,b\in L}$ there is:
  ${\displaystyle f(a+_{L}b)=f(a)+_{K}f(b)}$
• Linearity with regard to multiplication, i.e. for all ${\displaystyle a,b\in L}$ there is:
  ${\displaystyle f(a\cdot _{L}b)=f(a)\cdot _{K}f(b)}$

We have to verify these properties for ${\displaystyle \iota }$. To do this, we first translate the properties to be verified into the case of ${\displaystyle \iota }$. For example, the formula ${\displaystyle f(a\cdot _{L}b)=f(a)\cdot _{K}f(b)}$ becomes

${\displaystyle {\begin{aligned}{\color {Thistle}f}(a\cdot _{\color {RedOrange}L}b)&={\color {Thistle}f}(a)\cdot _{\color {Blue}K}{\color {Thistle}f}(b)\\[0.3em]&\downarrow \\[0.3em]{\color {Thistle}\iota }(a\cdot _{\color {RedOrange}\mathbb {R} }b)&={\color {Thistle}\iota }(a)\cdot _{\color {Blue}\mathbb {C} }{\color {Thistle}\iota }(b)\\[0.3em]\end{aligned}}}$

So we have to prove the equation ${\displaystyle \iota (a\cdot b)=\iota (a)\cdot \iota (b)}$. Here we can first use the definition of ${\displaystyle \iota }$. With this the following chain of equations can be shown:

${\displaystyle \iota (a\cdot b)=(a\cdot b,0)=\ldots =(a,0)\cdot (b,0)=\iota (a)\cdot \iota (b)}$

By explicitly calculating ${\displaystyle (a,0)\cdot (b,0)}$ this chain of equations can be proven. The same can be done for the other properties. The proof of injectivity is done by a similar procedure.

Proof (Embedding of the real numbers is a field homomorphism)

Let ${\displaystyle a,b\in \mathbb {R} }$. Further, as defined above, ${\displaystyle (1.0)}$ is the neutral element of multiplication in ${\displaystyle \mathbb {C} }$, and ${\displaystyle (0.0)}$ is the neutral element of addition in ${\displaystyle \mathbb {C} }$. There is:

Proof step: ${\displaystyle \iota }$ preserves neutral elements

The two neutral elements of ${\displaystyle \mathbb {R} }$ get mapped to the neutral elements of ${\displaystyle \mathbb {C} }$:

${\displaystyle {\begin{aligned}\iota (1_{\mathbb {R} })&=(1,0)=1_{\mathbb {C} }\\\iota (0_{\mathbb {R} })&=(0,0)=0_{\mathbb {C} }\end{aligned}}}$

Proof step: ${\displaystyle \iota (a+b)=\iota (a)+\iota (b)}$

${\displaystyle \iota (a+b)=(a+b,0)=(a,0)+(b,0)=\iota (a)+\iota (b)}$

Proof step: ${\displaystyle \iota (a\cdot b)=\iota (a)\cdot \iota (b)}$

${\displaystyle {\begin{aligned}\iota (a\cdot b)&=(a\cdot b,0)\\&=(a\cdot b-0\cdot 0,a\cdot 0+0\cdot b)\\&=(a,0)\cdot (b,0)=\iota (a)\cdot \iota (b)\end{aligned}}}$

Proof step: ${\displaystyle \iota }$is injective

Let ${\displaystyle a,b\in \mathbb {R} }$ with ${\displaystyle \iota (a)=\iota (b)}$. Consequently ${\displaystyle (a,0)=\iota (a)=\iota (b)=(b,0)}$, so ${\displaystyle (a,0)=(b,0)}$. This means, ${\displaystyle a=b}$ and our map is injective.

Thus the map ${\displaystyle \iota }$ is an injective field homomorphism , i.e. a field homomorphism.

Due to the properties of a field monomorphism, the structure of a field is preserved in the image of the embedding. Simply put, the image of the field monomorphism fulfils the field axioms and thus defines a field again. Since the image of the embedding ${\displaystyle \iota }$ is a subset of the field of complex numbers, we can regard the image ${\displaystyle \iota (\mathbb {R} )}$ as a sub-field of ${\displaystyle \mathbb {C} }$. Furthermore, the image ${\displaystyle \iota \colon \mathbb {R} \to \operatorname {Imag} (\iota )}$ gives a field isomorphism, i.e. a bijective field homomorphism between ${\displaystyle \mathbb {R} }$ and ${\displaystyle \operatorname {Imag} (\iota )}$. This justifies the notion ${\displaystyle \mathbb {R} \subseteq \mathbb {C} }$ and we view from now on all real numbers ${\displaystyle a\in \mathbb {R} }$ as equal to the complex number ${\displaystyle a:=\iota (a)}$.

We would like to write a complex number as ${\displaystyle a+b\,\mathrm {i} }$. According to our definition with ${\displaystyle \mathbb {C} =\mathbb {R} \times \mathbb {R} }$, this number is the tuple ${\displaystyle (a,b)}$. To simplify calculations, we would like to introduce the notation ${\displaystyle a+b\,\mathrm {i} }$ without the tuple. For this we have to define ${\displaystyle \mathrm {i} }$ mathematically. Since ${\displaystyle \mathrm {i} }$ lies in the complex plane on the ${\displaystyle y}$ axis at coordinate ${\displaystyle 1}$, we choose ${\displaystyle \mathrm {i} :=(0,1)}$:

In the beginning we looked for the solution of the equation ${\displaystyle x^{2}=-1}$ and with ${\displaystyle \mathrm {i} }$ we found one of these solutions. We can verify that ${\displaystyle \mathrm {i} ^{2}=-1}$ for ${\displaystyle \mathrm {i} =(0,1)}$ by explicit computation:

${\displaystyle {\begin{aligned}\mathrm {i} ^{2}&=\mathrm {i} \cdot \mathrm {i} =(0,1)\cdot (0,1)\\[0.3em]&=(0\cdot 0-1\cdot 1,0\cdot 1+1\cdot 0)\\[0.3em]&=(-1,0)=\iota (-1)=-1\end{aligned}}}$

Here, we use the embedding ${\displaystyle \iota }$ of the real numbers in ${\displaystyle \mathbb {C} }$ and the notation ${\displaystyle a=\iota (a)}$ for ${\displaystyle a\in \mathbb {R} }$. So there indeed is ${\displaystyle \mathrm {i} ^{2}=-1}$. Now we show that the notation ${\displaystyle a+b\,\mathrm {i} }$ for ${\displaystyle (a,b)}$ indeed makes sense. Using ${\displaystyle c:=\iota (c)=(c,0)}$ for ${\displaystyle c\in \mathbb {R} }$ we show ${\displaystyle (a,b)=a+b\,\mathrm {i} }$. Thanks to this proof, we can then calculate with the complex number ${\displaystyle a+b\,\mathrm {i} }$ as if it was a sum:

Proof

Let ${\displaystyle (a,b)\in \mathbb {C} }$. Then

${\displaystyle {\begin{aligned}(a,b)&=(a,0)+(0,b)\\[0.5em]&{\color {OliveGreen}\left\downarrow \ {\begin{aligned}&(b,0)\cdot (0,1)\\=&(b\cdot 0-0\cdot 1,b\cdot 1+0\cdot 0)\\=&(0,b)\end{aligned}}\right.}\\[0.5em]&=(a,0)+(b,0)\cdot (0,1)\\&=a+b\cdot (0,1)=a+b\,\mathrm {i} \end{aligned}}}$

It would be nice to have an ordering of complex numbers, that means a larger/smaller relation for complex numbers. Let us consider the numbers ${\displaystyle 1}$ and ${\displaystyle \mathrm {i} }$. We notice that they lie on the unit circle. This is the set of all points which have the distance ${\displaystyle 1}$ to zero:

Is now ${\displaystyle 1<\mathrm {i} }$, ${\displaystyle 1=\mathrm {i} }$ or ${\displaystyle 1>\mathrm {i} }$? At first this case seems to be ambiguous, because both numbers have the same absolute value. What about ${\displaystyle 1}$ and ${\displaystyle -2\mathrm {i} }$? The number ${\displaystyle -2\mathrm {i} }$ is further away from zero than the number ${\displaystyle 1}$. Is ${\displaystyle -2\mathrm {i} >1}$ then also valid? Can the product of a negative number with the imaginary unit really be greater than a positive number?

From these small examples we can already see that establishing an ordering of complex numbers is difficult. In fact this is not possible. The following theorem proves this:

With ${\displaystyle \mathbb {C} }$ we constructed a field in which the equation ${\displaystyle x^{2}=-1}$ is solvable, so the polynomial ${\displaystyle x^{2}+1}$ has a zero. In the complex numbers ${\displaystyle \mathbb {C} }$ we even have that every polynomial (with coefficients in ${\displaystyle \mathbb {C} }$) of degree greater or equal to ${\displaystyle 1}$ has at least one zero. This excludes only constant polynomials, which of course (except the zero polynomial) have no zeros. This property is not valid in the real numbers: for instance, ${\displaystyle x^{2}+1}$ has no real zeros.

This property of complex numbers is called algebraic closure and is treated in algebra. The algebraic closure of ${\displaystyle \mathbb {C} }$ is proved in a theorem with the majestic name Fundamental Theorem of Algebra.