View source for Exercises:Saul - Algebraic Topology - 3/Exercise 3.2

<noinclude>
==Exercises==
===Exercise 3.2===
</noinclude>Suppose that {{Top.|X|J}} is a non-empty ''{{link|path-connected|topology}}'' [[topological space]], equipped with a [[Delta-complex|{{M|\Delta}}-complex]] structure. Show, directly from the definitions (Hatcher, of course...) that {{M|H^\Delta_0(X)\cong\mathbb{Z} }}
* We may assume without proof that the {{M|1}}-skeleton is path connected.
{{Begin Notebox}}'''Notes for future reference''' - [[User:Alec|Alec]] ([[User talk:Alec|talk]]) 06:27, 1 February 2017 (UTC){{Begin Notebox Content}}
* {{MM|H^\Delta_n(X):\eq\frac{\text{Ker}(\partial_0)}{\text{Im}(\partial_1)} }}
As {{M|\partial_0}} just sends ''everything'' to {{M|0}} we see {{M|\text{Ker}(\partial_0)\eq \Delta_0(X)}} - all the vertices. Thus, essentially, {{M|\text{Ker}(\partial_0)\cong\mathbb{Z}^{\#\text{vertices} } }}.

Okay now {{M|\partial_1:\Delta_1(X)\rightarrow\Delta_0(X)}}, what is its image?
* First of all, for {{M|f\in\Delta_1(X)}} we see {{M|\partial_1(X):\eq\partial_1(\sum_{\alpha\in I_1}n_\alpha \sigma_\alpha)\eq\sum_{\alpha\in I_1}n_\alpha\partial_1(\sigma_\alpha)}} {{M|\eq\sum_{\alpha\in I_1}n_\alpha(\text{Terminal}(\sigma_\alpha)-\text{Initial}(\sigma_\alpha))}}
** where {{M|I_1}} is the set of {{M|1}}-simplices involved in {{M|X}}, and {{M|n_\alpha\in\mathbb{Z} }} with {{M|n_\alpha\neq 0}} for only finitely many of the {{M|\alpha\in I_1}}
This shows us that (sort of anyway) the image is spanned by various {{M|\text{Terminal}(\sigma_\alpha)-\text{Initial}(\sigma_\alpha) }} (which are vertices) 


Using {{M|X^1}} to denote the {{M|1}}-skeleton (consistent notation be damned) then {{caveat|and this is the informal part}} for any two vertexes of {{M|X}}, say {{M|v_0}} and {{M|v_1}}, there is a path through the "edges" of {{M|X^1}}, such that {{M|\partial_1(\text{that path})\eq v_1-v_0}}
* We can make this a bit better! If {{M|(p_i)_{i\eq 1}^k}} is a representation of the path, where {{M|p_i}} is an edge, such that the initial vertex of {{M|p_1}} is {{M|v_0}} and the final vertex of {{M|p_k}} is {{M|v_1}} we can represent the path by the formal linear combination: {{M|\sum_{i\eq 1}^k p_i}}.
** Note the {{M|p_i}} need not be unique, it could have several loops in it, that wont matter (as the boundaries of cycles are {{M|0}})

Now what we can sort of do is... well we want that sum to collapse to a few terms. What we can do is consider each {{M|\sigma_\alpha}} which is an edge - plus the path from its endpoint to some fixed point of our choice. The boundaries then will have the same terminal point, subtracting various initials (and some/one (?) will have the same terminal and initial, giving us our "one less")

It would have to be shown this is in bijection with the edges.
{{End Notebox Content}}{{End Notebox}}
{{Begin Blue Notebox}}'''Notes to the marker:''' [[User:Alec|Alec]] ([[User talk:Alec|talk]]) 06:27, 1 February 2017 (UTC){{Begin Blue Notebox Content}}
The proof for this exercise will either be transcluded, or copied and pasted into its own theorem or lemma page. As it falls under the Unified Mathematics project the proof is very methodical (for example indentation is directly related to the parse tree of a [[FOL]] statement) with small steps.

On paper this took me about half a page. However there's no guarantee that even I could read that; so I don't expect you to. Hence this.

I checked with the lecturer to be sure this qualified as "from the definitions", it seems to. He did mention that {{M|\epsilon}} is usually used for the map I have called {{M|I}} and mentioned some differences between the Abelian groups that usually have a {{M|C}} in them and how he used {{M|C}}.
* This is annoying because I really don't like Hatcher's book, but adopted his notation here ({{M|\Delta_n(X)}} - see bottom of page 104) to try and help the marker, rather than the more familiar notation involving {{M|Z}}s, {{M|C}}s) and {{M|B}}s
{{End Notebox Content}}{{End Notebox}}

Note to future editors: the proof that the map, {{M|I}}, is [[surjective]] and actually a [[group homomorphism]] is omitted. Be sure to mark this as [[Template:Requires proof]] and mark it {{C|easy}}

====Proof====
Let us define some notation before we start.
* {{M|X^n}} is the {{N|skeleton}} of {{M|X}}. Which made from all the simplices involved in {{M|X}} of dimension {{M|\le n}}. So {{M|X^1}} is itself a complex made up of all the 0 and 1 simplices. 
* {{M|X^{(n)} }} is not a complex but rather a set of all the {{n|dimensional}} simplices (and only those simplices) involved in {{M|X}}. For example {{M|X^{(1)} }} are all the {{M|1}}-simplices of {{M|X}} (and not the {{M|0}}-simplices), and so forth.
* {{M|\Delta_n(X):\eq\mathcal{F}(X^{(n)})}} is the free abelian group with generators the set of {{M|n}}-simplices involved in {{M|X}} ({{M|\mathcal{F}(A)}} denotes the free abelian group generated by the elements {{M|a\in A}})
* {{M|\partial_n:\Delta_{n}(X)\rightarrow\Delta_{n-1}(X)}} is the boundary map.
** {{M|\partial_0:\Delta_0(X)\rightarrow 0}} is a [[group homomorphism]] onto the [[trivial group]]. {{M|\partial_0:x\mapsto 0}} always; thus {{M|\text{Ker}(\partial_0)\eq\Delta_0(X)}} 
* {{MM|H_n^\Delta(X):\eq\frac{\text{Ker}(\partial_n)}{\text{Im}(\partial_{n+1})} }}
We also indulge in a few [[abuses of notation]]
* {{M|c\in\Delta_0(X)}} means {{M|c\eq\sum_\alpha n_\alpha v_\alpha}} where it is understood that {{M|n_\alpha\in\mathbb{Z} }} is non-zero for only finitely many of the {{M|\alpha}} in the implied indexing set. The indexing set for which each {{M|\alpha}} is in can also be used to index {{M|X^{(0)} }}, thus {{M|v_\alpha}} addresses each element of {{M|X^{(0)} }} - under the identification of {{M|v\in X^{(0)} }} with {{M|1v\eq v\in\mathcal{F}(X^{(0)})}}.
* {{M|d\in\Delta_1(X)}} means {{M|d\eq\sum_\alpha n_\alpha e_\alpha}} almost exactly as above but this time with {{M|X^{(1)} }} instead of {{M|X^{(0)} }} in play. 
* For {{M|e\in X^{(1)} }} (possibly identified with {{M|1e\in\Delta_1(X)}}) we use {{M|e(0)}} for the initial point of the edge and {{M|e(1)}} for the final point of the edge. Thus {{M|\partial(e)\eq e(1)-e(0)}}

We wish to compute:
* {{MM|H_0^\Delta(X):\eq\frac{\text{Ker}(\partial_0)}{\text{Im}(\partial_1)}\eq\frac{\Delta_0(X)}{\text{Im}(\partial_1)} }}

'''Proof: '''
* Define {{M|I:\Delta_0(X)\rightarrow\mathbb{Z} }} by {{M|I:\sum_\alpha n_\alpha v_\alpha\mapsto \sum_\alpha n_\alpha}}, clearly this is a [[group homomorphism]] and clearly also it is [[surjective]] (as {{M|X}} is non-empty, we have at least one generator of {{M|\Delta_0(X)}}, so from that alone we can get any integer, that shows surjectivity. It being a group homomorphism is even easier).
** By the [[first group isomorphism theorem]] we have: {{MM|\frac{\Delta_0(X)}{\text{Ker}(I)}\cong_{\bar{I} }\mathbb{Z} }} where {{MM|\overline{I}:\frac{\Delta_0(X)}{\text{Ker}(I)}\rightarrow\mathbb{Z} }} is the induced [[group isomorphism]] from {{M|I}}, thus {{M|\overline{I}:[c]\mapsto I(C)}}. This notation is unambiguous, {{M|[c]}} represents an arbitrary equivalence class of the quotient (as this is first year work I will not elaborate any further. See the page ''[[first group isomorphism theorem]]'' for more information)
** Suppose that {{M|\text{Im}(\partial_1)\eq\text{Ker}(I)}}. Then {{M|\overline{I} }} would be an isomorphism from {{M|H_0^\Delta(X)}} to {{M|\mathbb{Z} }}, and the result would be shown. This it the route we will take.
** To do so we must show: {{M|\text{Im}(\partial_1)\eq\text{Ker}(I)}}. This will consist of two steps: {{M|\text{Im}(\partial_1)\subseteq\text{Ker}(I)}} and {{M|\text{Ker}(I)\subseteq \text{Im}(\partial_1)}}
**# Showing that {{M|\text{Im}(\partial_1)\subseteq\text{Ker}(I)}}, by the [[implies-subset relation]], we need only show {{M|\forall c\in\text{Im}(\partial_1)[c\in\text{Ker}(I)]}}
**#* Let {{M|c\in\text{Im}(\partial_1)}} be given
**#** By definition of {{link|image|function}}, {{M|c\in\text{Im}(\partial_1)\iff \exists d\in \Delta_1(X)[\partial_1(d)\eq c]}}
**#** Thus let {{M|d\in\Delta_1(X)}} be such that {{M|\partial_1(d)\eq c}}.
**#** We observe now that {{M|I(c)\eq I(\partial_1(d))}}
**#**: {{M|\eq I(\partial_1(\sum_\alpha n_\alpha e_\alpha))}}
**#**: {{M|\eq I(\sum_\alpha n_\alpha\partial_1(e_\alpha))}}
**#**: {{M|\eq I(\sum_\alpha n_\alpha(e_\alpha(1)-e_\alpha(0))}}
**#**: {{M|\eq I(\sum_\alpha n_\alpha e_\alpha(1) + \sum_\alpha (-n_\alpha) e_\alpha(0))}}
**#**: {{M|\eq \sum_\alpha n_\alpha + \sum_\alpha (-n_\alpha)}}
**#**: {{M|\eq \sum_\alpha(n_\alpha - n_\alpha)}}
**#**: {{M|\eq 0}}
**#** Thus {{M|I(c)\eq 0}}, so {{M|c\in\text{Ker}(I)}}
**#* Since {{M|c\in\text{Im}(\partial_1)}} was arbitrary, we have shown that for all such {{M|c}} that {{M|c\in \text{Ker}(I)}}. This completes the first step.
**# Showing that {{M|\text{Ker}(I)\subseteq \text{Im}(\partial_1)}}. By the [[implies-subset relation]] we need only show {{M|\forall c\in\text{Ker}(I)[c\in\text{Im}(\partial_1)]}}
**#* We require two lemmas before we can continue:
**#*# {{M|\forall v_0,v\in X^{(0)}\exists (p_i)_{i\eq 1}^k\subseteq X^{(1)}[\partial_1(\sum^k_{i\eq 1}p_i)\eq v-v_0\in\Delta_0(X)]}} (this requires path-connectedness) and
**#*# {{M|\forall c\in\Delta_0(X)\forall v_0\in X^{(0)}\exists d\in\Delta_1(X)[\partial_1(d)\eq c-I(c)v_0\in\Delta_0(X)]}}
**#* The proof of these can be found below (at this level of indentation)
**#** Suppose the lemmas hold. We will prove the statement: {{M|\forall c\in\text{Ker}(I)[c\in\text{Im}(\partial_1)]}}
**#*** Let {{M|c\in\text{Ker}(I)}} be given
**#**** We wish to show {{M|c\in\text{Im}(\partial_1)}}, by definition of {{link|image|function}}:
**#***** {{M|c\in\text{Im}(\partial_1)\iff\exists d\in\Delta_1(X)[\partial_1(d)\eq c]}}
**#**** Choose {{M|v_0\in X^{(0)} }} arbitrarily 
**#***** As {{M|c\in\text{Ker}(I)\subseteq \Delta_0(X)}} we see {{M|c\in\Delta_0(X)}}, thus we can apply the second lemma
**#***** Choose {{M|d\in\Delta_1(X)}} to be the {{M|d}} posited to exist by the second lemma. So we have: {{M|\partial_1(d)\eq c-I(c)v_0}}
**#****** now we wish to show our choice of {{M|d}} is such that {{M|\partial_1(d)\eq c}}
**#****** {{M|\partial_1(d)\eq c-I(c)v_0}}, we know this already
**#******* But {{M|c\in\text{Ker}(I)}}, so {{M|I(c)\eq 0}}, thus
**#****** {{M|\partial_1(d)\eq c}}
**#****** As required.
**#**** Thus we have shown our choice of {{M|d}} satisfies {{M|\partial_1(d)\eq c}}
**#*** Since {{M|c\in\text{Ker}(I)}} was arbitrary we have shown {{M|\forall c\in\text{Ker}(I)\exists d\in\Delta_1(X)[\partial_1(d)\eq c]}}
**#**** Which as we established earlier is the same as {{M|\forall c\in\text{Ker}(I)[c\in\text{Im}(\partial_1)]}} which was itself the same as {{M|\text{Ker}(I)\subseteq\text{Im}(\partial_1)}}
**#** Thus we have shown that, provided the lemmas hold, {{M|\text{Ker}(I)\subseteq\text{Im}(\partial_1)}}
**#* Proof of lemmas:
**#*# Proof that: {{M|\forall v_0,v\in X^{(0)}\exists (p_i)_{i\eq 1}^k\subseteq X^{(1)}[\partial_1(\sum^k_{i\eq 1}p_i)\eq v-v_0\in\Delta_0(X)]}}
**#*#* Let {{M|v_0\in X^{(0)} }} be given
**#*#** Let {{M|v\in X^{(0)} }} be given
**#*#*** By path-connectedness of {{M|X^1}} (the {{M|1}}-skeleton) we see there is a path through the {{M|1}}-skeleton, say {{M|p}}, from {{M|v_0}} to {{M|v}}
**#*#*** Say {{M|(p_i)_{i\eq 1}^k\subseteq X^{(1)} }} such that {{M|p\eq\sum_{i\eq 1}^k p_i\in X^1}} which of course means {{M|p\eq\sum_{i\eq 1}^k p_i\in\Delta_1(X)}} too
**#*#*** Thus: {{M|\partial_1(\sum_{i\eq 1}^k p_i)\eq v-v_0\in\Delta_0(X)}} by the very definition of the path we took.
**#*# {{M|\forall c\in\Delta_0(X)\forall v_0\in X^{(0)}\exists d\in\Delta_1(X)[\partial_1(d)\eq c-I(c)v_0\in\Delta_0(X)]}}
**#*#* Let {{M|c\in\Delta_0(X)}} be given, we shall write {{M|c\eq\sum_\alpha n_\alpha v_\alpha}}
**#*#** Let {{M|v_0\in X^{(0)} }} be given
**#*#*** We already know that for each {{M|v_\alpha}} in {{M|\sum_\alpha n_\alpha v_\alpha}} there exists a path {{M|p(v_\alpha) }} say from {{M|v_0}} to {{M|v_\alpha}}, {{M|p(v_\alpha):\eq\sum_{i\eq 1}^k p_i}} such that {{M|\partial_1(p(v_\alpha))\eq v_\alpha-v_0}} from the first lemma.
**#*#*** Choose {{M|d:\eq\sum_\alpha n_\alpha p(v_\alpha)\in\Delta_1(X) }}
**#*#**** We must show that this {{M|d}} satisfies the "such that" part of the lemma
**#*#**** {{M|\partial_1(d)\eq\partial_1(\sum_\alpha n_\alpha p(v_\alpha))}}
**#*#****: {{M|\eq \sum_\alpha n_\alpha \partial_1(p(v_\alpha))}}
**#*#****: {{M|\eq\sum_\alpha n_\alpha(v_\alpha - v_0)}}
**#*#****: {{M|\eq\sum_\alpha n_\alpha v_\alpha + (-\sum_\alpha v_\alpha) v_0}}
**#*#****: {{M|\eq c + (-I(c))v_0}}
**#*#****: {{M|\eq c - I(c)v_0}}
**#*#**** As required
**#*#*** Our choice of {{M|d}} satisfies the requirements of the claim
**#*#** Since {{M|v_0\in X^{(0)} }} was arbitrary we have shown the claim for all such {{M|v_0}}
**#*#* Since {{M|v\in X^{(0)} }} was arbitrary we have shown the claim for all such {{M|v}}
** We have now established {{M|\text{Ker}(I)\eq\text{Im}(\partial_1)}} thus {{M|H_0^\Delta(X)\cong\mathbb{Z} }} - as required.

<noinclude>
==Notes==
<references group="Note"/>
==References==
<references/>
</noinclude>