Professional Documents
Culture Documents
Uniqueness of inverse.
elementary row
A b C d
operations
one elementary
A b C d
row operation
C d E A b C d EA Eb C EA
and d Eb
Let u be a solution to Ax b
Au b EAu Eb Cu d
u is a solution to Cx d
one elementary
A b C d
row operation
We want to show that Ax b and Cx d have the same
solution set.
There exists an elementary matrix E such that
C d E A b C d EA Eb C EA
and d Eb
Let v be a solution to Cx d
E 1C A
Cv d E 1Cv E 1d Av b
and E 1d b
v is a solution to Ax b
If A is a square matrix, then the following statements
are equivalent.
(If one of them is true, so are the rest. If one of
them is false, so are the rest.)
1) A is invertible.
Ek Ek1... E1 A
Ek Ek 1... E1 A I n
Ek Ek 1... E1 A I n
Question:
What happens if the matrix A is not invertible?
( Ek Ek1... E1) A I n
Ek Ek 1... E1 A Ek Ek 1... E1 I n when A is singular
I n Ek Ek1... E1
In A1 R Ek Ek1... E1
Question:
What happens if the matrix A is not invertible?
Answer:
If A is singular, then its reduced row-echelon form
will not be the identity matrix.
Determine if the following matrix is invertible
and if so, find its inverse.
2 1 0
A 1 2 0
3 1 1
Determine if the following matrix is invertible
and if so, find its inverse.
1 1 1 1
1 2 6 3
A
1 2 6 4
1 1 1 0
1 1 1 1 1 0 0 0
1 2 6 3 0 1 0 0
1 2 6 4 0 0 1 0
1
1 1 0 0 0 0 1
R2 R1 1 1 1 1 1 0 0 0
0 3 7 4 1 1 0 0
R3 R1
0 3 7 5 1 0 1 0
R4 R1 0
0 0 1 1 0 0 1
1 1 1 1 1 0 0 0
0 3 7 4 1 1 0 0
0 3 7 5 1 0 1 0
0 1 1 1
0 0 0 0
1 1 1 1 1 0 0 0
R3 R2 0 3 7 4 1 1 0 0
0 0 0 1 0 1 1 0
0 1 1 1
0 0 0 0
1 1 1 1 1 0 0 0
0 row-echelon form
3 7 4 1 1 0 0
has only 3 leading
0 0 0 1 0 1 1 0
0 entries
0 0 1 1 0 0 1
1 1 1 1 1 0 0 0
0 0
R4 R3
3 7 4 1 1 0
0 0 0 1 0 1 1 0
0 1 1 1 1
0 0 0
a b
If A is invertible, then ad bc 0.
c d
a b
If A is invertible, then ad bc 0.
c d
Case 1: If a 0, and c 0.
a b 0 b This matrix will not have I 2 as
A its reduced row-echelon form
c d 0 d
and so is not invertible.
a b R2 ac R1 a b a b
A 0 d cb 0 ad bc
c d a a
0 b R2 R1 c d
A 0 b
c d
So if A is invertible, we must have two leading entries
and thus b 0.
For this case, this implies ad bc 0.
a b
If ad bc 0, then A is invertible
c d
b
1 d
ad bc ad bc
and A c a
.
ad bc ad bc
a b
If A is invertible, then ad bc 0.
c d
a b
A is invertible if and only if ad bc 0.
c d
Let A and B be square matrices of the same size.
If AB I , then
BA I A B 1 B A1
Proof:
Consider the homogeneous linear system Bx 0.
A1 (B 1)1 B
Finally,
BA A1 A I
If A is a square matrix such that
A2 6 A 8 I 0,
A2 6 A 8 I 0 A2 6 A 8 I
something
A( A 6) 8 I
wrong??
A( A 6 I ) 8I
A1 [ 18 ( A 6 I )] A[ 18 ( A 6 I )] I
If A and B are both square matrices of the same
size and B is singular, then
1 0 0 0
1 4 2 2 0 1 0 0
AE1 0 3 4 3 E1 (2 R3 )
0 0 2 0
1 1 0 0 0
0 0 1
1 4 1 2
A 0 3 2 3
1 1 0 0
interchange
columns 1 and 4
0 0 0 1
2 4 1 1 0 1 0 0
AE2 3 3 2 0 E2 (R1 R4 )
0 0 1 0
0 1 0 1 1
0 0 0
1 4 1 2
A 0 3 2 3
1 1 0 0
column 3 minus 2
times column 2
1 0 0 0
1 4 9 2 0 1 2 0
AE3 0 3 8 3 E3 (R2 2 R3 )
0 0 1 0
1 1 2 0 0
0 0 1
Recall that we have have shown
a b
A is invertible if and only if ad bc 0.
c d
The quantity ad bc is known as the determinant
a b
of .
c d
Let A (aij ) be a square matrix of order n.
Let M ij be a square matrix of order n 1 obtained
by removing the ith row and jth column of A.
2 1 3 0 1 3 1
4 1 3 1 M11 4 3 1
A
1 4 3 1 0 1 1
0 0 1 1
2 3 0
M 32 4 3 1
0 1 1
Let A (aij ) be a square matrix of order n.
Let M ij be a square matrix of order n 1 obtained
by removing the ith row and jth column of A.
The determinant of A is defined as
a11 if n 1
det(A)
a11 A11 a12 A12 ... a1n A1n if n 2
a11 if n 1
det(A)
a11 A11 a12 A12 ... a1n A1n if n 2
By cofactor expansion,
1 3 4
11
4 1 2 1
2 4 1 (1) (1) (3) (1)1 2
2 9 4 9
4 2 9
13
2 4
(4) (1)
4 2
By cofactor expansion,
1 3 4
11
4 1 2 1
2 4 1 (1) (1) (3) (1)1 2
2 9 4 9
4 2 9
13
2 4
(4) (1)
4 2
0.
What is the determinant of the following matrix?
a b c
Ad e f
g h i
Answer:
a b c a b
d e f d e
g h i g h
Answer:
No 'special formula'! Use cofactor expansion!
æ a a12 ... a1n ö
ç ÷
11
a11 if n 1
det(A)
a11 A11 a12 A12 ... a1n A1n if n 2
1 3 4
21
3 4 2 2
1 4
2 4 1 2 (1) 4 (1)
2 9 4 9
4 2 9
2 3
1 3
1 (1)
4 2
1 3 4
21
3 4 2 2
1 4
2 4 1 2 (1) 4 (1)
2 9 4 9
4 2 9
2 3
1 3
1 (1)
4 2
38 28 10
0
Try cofactor expansion along another row or
column!
If A is a triangular matrix, then det( A) is the
product of its diagonal entries.
1 2
1
A 3
3
A 1
0
0
2
0
1
4
3
det(A) 0 det(A) 2 3 12 1 4 12
Proof is omitted.
If A is a square matrix, then
det( A) det( AT ).
Proof is omitted.
1 3 4 1 2 4
2 4 1 0 3 4 2 0
4 2 9 4 1 9
The determinant of a square matrix with two
identical rows is 0.
The determinant of a square matrix with two
identical columns is 0.
1 0 1 1
1 0 1
2 3 2 3
1 0 1 0 0
4 1 4 3
1 1 1
1 2 1 0
Proof is omitted.
The three theorems we have stated without
proofs can all be proven using a technique known
as Mathematical Induction.