Complexification, complex structures, and linear ordinary differential equations

Jordan Bell
April 3, 2014

1 Motivation

The solution of the initial value problem

x′⁢(t)=A⁢x⁢(t),x⁢(0)=x0∈ℝn,

where A is an n×n matrix over ℝ, is x⁢(t)=exp⁡(A⁢t)⁢x0. If we want to compute the solution and if A is diagonalizable, say A=P⁢D⁢P-1, we use

exp⁡(A⁢t)=exp⁡((P⁢D⁢P-1)⁢t)=P⁢exp⁡(D⁢t)⁢P-1.

Thus if the matrix A has complex eigenvalues, then although exp⁡(A⁢t)⁢x0∈ℝn, it may not be the case that P-1⁢x0∈ℝn. For example, if A=(0-110), then

D=(-i00i),P=(-ii11),P-1=12⁢(i1-i1).

For x0=(10),

P-1⁢x0=12⁢(i1-i1)⁢(10)=12⁢(i-i).

This is similar to how Cardano’s formula, which expresses the roots of a real cubic polynomial in terms of its coefficients, involves complex numbers and yet the final result may still be real.

In the following, unless I specify the dimension of a vector space, any statement about real vector spaces is about real vector spaces of finite or infinite dimension, and any statement about complex vector spaces is about complex vector spaces of finite or infinite dimension.

2 Direct sums

If V is a real vector space, a complex structure for V is an ℝ-linear map J:V→V such that J2=-idV.

If V is a real vector space and J:V→V is a complex structure, define a complex vector space VJ in the following way: let the set of elements of VJ be V, let addition in VJ be addition in V, and define scalar multiplication in VJ by

(a+i⁢b)⁢v=a⁢v+b⁢J⁢(v).

One checks that for α,β∈ℂ and v∈VJ we have (α⁢β)⁢v=α⁢(β⁢v), and thus that VJ is indeed a complex vector space with this definition of scalar multiplication.11 1 One should also verify that distributivity holds with this definition of scalar product; the other properties of a vector space are satisfied because VJ has the same addition as the real vector space V.

Let V be a real vector space, and define the ℝ-linear map J:V⊕V→V⊕V by

J⁢(v,w)=(-w,v).

J2=-idV⊕V. J is a complex structure on the real vector space V⊕V. The complexification of V is the complex vector space Vℂ=(V⊕V)J. Thus, Vℂ has the same set of elements as V⊕V, the same addition as V⊕V, and scalar multiplication

(a+i⁢b)⁢(v,w)=a⁢(v,w)+b⁢J⁢(v,w),

which gives

(a+i⁢b)⁢(v,w)=a⁢(v,w)+b⁢(-w,v)=(a⁢v,a⁢w)+(-b⁢w,b⁢v)=(a⁢v-b⁢w,a⁢w+b⁢v).

If the real vector space V has dimension n and if {e1,…,en} is a basis for V, then

{(e1,0),…,(en,0),(0,e1),…,(0,en)}

is a basis for the real vector space V⊕V. Let v∈Vℂ. Using the basis for the real vector space V⊕V, there exist

a1,…,an,b1,…,bn∈ℝ

such that

v = a1⁢(e1,0)+⋯⁢an⁢(en,0)+b1⁢(0,e1)+⋯+bn⁢(0,en)
= a1⁢(e1,0)+⋯+an⁢(en,0)+b1⁢J⁢(e1,0)+⋯+bn⁢J⁢(en,0)
= (a1+i⁢b1)⁢(e1,0)+⋯+(an+i⁢bn)⁢(en,0),

where in the last line we used the definition of scalar multiplication in Vℂ. One checks that the set {(e1,0),…,(en,0)} is linearly independent over ℂ, and therefore it is a basis for Vℂ. Hence

dimℂ⁡Vℂ=dimℝ⁡V.

3 Complexification is a functor

If V,W are real vector spaces and T:V→W is an ℝ-linear map, we define

Tℂ:Vℂ→Wℂ

by

Tℂ⁢(v1,v2)=(T⁢v1,T⁢v2);

this is a ℂ-linear map. Setting ιV⁢(v1,v2)=(v1,0) and ιW⁢(w1,w2)=(w1,0), Tℂ:Vℂ→Wℂ is the unique ℂ-linear map such that Tℂ∘ιV=ιW∘T.22 2 See Keith Conrad’s, https://kconrad.math.uconn.edu/blurbs/linmultialg/complexification.pdf

Complexification is a functor from the category of real vector spaces to the category of complex vector spaces:

(idV)ℂ⁢(v1,v2)=(idV⁢v1,idV⁢v2)=(v1,v2)=idVℂ⁢(v1,v2),

so (idV)ℂ=idVℂ, and if S:U→V and T:V→S are ℝ-linear maps, then

(T∘S)ℂ⁢(v1,v2)=(T⁢(S⁢v1),T⁢(S⁢v2))=Tℂ⁢(S⁢v1,S⁢v2)=Tℂ⁢(Sℂ⁢(v1,v2)),

so (T∘S)ℂ=Tℂ∘Sℂ.

4 Complexifying a complex structure

If V is a real vector space and J:V→V is a complex structure, then

(Jℂ)2⁢(v1,v2) = Jℂ⁢(J⁢v1,J⁢v2)
= (J2⁢v1,J2⁢v2)
= (-v1,-v2)
= -(v1,v2),

so (Jℂ)2=-idVℂ. Let

Ei={w∈Vℂ:Jℂ⁢w=i⁢w},E-i={w∈Vℂ:Jℂ⁢w=-i⁢w}.

If w∈Vℂ, then one checks that

w-i⁢Jℂ⁢w∈Ei,w+i⁢Jℂ⁢w∈E-i,

and

w=12⁢(w-i⁢Jℂ⁢w)+12⁢(w+i⁢Jℂ⁢w).

It follows that

Vℂ=Ei⊕E-i.

5 Complex structures, inner products, and symplectic forms

If V is a real vector space of odd dimension, then one can show that there is no linear map J:V→V satisfying J2=-idV, i.e. there does not exist a complex structure for it. On the other hand, if V has even dimension, let

{e1,…,en,f1,…,fn}

be a basis for the real vector space V, and define J:V→V by

J⁢ej=fj,J⁢fj=-ej.

Then J:V→V is a complex structure.

If V is a real vector space of dimension 2⁢n with a complex structure J, let e1≠0. Check that J⁢e1∉span⁢{e1}. If n>1, let

e2∉span⁢{e1,J⁢e1}.

Check that the set {e1,e2,J⁢e1,J⁢e2} is linearly independent. If n>2, let

e3∉span⁢{e1,e2,J⁢e1,J⁢e2}.

Check that the set {e1,e2,e3,J⁢e1,J⁢e2,J⁢e3} is linearly independent. If 2⁢i<2⁢n then there is some

ei+1∉span⁢{e1,…,ei,J⁢e1,…,J⁢ei}.

I assert that

{e1,…,en,J⁢e1,…,J⁢en}

is a basis for V.

Using the above basis {e1,…,en,J⁢e1,…,J⁢en} for V, let fi=J⁢ei, and define ⟨⋅,⋅⟩:V×V→ℝ by

⟨ei,ej⟩=δi,j,⟨fi,fj⟩=δi,j,⟨ei,fj⟩=0,⟨fi,ej⟩=0.

Check that this is an inner product on the real vector space V. Moreover,

⟨J⁢ei,J⁢ej⟩=⟨fi,fj⟩=δi,j=⟨ei,ej⟩,

and

⟨J⁢fi,J⁢fj⟩=⟨J2⁢ei,J2⁢ej⟩=⟨-ei,-ej⟩=⟨ei,ej⟩=δi,j=⟨fi,fj⟩,

and

⟨J⁢ei,J⁢fj⟩=⟨fi,-ej⟩=-⟨fi,ej⟩=0=⟨ei,fj⟩,

and

⟨J⁢fi,J⁢ej⟩=⟨-ei,fj⟩=-⟨ei,fj⟩=0=⟨fi,ej⟩.

Hence for any v,w∈V,

⟨J⁢v,J⁢w⟩=⟨v,w⟩.

We say that the complex structure J is compatible with the inner product ⟨⋅,⋅⟩, i.e. J:(V,⟨⋅,⋅⟩)→(V,⟨⋅,⋅⟩) is an orthogonal transformation.

A symplectic form on a real vector space V is a bilinear form ω:V×V→ℝ such that ω⁢(v,w)=-ω⁢(w,v), and such that if ω⁢(v,w)=0 for all w then v=0; we say respectively that ω is skew-symmetric and non-degenerate. If a real vector space V has a complex structure J, and ⟨⋅,⋅⟩ is an inner product on V that is compatible with J, define ω by

ω⁢(v,w)=⟨v,J-1⁢w⟩=⟨v,-J⁢w⟩=-⟨v,J⁢w⟩,

which is equivalent to

ω⁢(v,J⁢w)=⟨v,w⟩.

Using that the inner product is compatible with J and that it is symmetric,

ω⁢(v,w)=-⟨v,J⁢w⟩=-⟨J⁢v,J2⁢w⟩=-⟨J⁢v,-w⟩=⟨w,J⁢v⟩=-ω⁢(w,v),

so ω is skew-symmetric. If w∈V and ω⁢(v,w)=0 for all v∈V, then

-⟨v,J⁢w⟩=0

for all v∈V, and thus J⁢w=0. Since J is invertible, w=0. Thus ω is nondegenerate. Therefore ω is a symplectic form on V.33 3 Using the basis {e1,…,en,f1,…,fn} for V, fi=J⁢ei, we have ω⁢(ei,fj)=-⟨ei,J⁢fj⟩=-⟨ei,J2⁢ej⟩=-⟨ei,-ej⟩=⟨ei,ej⟩=δi,j, and ω⁢(ei,ej)=-⟨ei,J⁢ej⟩=-⟨ei,fj⟩=0,ω⁢(fi,fj)=0. A basis {e1,…,en,f1,…,fn} for a symplectic vector space that satisfies these three conditions is called a Darboux basis. We have

ω⁢(J⁢v,J⁢w)=-⟨J⁢v,J2⁢w⟩=-⟨J2⁢v,J3⁢w⟩=-⟨-v,-J⁢w⟩=-⟨v,J⁢w⟩=ω⁢(v,w).

We say that J is compatible with the sympletic form ω, namely, J:(V,ω)→(V,ω) is a symplectic transformation.

On the other hand, if V is a real vector space with symplectic form ω and J is a compatible complex structure, then ⟨⋅,⋅⟩:V×V→ℝ defined by

⟨v,w⟩=ω⁢(v,J⁢w)

is an inner product on V that is compatible with the complex structure J.

Suppose V is a real vector space with complex structure J:V→V and that h:VJ×VJ→ℂ is an inner product on the complex vector space VJ. Define g:V×V→ℝ by44 4 The letter h refers to a Hermitian form, i.e. an inner product on a complex vector space, and the letter g refers to the usual notation for a metric on a Riemannian manifold.

g⁢(v1,v2)=12⁢(h⁢(v1,v2)+h⁢(v1,v2)¯)=12⁢(h⁢(v1,v2)+h⁢(v2,v1)).

It is straightforward to check that g is an inner product on the real vector space V. Similarly, define ω:V×V→ℝ by

ω⁢(v1,v2)=i2⁢(h⁢(v1,v2)-h⁢(v1,v2)¯)=i2⁢(h⁢(v1,v2)-h⁢(v2,v1)).

It is apparent that ω is skew-symmetric. If ω⁢(v1,v2)=0 for all v1, then in particular ω⁢(i⁢v1,v1)=0, and so

h⁢(i⁢v1,v1)-h⁢(v1,i⁢v1)=0.

As h is a complex inner product,

i⁢h⁢(v1,v1)-i¯⁢h⁢(v1,v1)=0,

i.e.

2⁢i⁢h⁢(v1,v1)=0,

and thus h⁢(v1,v1)=0, which implies that v1=0. Therefore ω is nondegenerate, and thus ω is a symplectic form on the real vector space V. With these definitions of g and ω, for v1,v2∈VJ we have

h⁢(v1,v2)=g⁢(v1,v2)-i⁢ω⁢(v1,v2),

which writes the inner product on the complex vector space VJ using an inner product on the real vector space V and a symplectic form on the real vector space V; note that VJ has the same set of elements as V. Moreover, for v1,v2∈V we have

ω⁢(v1,J⁢v2) = i2⁢(h⁢(v1,J⁢v2)-h⁢(J⁢v2,v1))
= i2⁢(h⁢(v1,i⁢v2)-h⁢(i⁢v2,v1))
= i2⁢(-i⁢h⁢(v1,v2)-i⁢h⁢(v2,v1))
= g⁢(v1,v2).

5.1 Tensor products

Here we give another presentation of the complexification of a real vector space, this time using tensor products of real vector spaces. If you were satisfied by the first definition you don’t need to read this one; read this either if you are curious about another way to define complexification, if you want to see a pleasant application of tensor products, or if you didn’t like the first definition. Let V be a real vector space of dimension n. ℂ is a real vector space of dimension 2, and

V⊗ℝℂ

is a real vector space of dimension 2⁢n. If V has basis {e1,…,en}, then V⊗ℝℂ has basis {e1⊗1,…,en⊗1,e1⊗i,…,en⊗i}. Since every element of V⊗ℝℂ can be written uniquely in the form

v1⊗1+v2⊗i,v1,v2∈V,

one often writes

V⊗ℝℂ≅V⊕i⁢V;

here i⁢V is a real vector space that is isomorphic to V.

The complexification of V is the complex vector space Vℂ whose set of elements is V⊗ℝℂ, with the same addition as the real vector space V⊗ℝℂ, and with scalar multiplication defined by

α⁢(v⊗β)=v⊗(α⁢β),v∈V,α,β∈ℂ.

Let v∈Vℂ. Using the basis of the real vector space V⊗ℝℂ, there exist some

a1,…,an,b1,…,bn∈ℝ

such that

v = a1⁢e1⊗1+⋯+an⁢en⊗1+b1⁢e1⊗i+⋯+bn⁢en⊗i
= e1⊗(a1+i⁢b1)+⋯+en⊗(an+i⁢bn)
= (a1+i⁢b1)⁢e1⊗1+⋯+(an+i⁢bn)⁢en⊗1,

where in the last line we used the definition of scalar multiplication in Vℂ. One checks that the {e1⊗1,…,en⊗1} is linearly independent over ℂ, and hence that it is a basis for the complex vector space Vℂ, so Vℂ has dimension n over ℂ.

If V and W are real vector spaces and T:V→W is a linear map, define Tℂ:Vℂ→Wℂ by

Tℂ⁢(v⊗z)=(T⁢v)⊗z.

With this definition of Tℂ, one can check that complexification is a functor from the category of real vector spaces to the category of complex vector spaces.

6 Decomplexification

If V is a complex vector space, let Vℝ be the real vector space whose set of elements is V, in which addition is the same as addition in V, and in which scalar multiplication is defined by

a⁢v=(a+0⁢i)⁢v,a∈ℝ.

Because V is a complex vector space, it is apparent that Vℝ is a real vector space with this scalar multiplication. We call Vℝ the decomplexification of the complex vector space V.

If V has basis {e1,…,en} and v∈V, then there are a1+i⁢b1,…,an+i⁢bn∈ℂ such that

v=(a1+i⁢b1)⁢e1+⋯+(an+i⁢bn)⁢en=a1⁢e1+⋯+an⁢en+b1⁢(i⁢e1)+⋯+bn⁢(i⁢en).

One checks that

e1,…,en,i⁢e1,…,i⁢en

are linearly independent over ℝ, and hence are a basis for the real vector space Vℝ. Thus,

dimℝ⁡Vℝ=2⁢dimℂ⁡V.

If V is a complex vector space and T:V→V is a ℂ-linear map, define Tℝ:Vℝ→Vℝ by

Tℝ⁢v=T⁢v.

Because T is ℂ-linear it follows that Tℝ is ℝ-linear. Decomplexification is a functor from the category of complex vector spaces to the category of real vector spaces. Since decomplexification is defined simply by ignoring the fact that V is closed under multiplication by complex scalars and only using real scalars, decomplexification is called a forgetful functor

7 Complex conjugation in complexified vector spaces

If V is a real vector space, define σ:Vℂ→Vℂ by

σ⁢(v1,v2)=(v1,-v2).

We call σ complex conjugation in Vℂ. We have σ∘σ=idVℂ. If T:Vℂ→Vℂ is a ℂ-linear map, define Tσ:Vℂ→Vℂ by

Tσ⁢(w)=σ⁢(T⁢σ⁢(w)).

Tσ is a ℂ-linear map. It is a fact that if T:Vℂ→Vℂ is ℂ-linear, then Tσ=T if and only if there is some ℝ-linear S:V→V such that T=Sℂ. In words, a linear map on the complexification of a real vector space is equal to its own conjugate if and only if it is the complexification of a linear map on the real vector space.

The following are true statements:55 5 These are exercises from V. I. Arnold’s Ordinary differential equations, p. 122, §18.4, in Richard A. Silverman’s translation. (ℂn=(ℝn)ℂ)

  • •

    If T:ℂn→ℂn is a linear map, then

    exp(T)ℝ=exp(Tℝ),

    and

    exp(T)σ=exp(Tσ).
  • •

    If T:ℝn→ℝn is a linear map, then

    exp(T)ℂ=exp(Tℂ).
  • •

    If T:ℂn→ℂn is a linear map, then

    det⁡Tℝ=|det⁡T|2,

    and

    det⁡Tσ=det⁡T¯.
  • •

    If T:ℝn→ℝn is a linear map, then

    det⁡Tℂ=det⁡T.
  • •

    If T:ℂn→ℂn is a linear map, then

    Tr⁢(Tℝ)=Tr⁢T+Tr⁢Tσ,

    and

    Tr⁢Tσ=Tr⁢T¯.
  • •

    If T:ℝn→ℝn is a linear map, then

    Tr⁢Tℂ=Tr⁢T.

8 Linear ordinary differential equations over ℂ

Let A be an n×n matrix over ℂ. The solution of the initial value problem

z′⁢(t)=A⁢z⁢(t),z⁢(0)=z0∈ℂn,

is z⁢(t)=exp⁡(A⁢t).

If A has n distinct eigenvalues λ1,…,λn∈ℂ, then, with

Eλ={z∈ℂn:A⁢z=λ⁢z},

we have

ℂn=Eλ1⊕+⋯+⊕Eλn,

where each Eλk has dimension 1. For z∈Eλk,

exp⁡(A⁢t)⁢z=∑m=0∞tm⁢Am⁢zm!=∑m=0∞tm⁢λkm⁢zm!=eλk⁢t⁢z.

Let ξk∈Eλk be nonzero, 1≤k≤n. They are a basis for ℂn, so there are ck∈ℂ such that

z0=∑k=1nck⁢ξk.

Then

z⁢(t)=exp⁡(A⁢t)⁢z0=exp⁡(A⁢t)⁢∑k=1nck⁢ξk=∑k=1nck⁢exp⁡(A⁢t)⁢ξk=∑k=1nck⁢eλk⁢t⁢ξk.

Suppose that A is an n×n matrix over ℂ, that z0∈ℂn, that Aσ=A and that σ⁢(z0)=z0. The solution of the initial value problem

z′⁢(t)=A⁢z⁢(t),z⁢(0)=z0,

is z⁢(t)=exp⁡(A⁢t)⁢z0. We have, as exp(At)σ=exp((At)σ)=exp(At),

σ(z(t))=σ(exp(At)z0)=σ(exp(At)σ(z0))=exp(At)σz0=exp(At)z0=z(t).

Therefore, if Aσ=A and σ⁢(z0)=z0, then σ⁢(z⁢(t))=z⁢(t) for all t.

9 Linear ordinary differential equations over ℝ

Let A be an n×n matrix over ℝ and let x0∈ℝn. Let z0=(x0,0)∈ℂn=(ℝn)ℂ, and let z⁢(t)=(z1⁢(t),z2⁢(t)) be the solution of the initial value problem

z′⁢(t)=Aℂ⁢z⁢(t),z⁢(0)=z0∈ℂn.

As Aℂ is the complexification of a real linear map, (Aℂ)σ=Aℂ, and

σ⁢(z0)=σ⁢(x0,0)=(x0,-0)=(x0,0)=z0,

so σ⁢(z⁢(t))=z⁢(t), i.e. (z1⁢(t),z2⁢(t))=(z1⁢(t),-z2⁢(t)), so z2⁢(t)=0 for all t. But z′⁢(t)=(z1′⁢(t),z2′⁢(t)) and Aℂ⁢z⁢(t)=(A⁢z1⁢(t),A⁢z2⁢(t)), so

z1′⁢(t)=A⁢z1⁢(t)

for all t. Also, z⁢(0)=(z1⁢(0),z2⁢(0)) and z⁢(0)=z0=(x0,0), so z1⁢(0)=x0. Therefore, x⁢(t)=z1⁢(t) is the solution of the initial value problem

x′⁢(t)=A⁢x⁢(t),x⁢(0)=x0.

Thus, to solve an initial value problem in ℝn we can complexify it, solve the initial value problem in ℂn, and take the first entry of the solution of the complex initial value problem.

If A is an n×n matrix over ℝ, let

det⁡(A-x⁢I)=∑k=0nak⁢xk,ak∈ℝ,

its characteristic polynomial. The Cayley-Hamilton theorem states that

∑k=0nak⁢Ak=0.

Taking the complexification of this gives

∑k=0nak⁢(Aℂ)k=0.

It follows that the roots of det⁡(A-x⁢I) are the same as the roots of det⁡(Aℂ-x⁢Iℂ). A complex root of det⁡(A-x⁢I) is not an eigenvalue of A:ℝ2→ℝ2, but is indeed an eigenvalue of Aℂ:ℂ2→ℂ2, so the roots of the characteristic polynomial of A are the eigenvalues of Aℂ.

10 Linear ordinary differential equations in ℝ2

Let A be a 2×2 matrix over ℝ.66 6 This section follows Arnold, p. 132, §20.3. Suppose that the roots of the characteristic polynomial

det⁡(A-x⁢I)=det⁡A-x⁢Tr⁢A+x2

are λ,λ¯, i.e. that the roots of the characteristic polynomial are complex conjugate. Let λ=α+i⁢ω, ω≠0.77 7 Define J:ℝ2→ℝ2 by J=1ω⁢(A-α⁢I). We have J2=1ω2⁢(A2-2⁢α⁢A+α2⁢I). By the Cayley-Hamilton theorem, I⁢det⁡A-A⁢Tr⁢A+A2=0, so I⁢λ⁢λ¯-A⁢(λ+λ¯)+A2=0, and written using λ=α+i⁢ω this is I⁢(α2+ω2)-2⁢α⁢A+A2=0. Hence J2=-I, so J=1ω⁢(A-α⁢I) is a complex structure on ℝ2. λ is an eigenvalue for Aℂ, so let Aℂ⁢(v1,v2)=λ⁢(v1,v2), (v1,v2)≠0. Furthermore,

σ⁢(Aℂ⁢(v1,v2))=σ⁢(λ⁢(v1,v2)),

so

(Aℂ)σ⁢σ⁢(v1,v2)=λ¯⁢σ⁢(v1,v2),

hence, as (Aℂ)σ=Aℂ,

Aℂ⁢(v1,-v2)=λ¯⁢(v1,-v2).

Therefore (v1,-v2) is an eigenvector of Aℂ with eigenvalue λ¯≠λ, so (v1,-v2) and (v1,v2) are linearly independent over ℂ. If a1⁢v1+a2⁢v2=0, a1,a2∈ℝ, then

(a12-i⁢a22)⁢(v1,v2)+(a12+i⁢a22)⁢(v1,-v2)=0,

from which it follows that a1,a2=0. Therefore v1,v2∈ℝ2 are linearly independent over ℝ.

We have

(α+i⁢ω)⁢(v1,v2)=(α⁢v1-ω⁢v2,α⁢v1+ω⁢v2),

and

Aℂ⁢(v1,v2)=(A⁢v1,A⁢v2),

so

A⁢v1=α⁢v1-ω⁢v2,A⁢v2=α⁢v1+ω⁢v2,

and hence

A⁢(v1v2)=(α⁢v1-ω⁢v2α⁢v1+ω⁢v2)=(v1v2)⁢(αω-ωα).

Therefore

A=(v1v2)⁢(αω-ωα)⁢(v1v2)-1.