Understanding Singular Rectangular Matrices

  • Context: Undergrad 
  • Thread starter Thread starter roadworx
  • Start date Start date
  • Tags Tags
    Matrices Rectangular
Click For Summary
SUMMARY

The discussion centers on the concept of singular rectangular matrices, specifically analyzing a given 6x5 matrix. The matrix is deemed singular because it does not have an inverse, which is confirmed by the linear dependence of its columns. The user highlights that the first three columns can be combined to produce a column of ones, indicating redundancy. The definition of singularity is clarified as a linear transformation represented by a non-square matrix being non-invertible, confirming that all non-square matrices are singular.

PREREQUISITES
  • Understanding of linear transformations
  • Knowledge of matrix dimensions and properties
  • Familiarity with concepts of linear dependence and independence
  • Basic understanding of matrix invertibility
NEXT STEPS
  • Study the properties of linear transformations in detail
  • Learn about the rank and nullity of matrices
  • Explore the implications of matrix singularity in practical applications
  • Investigate the relationship between matrix dimensions and invertibility
USEFUL FOR

Students of linear algebra, mathematicians, and anyone involved in matrix theory or applications in engineering and computer science.

roadworx
Messages
20
Reaction score
0
hi,

I have a question on determining whether rectangular matrices are singular.

\left[1 0 0 1 0\right]
\left[1 0 0 0 1\right]
\left[0 1 0 1 0\right]
\left[0 1 0 0 1\right]
\left[0 0 1 1 0\right]
\left[0 0 1 0 1\right]

The book says it's singular. But the explanation isn't very clear. It says something about the first 3 columns treated as vectors give a column of 1's, the final two columns also give a column of 1's. Any better explanation?
 
Physics news on Phys.org
What do you mean by "singular"? The most general definition I know is that a linear transformation (representable by a matrix) is not invertible. That is, T:U->V is "singular" if there is no linear transformation S:V-> U such that ST(u)= u for all u in U and TS(v)= v for all v in U. If T is represented by an non-rectangular matrix (of dimension "n by m" with n not equal to m), then U and V do not have the same dimension and T is either not "1-to-1" or not "onto". In either case it has no inverse. That is every non-square matrix is "singular".

If you are using a different definition of "singular", please tell us what it is.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K