Why Is QQ^T Singular for a Matrix with Orthonormal Columns?

  • Context: Undergrad 
  • Thread starter Thread starter hotvette
  • Start date Start date
  • Tags Tags
    Columns Matrix
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
5 replies · 6K views
Messages
1,001
Reaction score
11
If Q is an m x n (m > n) matrix with orthonormal columns, we know that [itex]Q^TQ = I[/itex] of dimension n x n. I have a question about [itex]QQ^T[/itex]. It is a symmetric m x m matrix but also appears to be singular. Why would it be singular? Probably something basic I've long since forgotten.
 
Physics news on Phys.org
hotvette said:
If Q is an m x n (m > n) matrix with orthonormal columns, we know that [itex]Q^TQ = I[/itex] of dimension n x n. I have a question about [itex]QQ^T[/itex]. It is a symmetric m x m matrix but also appears to be singular. Why would it be singular? Probably something basic I've long since forgotten.
Why do you say it "appears to be singular"? You can take Q= I as a matrix with orthonormal matrix such that [itex]QQ^T[/itex] is not singular.
 
Thanks for your reply. I'm dealing specifically with non-square matrices with more rows than columns where I'm trying to factor [itex]QQ^T[/itex] using QR or SVD. The result is always nonsense so I tried an experiment by generating random non-square matrices with orthonormal columns and in all cases [itex]QQ^T[/itex] had condition numbers ~1E15 and the factorization routines broke down. I figured there must be some rule or axiom I'd forgotten.

This came up when trying to simplify the matrix equation [itex]A^TDAx = A^Tb[/itex] where A is non-square with more rows than columns and D is diagonal. If A is factored into QR the simplification gets stalled because I end up with [itex]QQ^T[/itex] on both sides and can't go further.

The broader question is whether [itex]A^TDAx = A^Tb[/itex] can be solved for x without having to carry out the matrix multiplications [itex]A^TDA[/itex], where A is non-square with more rows than columns and D is diagonal.
 
Last edited:
I managed to answer the broader question after realizing I made a goof in the equation. It really is ATDAx = ATDb and can be readily solved by letting B = D1/2A. The problem is then BTBx = BTD1/2b which is easy to solve.

On the other question, I'm still curious whether a generalization can be made about the nature of QQT in the case where Q is rectangular (m > n) and has orthonormal columns. I've scoured my linear algebra texts and can't find any statements about this.
 
hotvette said:
If Q is an m x n (m > n) matrix with orthonormal columns, we know that [itex]Q^TQ = I[/itex] of dimension n x n. I have a question about [itex]QQ^T[/itex]. It is a symmetric m x m matrix but also appears to be singular. Why would it be singular? Probably something basic I've long since forgotten.

[itex]QQ^T[/itex] has rank n, so if n < m then it is singular.
 
Thanks. Actually, I realized it doesn't matter that the columns are orthonormal. I found the relation I was looking for:

rank(A) = rank(ATA) = rank(AAT)

It makes intuitive sense since you aren't adding any information by forming the matrix products.

http://en.wikipedia.org/wiki/Rank_(linear_algebra )
 
Last edited by a moderator: