Beruflich Dokumente
Kultur Dokumente
ab = 1
We say b is the inverse of a (provided it exists). We can even solve for b:
b = 1/a
So we can write the inverse equation as:
a * 1/a = aa-1= 1
AB = I
BA = I
Usually, we write A-1 instead of B, so that the matrix inverse equations look like:
AA-1 = I
A-1A = I
If the inverse does not exist, we say A is singular (or non-invertible). If the inverse does exist, then we say A is non-singular (or invertible).
2 1 1
3 2 2
A=
1 0
1 1 0
2 1 1
3 2 2
1 0 0
0 1 0
0 0 1
STEP #1: Adjoin an identity matrix of the same size to the right hand side of A. We call this matrix [A|I].
STEP #2: Use elementary row operations to reduce the lefthand side of [A|I] to RREF.
1 1 0
2 1 1
3 2 2
1 0 0
0 1 0
0 0 1
R2 R2 R1
1 0 0
2 -1 1
3 -1 2
1 -1 0
0 1 0
0 0 1
R2 (-1)R2
1 0 0
2 1 1
3 1 2
1 1 0
0 -1 0
0 0 1
R3 R3 R2
1 0 0
2 1 0
3 1 1
1 1 -1
0 -1 1
0 0 1
R1
R1 2R2
1 0 0
0 1 0
1 1 1
-1 1 -1
2 -1 1
0 0 1
R1
R1 R3
1 0 0
0 1 0
0 1 1
0 1 -1
1 -1 1
-1 0 1
R2 R2 R3
1 0 0
0 1 0
0 0 1
0 2 -1
1 -2 1
-1 -1 1
RREF
A-1
STEP #3: If the RREF of A is an identity matrix, then A has an inverse and the inverse is the matrix on the right hand side!
The only other thing that may happen, is you obtain a full row of zeros along the way. If this happens, then A is not invertible (or A is singular).
1 0 0
0 1 0
1 0 0
0 2 -1
1 -2 1
-1 -1 1
A-1 does not exist (even though there is a matrix over here)
1
A=
2 4
1 2 2
A=
3 0 5 0 -7 2 0 5
M11 = det
-7 2
= 0 (-35) = 35
The minor of the (1,1) entry.
1 2 2
A=
3 0 5 0 -7 2 1 2
M23 =
det
-7
= -7 0 = -7
The minor of the (2,3) entry.
1 2 2
A=
3 0 5 0 -7 2 1 2
M32 = det
= 5 6 = -1
The minor of the (3,2) entry.
Aij = (-1)i+jdet(Mij)
Ex. 6 Cofactors of a 3x3 Matrix
M23 =
1 0
2 -7
1 2 2
A=
3 0 5
0 -7 2
A23 = (-1)2+3det(M23) = (-1)5(-7-0) = (-1)(-7) =7
Aij = (-1)i+jdet(Mij)
Ex. 6 Cofactors of a 3x3 Matrix
M11 =
1 2 2
A=
-7 2
3 0 5
0 -7 2
A11 = (-1)1+1det(M11) = (-1)2(0+35) = 35
A11 A12
cofmat(A) =
A1n A2n
A21 A22
Ann
An1 An2
1
B=
2 4
Since there isnt a matrix left over when we cross out the column and row, we just write down the number left over.
cofmat(B) =
(-1)2(4)
=
1
B=
2 4
cofmat(B) =
(-1)2(4) (-1)3(3)
=
1
B=
2 4
cofmat(B) =
(-1)2(4) (-1)3(3)
=
(-1)3(2)
1
B=
2 4
cofmat(B) =
(-1)2(4) (-1)3(3)
=
(-1)3(2) (-1)4(1)
1
B=
2 4
cofmat(B) =
4
=
-3
-2 1
adj(A) = cofmat(A)T
So, if we know the adjoint of a square matrix A, we just scalar multiply by one over the determinant to get the inverse. Right now, we can only use this for 2x2 matrices (we will learn how to find determinants of bigger matrices later).
a
A=
b d
1
-b
A-1 = ad-bc
One over the determinant
-c a
Adjoint of A
Suppose that the industrial process of a company can be modeled by the matrix equation Ax=b. The input vector x represents the amounts of materials that are entered into the industrial process and the output vector b represents the amounts of materials obtained after the process is complete. If the company would like the output of three materials to be 15, 10 and 5; how much of the materials are required as input into the process?
1 2 3
A=
1 1 2 0 1 2
0 1 -1
A-1 = 2
-2 -1
-1 1 1
We can use information from the question to write out the output vector b.
15
b=
10
x y z
=
0 1 -1 15 2 -2 -1 10 -1 1 1 5
So the company would require 5 units of the first, 5 units of the second, and 0 units of the third input materials.
5
=
5 0
ELEMENTARY MATRICES
A square matrix E is called an elementary matrix if it can be obtained from the identity matrix by a single elementary row operation. TYPE I multiplying a row by a non-zero number
1 0 0
0 1 0
0 0 1
R3 2 R3
1 0 0
0 1 0 E1
0 0 2
ELEMENTARY MATRICES
A square matrix E is called an elementary matrix if it can be obtained from the identity matrix by a single elementary row operation. TYPE II adding a multiple of one row to another
1 0 0
0 1 0
0 0 1
R1 R1 3R3
1 0 0
0 1 0 E2
-3 0 1
ELEMENTARY MATRICES
A square matrix E is called an elementary matrix if it can be obtained from the identity matrix by a single elementary row operation. TYPE III switching two rows (called a permutation)
1 0 0
0 1 0
0 0 1
R2 R3
1 0 0
0 0 1 E3
0 1 0
ELEMENTARY MATRICES
ELEMENTARY MATRICES
Thm. 12 Every elementary matrix is invertible. The inverse of an elementary matrix is an elementary matrix of the same type. Proof not required Appendix B: If and Only If Proofs done on overhead
Thm. 13 A square matrix A is invertible if and only if it is the product of elementary matrices.
Proof done on overhead Note: we can generalize Thm. 11 so that any square matrix A can be written as a product of elementary matrices and an upper triangular matrix. (see textbook pg. 133) This is important since A need not be invertible to do so!