September 2018
Intermediate to advanced
580 pages
16h 3m
English
In this section, we define the rank of a matrix. We then use elementary operations to compute the rank of a matrix and a linear transformation. The section concludes with a procedure for computing the inverse of an invertible matrix.
If , we define the rank of A, denoted rank(A), to be the rank of the linear transformation .
Many results about the rank of a matrix follow immediately from the corresponding facts about a linear transformation. An important result of this type, which follows from Fact 3 (p. 101) and Corollary 2 to Theorem 2.18 (p. 103), is that an matrix is invertible if and only if its rank is n.
Every matrix A is the matrix representation of the linear ...
Read now
Unlock full access