Geg 217 Lect 01
Geg 217 Lect 01
A Comprehensive Introduction
Dr Oluwafemi A. George
Dr John Ogbemhe
November 6, 2023
Topics
Logarithmic functions
Exponential functions
Circular functions
Trigonometric functions
Topics
Conformal mapping
Riemann mapping theorem
Applications of conformal mapping
Topics
Limits of complex functions
Continuity of complex functions
Differentiability of complex functions
Topics
Cauchy-Riemann equations
Analytic functions
Cauchy-Riemann equations in polar coordinates
Topics
Complex line integrals
Cauchy’s integral theorem
Cauchy’s integral formula
Topics
Integration of complex functions
Cauchy’s residue theorem
Laurent series
Topics
Conformal mapping
Potential theory
Fourier analysis
a11 a12 .... a1n b11 b12 .... b1n
. . .... . .
. .... .
[aij + bij ] =
. . .... . +
. . .... . =
. . .... . . . .... .
am1 am2 .... amn bm1 bm2 .... bmn
a11 + b11 a12 + b12 .... a1n + b1n
. . .... .
. . .... .
. . .... .
am1 + bm1 am2 + bm2 .... amn + bmn
1 Step 1: Analysis
Since the last pair of equal matrices is the final one, the terms of
each pair are added.
1 Step 1: Analysis
Since the last pair of equal matrices is the final one, the terms of
each pair are added.
(c), are not equal their sum is undefined.
Similarly, when matrices are equal or of same dimension, their
corresponding terms may be subtracted from each other.
1 Step 1: Analysis
Since the last pair of equal matrices is the final one, the terms of
each pair are added.
(c), are not equal their sum is undefined.
Similarly, when matrices are equal or of same dimension, their
corresponding terms may be subtracted from each other.
2 Step 2:Add or Subtract
Step two involves adding or subtracting matrix pair values.
When subtracting, each matrix member following the negative
sign is subtracted from its predecessor.
1 Step 1: Analysis
Since the last pair of equal matrices is the final one, the terms of
each pair are added.
(c), are not equal their sum is undefined.
Similarly, when matrices are equal or of same dimension, their
corresponding terms may be subtracted from each other.
2 Step 2:Add or Subtract
Step two involves adding or subtracting matrix pair values.
When subtracting, each matrix member following the negative
sign is subtracted
from
its predecessor.
−1 2 1 3 −1 + 1 2 + 3 0 5
(a) + = =
0 1 −1 2 0 + −1 1 + 2 −1 3
1 Step 1: Analysis
Since the last pair of equal matrices is the final one, the terms of
each pair are added.
(c), are not equal their sum is undefined.
Similarly, when matrices are equal or of same dimension, their
corresponding terms may be subtracted from each other.
2 Step 2:Add or Subtract
Step two involves adding or subtracting matrix pair values.
When subtracting, each matrix member following the negative
sign is subtracted
from
its predecessor.
−1 2 1 3 −1 + 1 2 + 3 0 5
(a) + = =
0 1 −1 2 0 + −1 1 + 2 −1 3
0 1 −2 0 0 0 0 + 0 1 + 0 −2 + 0 0 1 −2
(b) + = =
1 2 3 0 0 0 1+0 2+0 3+0 1 2 3
0 1 −2 0 0 0 0 + 0 1 + 0 −2 + 0 0 1 −2
(b) + = =
1 2 3 0 0 0 1+0 2+0 3+0 1 2 3
0 1 −2 0 0 0 0 + 0 1 + 0 −2 + 0 0 1 −2
(b) + = =
1 2 3 0 0 0 1+0 2+0 3+0 1 2 3
−6 0 −3
=
−4 5 1
Matrix Multiplication
Definition
Two matrices A and B are said to be confirmable for product AB if
number of columns in A equals to the number of rows in matrix B.
Let A = (aij )m×n and B = (bij )n×r be two matrices. The product
matrix C = AB, is matrix of order m × r
n
X
where cij = aij bkj = ai1 b1j + ai2 b2j + ...... + ain bnj (3)
k=1
Definition
′
Transpose of m × n matrix A, denoted AT or A , is n × m matrix
with rows and columns of A transposed in AT
Definition
Let A = (aij )n×n be a square matrix of order n, then |A| is called the
determinant of matrix A.
Case 1: Determinant of a 2 × 2 matrix
Let
a11 a12 a a
A= , then|A| = 11 12 = a11 × a22 − a12 × a21
a21 a22 a21 a22
b22 b23 b b b b
|B| = b11 − b12 21 23 + b13 21 22
b32 b33 b31 b33 b31 b32
|B| = b11 (b22 × b33 − (b23 × b32 )) − b12 (b21 × b33 − (b23 × b31 ))
Definition
Let A = (aij )n×n be a square matrix. Then Mij denotes a sub matrix
of A with order (n − 1) × (n − 1) obtained by deleting its i th row and
j th column. The determinant |Mij | is called the minor of the element
aij of A.
Find the minors of the following matrix and use the results to
determine
its cofactors
5 4 2
2 3 1
3 −2 −1
5 2
M32 = Minor of a32 = =5×1−2×2=5−4=1
2 1
5 4
M33 = Minor of a33 = = 5 × 3 − 4 × 2 = 15 − 8 = 7
2 3
Step 2: Determine the cofactors using the results of the minors
c11 = Cofactor of M11 = (−1)1+1 × −1 = −1 × −1 = −1
c12 = Cofactor of M12 = (−1)1+2 × −5 = −1 × −5 = 5
c13 = Cofactor of M13 = (−1)1+3 × −13 = 1 × −13 = −13
c21 = Cofactor of M21 = (−1)2+1 × 0 = −1 × 0 = 0
c22 = Cofactor of M22 = (−1)2+2 × −11 = 1 × −11 = −11
c23 = Cofactor of M23 = (−1)2+3 × −22 = −1 × −22 = 22
Definition
The transpose of the cofactor matrix with element aij of A denoted
by adj(A) is called adjoint of matrix A.
Theorem
For any square matrix A,
A(adjA) = (adjA)A = |A|I where I is the identity matrix of same
order.
0 0 .... 1
= |A|In
where In is unit matrix of order n.
Theorem
If A is a non-singular matrix of order n, then |adjA| = |A|n−1
Proof.
(i) The necessary condition
Let A be a square matrix of order n and B is inverse of it, then
AB = I
Dr Oluwafemi A. George Dr John Ogbemhe (Department
Engineering
of Systems
CalculusEngineering
III (GEG217)
University of Lagos)
November 6, 2023 48 / 68
Inverse of a matrix Cont’d
|AB| = |A||B|
Therefore, |A| = ̸ 0
(ii) The sufficient condition:
If |A| =
̸ 0, then we define the matrix B such that
1
B= (adjA)
|A|
1 1
Then, AB = A (adjA) = A(adjA)
|A| |A|
1
= |A|I = I
|A|
1 1 1
Similarly , BA = (adjA)A = A(adjA) = |A|I = I
|A| |A| |A|
Thus AB = BA = I , and B is inverse of A given by A−1 = |A| 1
(adjA)
Dr Oluwafemi A. George Dr John Ogbemhe (Department
Engineering
of Systems
CalculusEngineering
III (GEG217)
University of Lagos)
November 6, 2023 49 / 68
Inverse of a matrix Cont’d
Proof.
Let B and C be inverses of the matrix A then, AB = BA = I and
AC = CA = I
B(AC ) = BI
BA(C ) = B
C =B
Properties of inverse
(A−1 )−1 = A, i.e., inverse of inverse is original matrix (assuming
A is invertible)
(AB)−1 = B −1 A−1 (assuming A, B are invertible)
(A−T )−1 = (A−1 )−T (assuming A is invertible)
I −1 = I
(αA)−1 = α1 A−1 (assuming A is invertible, α ̸= 0)
If y = Ax, where x ∈ Rn and A is invertible, then
x = A−1 y : A−1 y = A−1 Ax = Ix = x
1 −1
Let A = find A−1
1 2
2 1
Solution A−1 = = 1
|A|
adj(A)
since 1
3
1 2
2 1
|A| = 1 × 2 − (−1 × 1) = 3 and adj(A) =
1 2
Determine whether
the following
transformations are linear or not.
w1 − w2
w1 w 1 w1 + w2
(1) → w1 + w2 (2) →
w2 w2 w2 + 2
2 × w1
Solution 1
T (û + v̂ ) = T (û) + T (v̂ )
Let
x1 y
û = and v̂ = 1
x2 y2
Dr Oluwafemi A. George Dr John Ogbemhe (Department
Engineering
of Systems
CalculusEngineering
III (GEG217)
University of Lagos)
November 6, 2023 54 / 68
Linear transformations Cont’d
Solution 1 Cont’d
x1 y
T (û + v̂ ) = + 1
x2 y2
x1 + y1 − (x2 + y2 )
= x1 + y1 + (x2 + y2 )
2 × (x1 + y1 )
x1 + y1 − x2 − y2
T (û + v̂ ) = x1 + y1 + x2 + y2 = LHS
2x1 + 2y1
x1 y1
T (û) + T (v̂ ) = T +T
x2 y2
T (C û) = CT (û) C ∈ R
x1 Cx1
T (C û) = T C =T
x2 Cx2
Dr Oluwafemi A. George Dr John Ogbemhe (Department
Engineering
of Systems
CalculusEngineering
III (GEG217)
University of Lagos)
November 6, 2023 56 / 68
Linear transformations Cont’d
Solution 1 Cont’d
Cx1 − Cx2
T = Cx1 + Cx2 = LHS
2Cx1
x1 − x2
x
CT (û) = C T 1 = C x1 + x2
x2
2x1
C (x1 − x2 )
= C (x1 + x2 ) = RHS
C × 2x1
Since definitions 5 and 6 are satisfied, this transformation is linear.
Can you try the second example?
Dr Oluwafemi A. George Dr John Ogbemhe (Department
Engineering
of Systems
CalculusEngineering
III (GEG217)
University of Lagos)
November 6, 2023 57 / 68
Computer Graphics:
(3, 1)
(3, −1)
(−1, −4)
(2, −6)
Dr Oluwafemi A. George Dr John Ogbemhe (Department
Engineering
of Systems
CalculusEngineering
III (GEG217)
University of Lagos)
November 6, 2023 59 / 68
Computer Graphics: Cont’d
(2, 6)
(−1, 4)
(−6, −2)
(−1, −3)
(0, 1) (1, 1)
(−1, −1)
(0, 0) (1, 0)
0 0 0 4 4 4 4 8
L = ,L = ,L = ,L =
0 0 2 2 0 0 2 2
(0, 0) (4, 0)
Determine
whether
or not this transformation is linear.
w1 w1 + w2
→
w2 w2 + 2