MAS61015 Algebraic Topology

11. Homology of the punctured plane

Later we will prove that for all n≥2 we have

Hk⁢(ℝn∖{0})=Hk⁢(Sn−1)={ℤ if ⁢k=0⁢ or ⁢k=n−10 otherwise. 

For this we will need the Mayer-Vietoris sequence, which is a very important and useful tool, but it will take some work to set that up. In this section, we outline a different approach which is more direct and elementary but which works only for n=2. We will identify ℝ2 with ℂ and write ℂ×=ℂ∖{0}, so our main task will be to prove that H1⁢(ℂ×)=ℤ.

Video (Definition 11.2 to Theorem 11.11)

Definition 11.1.

Let z∈ℂ× be a nonzero complex number. This can be expressed as z=r⁢ei⁢θ for a unique pair or real numbers r,θ with r>0 and −π<θ≤π. We put plog⁡(z)=log⁡(r)+i⁢θ, and call this the principal logarithm of z.

Note that plog:ℂ×→ℂ and exp⁡(plog⁡(z))=z for all z, but plog is not continuous (because for small ϵ>0 we have plog⁡(−1+i⁢ϵ)≈i⁢π but plog⁡(−1−i⁢ϵ)≈−i⁢π). This cannot be fixed by adjusting the definitions: there is no continuous map f:ℂ×→ℂ with exp⁡(f⁢(z))=z for all z. To work around this we make the following definition:

Definition 11.2.

For any z∈ℂ× we put

LOG⁡(z)={z~∈ℂ|exp⁡(z~)=z}=plog⁡(z)+2⁢π⁢i⁢ℤ.

Any element of LOG⁡(z) will be called a logarithm of z. More generally, suppose we have a topological space T and a continuous map u:T→ℂ×. By a continuous logarithm of u we mean a continuous map u~:T→ℂ with exp∘u~=u, or equivalently u~⁢(t)∈LOG⁡(u⁢(t)) for all t.

Note that the cosets i⁢π+2⁢π⁢i⁢ℤ and −i⁢π+2⁢π⁢i⁢ℤ are the same, and that LOG⁡(−1+i⁢ϵ) is close to this coset for all small ϵ, independent of whether ϵ is positive or negative. Thus, LOG⁡(z) depends continuously on z even though plog⁡(z) does not.

Given a continuous map u:T→ℂ×, we could attempt to define a continuous logarithm of u by u~=plog∘u. This works provided that the image u⁢(T) does not touch the negative real axis where plog is discontinuous. If u⁢(T) does touch the negative real axis then it may be possible to find a continuous logarithm by a different method, but in some cases, no continuous logarithm exists.

Lemma 11.3.

Let u:[0,1]→ℂ× be continuous, and suppose that x∈LOG⁡(u⁢(0)). Then there is a unique continuous logarithm u~:[0,1]→ℂ with u~⁢(0)=x.

We will prove this properly later when we come to discuss covering maps.

Sketch proof.

If we choose N sufficently large, then when |s−t|≤1/N the points u⁢(s)/u⁢(t) will be close to 1 in ℂ× and so will be far from the negative real axis where plog is discontinuous. We can thus define

u~⁢(t)=x+∑k=1Nplog⁡(u⁢(k⁢tN)/u⁢((k−1)⁢tN)).

This is a continuous function of t. When t=0 we see that all the terms in the sum are plog⁡(u⁢(0)/u⁢(0))=plog⁡(1)=0, so u~⁢(0)=x. In general we have

exp⁡(u~⁢(t))=exp⁡(x).∏i=1Nu⁢(k⁢t/N)u⁢((k−1)⁢t/N)=u⁢(0).∏i=1Nu⁢(k⁢t/N)u⁢((k−1)⁢t/N),

and most of the terms in the product cancel out leaving only exp⁡(u~⁢(t))=u⁢(t). ∎

Corollary 11.4.

Let K⊆ℝN be convex, and suppose that k∈K. Let u:K→ℂ× be continuous, and suppose that x∈LOG⁡(u⁢(k)). Then there is a unique continuous logarithm u~:K→ℂ with u~⁢(k)=x. (In particular, this applies when K=Δd for some d.)

Sketch proof.

For m∈K we can define vm:[0,1]→ℂ× by vm⁢(t)=u⁢(t⁢m+(1−t)⁢k). By the lemma, there is a unique continuous logarithm v~m:[0,1]→ℂ with v~m⁢(0)=x. We define u~⁢(m)=v~m⁢(1), so exp⁡(u~⁢(m))=exp⁡(v~m⁢(1))=vm⁢(1)=u⁢(m). We have vk⁢(t)=u⁢(k) for all t so v~k must be the constant path at x so u~⁢(k)=v~k⁢(1)=x. With some work one can check that u~ is continuous. ∎

Definition 11.5.

Given any path u:Δ1→ℂ× we define

ω⁢(u)=(u~⁢(e1)−u~⁢(e0))/(2⁢π⁢i)∈ℂ,

where u~ is any continuous logarithm of u. (This is well-defined, because any two continuous logarithms differ by a constant of the form 2⁢n⁢π⁢i, and the constant cancels out when we calculate u~⁢(e1)−u~⁢(e0).) We then extend this linearly to get a homomorphism ω:C1⁢(ℂ×)→ℂ, given by

ω⁢(n1⁢u1+⋯+nr⁢ur)=n1⁢ω⁢(u1)+⋯+nr⁢ω⁢(ur).
Example 11.6.

The standard loop un:Δ1→ℂ× of winding number n is given by un⁢(1−t,t)=exp⁡(2⁢π⁢i⁢n⁢t). The obvious continuous logarithm is u~n⁢(t)=2⁢π⁢i⁢n⁢t, and using this we get ω⁢(un)=n.

Lemma 11.7.

For u:Δ2→ℂ× we have ω⁢(∂(u))=0. Thus, we have ω⁢(B1⁢(ℂ×))=0.

Proof.

For i=0,1,2 we put vi=u∘δi:Δ1→ℂ×, so ∂(u)=v0−v1+v2. By Corollary 11.4, we can choose a continuous logarithm u~:Δ2→ℂ for u. We then note that the map v~i=u~∘δi:Δ1→ℂ is a continuous logarithm for for vi, so ω⁢(vi)=(v~i⁢(e1)−v~i⁢(e0))/(2⁢π⁢i). This gives

2⁢π⁢i⁢ω⁢(∂(u))=(v~0⁢(e1)−v~0⁢(e0))−(v~1⁢(e1)−v~1⁢(e0))+(v~2⁢(e1)−v~2⁢(e0)).

However, we have

δ0⁢(e1) =e2 δ1⁢(e1) =e2 δ2⁢(e1) =e1
δ0⁢(e0) =e1 δ1⁢(e0) =e0 δ2⁢(e0) =e0,

so the above expression becomes

2⁢π⁢i⁢ω⁢(∂(u))=(u~⁢(e2)−u~⁢(e1))−(u~⁢(e2)−u~⁢(e0))+(u~⁢(e1)−u~⁢(e0))=0,

so ω⁢(∂(u))=0 as claimed. More generally, if u∈C2⁢(ℂ×) then u=n1⁢u1+⋯+nr⁢ur for some integers ni and maps ui:Δ2→ℂ×, and this gives

ω⁢(∂(u))=∑ini⁢ω⁢(∂(ui))=∑ini⁢.0=0

as before. Thus, if w∈B1⁢(ℂ×) then w=∂(u) for some u∈C2⁢(ℂ×) giving ω⁢(w)=ω⁢(∂(u))=0 as claimed. ∎

Definition 11.8.

We now define homomorphisms β:ℂ→ℂ× and γ:C0⁢(ℂ×)→ℂ× by β⁢(z)=exp⁡(2⁢π⁢i⁢z) and

γ⁢(n1⁢z1+⋯+nr⁢zr)=z1n1⁢z2n2⁢⋯⁢zrnr.

(Here we regard ℂ and C0⁢(ℂ×) as groups under addition and ℂ× as a group under multiplication, so to say that β and γ are homomorphisms means that β⁢(w+z)=β⁢(w)⁢β⁢(z) and γ⁢(u+v)=γ⁢(u)⁢γ⁢(v); it is easy to see that both of these identities are valid.)

Lemma 11.9.

The following square commutes (or in other words, β⁢(ω⁢(u))=γ⁢(∂(u)) for all u∈C1⁢(ℂ×)).

[Uncaptioned image]
Proof.

In general u will be a ℤ-linear combination of paths in ℂ×, but all the maps are homomorphisms, so it will be enough to consider the case where u:Δ1→ℂ× is just a single path. We then have ∂(u)=u⁢(e1)−u⁢(e0)∈C0⁢(ℂ×) and so γ⁢(∂(u))=u⁢(e1)/u⁢(e0)∈ℂ×. Now choose a continuous logarithm u~:Δ1→ℂ for u. By definition we have ω⁢(u)=(u~⁢(e1)−u~⁢(e0))/(2⁢π⁢i), so

β⁢(ω⁢(u))=exp⁡(u~⁢(e1)−u~⁢(e0))=exp⁡(u~⁢(e1))/exp⁡(u~⁢(e0))=u⁢(e1)/u⁢(e0)=γ⁢(∂(u)).

∎

Corollary 11.10.

We have ω⁢(Z1⁢(ℂ×))=ℤ and ω⁢(B1⁢(ℂ×))=0, so ω induces a homomorphism ω¯:H1⁢(ℂ×)→ℤ given by ω¯⁢(z+B1⁢(ℂ×))=ω⁢(z).

Proof.

Suppose that z∈Z1⁢(ℂ×), so ∂(z)=0, so γ⁢(∂(z))=γ⁢(0)=1. By the Lemma we then have β⁢(ω⁢(z))=1, or in other words exp⁡(2⁢π⁢i⁢ω⁢(z))=1, so ω⁢(z)∈ℤ. As in Example 11.6 we also have standard loops un∈Z1⁢(ℂ×) with ω⁢(un)=n, so the image ω⁢(Z1⁢(ℂ×)) is the whole group ℤ. We saw in Lemma 11.7 that ω⁢(B1⁢(ℂ×))=0, and it follows that the rule ω¯⁢(z+B1⁢(ℂ×))=ω⁢(z) gives a well-defined homomorphism from the quotient group H1⁢(ℂ×)=Z1⁢(ℂ×)/B1⁢(ℂ×) to ℤ. ∎

Theorem 11.11.

The homomorphism ω¯:H1⁢(ℂ×)→ℤ is an isomorphism.

Proof.

We have already remarked that ω¯⁢(un+B1⁢(ℂ×))=ω⁢(un)=n for all n∈ℤ; this shows that ω¯ is surjective. Now suppose we have h∈H1⁢(ℂ×) with ω⁢(h)¯=0. By Proposition 10.29, we can find a loop u:Δ1→ℂ× based at 1∈ℂ× with h=[u]. By Lemma 11.3, there is a unique continuous logarithm u~:Δ1→ℂ with u~⁢(e0)=0. We then have ω⁢(u)=(u~⁢(e1)−u~⁢(e0))/(2⁢π⁢i)=u~⁢(e1)/(2⁢π⁢i). However, we also know that ω⁢(u)=ω¯⁢([u])=ω¯⁢(h)=0, so we must have u~⁢(e1)=0 as well. We now define v~:Δ2→ℂ by

v~⁢(t0,t1,t2)={(1−t0)⁢u~⁢(t1/(1−t0),t2/(1−t0)) if ⁢t0<10 if ⁢t0=1.

We leave it to the reader to check that v~ is continuous even at e0. (A full proof of a more general fact will be given later.) We then define v=exp∘v~:Δ2→ℂ×. It is easy to see that v~ is a filling in for u~, and thus that v is a filling in for u, so [u]=0 in H1⁢(X) by Lemma 10.31, or in other words h=0. This proves that ω¯ is also injective, and so is an isomorphism as claimed. ∎