Concept understanding — Consistency by Rank Method
Theorem (Rouché-Capelli). The system AX=B is consistent (has at least one solution) if and only if the rank of the coefficient matrix equals the rank of the augmented matrix: ρ(A)=ρ([A∣B]).
This single test subsumes and explains matrix inversion, Cramer's rule and Gaussian elimination all at once. Row-reduce [A∣B] to echelon form, read off ρ(A) and ρ([A∣B]) from the number of non-zero rows in the left block and in the whole augmented matrix, and apply the standing rule (with n = number of unknowns):
ρ(A)=ρ([A∣B])=n−k<n⇒consistent, infinitely many solutions, forming a k-parameter family (choose k unknowns arbitrarily, solve the rest by back substitution).
ρ(A)=ρ([A∣B])⇒inconsistent, no solution (the echelon form of [A∣B] shows a row like 0=c for some c=0 -- a contradiction).
Worked illustration. For x+y=2,2x+2y=5: [A∣B]=(1212∣∣25)R2→R2−2R1(1010∣∣21). Here ρ(A)=1 but ρ([A∣B])=2 (the bottom row reads 0=1), so the system is inconsistent -- geometrically, two parallel, non-coincident lines. …
Expand the coefficient determinant ∣A∣ in terms of k, find its roots, then use the rank test at each root to decide between "no solution" and "infinitely many solutions".
Step 2. Factor and find the roots.∣A∣=−2(k3−3k+2). Since k=1 makes k3−3k+2=1−3+2=0, divide by (k−1): k3−3k+2=(k−1)(k2+k−2)=(k−1)(k−1)(k+2)=(k−1)2(k+2). So ∣A∣=−2(k−1)2(k+2), which vanishes exactly at k=1 (a double root) and k=−2.
Step 3. k=1,−2: unique solution. Here ∣A∣=0⇒ρ(A)=ρ([A∣B])=3=n, so the system has a unique solution for every k∈/{1,−2}.
Step 4. k=1: check consistency. Substituting k=1 into the three equations gives x−2y+z=1, x−2y+z=−2, x−2y+z=1 — the first and third equations are literally identical, while the second has the same left side but a different constant. Row-reducing [A∣B]:
Assuming every root of ∣A∣=0 automatically gives 'infinitely many solutions' — a root can just as well make the system inconsistent, as k=1 does here. …