7.04 Homotopy lifting, monodromy

Below the video you will find accompanying notes and some pre-class questions.

Notes

Monodromy

(0.00) In the last couple of sections, we have seen the phenomenon of path-lifting for covering spaces p:YX: given a path γ in X and a point yp1(γ(0)) there exists a unique lifted path ˜γ in Y such that p˜γ=γ and ˜γ(0)=y.

(1.07) If I start with a loop γ in X then there is no guarantee that the lift ˜γ will be a loop: it might just be a path. This leads to the idea of monodromy. For example, if p:S1S1 is the double cover p(eiθ)=ei2θ then the path eiπt lifts the loop ei2πt.

(1.53) Given a loop γ in X based at x, define the monodromy around γ σγ to be the permutation σγ:p1(x)p1(x) defined by σγ(y)=˜γ(1),
where ˜γ is the unique lift of γ starting at y.

If γ1γ2 then σγ1=σγ2.

This will follow from the homotopy lifting lemma below.

Homotopy lifting lemma

(4.25) Suppose that p:YX is a covering map and that γs is a homotopy of paths rel endpoints in X (i.e. γs(0) and γs(1) are independent of s). Then, given a lift ˜γ0 of γ0, there exists a lifted homotopy ˜γs rel endpoints, that is a homotopy of ˜γ0 such that p˜γs=γs and such that ˜γs(0) and ˜γs(1) are independent of s.
(6.58) Let H:[0,1]×[0,1]X be the homotopy in X (i.e. γs(t)=H(s,t)). We can subdivide the square into rectangles Rij such that H(Rij)Uij for some elementary neighbourhood Uij. Here, the index i runs along the x-direction and the index j runs along the y-direction.

(9.06) The strategy to construct the lifted homotopy ˜H (such that ˜H(s,t)=˜γs(t)) is to pick local inverses qij:UijY for p and set ˜H|Rij=qijH|Rij. Certainly this defines a lift of H because p˜H=pqijH=H, however, we need to pick qij carefully to ensure that the map ˜H constructed in this way is continuous. We need to ensure that ˜H|Rij and ˜H|Rkl agree along the overlap RijRkl.

(11.13) For simplicity, let's imagine that we only have a two-by-two grid of squares. We will start by constructing q1j. To begin with, we know that ˜H(0,t)=˜γ0(t) for a given lift ˜γ0. This tells us which qij to use on the rectangles R11,R12: namely, q11:U11Y is the unique local inverse with q11(γ0(0))=˜γ0(0); q12:U12Y is the unique local inverse with q12(γ0(t1))=˜γ0(t1) where t1 is the value of the t-coordinate at the top of the rectangle R11.

(14.15) We need to check that the results ˜H11:=q11H and ˜H12:=q12H agree along the overlap R11R12 (which is an edge comprising points of the form (s,t1) with s[0,s1]). By construction, we have ˜H11(0,t1)=˜H12(0,t1)=˜γ0(t1) and the restrictions ˜H1j(s,t1) to the edge R11R12 define paths; these paths both lift H(s,t1) and have the same initial condition ˜H11(0,t1)=˜H12(0,t1). Therefore, by uniqueness of path-lifting, we have ˜H11(s,t1)=˜H12(s,t1) for all s[0,s1].

(18.02) We can do the same trick starting with ˜γs1 and extend our homotopy over R2j and, by induction, over the whole square.

(19.06) We need to check that ˜H is a homotopy rel endpoints, i.e. ˜H(s,0) and ˜H(s,1) should be constant. But ˜H(s,0) lifts H(s,0), which is constant. The constant lift is also a lift, so by uniqueness of path-lifting, it must agree with ˜H(s,0), which must therefore be constant. Similarly for ˜H(s,1).

Pre-class questions

  1. In the proof of the homotopy lifting lemma, why can we subdivide the square into rectangles Rij such that each H(Rij) is contained in an elementary neighbourhood?
  2. Why does monodromy around a loop depend only on the homotopy class of the loop?

Navigation

Comments, corrections and contributions are very welcome; please drop me an email at j.d.evans at lancaster.ac.uk if you have something to share.

CC-BY-SA 4.0 Jonny Evans.