Solution The Cofactors of A Are - 18 - 17 - 6

•• Solution

the cofactors of A are
= -18; = -17;
= -6:
= -6; = -10;
= -2:
•
= -10; = -1;
= 28:
Then,
adj A =
•
Theorem 3.11 If A = [] is an nxn matrix, then
A(adj A) = (adj A)A = det(A)
Proof: We have
A(adj A) =
• i, jth element in the product matrix A(adj) is by (7)
the
+ + + = det(A) if i = j
+ + + = 0 if
This means that

A (adj A) = = det(A)
the i, jth element in the product matrix A(adj) is by (8)

+ + + = det(A) if i = j
+ + + = 0 if
Thus (adj A)A = det(A)

•
Example 6: Consider the matrix of Example 5, Then
=
= -94 and
= -94
•
Corollary 3.3 If A is an nxn matrix and det(A)
Proof: By Theorem 3.11 A(adj A) = det(A) , so if det(A)
A[A(adj A)]= [det(A) ] =

Hence,
•Example
7: Again consider the matrix of Example 5. Then det(A)=
-94, and
=
•Theorem
3.12A matrix A is nonsingular if and only if det(A)
Proof: If det(A) then Corollary 3.2 gives an expression for , so A
is nonsingular
The converse has already been established in Corollary 3.2
whose proof was left to the reader as Exercise T.4 of Section 3.1.
We prove the converse here. Suppose that A is nonsingular.
Then
A
From Theorem 3.8 we have
det(A) = det(A)det() = det() = 1
Which implies that det(A) . This completes the proof.
•Corollary
3.4 : For an nxn matrix A, the homogeneus system
Ax=0 has a nontrivial solution if and only if det(A) = 0
Proof: If det(A) then by Theorem 3.12, A is nonsingular and thus

Ax=0 has only the trivial solution (Theorem 1.13 in Section 1.6).
Conversely, if det(A) = 0, then A is singular (Theorem 3.12 ).
Suppose that A is row equivalent to a matrix B in reduced row
echelon form. If then follows from Theorem 1.12 in Section 1.6
and Exercise T.9 in Section 1.6 that B has a row of zeros. The
system is x=0 has the same solutions as the system Ax=0. Let be
the matrix obtained by deleting the zero rows of B. Then the
system Bx=0 has the same solutions as the system Since the
Latter is homogeneous system of at most n-1 equations in n
unknown, it has a nontrivial solution (Theorem 1.8 in Section
1.5). Hence the given system Ax=0 has a nontrivial solution. We
might note that the proof of the converse is essentially the proof
of Exercise T.3 in section 1.6
•Example
8: Let A be a 4x4 matrix with det(A) = -2.
(a). Describe the set of all solutions to the homogeneous system
Ax=C
(b). If A is transformed to reduced row echelen form B, what is
B?
(c). Give an expression for a solution to the inner sytem Ax=b,
where
b=
(d). Can the linear system Ax=b have more than one solution?
Explain.
(e). Does exist?
•Solution:

(a). Since det(A) by Corollary 3.4, the homogeneous system has
only the trivial solution
(b). Since det(A) , by Theorem 3.12, A is a nonsingular matrix and
by Theorem 1.12, B = 1
(c). A solution to the given system is given by x = b
(d). No, The solution given in part (c) is the only one.
(e). Yes
In section 1.6 we developed a practical method for finding In
describing the situation showing that a matrix is singular and has
no inverse, we use the fact that if we start with the identity
matrix and use only elementary row operations on , we can
never obtain a matrix having a row consisting entirely of zeros.
We can now justify this statement as follows. If matrix B results
form by interchanging two rows of then det(B) = -det()= -1
(Theorem 3.2): if C results form by multiplying a row of
•by c = cdet() = c (Theorem 3.5) and if D results from by c to
another row of then det(D) = det() = 1 (Theorem 3.6).
Performing elementary row operations on will thus never yield
a matrix with zero determinant. Now suppose that F is obtained
from by a sequence of elementary row operations and F has a
row of zeros. Then det(F) = 0 (Theorem 3.4). This contradiction
justifies the statement used in Section 1.6.
We might note that the method of inverting a nonsingular
matrix given in Corollary 3.3 is much less efficient than the
method given in Chapter 1. In fact, the computation of using
determinants, as given in Corollary 3.5, become too expensive
for n>4 from a computing point of view. We discuss these
matters in Section 3.5m where we deal with determinants from
a computational point of view. However, Corollary 3.3 is still a
useful result on other grounds.
•We may summarize our results on determinants, homogeneous
systems and nonsingular matrices in the following List of
Nonsingular Equivalences
List of nonsingular Equivalences

The following statements are equivalent.
1. A is nonsingular
2. Ax = 0 has only the trivial solution
3. A is row equivalent to
4. The linear system Ax = b has a unique solution for every nx1
matrix b.
5. det(A)

Solution The Cofactors of A Are - 18 - 17 - 6

Uploaded by

Copyright:

Available Formats

Solution The Cofactors of A Are - 18 - 17 - 6

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Solution The Cofactors of A Are - 18 - 17 - 6

Uploaded by

Copyright:

Available Formats

•• Solution

This means that

the i, jth element in the product matrix A(adj) is by (8)

Thus (adj A)A = det(A)

Proof: By Theorem 3.11 A(adj A) = det(A) , so if det(A)

A[A(adj A)]= [det(A) ] =

Proof: If det(A) then by Theorem 3.12, A is nonsingular and thus

List of nonsingular Equivalences

You might also like