Rank of Matrices: Why Equal to Transpose?

  • Context: Undergrad 
  • Thread starter Thread starter Fu Lin
  • Start date Start date
  • Tags Tags
    Matrices rank
Click For Summary

Discussion Overview

The discussion centers on the question of why the rank of a matrix is equal to the rank of its transpose. Participants explore this concept from various angles, seeking fundamental explanations that do not rely on advanced linear algebra concepts such as singular values or eigenvalues.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant expresses amazement that the number of linearly independent rows coincides with the number of linearly independent columns, seeking an elementary explanation for this phenomenon.
  • Another participant challenges the initial characterization of a matrix as merely an array of numbers, emphasizing that it is an object in an algebraic system with specific properties.
  • A later reply suggests that the equality of ranks depends on the definition of matrix multiplication, noting that the dot product of a row and a column is fundamental to understanding the relationship between rows and columns.
  • Several preliminary results are proposed as necessary for proving the theorem, including properties of elementary matrices, the effect of invertible matrices on rank, and the behavior of transposes under multiplication.

Areas of Agreement / Disagreement

Participants do not reach a consensus on a singular explanation or proof for why the rank of a matrix equals the rank of its transpose. Multiple viewpoints and approaches are presented, indicating ongoing exploration and debate.

Contextual Notes

The discussion includes various assumptions about matrix properties and definitions, which may not be universally accepted. The reliance on preliminary results for proof suggests that the topic is complex and not fully resolved within the thread.

Fu Lin
Messages
6
Reaction score
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
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:
 
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.
 
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:
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:
 

Similar threads

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