Matrix representation of a linear map

As before, let ei = (0, . . . , 0, 1, 0, . . . , 0)T , with 1 in the

i th place and 0 elsewhere , be standard basis vectors.
Given linear map f : Rn → Rm we get n column
vectors (of size m) viz., f (e1 ), . . . , f (en ). Place them
side by side. , Thus if f (ej ) = (f1j , f2j , . . . , fmj )T , then
we obtain an array of the form
 
f11 f12 . . . f1n
 f21 f22 . . . f2n 
Mf =  .. ..  .
 
 . . 
fm1 fm2 . . . fmn

Such an array is called a matrix with m rows and n

columns or a matrix of size m × n. In short, we write
Mf = (fij ). We call Mf to be the matrix associated
with the linear map f : Rn → Rm .
12/45
If we let Matm×n (R), or simply, Mm,n , denote the set of
all m × n matrices with entries in R, then we obtain:
M : L(n, m) → Mm,n
f 7−→ Mf
The map M is a one-to-one correspondence (i.e.,
one-one and onto map) between the set of all linear
maps from Rn to Rm and the set of all m × n matrices
with entries in R. Note: Two matrices are equal if
their sizes are the same and corresponding entries
are the same. M is one-one (or injective), means
Mf = Mg for some f , g ∈ L(n, m) ⇒ f = g,
whereas M is onto (or surjective) means that
A ∈ Matm×n (R) ⇒ A = Mf for some f ∈ L(n, m).

13/45
If we let Matm×n (R), or simply, Mm,n , denote the set of
all m × n matrices with entries in R, then we obtain:
M : L(n, m) → Mm,n
f 7−→ Mf
The map M is a one-to-one correspondence (i.e.,
one-one and onto map) between the set of all linear
maps from Rn to Rm and the set of all m × n matrices
with entries in R. Note: Two matrices are equal if
their sizes are the same and corresponding entries
are the same. M is one-one (or injective), means
Mf = Mg for some f , g ∈ L(n, m) ⇒ f = g,
whereas M is onto (or surjective) means that
A ∈ Matm×n (R) ⇒ A = Mf for some f ∈ L(n, m).

13/45
If we let Matm×n (R), or simply, Mm,n , denote the set of
all m × n matrices with entries in R, then we obtain:
M : L(n, m) → Mm,n
f 7−→ Mf
The map M is a one-to-one correspondence (i.e.,
one-one and onto map) between the set of all linear
maps from Rn to Rm and the set of all m × n matrices
with entries in R. Note: Two matrices are equal if
their sizes are the same and corresponding entries
are the same. M is one-one (or injective), means
Mf = Mg for some f , g ∈ L(n, m) ⇒ f = g,
whereas M is onto (or surjective) means that
A ∈ Matm×n (R) ⇒ A = Mf for some f ∈ L(n, m).

13/45
If we let Matm×n (R), or simply, Mm,n , denote the set of
all m × n matrices with entries in R, then we obtain:
M : L(n, m) → Mm,n
f 7−→ Mf
The map M is a one-to-one correspondence (i.e.,
one-one and onto map) between the set of all linear
maps from Rn to Rm and the set of all m × n matrices
with entries in R. Note: Two matrices are equal if
their sizes are the same and corresponding entries
are the same. M is one-one (or injective), means
Mf = Mg for some f , g ∈ L(n, m) ⇒ f = g,
whereas M is onto (or surjective) means that
A ∈ Matm×n (R) ⇒ A = Mf for some f ∈ L(n, m).

13/45
If we let Matm×n (R), or simply, Mm,n , denote the set of
all m × n matrices with entries in R, then we obtain:
M : L(n, m) → Mm,n
f 7−→ Mf
The map M is a one-to-one correspondence (i.e.,
one-one and onto map) between the set of all linear
maps from Rn to Rm and the set of all m × n matrices
with entries in R. Note: Two matrices are equal if
their sizes are the same and corresponding entries
are the same. M is one-one (or injective), means
Mf = Mg for some f , g ∈ L(n, m) ⇒ f = g,
whereas M is onto (or surjective) means that
A ∈ Matm×n (R) ⇒ A = Mf for some f ∈ L(n, m).
M preserves addition and scalar multiplication, i.e.,
Mf +g = Mf +Mg and Mαf = αMf , ∀f , g ∈ L(n, m), α ∈ R.
13/45
Examples:

14/45
Examples:
1. For the identity map id : Rn → Rn ,
 
1 0 ... 0
 0 1 ... 0 
Mid = I = In :=  ..
 
.. 
 . . 
0 0 ... 1

14/45
Examples:
1. For the identity map id : Rn → Rn ,
 
1 0 ... 0
 0 1 ... 0 
Mid = I = In :=  .. ..  = (δij )
 
 . . 
0 0 ... 1

wehre δij is the Kronecker delta defined by

δij = 1 if i = j and δij = 0, if i 6= j.

14/45
Examples:
1. For the identity map id : Rn → Rn ,
 
1 0 ... 0
 0 1 ... 0 
Mid = I = In :=  .. ..  = (δij )
 
 . . 
0 0 ... 1

wehre δij is the Kronecker delta defined by

δij = 1 if i = j and δij = 0, if i 6= j.
2. The matrix of the linear map T : R2 → R2 which
interchanges coordinates, is

14/45
Examples:
1. For the identity map id : Rn → Rn ,
 
1 0 ... 0
 0 1 ... 0 
Mid = I = In :=  .. ..  = (δij )
 
 . . 
0 0 ... 1

wehre δij is the Kronecker delta defined by

δij = 1 if i = j and δij = 0, if i 6= j.
2. The matrix of the linear map T : R2 → 2
 R which

0 1
interchanges coordinates, is MT = .
1 0

14/45
Examples:
1. For the identity map id : Rn → Rn ,
 
1 0 ... 0
 0 1 ... 0 
Mid = I = In :=  .. ..  = (δij )
 
 . . 
0 0 ... 1

wehre δij is the Kronecker delta defined by

δij = 1 if i = j and δij = 0, if i 6= j.
2. The matrix of the linear map T : R2 → 2
 R which

0 1
interchanges coordinates, is MT = .
1 0
3. For the linear map µα : Rn → Rn corresponding to
multiplication by a fixed scalar α, the associated
matrix is
14/45
Examples:
1. For the identity map id : Rn → Rn ,
 
1 0 ... 0
 0 1 ... 0 
Mid = I = In :=  .. ..  = (δij )
 
 . . 
0 0 ... 1

wehre δij is the Kronecker delta defined by

δij = 1 if i = j and δij = 0, if i 6= j.
2. The matrix of the linear map T : R2 → 2
 R which
0 1
interchanges coordinates, is MT = .
1 0
3. For the linear map µα : Rn → Rn corresponding to
multiplication by a fixed scalar α, the associated
matrix is the scalar matrix diag(α, . . . , α) := (αδij )
14/45
4. Rotation of the plane by an angle θ defines a linear
map Rθ : R2 → R2 (Linearity of Rθ can be shown by
the law of congruent triangles or by finding a formula
for Rθ (x, y ) using polar coordinates and trigonometric
identities). The matrix of Rθ is about the
 
cos θ − sin θ
MRθ =
sin θ cos θ

15/45
4. Rotation of the plane by an angle θ defines a linear
map Rθ : R2 → R2 (Linearity of Rθ can be shown by
the law of congruent triangles or by finding a formula
for Rθ (x, y ) using polar coordinates and trigonometric
identities). The matrix of Rθ is about the
 
cos θ − sin θ
MRθ =
sin θ cos θ

5. The inclusion map R2 → R3 that sends (x, y ) ∈ R2 to

(x, y , 0) ∈ R3 is clearly a linear map and its matrix is

15/45
4. Rotation of the plane by an angle θ defines a linear
map Rθ : R2 → R2 (Linearity of Rθ can be shown by
the law of congruent triangles or by finding a formula
for Rθ (x, y ) using polar coordinates and trigonometric
identities). The matrix of Rθ is about the
 
cos θ − sin θ
MRθ =
sin θ cos θ

5. The inclusion map R2 → R3 that sends (x, y ) ∈ R2 to

(x, y , 0) ∈ R3 is clearly a linear map and its matrix is
 
1 0
 0 1 
0 0
In a similar way, we can write down the (n + t) × n
matrix corresponding to the inclusion map Rn → Rn+t .
15/45
Operations on matrices
Set of all matrices of size m × n is denoted by Mm,n

16/45
Operations on matrices
Set of all matrices of size m × n is denoted by Mm,n
As before, for A = (aij ), B = (bij ) ∈ Mm,n and α ∈ R,
A + B := (aij + bij ); αA := (αaij )
Matrix addition and scalar multiplicaion satisfies the
“usual properties”. The zero element is the zero
matrix 0, all of whose entries are 0 and the negative
of a matrix A = (aij ) is the matrix −A = (−aij ).

16/45
Operations on matrices
Set of all matrices of size m × n is denoted by Mm,n
As before, for A = (aij ), B = (bij ) ∈ Mm,n and α ∈ R,
A + B := (aij + bij ); αA := (αaij )
Matrix addition and scalar multiplicaion satisfies the
“usual properties”. The zero element is the zero
matrix 0, all of whose entries are 0 and the negative
of a matrix A = (aij ) is the matrix −A = (−aij ).

16/45
Operations on matrices
Set of all matrices of size m × n is denoted by Mm,n
As before, for A = (aij ), B = (bij ) ∈ Mm,n and α ∈ R,
A + B := (aij + bij ); αA := (αaij )
Matrix addition and scalar multiplicaion satisfies the
“usual properties”. The zero element is the zero
matrix 0, all of whose entries are 0 and the negative
of a matrix A = (aij ) is the matrix −A = (−aij ).
‘ Transpose’ operation introduced earlier can be
extended to all matrices
AT := (bij ) ∈ Mn,m where bij := aji
Note that (αA + βB)T = αAT + βB T for any α, β ∈ R.

16/45
Operations on matrices
Set of all matrices of size m × n is denoted by Mm,n
As before, for A = (aij ), B = (bij ) ∈ Mm,n and α ∈ R,
A + B := (aij + bij ); αA := (αaij )
Matrix addition and scalar multiplicaion satisfies the
“usual properties”. The zero element is the zero
matrix 0, all of whose entries are 0 and the negative
of a matrix A = (aij ) is the matrix −A = (−aij ).
‘ Transpose’ operation introduced earlier can be
extended to all matrices
AT := (bij ) ∈ Mn,m where bij := aji
Note that (αA + βB)T = αAT + βB T for any α, β ∈ R.

16/45
Operations on matrices
Set of all matrices of size m × n is denoted by Mm,n
As before, for A = (aij ), B = (bij ) ∈ Mm,n and α ∈ R,
A + B := (aij + bij ); αA := (αaij )
Matrix addition and scalar multiplicaion satisfies the
“usual properties”. The zero element is the zero
matrix 0, all of whose entries are 0 and the negative
of a matrix A = (aij ) is the matrix −A = (−aij ).
‘ Transpose’ operation introduced earlier can be
extended to all matrices
AT := (bij ) ∈ Mn,m where bij := aji
Note that (αA + βB)T = αAT + βB T for any α, β ∈ R.
Products of linear maps is not linear (in fact not even
defined), in general. But composites of linear maps
are linear. How does this relate to matrices?
16/45
Composition of Linear Maps and Matrix Multiplication

Question: Let f : Rn → Rm , g : Rp → Rn be linear maps. If

A := Mf and B := Mg then Mf ◦g =?

17/45
Composition of Linear Maps and Matrix Multiplication

Question: Let f : Rn → Rm , g : Rp → Rn be linear maps. If

A := Mf and B := Mg then Mf ◦g =?
f ◦ g is a map of Rp to Rm . For 1 ≤ j ≤ p,
n
!
X
(f ◦ g)(ej ) = f (g(ej )) = f bkj ek
k =1
n n m
!
X X X
= bkj f (ek ) = bkj aik ei
k =1 k =1 i=1
m n
!
X X
= aik bkj ei
i=1 k =1

Thus Mf ◦g = C, where C = P(c ij ) is the m × p matrix

th n
whose (i, j) entry is cij = k =1 aik bkj . We call C the
product of the m × n matrix A and the n × p matrix B,
and write C = AB.
17/45
Basic Properties of Matrix Multiplication
The following properties are readily derived from the
corresponding properties of linear maps and the one-to
-one correspondence between linear maps and matrices.
Assume that the matrices A, B, C are of appropriate sizes
so that all relevant products are defined.
1. Associativity: A(BC) = (AB)C.

18/45
Basic Properties of Matrix Multiplication
The following properties are readily derived from the
corresponding properties of linear maps and the one-to
-one correspondence between linear maps and matrices.
Assume that the matrices A, B, C are of appropriate sizes
so that all relevant products are defined.
1. Associativity: A(BC) = (AB)C.
2. Right and Left Distributivity:
A(B + C) = AB + AC, (B + C)A = BA + CA

18/45
Basic Properties of Matrix Multiplication
The following properties are readily derived from the
corresponding properties of linear maps and the one-to
-one correspondence between linear maps and matrices.
Assume that the matrices A, B, C are of appropriate sizes
so that all relevant products are defined.
1. Associativity: A(BC) = (AB)C.
2. Right and Left Distributivity:
A(B + C) = AB + AC, (B + C)A = BA + CA
3. Multiplicative identity: For any A ∈ Mm,n ,
AIn = A and Im A = A
In particular, if A is a n × n matrix, then AIn = A = In A.

Remark: Matrix multiplication is not commutative in

general, i.e., AB need not equal BA even when both the
products are defined. Exercise: Find examples!
18/45
Basic Properties of Matrix Multiplication
The following properties are readily derived from the
corresponding properties of linear maps and the one-to
-one correspondence between linear maps and matrices.
Assume that the matrices A, B, C are of appropriate sizes
so that all relevant products are defined.
1. Associativity: A(BC) = (AB)C.
2. Right and Left Distributivity:
A(B + C) = AB + AC, (B + C)A = BA + CA
3. Multiplicative identity: For any A ∈ Mm,n ,
AIn = A and Im A = A
In particular, if A is a n × n matrix, then AIn = A = In A.
4. Transpose of Product: (AB)T = B T AT .
Remark: Matrix multiplication is not commutative in
general, i.e., AB need not equal BA even when both the
products are defined. Exercise: Find examples!
18/45
Invertible Maps
Recall the set-theoretic definition of invertible functions.
Let X , Y be sets. A function f : X → Y is said to be
invertible if there exists g : Y → X satisfying
g ◦ f = idX and f ◦ g = idY .
In this case the function g is unique (check!) and it is
called the inverse of f and denoted by f −1 .

19/45
Invertible Maps
Recall the set-theoretic definition of invertible functions.
Let X , Y be sets. A function f : X → Y is said to be
invertible if there exists g : Y → X satisfying
g ◦ f = idX and f ◦ g = idY .
In this case the function g is unique (check!) and it is
called the inverse of f and denoted by f −1 .
For any function f : X → Y ,
f is invertible ⇐⇒ f is one-one and onto.
If f : Rn → Rn is an invertible linear map, then f −1 is
linear. [To see this, let y1 , y2 ∈ Rn . Then there are
x1 , x2 ∈ Rn such that f (xi ) = yi , i.e., xi = f −1 (yi ) for
i = 1, 2. Thus f −1 (y1 + y2 ) = f −1 (f (x1 ) + f (x2 )) and
using the linearity of f , we find that this is equal to
f −1 (f (x1 + x2 )) = x1 + x2 = f −1 (y1 ) + f −1 (y2 ).
Similarly f −1 preserves scalar multiplication. 19/45