Professional Documents
Culture Documents
Prove:
We'll prove this property for 3x3 matrices but the method of the proof is universal.
So take P =
[a b c]
[d e f]
[g h i]
Let A,B,C,D,E,F,G,H,I be the cofactors of a,b,c,d,e,f,g,h,i.
We multiply the elements of a row, say the second, with the corresponding cofactors of
another row, say the the first.
We have to prove that dA+eB+fC = 0.
Take now the matrix Q =
[d e f]
[d e f]
[g h i]
Since the matrix has two equal rows,its determinant is 0. So det(Q) = 0.
Furthermore, the cofactors of corresponding elements of the first row of P and Q are the
same. These cofactors are A B and C.
Hence the calculation of det(Q) emanating from the first row gives dA+eB+fC.
Since we know that det(Q) = 0, dA+eB+fC = 0.
Q.E.D.
We say that B is an inverse matrix of A if and only if A.B=I=B.A . (I is the identity matrix.)
We show that it is impossible that there are two inverse matrices for A.
Say, there are two inverse matrices B and C for A, then we have
A.B=I=B.A and A.C=I=C.A
Then, B=I.B=C.A.B=C.I=C
So B=C is the unique inverse of A.
We'll show that for the unique inverse B of a regular matrix A holds:
B = (adjoint of A) / det(A) We'll prove this property for 3x3 matrices but the method of the
proof is universal.
First we'll calculate
A.(adjoint of A) =
[a b c] [A D G]
[d e f] . [B E H] =
[g h i] [C F I]
[aA+bB+cC aD+bE+cF aG+bH+cI]
[dA+eB+fC dD+eE+fF dG+eH+fI] =
[gA+hB+iC gD+hE+iF gG+hH+iI]
[aA+bB+cC 0 0 ]
[ 0 dD+eE+fF 0 ] =
[ 0 0 gG+hH+iI]
[ det(A) 0 0 ]
[ 0 det(A) 0 ] =
[ 0 0 det(A)]
[ 1 0 0]
det(A). [ 0 1 0] =
[ 0 0 1]
det(A).I
In the same way, (adjoint of A).A =det(A).I
Prove: [g h i]
We'll prove this property for 3x3 matrices Since the matrix has two equal rows,its
but the method of the proof is universal. determinant is 0. So det(Q) = 0.
So take P = Furthermore, the cofactors of
corresponding elements of the first row of
P and Q are the same. These cofactors
[a b c] are A B and C.
[d e f]
Hence the calculation of det(Q)
[g h i]
emanating from the first row gives
Let A,B,C,D,E,F,G,H,I be the cofactors of
dA+eB+fC.
a,b,c,d,e,f,g,h,i.
Since we know that det(Q) = 0,
We multiply the elements of a row, say the
dA+eB+fC = 0.
second, with the corresponding cofactors
Q.E.D.
of another row, say the the first.
We have to prove that dA+eB+fC = 0.
Take now the matrix Q = Inverse matrix of a regular square
matrix
[d e f]
[d e f]
We say that B is an inverse matrix of A if [dA+eB+fC dD+eE+fF dG+eH+fI]
=
and only if A.B=I=B.A . (I is the identity [gA+hB+iC gD+hE+iF gG+hH+iI]
matrix.)
Because of the cofactors
Uniqueness of the inverse matrix property,
[aA+bB+cC 0 0 ]
We show that it is impossible that there are [ 0 dD+eE+fF 0 ]
two inverse matrices for A. =
Say, there are two inverse matrices B and [ 0 0 gG+hH+iI]
C for A, then we have
The diagonal elements of
A.B=I=B.A and A.C=I=C.A this matrix are det(A)
Then, B=I.B=C.A.B=C.I=C
So B=C is the unique inverse of A. [ det(A) 0 0 ]
[ 0 det(A) 0 ] =
[ 0 0 det(A)]
Calculating the inverse of a regular
square matrix [ 1 0 0]
det(A). [ 0 1 0] =
[ 0 0 1]
We'll show that for the unique inverse B of
a regular matrix A holds: det(A).I
B = (adjoint of A) / det(A) We'll prove this In the same way, (adjoint of A).A =det(A).I
property for 3x3 matrices but the method
of the proof is universal.
First we'll calculate
A.(adjoint of A) =
[a b c] [A D G]
[d e f] . [B E H] =
[g h i] [C F I]