Scribd
Upload
116 views1 page

Invertible Matrix Theorem

The document discusses an invertible matrix theorem which states that for a square matrix A, several statements about A are equivalent such as A being invertible, its columns being linearly independent, and its determinant being non-zero.

Uploaded by

Manab Chetia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
116 views1 page

Invertible Matrix Theorem

The document discusses an invertible matrix theorem which states that for a square matrix A, several statements about A are equivalent such as A being invertible, its columns being linearly independent, and its determinant being non-zero.

Uploaded by

Manab Chetia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

The Invertible Matrix Theorem

Let A be a square n n matrix. Then the following statements are equivalent. That is, for a given A , the statements are either all true or all false. a. A is an invertible matrix. b. A is row equivalent to the n n identity matrix. c. A has n pivot positions. r r d. The equation Ax = 0 has only the trivial solution. e. The columns of A form a linearly independent set. r r f. The linear transformation x Ax is one-to-one. (*) r r r g. The equation Ax = b has at least one solution for each b in R n . h. The columns of A span R n . r r i. The linear transformation x Ax maps R n onto R n . (*) j. There is an n n matrix C such that CA = I . k. There is an n n matrix D such that AD = I . l. AT is an invertible matrix. m. The columns of A form a basis of R n . n. ColA = R n o. dim ColA = n n p. rankA = r q. NulA = {0} r. dim NulA = 0 s. The number 0 is not an eigenvalue of A . t. The determinant of A is not zero.

(*)

not covered in the class

You might also like