A system of linear equations is solvable exactly when . If is one solution, thenso its solution set is , a translate of the kernel of a linear map.
For , the matrix is an invertible matrix, andEvery is in the image of a linear map and has exactly one preimage. For , its first two columns span the image of a linear map, while the corresponding homogeneous linear system gives the kernel of a linear map:The prescribed satisfies the displayed condition precisely when . If , it lies outside the image of a linear map and there is no solution. If , it lies in the image of a linear map, and the nonzero kernel of a linear map supplies infinitely many solutions.
For , , whose row space is . For , elementary row operations give the reduced row echelon formIts row space is , whereas the image of a linear map is . These differ: belongs to the former but not the latter. Thus (A) is true exactly when . Rows are being identified with vectors in in this comparison.
Every elementary column operation preserves the linear span of the columns: each new column is a linear combination of the old columns, and the inverse operation supplies the reverse inclusion. Thus the column space of equals that of , which is precisely the image of a linear map . Consequently (B) is true for every .
For , both reduced forms are , so . At , the reduced column echelon form is the transpose of the reduced row echelon form of , givingFor example, followed by , using the updated second column, produces the displayed directly. Its third column is zero. The two matrices differ, so (C) is true exactly when . Taking a transpose exchanges the kind of reduction, but also replaces the original by ; it does not generally identify the two reduced forms of itself.
Articles by others on the same topic
There are currently no matching articles.