Question
Proving a 3x3 matrix is non-singular for all values
Original question: Eg3. Show that for all , is non-singular.
det
Since Hence det
is non-singular for all
, no real roots
Expert Verified Solution
Key concept: This problem uses determinant expansion and completing the square to prove that a parameterized matrix has no zero determinant for any real value of the variable.
Step by step
What the problem is asking
A matrix is non-singular when its determinant is not zero. Because the entries of the matrix depend on the variable , the goal is to compute and show that it is always positive for every real .
The key idea is not just finding a formula, but rewriting that formula into a form that makes its sign obvious. That is why completing the square is useful here.
Step-by-step determinant expansion
For
expand along the first row:
Now evaluate each determinant:
Simplify:
Why completing the square proves non-singularity
Rewrite the quadratic:
Because a square is always nonnegative,
so
That means the determinant is never zero, so the matrix is non-singular for all real .
Useful sign test
A quadratic of the form is always positive if its completed-square form has a positive constant term and the coefficient of the square is positive. Here, both conditions hold, so there are no real roots and no value of that makes the matrix singular.
Pitfall alert
A frequent mistake is to stop after computing and conclude it is positive just because the leading coefficient is positive. That is not enough for a quadratic; it could still cross zero. You must either complete the square or compute the discriminant. Another error is using the wrong cofactor signs during expansion, which changes the final quadratic completely. It is also important to say clearly that non-singular means determinant nonzero, not merely nonnegative. The completed-square step is what gives the proof its strength.
Try different conditions
If one entry changes, for example replacing the in the second row by a parameter , the determinant may no longer be always positive. In that variant, you would recompute as a quadratic in with coefficients depending on , then check whether its discriminant is negative or whether the completed-square form has a positive minimum. For a different variant where the matrix is symmetric, you could sometimes use eigenvalue arguments instead of direct expansion, but the conclusion still depends on proving the determinant cannot be zero for any real parameter value.
Further reading
cofactor expansion, completed square, non-singular matrix
FAQ
How can you prove a parameterized matrix is non-singular for all real x?
Compute the determinant as a function of x, then rewrite it in a form whose sign is obvious, such as a completed square plus a positive constant. If the determinant never equals zero, the matrix is non-singular for every real x.
Why is completing the square useful after finding a determinant?
Completing the square reveals the minimum value of the determinant expression. If that minimum is positive, then the determinant can never be zero, which proves the matrix is non-singular.