Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Lecture 5/latex
\setcounter{section}{5}
\subtitle {Ordering properties of the real numbers}
It is known that the real number may be identified with the points on a line. If on the number line, a point is further on the right than another point, then its value is larger. We describe now these ordering properties of the real numbers.
\inputdefinition
{ }
{
A
field
$K$ is called an \definitionword {ordered field}{,} if there is a relation $>$
\extrabracket {\keyword {larger than} {}} {} {}
between the elements of $K$, fulfilling the following properties
\extrabracket {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
means
\mathrelationchain
{\relationchain
{a
}
{ > }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{a
}
{ = }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}} {} {.}
\enumerationfour {For two elements
\mathrelationchain
{\relationchain
{a,b
}
{ \in }{K
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
we have either
\mathrelationchain
{\relationchain
{a
}
{ > }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{a
}
{ = }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{b
}
{ > }{a
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {From
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{b
}
{ \geq }{c
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
one may deduce
\mathrelationchain
{\relationchain
{a
}
{ \geq }{c
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\extrabracket {for any
\mathrelationchain
{\relationchain
{ a , b , c
}
{ \in }{ K
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}} {} {.}
} {
\mathrelationchain
{\relationchain
{ a
}
{ \geq }{ b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
implies
\mathrelationchain
{\relationchain
{ a + c
}
{ \geq }{ b + c
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\extrabracket {for any
\mathrelationchain
{\relationchain
{ a , b , c
}
{ \in }{ K
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}} {} {.}
} {From
\mathrelationchain
{\relationchain
{ a
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{ b
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
one may deduce
\mathrelationchain
{\relationchain
{ a b
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\extrabracket {for any
\mathrelationchain
{\relationchain
{ a, b
}
{ \in }{ K
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}} {} {.}
}
\mathcor {} {\Q} {and} {\R} {} are, with their natural orderings, ordered fields.
\inputfactproof
{Ordered field/Elementary properties/3/Fact}
{Lemma}
{}
{
In an
ordered field,
the following properties hold.
\enumerationten {
\mathrelationchain
{\relationchain
{1
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{-a
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{a-b
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{-a
}
{ \leq }{-b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \geq }{d
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{a +c
}
{ \geq }{b+d
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ac
}
{ \geq }{bc
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ac
}
{ \leq }{bc
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ \geq }{0
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \geq }{d
}
{ \geq }{0
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ac
}
{ \geq }{bd
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{b
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ab
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{b
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ab
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
{See Exercise 5.5 .}
\inputfactproof
{Ordered field/Elementary properties for inverses/Fact}
{Lemma}
{}
{
In an
ordered field,
the following properties holds.
\enumerationfive {From
\mathrelationchain
{\relationchain
{x
}
{ > }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
one can deduce
\mathrelationchain
{\relationchain
{x^{-1}
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {From
\mathrelationchain
{\relationchain
{x
}
{ < }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
one can deduce
\mathrelationchain
{\relationchain
{x^{-1}
}
{ < }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{x
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{x
}
{ \geq }{1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{x^{-1}
}
{ \leq }{1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {From
\mathrelationchain
{\relationchain
{x
}
{ \geq }{y
}
{ > }{0
}
{ }{
}
{ }{
}
}
{}{}{}
one can deduce
\mathrelationchain
{\relationchain
{x^{-1}
}
{ \leq }{ y^{-1}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For positive elements $x,y$ the relation
\mathrelationchain
{\relationchain
{x
}
{ \geq }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
is equivalent with
\mathrelationchain
{\relationchain
{ { \frac{ x }{ y } }
}
{ \geq }{1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
}
{
See Exercise 5.8 , Exercise 5.37 , Exercise 5.9 , Exercise 5.10 and Exercise 5.11 .
\inputdefinition
{ }
{
Let $K$ be an
ordered field. $K$ is called \definitionword {Archimedean}{,} if the following \definitionword {Archimedean axiom}{} holds, i.e. if for every
\mathrelationchain
{\relationchain
{x
}
{ \in }{K
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists a natural number $n$ such that
\mathrelationchaindisplay
{\relationchain
{n
}
{ \geq} {x
}
{ } {
}
{ } {
}
{ } {
}
}
}
\inputfaktbeweis
{Real numbers/Ordering axioms/Archimedean/Implications/Fact}
{Lemma}
{}
{
\factsituation {}
\factconclusion {\enumerationthree {For
\mathrelationchain
{\relationchain
{x,y
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
with
\mathrelationchain
{\relationchain
{x
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists
\mathrelationchain
{\relationchain
{n
}
{ \in }{ \N
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that
\mathrelationchain
{\relationchain
{nx
}
{ \geq }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{x
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists a natural number $n$ such that
\mathrelationchain
{\relationchain
{ { \frac{ 1 }{ n } }
}
{ < }{ x
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For two real numbers
\mathrelationchain
{\relationchain
{x
}
{ < }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists a rational number \mathl{n/k}{} (with
\mathrelationchain
{\relationchain
{n
}
{ \in }{\Z
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
\mathrelationchain
{\relationchain
{k
}
{ \in }{\N_+
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}) such that
\mathrelationchaindisplay
{\relationchain
{x
}
{ <} { { \frac{ n }{ k } }
}
{ <} {y
}
{ } {
}
{ } {
}
}
{}{}{.}
}}
\factextra {}
}
{
(1). We consider \mathl{y/x}{.} Because of the
Archimedean axiom
there exists some natural number $n$ with
\mathrelationchain
{\relationchain
{n
}
{ \geq }{ y/x
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Since $x$ is positive, due to
Lemma 5.2
(6)
also
\mathrelationchain
{\relationchain
{nx
}
{ \geq }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds. For (2) and (3) see
Exercise 5.21
.
\inputdefinition
{ }
{
For real numbers
\mathcond {a,b} {}
{a \leq b} {}
{} {} {} {,}
we call
\enumerationfour {
\mathrelationchain
{\relationchain
{ [a,b]
}
{ = }{ { \left\{ x \in \R \mid x \geq a \text{ and } x \leq b \right\} }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the \definitionword {closed interval}{.}
} {
\mathrelationchain
{\relationchain
{ ]a,b[
}
{ = }{ { \left\{ x \in \R \mid x >a \text{ and } x < b \right\} }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the \definitionword {open interval}{.}
} {
\mathrelationchain
{\relationchain
{ ]a,b]
}
{ = }{ { \left\{ x \in \R \mid x > a \text{ and } x \leq b \right\} }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the \definitionword {half-open interval}{} (closed on the right).
} {
\mathrelationchain
{\relationchain
{ [a,b[
}
{ = }{ { \left\{ x \in \R \mid x \geq a \text{ and } x < b \right\} }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the \definitionword {half-open interval}{} (closed on the left).
}
\image{ \begin{center}
\includegraphics[width=5.5cm]{\imageinclude {Floor_function.svg} }
\end{center}
\imagetext {} }
\imagelicense { Floor function.svg } {} {Omegatron} {Commons} {CC-by-sa 3.0} {}
For the real numbers, the intervals with bounds from $\Z$
\mathcond {[n,n+1[} {}
{n \in \Z} {}
{} {} {} {,}
form a disjoint union or a \keyword {covering} {} of $\R$. Therefore, the following definition makes sense.
\inputdefinition
{ }
{
For a real number $x$, the \definitionword {floor}{} \mathl{\left \lfloor x \right \rfloor}{} is defined as
\mathdisp {\left \lfloor x \right \rfloor = n, \text{ if } x \in [n,n+1[ \text{ and } n \in \Z} { . }
}
With the ordering properties, we can also define increasing and decreasing functions.
\inputdefinition
{ }
{
Let
\mathrelationchain
{\relationchain
{I
}
{ \subseteq }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
denote an
interval
and let
\mathdisp {f \colon I \longrightarrow \R} { }
denote a
function.
Then $f$ is called \definitionword {increasing}{} if
\mathdisp {f(x') \geq f(x) \text { holds for all } x,x' \in I \text{ with } x' \geq x} { , }
\definitionword {strictly increasing}{} if
\mathdisp {f(x') > f(x) \text { holds for all } x,x' \in I \text{ with } x'> x} { , }
\definitionword {decreasing}{} if
\mathdisp {f(x') \leq f(x) \text { holds for all } x,x' \in I \text{ with } x' \geq x} { , }
\definitionword {strictly decreasing}{} if
\mathdisp {f(x') < f(x) \text { holds for all } x,x' \in I \text{ with } x'> x} { . }
}
\subtitle {The modulus}
\image{ \begin{center}
\includegraphics[width=5.5cm]{\imageinclude {Absolute_value.svg} }
\end{center}
\imagetext {} }
\imagelicense { Absolute value.svg } {} {Ævar Arnfjörð Bjarmason} {Commons} {CC-by-sa 3.0} {}
\inputdefinition
{ }
{
For a real number
\mathrelationchain
{\relationchain
{x
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the \definitionword {modulus}{} is defined in the following way.
\mathrelationchaindisplay
{\relationchain
{ \betrag { x }
}
{ =} {\begin{cases} x \, ,\text{ if } x \geq 0 \, , \\ -x,\, \text{ if } x < 0 \, . \end{cases}
}
{ } {
}
{ } {
}
{ } {
}
}
}
So the modulus
\extrabracket {also called the \keyword {absolute value} {}} {} {}
is never negative and has only at
\mathrelationchain
{\relationchain
{ x
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the value $0$, elsewhere it is always positive. The mapping
\mathdisp {\R \longrightarrow \R
, x \longmapsto \betrag { x }} { , }
is called the \keyword {modulus function} {.} Its graph consists of two half lines; such a function is called \keyword {piecewisely linear} {.}
\inputfactproof
{Real numbers/Modulus/Properties/Fact}
{Lemma}
{}
{
\factsituation {The
modulus function
\mathdisp {\R \longrightarrow \R
, x \longmapsto \betrag { x }} { , }
fulfills the following properties ($x,y$ are arbitrary real numbers).}
\factconclusion {\enumerationeight {
\mathrelationchain
{\relationchain
{ \betrag { x }
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { x }
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{x
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { x }
}
{ = }{ \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{x
}
{ = }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{x
}
{ = }{-y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{ \betrag { y-x }
}
{ = }{ \betrag { x-y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { xy }
}
{ = }{ \betrag { x } \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{x
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{ \betrag { x^{-1} }
}
{ = }{ \betrag { x }^{-1}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {We have
\mathrelationchain
{\relationchain
{ \betrag { x+y }
}
{ \leq }{ \betrag { x } + \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
(\keyword {triangle inequality for the modulus} {}).
} {
\mathrelationchain
{\relationchain
{ \betrag { x+y }
}
{ \geq }{ \betrag { x } - \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}}
\factextra {}
{See Exercise 5.23 .}
\subtitle {Bernoulli's inequality}
\image{ \begin{center}
\includegraphics[width=5.5cm]{\imageinclude {Bernoulli_inequality.svg} }
\end{center}
\imagetext {Bernoulli's inequality for \mathl{n =3}{.}} }
\imagelicense { Bernoulli inequality.svg } {} {Oleg Alexandrov} {Commons} {public domain} {}
The following statement is called \keyword {Bernoulli's inequality} {.}
\inputfactproof
{Real numbers/Bernoulli's inequality/Fact}
{Theorem}
{}
{
\factsituation {For every real number
\mathrelationchain
{\relationchain
{x
}
{ \geq }{ -1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
and a natural number $n$,}
\factconclusion {the estimate
\mathrelationchaindisplay
{\relationchain
{ (1+x)^n}
{ \geq} { 1 +nx}
{ } {}
{ } {}
{ } {}
}
{}{}{}
holds.}
\factextra {}
}
{
We do induction over $n$. Suppose that the statement is already known for $n$. Then
\mathrelationchainalign
{\relationchainalign
{ (1+x)^{n+1}
}
{ =} { (1+x)^{n} (1+x)
}
{ \geq} { (1+nx)(1+x)
}
{ =} { 1+(n+1)x + nx^2
}
{ \geq} { 1+(n+1)x
}
}
{}
{}{,}
since squares in an ordered field are nonnegative.
\subtitle {The complex numbers}
We are going to introduce the complex numbers starting from the real numbers. It is not important for this construction that we have not completely listed all properties of the real numbers so far. We will use however that every positive real number has a unique real square root. With the construction of the complex numbers, we then have all number domains which are relevant for us.
\inputdefinition
{ }
{
The set
$\R^2$
with
\mathcor {} {0 \defeq (0,0)} {and} {1 \defeq (1,0)} {,}
with componentwise addition and the multiplication defined by
\mathrelationchaindisplay
{\relationchain
{ (a,b) \cdot (c,d)
}
{ \defeq} { (ac-bd, ad+bc)
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{,}
is called the \definitionword {field of complex numbers}{.} We denote it by
\mathdisp {\Complex} { . }
}
So the addition is just the vector addition in $\R^2$, but the multiplication is a new operation. We will see in Fact ***** a more geometric interpretation for the complex multiplication.
\inputfactproof
{Complex numbers/Field/Fact}
{Lemma}
{}
{
\factsituation {The
complex numbers}
\factconclusion {form a
field.}
\factextra {}
{See Exercise 5.32 .}
From now on we write
\mathrelationchaindisplay
{\relationchain
{ a+b { \mathrm i}
}
{ \defeq} { (a,b)
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
and in particular we put
\mathrelationchain
{\relationchain
{ { \mathrm i}
}
{ = }{ (0,1)
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
this number is called the \keyword {imaginary unit} {.} It has the important property
\mathrelationchaindisplay
{\relationchain
{ { \mathrm i}^2
}
{ =} { -1
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
From this property and the rules of a field, one can deduce all algebraic properties of the complex numbers. This also helps in memorizing the multiplication rule as we have
\mathrelationchaindisplay
{\relationchain
{ (a+b { \mathrm i} )(c+d { \mathrm i} )
}
{ =} { ac+ad { \mathrm i} +b { \mathrm i} c+b { \mathrm i} d { \mathrm i}
}
{ =} { ac+bd { \mathrm i}^2 +(ad+bc) { \mathrm i}
}
{ =} { ac-bd +(ad+bc) { \mathrm i} }
{ } {
}
}
{}{}{.}
We consider a real number $a$ as the complex number
\mathrelationchain
{\relationchain
{ a+0 { \mathrm i}
}
{ = }{ (a,0)
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Hence
\mathrelationchain
{\relationchain
{\R
}
{ \subset }{ \Complex
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
It does not make a difference whether we add or multiply real numbers as real numbers or as complex numbers.
\inputdefinition
{ }
{
For a
complex number
\mathrelationchaindisplay
{\relationchain
{z
}
{ =} { a+b { \mathrm i}
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{,}
we call
\mathrelationchaindisplay
{\relationchain
{
\operatorname{Re} \, { \left( z \right) }
}
{ =} { a
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
the \definitionword {real part}{} of $z$ and
\mathrelationchaindisplay
{\relationchain
{
\operatorname{Im} \, { \left( z \right) }
}
{ =} { b
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
}
However, one should not think that complex numbers are less real than real numbers. The construction of the complex numbers starting from the reals is by far easier than the construction of the real numbers starting from the rational numbers. On the other hand, it was a long historic process until complex numbers were accepted as numbers; they form a field, but not an ordered field, and so at first glance they are numbers which do not measure anything.
\image{ \begin{center}
\includegraphics[width=5.5cm]{\imageinclude {Complex_number_illustration.svg} }
\end{center}
\imagetext {} }
\imagelicense { Complex number illustration.svg } {} {Wolfkeeper} {en. Wikipedia} {CC-by-sa 3.0} {}
One should think of complex numbers as points of the plane; for the additive structure we have directly
\mathrelationchain
{\relationchain
{ \Complex
}
{ = }{ \R^2
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
The horizontal axis is called the \keyword {real axis} {} and the vertical axis is called the \keyword {imaginary axis} {.}
\inputfactproof
{Complex numbers/Real and imaginary part/Properties/Fact}
{Lemma}
{}
{
\factsituation {}
\factcondition {The
real part
and the
imaginary part
of
complex numbers
fulfill the following properties (for
\mathcor {} {z} {and} {w} {} in $\Complex$).}
\factconclusion {\enumerationfive {
\mathrelationchain
{\relationchain
{ z
}
{ = }{
\operatorname{Re} \, { \left( z \right) } +
\operatorname{Im} \, { \left( z \right) } { \mathrm i}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Re} \, { \left( z+w \right) }
}
{ = }{
\operatorname{Re} \, { \left( z \right) } +
\operatorname{Re} \, { \left( w \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Im} \, { \left( z+w \right) }
}
{ = }{
\operatorname{Im} \, { \left( z \right) } +
\operatorname{Im} \, { \left( w \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{r
}
{ \in }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathdisp {\operatorname{Re} \, { \left( rz \right) } =r
\operatorname{Re} \, { \left( z \right) } \text{ and }
\operatorname{Im} \, { \left( rz \right) } =r
\operatorname{Im} \, { \left( z \right) }} { . }
} {
\mathrelationchain
{\relationchain
{ z
}
{ = }{
\operatorname{Re} \, { \left( z \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{z
}
{ \in }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds, and this holds if and only if
\mathrelationchain
{\relationchain
{
\operatorname{Im} \, { \left( z \right) }
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
}}
\factextra {}
{See Exercise 5.34 .}
\inputdefinition
{ }
{
The
mapping
\mathdisp {\Complex \longrightarrow \Complex
, z = a+b { \mathrm i} \longmapsto \overline{ z } \defeq a-b { \mathrm i}} { , }
}
For $z$, the number $\overline{ z }$ is called the \keyword {complex-conjugated number} {} of $z$. Geometrically, the complex conjugation to
\mathrelationchain
{\relationchain
{z
}
{ \in }{ \Complex
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
is simple the reflection at the real axis.
\inputfactproof
{Complex Conjugation/Rules/Fact}
{Lemma}
{}
{
\factsituation {For the
complex conjugation,
the following rules hold
\extrabracket {for arbitrary
\mathrelationchain
{\relationchain
{z,w
}
{ \in }{ \Complex
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}} {} {.}}
\factconclusion {\enumerationsix {
\mathrelationchain
{\relationchain
{ \overline{ z+w }
}
{ = }{ \overline{ z } + \overline{ w }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ -z }
}
{ = }{ - \overline{ z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ z \cdot w }
}
{ = }{ \overline{ z } \cdot \overline{ w }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{z
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{ \overline{ 1/z }
}
{ = }{ 1/\overline{ z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ \overline{ z } }
}
{ = }{ z
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {We have
\mathrelationchain
{\relationchain
{ \overline{ z }
}
{ = }{ z
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{z
}
{ \in }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
}}
\factextra {}
{See Exercise 3.41 .}
\inputfactproof
{Complex numbers/Conjugation/Real part imaginary part/Fact}
{Lemma}
{}
{
\factsituation {}
\factcondition {For a
complex number
$z$ the following relations hold.}
\factconclusion {\enumerationthree {
\mathrelationchain
{\relationchain
{ \overline{ z }
}
{ = }{
\operatorname{Re} \, { \left( z \right) } - { \mathrm i}
\operatorname{Im} \, { \left( z \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Re} \, { \left( z \right) }
}
{ = }{ { \frac{ z+ \overline{ z } }{ 2 } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Im} \, { \left( z \right) }
}
{ = }{ { \frac{ z - \overline{ z } }{ 2 { \mathrm i} } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}}
\factextra {}
{See Exercise 5.35 .}
The square \mathl{d^2}{} of a real number is always nonnegative, and the sum of two nonnegative real numbers is again nonnegative. For a nonnegative real number $c$ there exists a unique nonnegative \keyword {square root} {} $\sqrt{c}$, see
Exercise 8.9
Hence the following definition yields a well-defined real number.
\inputdefinition
{ }
{
For a
complex number
\mathrelationchaindisplay
{\relationchain
{z
}
{ =} {a+b { \mathrm i}
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{,}
the \definitionword {modulus}{} is defined by
\mathrelationchaindisplay
{\relationchain
{ \betrag { z }
}
{ =} { \sqrt{a^2+b^2}
}
{ } {
}
{ } {
}
{ } {
}
}
}
The modulus of a complex number $z$ is, due to the \keyword {Pythagorean theorem} {,} the distance of $z$ to the zero point
\mathrelationchain
{\relationchain
{0
}
{ = }{ (0,0)
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
The modulus is a mapping
\mathdisp {\Complex \longrightarrow \R_{\geq 0}
, z \longmapsto \betrag { z }} { . }
\image{ \begin{center}
\includegraphics[width=5.5cm]{\imageinclude {Eulers_formula.svg} }
\end{center}
\imagetext {} }
\imagelicense { Euler's formula.svg } {} {Wereon} {Commons} {CC-by-sa 3.0} {}
The set of all complex numbers with a certain modulus form a circle with the zero point as center and with the modulus as radius. In particular, all complex numbers with modulus $1$ form the \keyword {complex unit circle} {.} The numbers of the complex unit circle are by the \keyword {formula of Euler} {} in relation to the complex exponential function and to the trigonometric functions, see Fact ***** and Fact *****. We further mention that the product of two complex numbers of the unit circle may be computed by adding the angles starting from the positive real axis counter clockwise.
\inputfactproof
{Complex numbers/Modulus/Rules/Fact}
{Lemma}
{}
{
\factsituation {}
\factcondition {The
modulus
of
complex numbers
fulfils the following properties.}
\factconclusion {\enumerationeight {
\mathrelationchain
{\relationchain
{ \betrag { z }
}
{ = }{ \sqrt{ z \ \overline{ z } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For real $z$ the real and the complex modulus are the same.
} {We have
\mathrelationchain
{\relationchain
{ \betrag { z }
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{z
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { z }
}
{ = }{ \betrag { \overline{ z } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { zw }
}
{ = }{ \betrag { z } \cdot \betrag { w }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{z
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{ \betrag { 1/z }
}
{ = }{ 1/\betrag { z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag {
\operatorname{Re} \, { \left( z \right) } }, \betrag {
\operatorname{Im} \, { \left( z \right) } }
}
{ \leq }{ \betrag { z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { z+w }
}
{ \leq }{ \betrag { z } + \betrag { w }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\extrabracket {triangle inequality} {} {.}
}}
\factextra {}
}
{
We only show the triangle inequality, for the other statements see
Exercise 5.36
.
Because of (7) we have for every complex number $u$ the estimate
\mathrelationchain
{\relationchain
{
\operatorname{Re} \, { \left( u \right) }
}
{ \leq }{ \betrag { u }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Therefore,
\mathrelationchaindisplay
{\relationchain
{
\operatorname{Re} \, { \left( z \overline{ w } \right) }
}
{ \leq} { \betrag { z } \betrag { w }
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{,}
and hence
\mathrelationchainalign
{\relationchainalign
{ \betrag { z+w }^2
}
{ =} { (z+w) { \left( \overline{ z } + \overline{ w } \right) }
}
{ =} { z \overline{ z } + z \overline{ w } + w \overline{ z } + w \overline{ w }
}
{ =} { \betrag { z }^2 + 2
\operatorname{Re} \, { \left( z \overline{ w } \right) } + \betrag { w } ^2
}
{ \leq} { \betrag { z }^2 + 2 \betrag { z } \betrag { w } + \betrag { w } ^2
}
}
{
\relationchainextensionalign
{ =} { ( \betrag { z } + \betrag { w } )^2
}
{ } {}
{ } {}
{ } {}
}
{}{.}
By taking the square root, we get the stated estimate.