## Unitary and Orthogonal Matrices

Let’s see what happens when we take a unitary or orthogonal transformation and turn it into a matrix by picking a basis for our vector space.

First a unitary transformation on a complex vector space. We pick a basis and set up the matrix

We can also set up the matrix for the adjoint

That is, the adjoint matrix is the conjugate transpose. This isn’t really anything new, since we essentially saw it when we considered Hermitian matrices.

But now we want to apply the unitarity condition that . It will make our lives easier here to just write out the sum over the basis in the middle and find

Now, this isn’t particularly useful on its face. I mean, what does that mess even *mean*? But if nothing else it tells us that we can describe unitary matrices in terms of (a lot of) equations involving only complex numbers. We can then pick out all the complex matrices which represent unitary transformations. They form the “unitary group” .

What about orthogonal matrices? Again, we pick a basis to get a matrix

and also a matrix for the adjoint

Here the adjoint matrix is just the transpose, not the conjugate transpose, since we’re working over a *real* inner product space. Then we can write down the orthogonality condition

Again, this doesn’t really seem to tell us much, but we can use these equations to cut out the matrices which represent orthogonal transformations from all real matrices. They form the “orthogonal group” .

But there’s something else we should notice here. The equations for the unitary group involved complex conjugation, so we need some structure like that to talk sensibly about unitarity. However, the orthogonality equations only involve basic field operations like addition and multiplication, and so these equations make sense over any field whatsoever. That is, given a field we can consider the collection of all matrices with entries in , and then impose the above orthogonality condition to cut out the matrices in the orthogonal group , while the first orthogonal group is .

One useful orthogonal group is . This is *not* the same as the unitary group , though it can be confusing to keep the two separate at first. The unitary group consists of matrices whose inverses are their *conjugate* transposes, instead of just their transposes for the complex orthogonal group. The unitary group preserves a sesquilinear inner product, which has a clear geometric interpretation we’ve been talking about. The orthogonal group preserves a bilinear form, which doesn’t have such a clear visual interpretation. They *are* related in a way, but we’ll be coming back to that subject much later on.

[...] choice of basis, we can just pick one arbitrarily and do our computations on matrices. And as we saw yesterday, adjoints are rather simple in terms of matrices: over real inner product spaces we take the [...]

Pingback by The Determinant of the Adjoint « The Unapologetic Mathematician | July 30, 2009 |

[...] Okay, we’ve got groups of unitary and orthogonal transformations (and the latter we can generalize to groups of matrices over arbitrary fields. These are defined by certain relations involving [...]

Pingback by The Determinant of Unitary and Orthogonal Transformations « The Unapologetic Mathematician | July 31, 2009 |

[...] Matrices and Orthonormal Bases I almost forgot to throw in this little observation about unitary and orthogonal matrices that will come in [...]

Pingback by Unitary and Orthogonal Matrices and Orthonormal Bases « The Unapologetic Mathematician | August 7, 2009 |

[...] of a vector space , including the particular case of the matrix group of the space . We also have defined the orthogonal group of matrices over whose transpose and inverse are the same, which is related [...]

Pingback by The Special Linear Group (and others) « The Unapologetic Mathematician | September 8, 2009 |