Finding an inner product for an orthonormal basis

$\begingroup$

I'm working through a question that I don't quite know how to get.

It is: Find an inner product $\langle - , -\rangle$ on $\mathbb{R} ^3$, and a matrix A such that $\langle u, v \rangle = u^\top Av$ such that, with respect to $\langle - , -\rangle$, the basis $\biggl \{(1, 1, 0)^\top , (1, 0, 1)^\top , (0, 1, 1)^\top\biggr\} $ is orthonormal.

So, normally if I had an inner product that I was looking to find the orthonormal basis for I'd use the Gram-Schmidt process and divide by the norms. However, it doesn't seem as if you can use that process in reverse. I'm not looking for an answer in any way, more of how I'd get started on working this through.

$\endgroup$

2 Answers

$\begingroup$

Start by finding three vectors, each of which is orthogonal to two of the given basis vectors and then try and find a matrix $A$ which transforms each basis vector into the vector you've found orthogonal to the other two. This matrix gives you the inner product.

I would first work out the matrix representation $A'$ of the inner product with respect to the given basis, because then the columns of $A'$ are just the vectors that you've already found (since you want to transform each basis element into each of these vectors). It is important that you express the vectors you've found in terms of the basis given, and not the standard basis for this part.

Once you've done this, we can relate $A$ and $A'$ by $A = P^{\dagger}A'P$ where $P$ is the change of basis matrix from the given basis to the standard basis.

$\endgroup$ 3 $\begingroup$

Let $u_1^\top = (1, 1, 0)^\top$ , $u_2^\top = (1, 0, 1)^\top $, $u_3^\top = (0, 1, 1)^\top $, and let $B$ the matrix $[u_1\ u_2\ u_3]$ and $A = (B B^\top)^{-1}$. $ u_i^\top A^{-1} u_j = (B^{-1}u_i )^\top B^{-1}u_j = e_i^\top e_j = \delta_{ij}.$ This generalizes to an arbitrary basis.

$\endgroup$

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password

Post as a guest

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

You Might Also Like