* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download complexification of vector space
Survey
Document related concepts
Symmetric cone wikipedia , lookup
Orthogonal matrix wikipedia , lookup
System of linear equations wikipedia , lookup
Cayley–Hamilton theorem wikipedia , lookup
Singular-value decomposition wikipedia , lookup
Perron–Frobenius theorem wikipedia , lookup
Exterior algebra wikipedia , lookup
Jordan normal form wikipedia , lookup
Euclidean vector wikipedia , lookup
Matrix multiplication wikipedia , lookup
Laplace–Runge–Lenz vector wikipedia , lookup
Covariance and contravariance of vectors wikipedia , lookup
Vector space wikipedia , lookup
Eigenvalues and eigenvectors wikipedia , lookup
Transcript
complexification of vector space∗ stevecheng† 2013-03-21 19:28:32 0.1 Complexification of vector space If V is a real vector space, its complexification V C is the complex vector space consisting of elements x + iy, where x, y ∈ V . Vector addition and scalar multiplication by complex numbers are defined in the obvious way: (x + iy) + (u + iv) = (x + u) + i(y + v) , (α + iβ)(x + iy) = (αx − βy) + i(βx + αy), x, y, u, v ∈ V x, y ∈ V, α, β ∈ R . If v1 , . . . , vn is a basis for V , then v1 + i0, . . . , vn + i0 is a basis for V C . Naturally, x + i0 ∈ V C is often written just as x. So, for example, the complexification of Rn is (isomorphic to) Cn . 0.2 Complexification of linear transformation If T : V → W is a linear transformation between two real vector spaces V and W , its complexification T C : V C → W C is defined by T C (x + iy) = T x + iT y . It may be readily verified that T C is complex-linear. If v1 , . . . , vn is a basis for V , w1 , . . . , wm is a basis for W , and A is the matrix representation of T with respect to these bases, then A, regarded as a complex matrix, is also the representation of T C with respect to the corresponding bases in V C and W C . So, the complexification process is a formal, coordinate-free way of saying: take the matrix A of T , with its real entries, but operate on it as a complex matrix. The advantage of making this abstracted definition is that we are not required to fix a choice of coordinates and use matrix representations when otherwise there is no need to. For example, we might want to make arguments ∗ hComplexificationOfVectorSpacei created: h2013-03-21i by: hstevechengi version: h37249i Privacy setting: h1i hDefinitioni h15A04i h15A03i † This text is available under the Creative Commons Attribution/Share-Alike License 3.0. You can reuse this document or portions thereof only if you do so under terms that are compatible with the CC-BY-SA license. 1 about the complex eigenvalues and eigenvectors for a transformation T : V → V , while, of course, non-real eigenvalues and eigenvectors, by definition, cannot exist for a transformation between real vector spaces. What we really mean are the eigenvalues and eigenvectors of T C . Also, the complexification process generalizes without change for infinitedimensional spaces. 0.3 Complexification of inner product Finally, if V is also a real inner product space, its real inner product can be extended to a complex inner product for V C by the obvious expansion: hx + iy, u + ivi = hx, ui + hy, vi + i(hy, ui − hx, vi) . It follows that kx + iyk2 = kxk2 + kyk2 . 0.4 Complexification of norm More generally, for a real normed vector space V , the equation kx + iyk2 = kxk2 + kyk2 can serve as a definition of the norm for V C . References [1] Vladimir I. Arnol’d. Ordinary Differential Equations. Springer-Verlag, 1992. 2