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.

7.7 Eichler’s pro<strong>of</strong> <strong>of</strong> Campbell–Baker–Hausdorff 157<br />

Relations (6) and (7) allow us to pass from polynomials in A, B to<br />

polynomials in A/2, B/2, paving the way for another application <strong>of</strong> fact 3<br />

and a new relation, between F n (A,B) and itself.<br />

Relation (6) allows us to rewrite the two terms on the right side <strong>of</strong> (7)<br />

as follows:<br />

F n (A/2,B) ≡ <strong>Lie</strong> F n (A/2,B/2) − F n (A/2 + B,−B/2) by (6)<br />

≡ <strong>Lie</strong> F n (A/2,B/2)+F n (A/2 + B/2,B/2) by (3)<br />

≡ <strong>Lie</strong> 2 −n F n (A,B)+2 −n F n (A + B,B) by fact 3,<br />

F n (−A/2,A + B)<br />

≡ <strong>Lie</strong> F n (−A/2,A/2+B/2)−F n (A/2+B,−A/2−B/2) by (6)<br />

≡ <strong>Lie</strong> − F n (A/2,B/2)+F n (B/2,A/2 + B/2) by (4) and (3)<br />

≡ <strong>Lie</strong> − 2 −n F n (A,B)+2 −n F n (B,A + B) by fact 3.<br />

So (7) becomes<br />

F n (A,B) ≡ <strong>Lie</strong> 2 1−n F n (A,B)+2 −n F n (A + B,B) − 2 −n F n (B,A + B),<br />

and, with the help <strong>of</strong> (5), this simplifies to<br />

(1 − 2 1−n )F n (A,B) ≡ <strong>Lie</strong> 2 −n (1 +(−1) n )F n (A + B,B). (8)<br />

If n is odd, (8) already shows that F n (A,B) ≡ <strong>Lie</strong> 0.<br />

If n is even, we replace A by A − B in (8), obtaining<br />

Theleftside<strong>of</strong>(9)<br />

(1 − 2 1−n )F n (A − B,B) ≡ <strong>Lie</strong> 2 1−n F n (A,B). (9)<br />

(1 − 2 1−n )F n (A − B,B) ≡ <strong>Lie</strong> − (1 − 2 1−n )F n (A,−B) by (3),<br />

so, making this replacement, (9) becomes<br />

2 1−n<br />

− F n (A,−B) ≡ <strong>Lie</strong><br />

1 − 2 1−n F n(A,B). (10)<br />

Finally, replacing B by −B in (10), we get<br />

2 1−n<br />

−F n (A,B) ≡ <strong>Lie</strong><br />

1 − 2 1−n F n(A,−B)<br />

( ) 2<br />

1−n 2<br />

≡ <strong>Lie</strong> −<br />

1 − 2 1−n F n (A,B) by (10),<br />

and this implies F n (A,B) ≡ <strong>Lie</strong> 0, as required.<br />

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

Saved successfully!

Ooh no, something went wrong!