The Inverse of a Matrix 2.2 But first what about 2.1 - #23 and #24? 23. Assume CA =In.

. Show Ax=0 has only the trivial solution. Suppose there is a vector x so that Ax=0 C(Ax)=0 (CA)x=0 In x=0 x=0 So every column is a pivot column. Each pivot is in a different row, so there are at least as many rows as columns. Or there cant be more columns than rows

24.

Assume AD=Im . Let b be any element of Rm We want to show that Ax=b has a solution. Suppose AD=Im (AD)b=b or A(Db)=b Therefore a solution to Ax=b is x=Db

By Theorem 4 in section 1.4, A has a pivot in each row. Since no column can have more than one pivot, there are at least as many columns as rows.

The Inverse of a Matrix 2.2

Ax = b

represents a system of m linear equations in n unknowns.

Back in Algebra I Solve ax = b a-1(ax) = a-1b (a-1a)x = a-1b 1x = a-1b x = a-1b Note Note that 1 is the identity for multiplication. and and that a-1 is the multiplicative inverse of a.

Definition: Let A be an n x n matrix. If there exists a matrix A-1 such that A-1A = In = A A-1 then A-1 is called the inverse of A. We say that A is invertible if it has an inverse. Example:

1 Let A = 1

1 2 1 1 Show that A = 1 1 2

Theorem 5: If A is an invertible n x n matrix then for each b Rn, the equation Ax = b has the unique solution
x = A1b

Proof: Let b Rn. By substitution

r r r r 1 A A b = ( AA )b = I b = b n

To show this solution is unique, assume solution. Then

is also a

r r r r 1 1 Au = b A Au = A b r r 1 1 or ( A A) u = A b r r 1 or In u = A b r r 1 or u=A b

( )

Theorem 6a: Let A be invertible. Then so is A-1. Furthermore (A-1)-1 = A Proof: Let U = A-1. U-1 should have the property that when we multiply it by U, we get In. The matrix that has that property is A. So (A-1)-1= U-1=A

Theorem 6b: Let A and B be invertible n x n matrices. Then AB is invertible and (AB)-1 = B-1A-1 Proof: (B-1A-1)(AB) =

Note that this result can be extended to more than two matrices.

Theorem 6c: Let A be invertible. Then so is AT. (AT)-1 = (A-1)T Proof: (AT)(A-1)T= (A-1A)T = (A-1)T(AT) = (AA-1)T =

HW Read Section 2.2.

Elementary Matrices
Definition: An elementary matrix is a matrix that can be obtained from the identity matrix by a single elementary row operation. Examples: Note that there are three types.
1 0 0 E1 = 0 0 1 0 1 0 1 0 0 E2 = 0 k 0 0 0 1 1 0 0 E3 = 0 1 0 0 k 1

where k0. Theorem: Let A be an n x n matrix. Any elementary row operation can be performed by premultiplying A by an appropriate elementary matrix. Example: Let Find a. E1A
1 A = 3 2 2 4 6 5 9 8

Let k = 5

b. E2A

c. E3A

Theorem: Let A be an n x n matrix. A is invertible iff it is row equivalent to the identity matrix In. Furthermore the sequence of elementary row operations that transforms A to In also transforms In to A-1. Proof: See page 124. Examples: Find the inverse of
1 A= 2 3 9

1 B = 1 0

2 1 1

1 1 3

Homework: Read sections 2.2 and 2.3. Do practice problems.

2.2: Exercises 1,3,5,7a,9,13,17,23,24,29,31,32 2.3: 1-7,11-19 odd, 22, 27,33 I will collect the underlined problems. T/F answers section 2.2 #9: T,F,F,T,T NOTE extra practice problems under course documents. If time look at 23 and 24 with class