18.07.2014 Views

John Stillwell - Naive Lie Theory.pdf - Index of

John Stillwell - Naive Lie Theory.pdf - Index of

John Stillwell - Naive Lie Theory.pdf - Index of

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

5.6 Complexification 109<br />

Now we show why gl(n,C) is the complexification <strong>of</strong> u(n):<br />

gl(n,C)=M n (C)=u(n)+iu(n).<br />

It is clear that any member <strong>of</strong> u(n)+iu(n) is in M n (C). So it remains to<br />

show that any X ∈ M n (C) can be written in the form<br />

X = X 1 + iX 2 where X 1 ,X 2 ∈ u(n), (*)<br />

that is, where X 1 and X 2 are skew-Hermitian. There is a surprisingly simple<br />

waytodothis:<br />

X = X − X T<br />

+ i X + X T<br />

.<br />

2 2i<br />

We leave it as an exercise to check that X 1 = X−XT<br />

2<br />

and X 2 = X+X T<br />

2i<br />

satisfy<br />

T T<br />

X 1 + X 1 = 0 = X2 + X 2 , which completes the pro<strong>of</strong>.<br />

As a matter <strong>of</strong> fact, for each X ∈ gl(N,C) the equation (*) has a unique<br />

solution with X 1 ,X 2 ∈ u(n). One solves (*) by first taking the conjugate<br />

transpose <strong>of</strong> both sides, then forming<br />

X + X T = X 1 + X 1<br />

T + i(X2 − X 2<br />

T )<br />

= i(X 2 − X 2<br />

T ) because X1 + X 1<br />

T = 0<br />

= 2iX 2 because X 2 + X 2<br />

T = 0.<br />

X − X T T T<br />

= X 1 − X 1 + i(X2 + X 2 )<br />

T<br />

T<br />

= X 1 − X 1 because X 2 + X 2 = 0<br />

= 2X 1 because X 1 + X 1<br />

T = 0.<br />

Thus X 1 = X−XT<br />

2<br />

and X 2 = X+X T<br />

2i<br />

that satisfy (*).<br />

are in fact the only values X 1 ,X 2 ∈ u(n)<br />

SL(n,C) and its <strong>Lie</strong> algebra sl(n,C)<br />

The group SL(n,C) is the subgroup <strong>of</strong> GL(n,C) consisting <strong>of</strong> the n × n<br />

complex matrices A with det(A)=1. The tangent vectors <strong>of</strong> SL(n,C) are<br />

among the tangent vectors X <strong>of</strong> GL(n,C), but they satisfy the additional<br />

condition Tr(X)=0. This is because e X ∈ GL(n,C) and<br />

det(e X )=e Tr(X) = 1 ⇔ Tr(X)=0.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!