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.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Back
Top