18.06.28: Complex vector spaces Lecturer: Barwick

advertisement
18.06.28: Complex vector
spaces
Lecturer: Barwick
I worked so hard to understand it that it must be true.
— James Richardson
18.06.28: Complex vector spaces
From last time …
I was alluding to a way to make complex multiplication easier to understand.
The idea is this: for any ๐‘ง = ๐‘Ž + ๐‘๐‘– ∈ C, you may consider the matrix
๐‘€๐‘ง = (
๐‘Ž −๐‘
).
๐‘ ๐‘Ž
On the newest problem set, you’ll show that addition of complex numbers is
addition of these matrices, multiplication of complex numbers is multiplication of these matrices (!), and one more thing …
18.06.28: Complex vector spaces
Complex conjugation is the map ๐‘ง
You’ll see that ๐‘€๐‘ง = ๐‘€๐‘งโŠบ .
๐‘ง that carries ๐‘ง = ๐‘Ž + ๐‘๐‘– to ๐‘ง = ๐‘Ž − ๐‘๐‘–.
Complex conjugation can be used to extract the real and complex parts of
your complex number:
2๐‘Ž = ๐‘ง + ๐‘ง;
2๐‘๐‘– = ๐‘ง − ๐‘ง.
18.06.28: Complex vector spaces
Complex conjugation also gives you the length of the vector ~๐‘ฃ ∈ R2 corresponding to ๐‘ง ∈ C:
โ€–~๐‘ฃโ€–2 = ๐‘ง๐‘ง.
So
๐‘ง = √๐‘ง๐‘ง exp(๐‘–๐œƒ)
for some (and hence infinitely many) ๐œƒ ∈ R.
If ๐‘ง ≠ 0, there is a unique such ๐œƒ ∈ [0, 2๐œ‹); this is sometimes called the
argument of ๐‘ง, but it’s annoying to write down a good formula. It’s better to
think of it as an element of R/2๐œ‹Z.
18.06.28: Complex vector spaces
One last general thing about the complex numbers, just because it’s so important.
Theorem (“Fundamental theorem of algebra”). For any polynomial
๐‘›
๐‘“(๐‘ง) = ∑ ๐›ผ๐‘– ๐‘ง๐‘–
๐‘–=0
with complex coefficients ๐›ผ๐‘– such that ๐›ผ๐‘› ≠ 0, there exist complex numbers
๐‘ค1 , … , ๐‘ค๐‘› such that
๐‘“(๐‘ง) = ๐›ผ๐‘› (๐‘ง − ๐‘ค1 )(๐‘ง − ๐‘ค2 ) โ‹ฏ (๐‘ง − ๐‘ค๐‘› ).
This is actually a theorem of topology, not algebra, but there you go.
18.06.28: Complex vector spaces
Here’s a cool example: ๐‘“(๐‘ง) = ๐‘ง๐‘› − 1. Let’s find the roots!
18.06.28: Complex vector spaces
The set C๐‘› is the set of column vectors
๐‘ง1
๐‘ง
๐‘ฃ=( 2 )
โ‹ฎ
๐‘ง๐‘›
with ๐‘ง๐‘– ∈ C. One can add such vectors componentwise, and one can multiply
any such vector with a complex scalar.
So this is the fundamental example of a complex vector space.
18.06.28: Complex vector spaces
Note that R๐‘› ⊂ C๐‘› . Now if ๐‘ฃ ∈ C๐‘› , then ๐‘ฃ = ๐‘ฃ if and only if ๐‘ฃ ∈ R๐‘› .
18.06.28: Complex vector spaces
More generally, a complex vector subspace ๐‘‰ ⊆ C๐‘› is a subset such that:
(1) for any ๐‘ฃ, ๐‘ค ∈ ๐‘‰, one has ๐‘ฃ + ๐‘ค ∈ ๐‘‰;
(2) for any ๐‘ฃ ∈ ๐‘‰ and any ๐‘ง ∈ C, one has ๐‘ง๐‘ฃ ∈ ๐‘‰.
18.06.28: Complex vector spaces
Vectors ๐‘ฃ1 , … , ๐‘ฃ๐‘˜ span a vector subspace ๐‘‰ ⊆ C๐‘› over C if and only if every
vector ๐‘ค ∈ ๐‘‰ can be written as a C-linear combination of the ๐‘ฃ๐‘– , i.e.,
๐‘˜
๐‘ค = ∑ ๐‘ง๐‘– ๐‘ฃ๐‘– ,
๐‘–=1
where each ๐‘ง๐‘– ∈ C.
18.06.28: Complex vector spaces
Similarly, the vectors ๐‘ฃ1 , … , ๐‘ฃ๐‘˜ are linearly independent over C if and only if
any vanishing C-linear combination
๐‘˜
∑ ๐‘ง๐‘– ๐‘ฃ๐‘– = 0
๐‘–=1
is a trivial C-linear combination, so that ๐‘ง1 = โ‹ฏ = ๐‘ง๐‘˜ = 0.
A C-basis of ๐‘‰ is thus a collection of vectors of ๐‘‰ that is linearly independent
over C and spans ๐‘‰ over C.
18.06.28: Complex vector spaces
Let’s do an example to appreciate the distinction. Let’s think of C2 , and let’s
think of the complex line
๐ฟ = {(
๐‘ง
) ∈ C2 | 3๐‘ง − 2๐‘ค = 0} ⊂ C2 .
๐‘ค
Now C2 ≅ R4 , so that complex line is a real plane:
{
{
{
{
๐ฟ = {(
{
{
{
{
๐‘ง1
}
}
| 3๐‘ง − 2๐‘ค = 0 }
}
๐‘ง2
|
1
1
) ∈ R4 |
⊂ R4 .
| 3๐‘ง2 − 2๐‘ค2 = 0 }
}
๐‘ค1
}
}
๐‘ค2
|
}
18.06.28: Complex vector spaces
The single vector (
2
) forms a C-basis of ๐ฟ.
3
Another legit C-basis would be the single vector (
The vectors
{
{
{
{
(
{
{
{
{
{
forms an R-basis of ๐ฟ over R.
2
0
),(
3
0
0
}
}
}
}
2
)}
}
0
}
}
3
}
2๐‘–
).
3๐‘–
18.06.28: Complex vector spaces
Another example: consider the complex vector subspace ๐‘Š ⊂ C2 spanned by
๐‘–
( ).
1
Here’s an important sentence to parse correctly: ๐‘Š does not have a C-basis
consisting of real vectors.
0
1
A real basis for ๐‘Š ⊂ R4 consists of ( ) and (
1
0
−1
0
)
0
1
18.06.28: Complex vector spaces
Proposition. Any complex vector subspace ๐‘Š ⊂ C๐‘› of complex dimension ๐‘˜
has an underlying real vector space of dimension 2๐‘˜.
To see why, take a C-basis {๐‘ค1 , … , ๐‘ค๐‘˜ } of ๐‘Š. Now {๐‘ค1 , ๐‘–๐‘ค1 , … , ๐‘ค๐‘˜ , ๐‘–๐‘ค๐‘˜ } is an
R-basis of ๐‘Š.
18.06.28: Complex vector spaces
In the other direction, a real vector subspace ๐‘‰ ⊆ R๐‘› generates a complex
vector subspace ๐‘‰C ⊆ C๐‘› , called the complexification; this is the set of all
C-linear combinations of elements of ๐‘‰:
๐‘˜
๐‘‰C โ‰” {๐‘ค ∈ C๐‘› | ๐‘ค = ∑ ๐›ผ๐‘– ๐‘ฃ๐‘– , for some ๐›ผ1 , … , ๐›ผ๐‘˜ ∈ C, ๐‘ฃ1 , … , ๐‘ฃ๐‘˜ ∈ ๐‘‰} .
๐‘–=1
Note that not all complex vector subspaces of C๐‘› are themselves complexifi๐‘–
cations; the complex vector subspace ๐‘Š ⊂ C2 spanned by ( ) provides a
1
counterexample. (A complex vector space is a complexification if and only if
it has a C-basis consisting of real vectors.)
18.06.28: Complex vector spaces
Now, most importantly, we may speak of complex matrices (i.e., matrices with
complex entries).
All the algebra we’ve done with matrices over R works perfectly for matrices over
C, without change.
18.06.28: Complex vector spaces
However, the freedom to contemplate complex matrices offers us new horizons when it comes to questions about eigenspaces and diagonalization. Let’s
contemplate the matrix
0 −1
๐ด=(
).
1 0
The characteristic polynomial ๐‘๐ด (๐‘ก) = ๐‘ก 2 + 1 doesn’t have any real roots, so
there’s no hope of diagonalizing ๐ด over R.
Over C, however, we find eigenvalues ๐‘–, −๐‘–. Let’s try to diagonalize ๐ด.
18.06.28: Complex vector spaces
Let’s begin with ๐ฟ๐‘– = ker(๐‘–๐ผ − ๐ด) = ker (
spanned by the vector (
And ๐ฟ−๐‘– = ker (
๐‘– 1
). It’s dimension 1, and it’s
−1 ๐‘–
1
).
−๐‘–
−๐‘– 1
1
) is dimension 1 and spanned by ( ).
−1 −๐‘–
๐‘–
18.06.28: Complex vector spaces
Note that neither ๐ฟ๐‘– nor ๐ฟ−๐‘– is a complexification. However, we do have a basis
1
1
{(
) , ( )} of C2 consisting of eigenvectors of ๐ด, and writing ๐‘‡๐ด in
−๐‘–
๐‘–
terms of this basis gives us the matrix
(
๐‘– 0
).
0 −๐‘–
So ๐ด is not diagonalizable over R, but it is diagonalizable over C.
18.06.28: Complex vector spaces
There’s one more new thing you can do with a complex matrices that doesn’t
quite work for real matrices: you can conjugate their entries. Of particular
import is the conjugate transpose:
โŠบ
๐ด∗ โ‰” (๐ด) = (๐ดโŠบ ).
We’ll understand the significance of this operation next time.
Download