"

Section 3.2 Determinants and Matrix Inverses

Theorem: Let A be a square matrix:

(a) If a multiple of one row of A is added to another row to produce a matrix B, then detB=detA.

 

(b) If two rows of A are interchanged to produce B, then detB=detA. (detA=detB).

 

(c) If one row of A is multiplied by c to produce B, then detB=cdetA(detA=(1/c)detB).

 

 

Fact: The above theorem could be rewrite as:

(a) If E is obtained by a multiple of one row of In is added to another row, then detEA=detEdetA=detA.

 

(b) If E is obtained by two rows of In are interchanged, then detEA=detEdetA=detA.

 

(c) If E is obtained by one row of In is multiplied by c, then detEA=detEdetA=cdetA(detA=(1/c)detEA)

 

Moreover,

 

detE={1 if E is the row placement of In1 if E is the row exchnage of Inc if E is a row scale of In

 

Sketch of the Proof: 1. Show the case of n=2 is true. 2. Use mathematical induction on n. We use the fact that n1 is true to show the case n is true. Because most of you did not know mathematical induction, we will not prove it here.

 

 

Example 1: Compute the determinant of A=[1023124501122301].

 

 

Exercise 1: Compute the determinant of A=[1003142023120121].

 

Theorem: A square matrix A is invertible if and only if detA0.

 

Fact: 1. An n×n matrix A is invertible if and only if AT is invertible. When A is not invertible then AT is not invertible, then AT has less than n pivot positions, less than n pivot columns. Hence ATx=0 has nontrivial solution.

 

2. If we do the row inter-exchange and row replacement on an n×n matrix A to obtain the Echelon form of A, U, then detA=(1)rdetU where r is the number of row exchanges. Notice that U is a triangular matrix, hence detU is the product of the diagonal entries. When U does not have n pivot positions, then the detU=0, i.e detA=0 and A is not invertible.

 

Example 2: Find the determinant of A=[0131231235221246].

 

Exercise 2: Find the determinant of A=[1031024312723452].

 

Theorem: If A is an n×n matrix then detA=detAT.

 

Theorem: If A and B are n×n matrices then detAB=detAdetB.

 

Example 3: Compute detAB without finding AB, where A=[1213], B=[2321].

 

Exercise 3: Compute detAB without finding AB, where A=[0114], B=[1421].

 

Example 4: Compute detATB without finding ATB, where A=[1224], B=[2331].

 

Exercise 4: Compute detATB without finding ATB, where A=[2104], B=[1311].

 

Group Work 1: Mark each statement True or False. Justify each answer. All matrices are n×n matrices.

a. A row replacement does not affect the determinant of a matrix.

 

b. The determinant of A is the product of the diagonal in any echelon form U of A, multiplied by (1)r, where r is the number of row interchange made during the row operation.

 

c. det(A+B)=detA+detB

 

d. If two row exchange are made in succession, then the new determinant
equals the old determinant.

 

e. The determinant of A is the product of the diagonal entries.

 

f. If detA is zero, then two rows or two columns are the same, or a row or a column is zero.

 

g. detAT=(1)detA.

 

Group Work 2: Compute detA3.

A=[130122001]

 

Group Work 3: Show det(A1)=1detA when A is invertible.

 

Group Work 4: In each case either prove the statement or give an example
showing that it is false. All matrices are n×n matrices.

a. detAB=detBTA.

 

b. If detA0 and AB=AC, then B=C.

 

c. If AB is invertible, then A and B are invertible.

 

d. det(I+A)=1+detA.

 

e. A and P are square matrices and P is invertible then detPAP1=detA.

 

f. If AT=A, then detA=1.

License

Icon for the Creative Commons Attribution 4.0 International License

Matrices Copyright © by Kuei-Nuan Lin is licensed under a Creative Commons Attribution 4.0 International License, except where otherwise noted.