domain range

A
A
-1

Pamela Leutwyler
|
|
|
.
|

\
|
=
|
|
|
.
|

\
|
|
|
|
.
|

\
|
z
y
x
z
y
x
1 0 0
0 1 0
0 0 1
A Square matrix with 1s on the diagonal and 0s elsewhere
Is called an IDENTITY MATRIX.
I
For every vector v, I v = v
A square matrix A has an inverse if there is a matrix A
-1
such that:


AA
-1
= I
|
|
.
|

\
|
=
|
|
.
|

\
|

|
|
.
|

\
|
1 0
0 1
3 2
7 5
5 2
7 3
: eg
Only one to one mappings can be inverted:
v
v
R
u
u
v
R
Is the counterclockwise
Rotation of through
degrees.


v
v
v
R If you know the value of
You can find because
Rotation is 1 1
(invertible)
v
P
Is the projection of
onto


w
v
w
v
Only one to one mappings can be inverted:
v
v
R
u
u
v
R
Is the counterclockwise
Rotation of through
degrees.


v
v
v
R If you know the value of
You can find because
Rotation is 1 1
(invertible)
v
P
Is the projection of
onto


w
v
w
v
P is NOT 1-1.

Given P v ,
v could be any one of many
vectors
v
v
v
P is NOT
invertible
Now we will develop an algorithm

to find the inverse for a matrix

that represents an invertible mapping.
|
|
|
.
|

\
|
5 3 2
4 3 2
4 4 3
A
|
|
|
.
|

\
|
j f c
h e b
g d a
A
-1

=
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
I
|
|
|
.
|

\
|
5 3 2
4 3 2
4 4 3
=
|
|
|
.
|

\
|
c
b
a
|
|
|
.
|

\
|
0
0
1
|
|
|
.
|

\
|
5 3 2
4 3 2
4 4 3
=
|
|
|
.
|

\
|
f
e
d
|
|
|
.
|

\
|
0
1
0
|
|
|
.
|

\
|
5 3 2
4 3 2
4 4 3
=
|
|
|
.
|

\
|
j
h
g
|
|
|
.
|

\
|
1
0
0
To solve for a, b, c,
reduce:
To solve for d, e, f,
reduce:
To solve for g, h, j,
reduce:
|
|
|
.
|

\
|
0
0
1
5 3 2
4 3 2
4 4 3
|
|
|
.
|

\
|
0
1
0
5 3 2
4 3 2
4 4 3
|
|
|
.
|

\
|
1
0
0
5 3 2
4 3 2
4 4 3
To solve for a, b, c,
reduce:
To solve for d, e, f,
reduce:
To solve for g, h, j,
reduce:
|
|
|
.
|

\
|
0
0
1
5 3 2
4 3 2
4 4 3
|
|
|
.
|

\
|
0
1
0
5 3 2
4 3 2
4 4 3
|
|
|
.
|

\
|
1
0
0
5 3 2
4 3 2
4 4 3
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
It is more efficient to do the three problems below in one step
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
It is more efficient to do the three problems below in one step
-1
|
|
|
.
|

\
|
1 1 0
0 1 0
0 0 1
1 0 0
4 3 2
4 4 3
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
It is more efficient to do the three problems below in one step
|
|
|
.
|

\
|
1 1 0
0 1 0
0 0 1
1 0 0
4 3 2
4 4 3
-1
1 1 0 - 1
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
It is more efficient to do the three problems below in one step
|
|
|
.
|

\
|

1 1 0
0 1 0
0 1 1
1 0 0
4 3 2
0 1 1
-2
0 1 -2 3
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
It is more efficient to do the three problems below in one step
|
|
|
.
|

\
|

1 1 0
0 3 2
0 1 1
1 0 0
4 1 0
0 1 1
-4
7 0 -4
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
It is more efficient to do the three problems below in one step
|
|
|
.
|

\
|

1 1 0
4 7 2
0 1 1
1 0 0
0 1 0
0 1 1
-1
3
0
-8 4
|
|
|
.
|

\
|
1 0 0
0 1 0
0 0 1
5 3 2
4 3 2
4 4 3
|
|
|
.
|

\
|

1 1 0
4 7 2
4 8 3
1 0 0
0 1 0
0 0 1
A I
I A
-1

reduces to: