Lecture 02
Lecture 02
Lecture 02
06 Jan 2020
• Summary of Lecture 01
• Matrix multiplication revisited
Rm Rm b
Example
1 0 0 1 0 1 0 0
A := and B := , then AB := , while BA :=
0 0 0 0 0 0 0 0
Moreover, AB = B, but A 6= I .
Proposition
Let A := [aij ] ∈ Mm,n , and let e1 , . . . , en be the basic column vectors in
Mn,1 . Then for k = 1, . . . , n,
a1k
..
.
A ek = ajk , which is the kth column of A.
..
.
amk
Corollary
A = B if and only if Aek = Bek for each k = 1, . . . , n.
This is called the outer product of the column vector c and the row
vector d.
Proposition
For the matrices A, B, C (of appropriate order so that the sums &
products are well-defined) and α ∈ R,
(1) Distributive law: (A + B)C = AC + BC , C (A + B) = CA + CB and
(2) (αA)B = αAB = A(αB).
Proof: Exercise
Matrix multiplication also satisfies the associative law:
Proposition
Let m, n, p, q ∈ N, and A ∈ Mm,n , B ∈ Mn,p and C ∈ Mp,q . Then
A(BC ) = (AB)C (which we shall write as ABC ).
for i = 1, . . . , m; j = 1, . . . , p.
Suppose B t At := [dij ]. Then
n
X n
X
0 0
dij = bik akj = bki ajk = cij0
k=1 k=1
Definition
Let x1 , . . . , xk be vectors in Rn and α1 , . . . , αm ∈ R. Then
α1 x1 + · · · + αk xk
Example
T
For k = 1, . . . , n, let ek := 0 · · · 1 · · · 0 ∈ Mn×1 be the
column vector, where the kth entry is 1 and all other entries are 0.
t
If b = b1 · · · bk · · · bn is any column vector of length n, then it
follows that b = b1 e1 + · · · + bk ek + · · · + bn en , which is a linear
combination of e1 , . . . , en . The vectors e1 , . . . , en are known as the basic
column vectors.
Proof: (1) Let AB = [cij ] and Rk be the k-th row of B. Then i-th row of
AB is
ci1 ci2 . . . cip
Pn Pn Pn
= k=1 aik bk1 k=1 aik bk2 . . . k=1 aik bkp
= ai1 b11 b12 . . . b1p + ai2 b21 b22 . . . b2p + · · · +
ain bn1 bn2 . . . bnp
= ai1 R1 + ai2 R2 + · · · + ain Rn
Example
1 6 0 2
2 1 −1
Let A = and B = 2 −1 1 −2. Then
0 3 1
2 0 −1 1
2 11 2 1
AB = .
8 −3 2 −5
We have
2 11 2 1 = 2 1 6 0 2 + 1 2 −1 1 −2
−1 2 0 −1 1 ,
11 2 1 −1
= 6 −1 +0 , etc.
−3 0 3 1
.
Definition
Let A be an n × n matrix. If there is an n × n matrix B such that
AB = In = BA then we say A is invertible and B is the inverse of A. The
inverse of A is denoted by A−1 .
Proposition
For any invertible square matrix A, (At )−1 = (A−1 )t .