Beruflich Dokumente
Kultur Dokumente
Note: some of these solutions are a bit brief. You might want to write
more details when you are learning these things for the first time. Also, as
usual I didn’t have time to draw the pictures.
3. Let X = RP2 RP2 with the natural base point x0 , and let X
W e denote
the universal cover. Note that π1 (X, x0 ) acts on the left on X, e where
[f ] ∈ π1 (X, x0 ) sends [γ] ∈ X e to [f · γ]. Recall that the connected
covering corresponding to a subgroup G ⊂ π1 (X, x0 ) is obtained by
modding out X e by the restriction of this action to G.
1
To make use of the above, we first describe the universal covering X e of
X. As a topological space, X e can be identified with the subset of R3
consisting of radius 1 spheres centered at the points (2k + 1, 0, 0) for
k ∈ Z. Regarding RP2 as S 2 modulo the antipodal map, the covering
map sends the sphere centered at (4k + 1, 0, 0) to the first RP2 , and the
sphere centered at (4k + 3, 0, 0) to the second RP2 . We can take the
base point xe0 to be the origin.
Next, we compute the left π1 (X, x0 ) action on X.e Let a and b denote
2
the generators of π1 of the first and second RP ’s, respectively. Then
a reflects the whole picture through the point (1, 0, 0), while b reflects
through the point (−1, 0, 0). In particular, ab translates everything 4
units to the right.
We now determine the nontrivial subgroups G of π1 (X, x0 ) and the
corresponding covering spaces X. e If G does not contain a reflection,
k
then G is generated by (ab) for some positive integer k, so X e is a
cyclic chain of 2k spheres. Now suppose that G contains a reflection.
e is a half-infinite chain of spheres, with an RP2
If G has order 2, then X
attached to the end. If G also contains a translation (ab)k where the
positive integer k is as small as possible, then X e is a chain of k − 1
2
spheres with an RP attached to each end.
5. Let X
e be the “grid”
[
e := (Z × R)
X (R × Z) ⊂ R2
2
subgroup1 .
Now we need to find a free basis for π1 (X,
e xe0 ). Following the algorithm,
we choose the maximal spanning tree of X e consisting of the x-axis
together with all of the vertical lines. Each remaining edge connects a
pair of lattice points (m, n) and (m+1, n) where m ∈ Z and n ∈ Z\{0}.
This edge contributes the basis element
am bn ab−n a1−m .
In fact, one can do a change of basis to obtain the following nicer basis:
{[am , bn ] | m, n ∈ Z \ {0}}.
Rn Rm
' × Rn−m = T m × Rn−m .
span(e1 , . . . , em ) span(e1 , . . . , em )
to move all the a’s to the left and all the b’s to the right, at which point everything cancels.
What we’re really proving here is that the abelianization of F2 is Z2 , with the isomor-
phism sending f 7→ (m, n).
3
Namely, given f, g : [0, 1] → G with f (0) = f (1) = g(0) = g(1) = 1, define
H : [0, 1] × [0, 1] → G by H(s, t) := f (s) ? g(t), where ? denotes the group
operation in G. Then H sends the boundary of the square to the loop f ·g·f ·g,
and this is homotopic via H to a constant map, so [f ][g][f ]−1 [g]−1 = 1 in
π1 (G, 1).