If a mxn matrix A, m>=n has a reduced QR-decomposition

  • Context: Undergrad 
  • Thread starter Thread starter Vikt0r
  • Start date Start date
  • Tags Tags
    Matrix
Click For Summary

Discussion Overview

The discussion revolves around the rank of a matrix A with a reduced QR-decomposition, specifically focusing on the relationship between the number of nonzero diagonal elements of matrix R and the rank of matrix A. The scope includes theoretical aspects of linear algebra.

Discussion Character

  • Debate/contested

Main Points Raised

  • One participant argues that if matrix A has a reduced QR-decomposition with R having j nonzero diagonal elements, then the rank of A is exactly j.
  • Another participant questions the precision of the claim regarding R having "j nonzero diagonal elements," suggesting it could also mean "at least j nonzero elements."
  • A different participant supports the claim that A's rank should be exactly j, explaining that the remaining columns in Q associated with the zero-valued elements of R span A's null space.
  • It is noted that rank(A) equals rank(QR) equals rank(R), with the rank of R being j.
  • One participant points out that the statement about Q covering the full basis is imprecise, clarifying that Q is an invertible orthogonal (or unitary) matrix, which is sufficient for the argument.

Areas of Agreement / Disagreement

Participants express disagreement regarding whether the rank of A is at least j or exactly j, with some supporting the latter view while others raise questions about the precision of the definitions involved.

Contextual Notes

The discussion highlights potential ambiguities in the definitions of nonzero diagonal elements and the implications for the rank of matrix A. There are unresolved nuances regarding the interpretation of the QR-decomposition and its relationship to the rank.

Vikt0r
Messages
1
Reaction score
0
Hi
I am arguing with a friend about the following:
He claims that if a mxn matrix A, m>=n has a reduced QR-decomposition where R has j nonzero diagonal elements, then the rank of A is at least j. I claim that it is exactly j.
It was some years ago since i read linear algebra so i was hoping someone here could help us out.
 
Physics news on Phys.org


Vikt0r said:
Hi
where R has j nonzero diagonal elements

Do you really mean what you wrote? Or you mean "exactly j nonzero diagonal elements?" Because, being precise, your condition can be also understood as "where R has at least j nonzero elements, perhaps more".
 


Yes, A's rank should be exactly j. In a full decomposition the remaining columns in Q associated with the zero-valued R's should span A's null space. Combined they (all of Q) covers the full m space, which of course makes sense since Q is an orthonormal basis.
 


Another way to put it is that: rank(A) = rank(QR) = rank(R), since Q covers the full basis. And the rank of R is j.
 


Then, you are right. To say "Q covers the full basis" is a little bit not quite precise. Q is an orthogonal (or unitary) matrix, thus, in particular, invertible. That is all you need.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 17 ·
Replies
17
Views
7K