Why Does a Singular Matrix Imply Infinite or Zero Solutions?

  • Thread starter Thread starter member 428835
  • Start date Start date
  • Tags Tags
    Matrix Theory
Click For Summary
SUMMARY

A singular matrix, defined by a determinant equal to zero, indicates either infinite solutions or no solutions for the equation Ax = B, where A is a square matrix and x and B are vectors. The absence of an inverse for a singular matrix means that the linear transformation represented by A does not map Rn onto itself uniquely. According to the dimension theorem, if the rank of A is less than the dimension of the vector space, the nullity of A is greater than zero, leading to an infinite number of solutions when y is within the image of A.

PREREQUISITES
  • Understanding of linear algebra concepts, specifically matrix theory.
  • Familiarity with determinants and their implications on matrix invertibility.
  • Knowledge of linear transformations and their properties.
  • Grasp of the dimension theorem relating rank and nullity of matrices.
NEXT STEPS
  • Study the properties of singular matrices in linear algebra.
  • Learn about the dimension theorem and its applications in vector spaces.
  • Explore the concept of null space and its significance in solving linear equations.
  • Investigate examples of linear transformations and their mappings in Rn.
USEFUL FOR

Students of linear algebra, mathematicians, and anyone interested in understanding the implications of singular matrices in solving linear equations.

member 428835
hey guys


given Ax=B where A is a square matrix and x and B are vectors, can anyone tell me why a singular matrix (that is, the determinant = 0) implies one of two situations: infinite solutions or zero solutions? a proof would be nice. i read through pauls notes but there was no proof.

thanks all!
 
Physics news on Phys.org
If ##\mathbf{A}\vec{x}=\vec{y}## then ##\mathbf{A}^{-1}\vec{y}=\vec{x}## provided the inverse exists.

If the matrix ##\mathbf{A}## is singular, it does not have an inverse.
Another name for it is "degenerate".

What does that tell you about the solutions?
(Think about it in terms of solving simultaneous equations.)
 
An n by n square matrix represents a linear transformation, A, from Rn to Rn. If it is "non-singular", then it maps all of Rn to all of Rn. That is, it is a "one to one" mapping- given any y in Rn there exist a unique x in Rn such that Ax= y.

But we can show that, for any linear transformation, A, from one vector space, U, to another, V, the "image" of A, that is, the set of all vectors y, of the form y= Ax for some x, is a subspace of V and that the "null space" of A, the set of all vectors, x, in U such that Ax= 0, is a subspace of U. Further, we have the "dimension theorem". If "m" is dimension of the image of A (called the "rank" of A) and "n" is the dimension of the nullspace of A (called the "nullity" of A) then m+ n is equal to the dimension of V. In particuar, if U and V have the same dimension, n, and the rank of A is m with m< n, then the nullity of A= m-n> 0.

It is further true that if A(u)= v and u' is in the nullspace of A then A(u+ u')= A(u)+ A(u')= v+ 0= v.

The result of all of that is this: If A is a singular linear transformation from vector space U to vector space V, then it maps U into some subspace of V. If y is NOT in that subspace then there is NO x such that Ax= y. If y is in that subspace then there exist x such that Ax= y but also, for any v in the nullity of A (which has non-zero dimension and so contains an infinite number of vectors) A(x+ v)= y also so there exist an infinite number of such vectors.
 
thanks this makes tons of sense!
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 4 ·
Replies
4
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 55 ·
2
Replies
55
Views
7K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 4 ·
Replies
4
Views
5K
Replies
8
Views
4K