Rank of a Matrix: Why is A = 1 & Not 0?

  • Context: Undergrad 
  • Thread starter Thread starter eg0
  • Start date Start date
  • Tags Tags
    Matrix rank
Click For Summary
SUMMARY

The rank of a matrix A is defined as the number of linearly independent rows or columns. In the case of a 3x3 matrix filled with ones, the rank is 1, not 0, because the rows and columns are linearly dependent but span a one-dimensional subspace in R3. To achieve a rank of 0, a matrix must be the zero matrix, which maps all vectors to the zero vector. Understanding linear dependence and the concept of subspaces is crucial for grasping why the rank of a non-zero matrix cannot be zero.

PREREQUISITES
  • Understanding of linear independence and dependence
  • Familiarity with matrix representation and operations
  • Basic knowledge of vector spaces and subspaces
  • Concept of linear transformations
NEXT STEPS
  • Study the concept of linear transformations in depth
  • Learn about the properties of vector spaces and subspaces
  • Explore the implications of rank in different types of matrices
  • Investigate the relationship between matrix rank and nullity
USEFUL FOR

Mathematicians, students of linear algebra, educators teaching matrix theory, and anyone seeking to deepen their understanding of matrix rank and linear transformations.

eg0
Messages
2
Reaction score
0
Hi
I don't understand why only a matrix full of zero has a rank = 0.

"the rank of a matrix A is the number of linearly independent rows or columns of A"

If I have a 3x3 matrix

A = [ 1 1 1
1 1 1
1 1 1 ]

assuming a_i denotes the column or row vector i of A. I can say

a_1 = 1*a_2 + 0*a_3 so a_1 is not linearly independent
a_2 = 1*a_1 + 0*a_3 so a_2 is not linearly independent
a_3 = 1*a_1 + 0*a_2 so a_3 is not linearly independent

So why rank A = 1 and not 0 ?
I know I'm missing something, I don't know what!
 
Physics news on Phys.org
To have rank 0 Ax=0 for all x. The column (or row vectors) are linearly dependent in pair and triples, but linearly dependent in singles. The rank is r if there exist r rows or columns that are linearly independent.
 
rank is the dimension of the subspace composed by the set of points you can reach using constant multiples of the vectors in your matrix.
A 3x3 matrix of ones can reach any point on a line in R3 (which is a subspace) and lines have dimension 1, so rank is 1.
 
More abstractly, an n by n matrix represents a linear transformation from an n dimensional vector space to an n dimensional vector space- L: U-> V. The "range" is the dimension of L(U) as a subspace of V. In particular, if you multiply a matrix by the vector having 1 as the ith entry, 0 every where else, you get the ith column of the matrix. But the set of all such vectors form a basis for U and so are mapped into a set that spans L(U). The only subspace with dimension 0 is the set containing only the 0 vector. In other words, to have rank 0, L must map every vector into the 0 vector. That is the "0" linear tranformation which is represented by the 0 matrix.
 
a simpler explanation is provided by noting that the set {(0,0,0)} (or any other n-dimensional 0-vector) is a linearly dependent set.

why? because for the 0-vector, we can have c0 = 0, even if c is non-zero.
 
Thank you. So I was wrong mainly because I had not understood the notion of linearly (in)dependence...
 

Similar threads

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