A.6. EXACT SEQUENCES 477

Is f (HCn) = ker(g)? Letting c be a cycle, consider f (c) . By definition of exactness,g( f (c)) = 0. Therefore, [0] = [g( f (c))] = g [ f (c)] showing that f (HCn)⊆ ker(g) .

For the other inclusion let [d]∈ ker(g) . In particular this assumes d is a cycle. I need toshow [d] is in f (HCn). We have [0] = g([d]) = [g(d)] . It follows that g(d) = ∂e for somee∈En+1. Since g is onto, e= g

(d̂)

for some d̂ ∈Dn+1 and so g(d) = ∂e= ∂g(d̂)= g(∂ d̂)

so g(d−∂ d̂

)= 0. Therefore, d−∂ d̂ ∈ ker(g) and so d−∂ d̂ = f (c) for some c∈Cn. Thus

0 = f (∂c) and since f is one to one, it follows ∂c = 0. Thus [d] = f ([c]) ∈ f (HCn). Wejust showed that, as mappings on homology groups, f (HCn) = ker(g) .

So far we have this in terms of homology groups:

HCn

f→ HDng→ HEn , Im( f ) = ker(g)

I want to get this:

HCn+1

f→ HDn+1

g→ HEn+1∆→ HCn

f→ HDng→ HEn · · ·

where ∆ is from Lemma A.6.2.{ker∆ = Img} Let [en+1] ∈ ker∆. I need to show [en+1] is in the image of g. Since

[en+1]∈ ker∆,[

f−1∂g−1en+1]= 0 so f−1∂g−1en+1 = ∂cn+1. Thus ∂g−1en+1 = f (∂cn+1).

Letting g(dn+1) = en+1 using the fact that g is onto, we get ∂dn+1 = f (∂cn+1) . Also∂g(dn+1) = g( f (∂cn+1)) so

g(∂dn+1− f (∂cn+1)) = 0

which implies there exists x for which

f (x) = ∂dn+1− f (∂cn+1) = ∂ (dn+1− f (cn+1))

Therefore, x = f−1∂ (dn+1− f (cn+1)) = ∂ f−1 (dn+1− f (cn+1)) = ∂y and so from theabove,

∂ f (y) = ∂ (dn+1− f (cn+1))

so 0 = ∂

(dn+1−

(∈kerg

f (y)+ f (cn+1)

)). But then dn+1− ( f (y)+ f (cn+1)) is a cycle and

g(dn+1− ( f (y)+ f (cn+1))) = g(dn+1) = en+1

Therefore, [en+1] is indeed in the image of g as was to be shown. Thus ker∆⊆ Img.Now consider [g(dn+1)] for dn+1 a cycle. Is this in ker∆? From the definition of ∆,

[f−1

∂g−1g(dn+1)]=

[f−1

=0∂dn+1

]= 0

since f is one to one. Thus Im(g) = ker∆.Next I need to verify exactness at HCn .{Im∆ = ker f} First let en+1 be a cycle and consider ∆ [en+1]≡

[f−1∂g−1en+1

]. Is it in

ker f ? Is it the case that f(

f−1∂g−1en+1)

is a boundary? This expression is just ∂g−1en+1so this is clearly true. Thus Im∆⊆ ker f .

Next suppose f [cn] = [ f cn] = 0 so [cn] ∈ ker f for cn a cycle. I need to show cn ∈ Im∆.Since [ f (cn)] = 0, it follows that f (cn) = ∂dn+1. By exactness, ∂dn+1 ∈ ker(g) because

A.6. EXACT SEQUENCES 477Is f (Hc,) = ker(g)? Letting c be a cycle, consider f (c). By definition of exactness,g(f(c)) =0. Therefore, [0] = [g (f (c))] = g[f (c)] showing that f (Hc,) C ker(g).For the other inclusion let [d] € ker (g) . In particular this assumes d is a cycle. I need toshow [d] is in f (Hc,). We have [0] = g ((d]) = [g (d)]. It follows that g (d) = de for somee € Ey1. Since g is onto, e = g (d) for some d € D,,.1 and so g (d) = de = Og (d) =g (dd)so g(d— dd) = 0. Therefore, d— dd € ker(g) and so d— 0d = f (c) for some c € Cy. Thus0 = f (dc) and since f is one to one, it follows dc = 0. Thus [d] = f ([c]) € f (Hc,). Wejust showed that, as mappings on homology groups, f (Hc,) = ker(g).So far we have this in terms of homology groups:Ac, 4, Ap, “, Ar,,,1m (f) = ker (g)I want to get this:Hc,,, 2 Hp,,, ® He,,, > He, 2 Hp, % He, +n+1 n+lwhere A is from Lemma A.6.2.{kerA = Img} Let [e,+1] € kerA. I need to show [e,+1] is in the image of g. Since[en+1] €kerA, (f'dg ens] =0so f'dgen+1 = OCn41. Thus Og len41 = f (Acn41).Letting g(dni1) = en41 using the fact that g is onto, we get ddyi) = f (Acn+1). Also9g (dn+1) = 8(f (Aen+1)) so8(Odn+1 — f (Ocn41)) =0which implies there exists x for whichf (x) = Odnai — f (Oen41) = 9 (dna — f (en41))Therefore, x = f—!0 (dni —f (en41)) = Of! (dnt —f (Cn41)) = Ay and so from theabove,Of (y) = (dn4i —f (en41))kerso0=0 [as - (0 Flew) . But then d,+1 — (f (vy) +f (en41)) is a cycle and8 (dn4i —(f Y) +f (ent1))) = 8 (dn+1) = n+Therefore, [e,,+1] is indeed in the image of g as was to be shown. Thus kerA C Img.Now consider [g (d,+1)] for d,41 a cycle. Is this in kerA? From the definition of A,=0[f 10g 'g (dni) = [rade =0since f is one to one. Thus Im(g) = kerA.Next I need to verify exactness at Hc,.{ImA = ker f} First let en be a cycle and consider A [en+1] = [f~!0g7!en+1] . Is it inker f? Is it the case that f (f~'dg~'en41) is a boundary? This expression is just 0g~!en+1so this is clearly true. Thus ImA C ker f.Next suppose f [Cn] = [fen] =0 so [cn] € ker f for cy, a cycle. I need to show c, € ImA.Since [f (cn)] = 0, it follows that f (cy) = Ady41. By exactness, Ad, € ker(g) because