Proving Orthonormal Basis for an Orthogonal Matrix

abbasb
Messages
5
Reaction score
0

Homework Statement



Prove: if an n × n matrix A is orthogonal (column vectors are orthonormal), then the columns form an orthonormal basis for R^n.
(with respect to the standard Euclidean inner product [= the dot product]).

Homework Equations


None.


The Attempt at a Solution



I know that since the column vectors are orthonormal, all I have to show is that these vectors are also linearly independent and span R^n.

But I'm having some trouble showing this, so I was thinking about showing it through the basis coordinates:

u= <u, v1>v1 + <u, v2>v2 +...+ <u, vn>vn

But I think I have to start with assuming that the vectors v1, v2, ... vn form a basis. So I think that method can't work.
 
Physics news on Phys.org
Linear independence is what you want to show. That means c1*v1+c2*v2+...+cn*vn=0 (where vi are your orthonormal vectors and the ci are constants) only has the solution c1=c2=...=cn=0. Can you show that? Once you have that, any set of n linearly independent vectors in R^n is a basis.
 
I've been trying to figure out how, but I just can't seem to think of a way...anymore advice?
 
You assume c1*v1+c2*v2+...+cn*vn=0. What is vi.(c1*v1+...+cn*vn)? '.'=dot product. Use orthonormality.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top