For any linear system , a solution exists exactly when belongs to the image of a linear map represented by . If is one solution, all others are exactlysince , and conversely adding a kernel vector preserves the equation. Thus there are no solutions if , one if and , and infinitely many if and the kernel is nontrivial: every real multiple of a nonzero kernel vector gives a distinct solution. Any two solutions differ by a kernel vector. Equivalently, consistency means the augmented matrix and have equal rank of a matrix; a consistent square linear system is unique exactly when its determinant is nonzero.
For the given matrix, set and . Perform the column operation , then the row operations and . Factoring the first column givesThese operations are determinant-preserving, and the displayed polynomial identity remains valid even when a factored expression vanishes.
To find all kernels and images of a linear map, putIf is the all-ones matrix, then . The direct sum is invariant under : on it acts by multiplication by , and on by . Since , its restriction to is invertible.
For and , the kernel is and the image of a linear map is all of . Decompose the right-hand side asApplying the inverse on each invariant summand gives the unique solutionFor and , the kernel is and the image of a linear map is . A solution exists exactly when . For , all solutions areFor and , so , the kernel is and the image of a linear map is . A solution exists exactly when . All such solutions areFinally, for , the kernel is and the image of a linear map is . The right-hand side has first entry one, so there is no solution for any . These four cases exhaust all parameter values.
Articles by others on the same topic
There are currently no matching articles.