Norm and Rows of Complex Matrix

Click For Summary
For an n x n matrix A with complex entries, if the condition ||Ax|| = ||x|| holds for any vector x in C^n, it implies that the rows of A form an orthonormal basis of C^n. The discussion highlights the challenge of demonstrating this property without excessive notation, focusing on the relationship between the norms and inner products of the rows. By considering specific choices for the vector x, such as columns of the adjoint of A, one can derive necessary conditions for orthonormality. The participants emphasize the importance of recognizing that the inner products of different rows must equal zero for the rows to be orthogonal. Ultimately, the conversation illustrates the connection between matrix properties and vector norms in complex spaces.
Yagoda
Messages
45
Reaction score
0

Homework Statement


I want to show that for an n x n matrix A with complex entries, if \left\|Ax\right\|=\left\|x\right\| for any vector x in C^n, then the rows of A are an orthonormal basis of C^n.


Homework Equations





The Attempt at a Solution

All I've managed to do so far is show that the columns of A all have length 1, which you can get by taking x to be e1. Is there a strategy of showing this for the rows and for showing orthogonality without having to write out the terms of the matrix multiplication Ax (I tried this and quickly became bogged down in notation)?
 
Physics news on Phys.org
Can you think of interesting choices for the vector x based on the elements of A?
 
I tried letting x be a column of the adjoint of A. This way when you multiply Ax, if your x is the ith column of the adjoint then the ith entry of the vector Ax is equivalent to the inner product <x,x>. But when you go to take the inner product <Ax,Ax> to find the norm of Ax I end up with a jumble of sums of entries of A being multiplied by each other so I'm not sure where to go from here. Am I on the right track?

Thanks.
 
Okay, suppose I'm setting x to be the first columns of the adjoint of A. Then when I take <Ax,Ax> the first term is <x,x>*<x,x> and the rest of the terms are the inner product of the first row of A with another term of A. Since we know that \left\|Ax\right\|=\left\|x\right\| is it too fast for me to make the jump to saying that <x,x> must equal 1 in order for ||Ax|| to equal ||x|| and subsequently all the other terms must be 0? It seems like there should be more justification in between those steps, but I can't seem to put my finger on it.
 
Yagoda said:
Okay, suppose I'm setting x to be the first columns of the adjoint of A. Then when I take <Ax,Ax> the first term is <x,x>*<x,x> and the rest of the terms are the inner product of the first row of A with another term of A.
Yes. If the row vectors of A are a1..an and x = a1T, you have <a1,a1>2+<a1,a2>2+... You know that <a1,a2>2 etc are non-negative, so...?
 
Ah, yes. I was getting bogged down in notation and missing the bigger picture. Thanks.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
2
Views
6K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
Replies
4
Views
2K