Finding an orthonormal basis of V

Unredeemed
Messages
120
Reaction score
0
I've done most of this question apart from the very last bit. I have an answer to the very last bit, but it doesn't use any of my previously proved statements and I think they probably mean me to deduce from what I already have.

Homework Statement


Let V be the finite-dimensional vector space of 2 x 2 matrices with real entries.

State, without proof, the dimension of V as a real vector space. (done)

A real-valued function V x V is defined by:

<A|B> = tr((A^t)B) where A^t is the transpose of the matrix A.

Show that <A|B> defines an inner product on V. (done)

Show that, with respect to this inner product, any symmetric matrix is orthogonal to any antisymmetric matrix, and that the identity matrix is orthogonal to any matrix whose trace is zero. (done)

Find an orthonormal basis of V. (bit I can't do)


Homework Equations





The Attempt at a Solution



I thought I could just write down:

\begin{equation}
\begin{pmatrix}
1 & 0 \\
0 & 1
\end{pmatrix}
\end{equation}
\begin{equation}
\begin{pmatrix}
1 & 0 \\
0 & -1
\end{pmatrix}
\end{equation}
\begin{equation}
\begin{pmatrix}
0 & -1 \\
1 & 0
\end{pmatrix}
\end{equation}
\begin{equation}
\begin{pmatrix}
0 & 1 \\
1 & 0
\end{pmatrix}
\end{equation}

And then show that it's an orthonormal basis. But, this obviously doesn't use what I've already proved. How can I deduce it from what I already have?

Cheers.
 
Physics news on Phys.org
Why do you have to deduce it from the previous steps? And note that, while your examples are orthogonal, they aren't orthonormal, although that's easy to fix. What about the four matrices like this one$$
\begin{pmatrix} 1 & 0\\0 & 0\end{pmatrix}$$which might be slightly easier to show are a basis.
 
Unredeemed said:
And then show that it's an orthonormal basis. But, this obviously doesn't use what I've already proved. How can I deduce it from what I already have?
But you will need to use the function you showed was an inner product to show your choice of matrices form an orthonormal basis. Plus it looks like you already did use some of what you proved in choosing those matrices.
 
LCKurtz said:
Why do you have to deduce it from the previous steps? And note that, while your examples are orthogonal, they aren't orthonormal, although that's easy to fix. What about the four matrices like this one$$
\begin{pmatrix} 1 & 0\\0 & 0\end{pmatrix}$$which might be slightly easier to show are a basis.

Oh yeah, good point, they are only orthogonal.

vela said:
But you will need to use the function you showed was an inner product to show your choice of matrices form an orthonormal basis. Plus it looks like you already did use some of what you proved in choosing those matrices.

So, as LCKurtz suggested, I should just use the standard basis for V and show that <A|B>=0 for A≠B and 1 for A=B?
 
Unredeemed said:
Oh yeah, good point, they are only orthogonal.



So, as LCKurtz suggested, I should just use the standard basis for V and show that <A|B>=0 for A≠B and 1 for A=B?

Yes. Although your original matrices can be normalized to work too.
 
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...
Back
Top