z2+1=0 is an example of an equation that has no solution in R. To find a solution, we therefore extend the field to R2 and call it the field (covered in more detail in chapter 5, Algebra, of Discrete Mathematics) of complex numbersC.
Definition 1.1imaginary unit
i2i=−1=^ the imaginary unit
Definition 1.2Cartesian form
z=x+iy
Definition 1.3real and imaginary part
Re(z)Im(z):=x∈R=^ real part:=y∈R=^ imaginary part
Definition 1.4conjugation
The conjugate of z=x+iy∈C is
z=x−iy∈C.
Conjugation has the following properties:
(i) For all z=x+iy=(x,y),z∈C=R2 we have
z⋅z=(x+iy)⋅(x−iy)=x2−i2y2=x2+y2=∥z∥2.
(ii) For all z1,z2∈C we have
z1+z2=z1+z2;
z1z2=z1z2.
Satz
Further properties of the complex numbers. Let z,w∈C; then the following hold:
The angle φ′ in the interval [0,2π) can in principle be computed by first computing the angle in (−π,π] as described above and, only if it is negative, increasing it by 2π:
φ′={φ+2π,φ,φ<0otherwise.
Remark
As an alternative to arctan, φ can also be computed via sine and cosine:
z2+1=0 is an example of an equation with no solution in R that does have solutions in C (namely z=±i). More generally, the fundamental theorem of algebra holds: every polynomial
p(z)=zn+an−1zn−1+⋯+a0
of degree n≥1 has a root in C. That is, unlike R, C is algebraically closed.
Example 1.1
Compute: 3−8i6+7i
Show solutionHide solution3−8i6+7i=3−8i6+7i⋅3+8i3+8i=9−64i218+21i+48i+56i2=9+6418+21i+48i−56=73−38+69i
Example 1.2
Compute the polar form of z=1+i.
Show solutionHide solutionrφ=12+12=2=arctan(11)=4π⇒z=2ei4π
Example 1.3
Compute the Cartesian form of 7ei3π.
Show solutionHide solution7ei3π=7(cos(3π)+isin(3π))=7⋅21+7⋅23i=27+273i
Example 1.4
Sketch the following set in the complex plane:
D:={(22(1+i))n:n∈N}Show solutionHide solution
In polar coordinates (1+i)=2ei4π, hence
(22(1+i))n=ei4nπ.
Since eiθ=ei(θ+2kπ)∀k∈Z, D consists of 8 points, obtained for n=0,1,2,..7:
Below you see the "nice" cosine and sine values on the unit circle, where the x-direction corresponds to cos(φ) and the y-direction to sin(φ):
Remark
Quadratic formula (learn by heart)
ax2+bx+c⇒x1,2=0=2a−b±b2−4ac
Example 1.6
Find all solutions of the following equation:
z2−2(3i+eiπ)=0(1)Show solutionHide solutionz2−2(3i+eiπ)⟺eiπ=−1z2−2(3i−1)⟺z2⟺z2⟺z2⟺polar form and Euler’s formula(reiϑ)2⟺r2e2iϑ=0=0=2(3i−1)=−2+23i=4(−21+23i)=4ei32π=4ei32π⟹r⟹2ϑ⟺ϑ=4=2=32π+2kπ,∀k∈Z=3π+kπ,∀k∈Z⟹z⟺z⟺z=2ei(3π+kπ)for k=0,1={2ei3π,2ei34π}={1+3i,−1−3i}
(Version 1): ∀b>0∃n∈N:b<n "We can always get bigger."
(Version 2): ∀ϵ>0∃n∈N:n1<ϵ "We can always get smaller."
Definition 2.1upper bound
Let A⊂R be a subset of R. A number b∈R is called an upper bound for A if
∀a∈A:a≤b.
Definition 2.2lower bound
A lower bound for A is a number c∈R such that
∀a∈A:a≥c.
Remark
Note that upper or lower bounds of A need not be elements of A. If the subset A has an upper bound, A is called bounded above. If a lower bound for A exists, A is called bounded below.
Remark
A set A can have several bounds, i.e. bounds are not unique. If, for instance, b is an upper bound for A, then so is every real number greater than b.
Definition 2.3supremum, infimum
The supremum of a set A is the least upper bound of A (notation: sup(A)). The infimum of A is the greatest lower bound of A (notation: inf(A)). If A is unbounded above and/or below, we set
sup(A)=+∞,inf(A)=−∞.
Remark
While upper and lower bounds are not unique, the supremum and the infimum of a set A are always unique. The supremum and the infimum need not be elements of A.
Definition 2.4maximum, minimum
If sup(A)∈A, then sup(A) is called the maximum of A, with the following notation:
sup(A)=max(A).
Analogously, if inf(A)∈A, then inf(A) is called the minimum of A, with the following notation:
inf(A)=min(A).
Definition 2.5
Let B,C⊂R be non-empty; then B+C denotes the following set
B+C:={b+c∣b∈B,c∈C}.
Satzcomputing with sup/inf
Let B,C⊂R be non-empty; then the following formulas hold:
"Guess" s+ and claim that "s+∈upper bounds(S)" holds.
Prove the claim by showing that ∀s∈S:s+≥s.
// Hence we know that supS exists.
Now we claim that "s+=supS" holds.
ifs+∈Sthen
// Proof by demonstration
supS=maxS=s+ and we are done!
else
// Proof by contradiction
Show that s+∈/S.
// Hence we know that maxS does not exist.
Carry out an ϵ-proof, as explained in the following example. Done!
end if
else
S is either empty or not bounded above; both imply that
supS and maxS do not exist.
If S is unbounded above, we have to prove that as well!
end if
Remarkcredit: Olivier Bitter
An ϵ-proof (line 14) is carried out as follows: let ϵ>0, and assume for contradiction that s′:=s+−ϵ is another upper bound for S. Find an element s∈S that is strictly greater than s′, which contradicts our assumption (we assumed that s′ is an upper bound).
Example 2.1credit: Olivier Bitter
Given: M1:={1+n1:n∈N−{0}}
Wanted: sup/max and inf/min (if they exist)
We start with sup/max:
(Line 2): It should be obvious that M1=∅. That upper bounds(M1)=∅ should also be clear, since the elements decrease as n grows. We still have to prove this formally (see steps 2 - 5).
(Line 3): We guess m+=2 and claim that 2∈upper bounds(M1).
(Line 4): ∀n≥1:
n≥1⇔1≥n1⇔2≥1+n1,
which shows that 2∈upper bounds(M1).
(Line 7): Choosing n=1 gives 1+11=2=m+, which shows that m+∈M1.
(Line 9): To summarise: supM1=maxM1=2.
Now we compute inf/min:
(Line 2): Again it should be obvious that M1=∅. It should be intuitively clear that the elements can never become negative, so lower bounds(M1)=∅.
(Line 3): We guess m−=1 and claim "1∈lower bounds(M1)".
(Line 4): To see that 1 is a lower bound, we use the following equivalences: ∀n≥1:
1≥0⇔n1≥0⇔1+n1≥1.
(Line 7): As n grows, the elements seem to get very close to 1 without ever reaching it. So we end up in line 10 and have to carry out a proof by contradiction.
(Line 12): Assume for contradiction that 1∈M1. Then there exists an n≥1 such that
1=1+n1⇔0=n1⇔0=1
which is a contradiction. Hence M1 has no minimum.
(Line 14): Now we want to show that 1 is the greatest lower bound of M1. Assume for contradiction that a greater lower bound exists, m′=m−+ε. But then we would need
1+ε≤1+n1⇔ε≤n1(∀n≥1).
This contradicts Theorem 1 (version 2 of the Archimedean principle). Hence infM1=1, and no minimum exists.