## Adjoints: A Detailed Example of the Conjugate Transpose Property.

### July 24, 2010

My next post is going to be this nice proof of the fact that if we have for some linear map for is a nontrivial finite vector space, then is really easy to find: it’s simply the *conjugate transpose *of . This is exactly what it sounds like: we find the transpose of (by switching with for all and ) and then replacing every element in the matrix with its conjugate. I guess the notation should be . Which is pretty complicated looking, but it’s really not hard to do at all. In fact, the point of this post is to give a detailed example. Actually, let’s do two examples, and you’re going to find that half of the time this is much easier to do than what I’ve said above.

## Example 1: A Real Space.

Let’s let our vector space be with the standard basis, and let’s let our linear map be defined by . So, what’s the matrix for this? Well, let’s write out where the basis elements go.

and so our matrix is

which is a pretty cute matrix, all things considered. Now, let’s do this the hard way: what is ? Let’s figure this crap out. Fix , and then

.

So we have to define our .

Let’s see if this jives with our crazy conjugate transpose idea.

What was our matrix again? Oh, right.

Now what’s the conjugate transpose?

So what should we have our transpose do? Let’s tease this out. This matrix implies:

which means that, in general,

and, what! Look at that! It’s the *same thing we got from before*! Is it magic? Sort of. But note that we didn’t really do any conjugating in this example, since, you know. Real stuff doesn’t change when you conjugate it.

Maybe we should do an example where you need to conjugate things then. Complex stuff. Yeah. Good idea.

## Example 2: Complex Stuff.

I just want to note, before doing this, that it was *extremely *difficult finding an actual example of this being done the “long way.” In fact, I found *no examples* of this being done the long way, so I needed to kind of “invent” my own way of doing this. Therefore, as a caveat, note that my method may differ from those which you have seen before. But it may not. I don’t know.

We will be using the vector space and the linear map defined by . Okay? Okay.

First, because this was really weird to do, let’s talk about . Our standard basis for the complex vector space is the same as the standard basis for ; explicitly, it is .

Look at those basis elements for a second. What do they correspond to? Well, if we consider a point then corresponds to the** real part **of** ** and, similarly, corresponds to the **imaginary part** of . The other two correspond to the real and imaginary parts, respectively, of . So, let’s start doing that thing with the basis elements acted on by the linear map so that we can make . Note that if we have , I will call the spot occupied by the “first complex coordinate” and I’ll call the spot occupied by the “second complex coordinate.” Notice that in the first complex coordinate, there is the “real part” and the “imaginary part,” and similarly for the second complex coordinate.

Note that this says, “where does the real part of go? It goes to the second complex coordinate in the real spot, as it is, itself, real.”

This says, “where does the imaginary part of go? It goes to the second complex coordinate in the imaginary spot, as it is, itself, imaginary.”

Here it gets a little tricky. Where does the real part of the second complex coordinate go? Well, the second complex coordinate goes into the first complex coordinate, but it is multiplied by and so it becomes imaginary. Therefore, we put the real part of the second complex coordinate into the imaginary part of the first complex coordinate. In addition to this, it also goes to the second complex coordinate in the real part, since we’re not multiplying it by in the second coplex coordinate.

This is the last part. Where does the imaginary part of the second complex coordinate go? Well, it goes into the first complex coordinate, but since we must multiply it by it become real but we must multiply it by since we have that . Similarly, it must go into the second complex coordinate, in the imaginary spot.

If you’ve followed all that, congratulations. It’s not all that easy, but after doing it for a bit, it gets really intuitive. Anyhow, this means that

which is a nice compact way to look at this.

Now, we do this the* long *way. This way becomes really irritating really fast, but in this case it isn’t too bad. Let’s do it. Fix . Also recall that complex conjugation is defined by .

and since we have

this implies that

Whew.

(Quick Note!)You might be a little stumped about the last part of the second-to-last line and how we got rid of that big nasty bar over all those other bars. Note that it follows easily if we quickly prove these two quick lemmas:

Quick Lemma 1: If we have , then .

Quick Proof.Write and with as we usu’ do. Then we have.

Quick Lemma 2: If we have , then .

Quick Proof.Write and as above. Then we have.

(End of Quick Note!)

Okay, so, let’s set up the matrix for above. We do the exact same thing as we did for the one above. Exact same thing. We find that we get the matrix (and do this yourself, it’s very magical!):

Now, look at the original matrix and compute the transpose conjugate (and, since we never used any complex variables in the matrix, this is just the transpose), and it should match up to the one we just got! Magical.

Let’s just note here that the longer process was tedious even for which is relatively “small” compared to some other spaces. I’m sure there’s a better way to do “the long way” of finding the adjoint, and when I find it, I’ll tell you. In the meantime, use the conjugate transpose theorem!

## Buyer Beware.

Last, note that this entire time we’ve been using orthonormal bases (quietly, but we’ve been doing it) and, in fact, this conjugate transpose theorem (which we will prove next post) *only works when we have an orthonormal bases*. So don’t just think we can apply this any-old-which-way. I want to emphasize, again, that the complex example is probably not done in the most efficient way, but, again, I could not find an example of it done elsewhere. If you find one, please comment and let me know!

I found one. Just letting you know.

xntzjex