Rank of Matrices: Why Equal to Transpose?

In summary, the rank of a matrix is equal to the rank of its transpose. This is a fundamental property of matrices that is easy to prove using a few preliminary results.
  • #1
Fu Lin
6
0
The question in short is, why the rank of a matrix is equal to the rank of its transpose?

Matrix is an array of numbers. Then it's amazing to me that the number of linear independent rows coincides with the number of linear independent columns. I tried to find some fundamental answer to this question, which does not resort to concepts like singular values or eigenvalues, so that it can be explained to those who do not know linear algebra. Is there an elementary way to explain this fact?
 
Last edited:
Physics news on Phys.org
  • #2
Fu Lin said:
I tried to find some fundamental answer to this question

In mathematics, such "fundamental answers" are called proofs. Start searching for one. :wink:
 
  • #3
Fu Lin said:
The question in short is, why the rank of a matrix is equal to the rank of its transpose?

Matrix is an array of numbers.
No! A matrix is an object in an algebraic system with specific properties. It can be represented by an "array of numbers".

Then it's amazing to me that the number of linear independent rows coincides with the number of linear independent columns. I tried to find some fundamental answer to this question, which does not resort to concepts like singular values or eigenvalues, so that it can be explained to those who do not know linear algebra. Is there an elementary way to explain this fact?
It depends entirely upon the definition of matrix multiplication: each term in the product of two matrices is the "dot product" of a row in the first matrix with a column in the second matrix. Reversing the order enterchanges the rows and columns.
 
  • #4
You need several preliminary results to prove that the rank of a matrix is equal to the rank of its transpose:
1) If A has rank r, then you can left- and right-multiply it by elementary matrices so that the rxr submatrix of the new A in the upper left corner is the identity matrix, and everywhere else is zeros.
2) Multiplying a matrix by invertible matrices does not change its rank.
3) Elementary matrices are invertible.
4) The transpose of a product is the product of the transposes (in reverse order).
5) The inverse matrix of a transpose matrix is the transpose matrix of the inverse matrix.

Now use these results to prove the theorem.
 
Last edited:
  • #5
mathboy said:
You need several preliminary results to prove that the rank of a matrix is equal to the rank of its transpose:
1) If A has rank r, then you can left- and right-multiply it by elementary matrices so that the rxr submatrix of the new A in the upper left corner is the identity matrix, and everywhere else is zeros.
2) Multiplying a matrix by invertible matrices does not change its rank.
3) Elementary matrices are invertible.
4) The transpose of a product is the product of the transposes (in reverse order).
5) The inverse matrix of a transpose matrix is the transpose matrix of the inverse matrix.

Now use these results to prove the theorem.

thank you.:smile:
 

Related to Rank of Matrices: Why Equal to Transpose?

1. What is a rank of a matrix?

The rank of a matrix is the maximum number of linearly independent rows or columns in that matrix. It can also be defined as the number of non-zero rows or columns in the reduced row echelon form of the matrix.

2. How can the rank of a matrix be calculated?

The rank of a matrix can be calculated by performing row operations to reduce the matrix to its row echelon form. The number of non-zero rows in the resulting matrix will be the rank of the original matrix.

3. Why is the rank of a matrix important?

The rank of a matrix is important because it provides information about the linear independence of the rows or columns in the matrix. It is also used to solve systems of linear equations and determine the dimension of the column and row spaces of a matrix.

4. What is the relationship between the rank of a matrix and its transpose?

The rank of a matrix and its transpose are always equal. This means that the number of linearly independent rows in a matrix is the same as the number of linearly independent columns in its transpose.

5. How can the equality between the rank of a matrix and its transpose be proven?

The equality between the rank of a matrix and its transpose can be proven by using the properties of matrix operations and the definition of rank. It can also be proven by showing that the reduced row echelon form of a matrix is the same as the reduced row echelon form of its transpose.

Similar threads

  • Linear and Abstract Algebra
Replies
9
Views
4K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
14
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
1K
Replies
4
Views
2K
  • Linear and Abstract Algebra
Replies
5
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
2K
  • Linear and Abstract Algebra
Replies
2
Views
2K
  • Precalculus Mathematics Homework Help
Replies
32
Views
905
  • Linear and Abstract Algebra
Replies
9
Views
892
Back
Top