A system AX=B is homogeneous when every constant bi=0, i.e. AX=O. Since x1=x2=⋯=xn=0 (the trivial solution) always satisfies it, ρ(A)=ρ([A∣O]) automatically -- a homogeneous system is always consistent; the only real question is whether it has a non-trivial (non-zero) solution too.
Let A be the n×n coefficient matrix of a homogeneous system in n unknowns.
If ρ(A)=n (equivalently ∣A∣=0, A non-singular), the system has only the trivial solution.
If ρ(A)<n (equivalently ∣A∣=0, A singular), the system has infinitely many non-trivial solutions, forming an (n−ρ(A))-parameter family.
So for a square coefficient matrix, the entire question collapses to one determinant check: a non-trivial solution exists exactly when ∣A∣=0. (If there are more unknowns than equations, ρ(A)<n automatically, so a non-trivial solution is guaranteed without even computing a determinant.)
Worked illustration. For x+y+z=0,2x−y+z=0,x−2y=0: ∣A∣=1211−1−2110=1(0+2)−1(0−1)+1(−4+1)=2+1−3=0, so a non-trivial solution exists; row-reducing [A∣O] recovers it as a one-parameter family.
A problem with an unknown parameter λ in the coefficients ("find λ so the system has a non-trivial solution") reduces to solving ∣A(λ)∣=0 for λ -- an ordinary polynomial equation in λ, often factored using the row/column operations that create zeros before expanding. …
Compute the coefficient determinant as a function of λ: detA=λ−8. It is a homogeneous system, so detA=0 forces only the trivial solution, and detA=0 (i.e. λ=8) opens up non-trivial solutions. …
Step 2. λ=8: only the trivial solution. Here detA=0⇒ρ(A)=3=n, so the homogeneous system has ρ(A)=n and therefore only the trivial solution x=y=z=0 — this is what "a unique solution" means for a homogeneous system. …
Confusing 'non-trivial solution' with 'no solution' — a homogeneous system is always consistent; the only question is whether the trivial solution is the only one.
Sign error distributing the minus sign on the middle cofactor −1[(4)(2)−λ(2)]. …