Lecture 1 Matrices

Definitions.
matrix
def
= rectangular array of numbers or symbols
mn matrix
def
m rows and n columns
a
ij
= (i, j) entry
def
= number in the ith row, jth column.
Example. A =
_
_
2 1 7 8
0 2 5 1
1 1 3 0
_
_
A is 3 4
a
23
= 5
Write A = (a
ij
) =
_
_
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
.
.
.
.
.
.
.
.
.
.
.
.
a
m1
a
m2
a
mn
_
_
_
_
More definitions. square matrix
def
A is n n
the diagonal of a square matrix
def
= a
11
, a
22
, . . . , a
nn
diagonal matrix
def
a
ij
= 0 if i = j
Operation definitions. For A =
_
a
ij
_
, B =
_
b
ij
_
,
equality A = B
def
a
ij
= b
ij
1 i m, 1 j n
addition A+B
def
=
_
a
ij
+ b
ij
_
1 i m, 1 j n
scalar multiplication A
def
=
_
a
ij
_
R
1 1
Examples.
_
2 1 3
1 5 2
_
=
_
2 1 3
1 a 2
_

_
2 1 3
1 5 2
_
+
_
0 1 2
2 1 3
_
=
3
_
2 1 3
1 5 2
_
=
matrix multiplication A is mn B is n p
AB
def
= C =
_
c
ij
_
c
ij
= a
i1
b
1j
+ a
i2
b
2j
+ + a
in
b
nj
Note. C is mp.
AB number of columns of A = number of rows of B.
Example. AB =
_
_
_
1 1 1
2 0 1
1 2 4
2 2 1
_
_
_
_
_
2 0
1 1
1 3
_
_
=
Note. In general AB = BA
1) Not dened: BA in the previous example.
2) Dened, but dierent sizes:
A =
_
2 1 3
1 2 1
_
B =
_
_
3 1
1 0
1 1
_
_
_
AB is 2 2
BA is 3 3
3) Dened, same size, still dierent: try 2 2 matrices.
Question. AB = AC. Is B = C?
1 2
Definitions.
zero matrix, 0
def
= mn matrix with all entries zero
identity matrix, I
def
= diagonal matrix with a
ii
= 1
Matrix Rules of Algebra
A+B = B+A addition is commutative
(A+B) +C = A+ (B+C)
(AB)C = A(BC)
(AB) = (A)(B) = A(B)
associative laws
A(B+C) = AB+AC
(A+B)C = AC+BC
(A+B) = A+ B
distributive laws
A+0 = A
AA = 0
0A = A0 = 0
additive identity
AI = IA = A multiplicative identity
Proofs from the denitions.
Definition. A n n
A is invertible
def
there exists A
1
, AA
1
= A
1
A = I
Theorem. A
1
is unique.
Proof.
Question. AB = AC. A
1
exists. Is B = C?
1 3
More Definitions. A n n, r N, A
r
= AA. . . A
. .
r times
A =
_
a
ij
_
, A mn, transpose of A = A
T
def
=
_
a
ji
_
Note. ith row of A
T
= ith column of A. A
T
is n m.
A is symmetric
def
A = A
T
Properties of Inverse If A
1
, B
1
exist
(A
1
)
1
= A (A)
1
=
1

A
1
(AB)
1
= B
1
A
1
Properties of Exponents
(A
r
)
1
= (A
1
)
r
A
r
A
s
= A
r+s
(A
r
)
s
= A
rs
Properties of Transpose
(A
T
)
T
= A (A+B)
T
= A
T
+B
T
(AB)
T
= B
T
A
T
(A)
T
= A
T
(A
T
)
1
= (A
1
)
T
Proofs by the denitions.
Definition
An n 1 matrix
def
= a vector,
or a column vector,
v
i
, w
i
R
v =
_
_
_
_
v
1
v
2
.
.
.
v
n
_
_
_
_
w =
_
_
_
_
w
1
w
2
.
.
.
w
n
_
_
_
_
For a xed positive integer n, the set of all such vectors together
with the operations of addition and scalar multiplication is R
n
,
Euclidean n-space.
The scalar product of two vectors (inner or dot product)
v, w
def
= v
1
w
1
+ v
2
w
2
+ + v
n
w
n
= v
T
w
Note. v
T
w = w
T
v is a 1 1 matrix, that is, a scalar.
1 4