Simplicial Structures in Topology
Simplicial Structures in Topology
Simplicial Structures in Topology
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
II.3 Homological Algebra 71<br />
ε ′ f0∂1(x1)= f ε∂1(x1)=0<br />
and im∂ ′ 1 = kerε′ , there exists y ′ 1 ∈ C′ 1 such that ∂ ′ 1 (y′ 1 )= f0∂1(x1). This def<strong>in</strong>es a<br />
homomorphism f1 : C1 → C ′ 1 such that f0∂1 = ∂ ′ 1 f1.<br />
Assume that we have <strong>in</strong>ductively constructed the homomorphisms fi : Ci → C ′ i<br />
commut<strong>in</strong>g with the boundary homomorphisms for i ≤ n; now, take the commutative<br />
diagram<br />
···<br />
···<br />
��<br />
Cn+1<br />
��<br />
′<br />
C n+1<br />
∂n+1 ��<br />
Cn<br />
��<br />
∂ ′ n+1 ��<br />
′<br />
C n<br />
For every basis element xn+1 of Cn+1<br />
fn<br />
∂n ��<br />
Cn−1<br />
��<br />
∂ ′ n ��<br />
′<br />
C n−1<br />
fn−1<br />
∂ ′ n fn∂n+1(xn+1)= fn−1∂n∂n+1(xn+1)=0<br />
��<br />
···<br />
��<br />
···<br />
that is to say, fn∂n+1(xn+1) ∈ ker∂ ′ n. It follows that fn∂n+1(xn+1) is an n-cycle<br />
of (C ′ ,∂ ′ ); but this cha<strong>in</strong> complex is acyclic and so there exists yn+1 ∈ C ′ n+1<br />
such that ∂ ′ (yn+1) = fn∂(xn+1). By extend<strong>in</strong>g l<strong>in</strong>early xn+1 ↦→ yn+1, we obta<strong>in</strong> a<br />
homomorphism<br />
fn+1 : Cn+1 → C ′ n+1 , d′ fn+1 = fnd.<br />
This concludes the <strong>in</strong>ductive construction.<br />
Suppose that g: (C,∂) → (C ′ ,∂ ′ ) is another extension of ¯f . Then, for any arbitrary<br />
generator x0 of C0,<br />
ε ′ ( f0 − g0)(x0)=0;<br />
s<strong>in</strong>ce kerε ′ = im∂ ′ 1 , there exists an element y1 ∈ C ′ 1 such that ∂ ′ 1 (y)=(f0 − g0)(x0).<br />
We def<strong>in</strong>e s0 : C0 → C ′ 1 by s0(x0) =y1 on the generators and extend this function<br />
l<strong>in</strong>early over the entire group C0; <strong>in</strong> this way, we obta<strong>in</strong> a homomorphism s0 : C0 →<br />
C ′ 1 such that ∂ ′ 1s1 = f0 − g0. Let us assume that, for every i = 1,···,n, wehave<br />
def<strong>in</strong>ed the homomorphisms si : Ci → C ′ i+1 satisfy<strong>in</strong>g the condition<br />
For any generator xn+1 of Cn+1<br />
∂ ′<br />
i+1 si + si−1∂i = fi − gi.<br />
∂ ′ n+1 ( fn+1 − gn+1 − sn∂n+1)(xn+1)=0<br />
(because ∂ ′ n+1sn + sn−1∂n = fn − gn); thus, there exists yn+2 ∈ C ′ n+2 such that<br />
( fn+1 − gn+1 − sn∂n+1)(xn+1)=∂ ′ n+2(yn+2).<br />
In this fashion, we construct a homomorphism sn+1 : Cn+1 → C ′ n+2 and, <strong>in</strong> the end,<br />
we obta<strong>in</strong> a cha<strong>in</strong> homotopy from f to g. �