Abstract

Talk

Goal: Understand the of the map we defined last time.

Lemma "Hom is left exact"

Given a Short exact sequence of abelian groups and a group. Applying gives us a dual exact sequence. And is the original sequence splits, then there is a slightly longer exact sequence.

Proof I will check the proof later.

is a contravariant functor and the property of the lemma is called left-exactness. Left-exactness of a functor means that the functor applied to a ses gives a ses with the right dropped.”

Remark: shows that the splitness of the sequence is necessary. Meaning is in general not exact.

We continue. We want to understand the relationship between . Let be the cycle group and the boundary group of . We write down the ses as last time: Now can be interpreted as a ses of chain complexes (we choose the easy map for , the homology is then equal the chain complex).

\[\begin{tikzcd}
	& {...} & {...} & {...} \\
	0 & {Z_n } & {C_n} & {B_{n-1}} & 0 \\
	0 & {Z_{n-1} } & {C_{n-1}} & {B_{n-2}} & 0 \\
	& {...} & {...} & {...}
	\arrow[from=1-2, to=2-2]
	\arrow[from=1-3, to=2-3]
	\arrow[from=1-4, to=2-4]
	\arrow[from=2-1, to=2-2]
	\arrow["i", from=2-2, to=2-3]
	\arrow["0"{description}, from=2-2, to=3-2]
	\arrow["\partial", from=2-3, to=2-4]
	\arrow["\partial"{description}, from=2-3, to=3-3]
	\arrow[from=2-4, to=2-5]
	\arrow["0"{description}, from=2-4, to=3-4]
	\arrow[from=3-1, to=3-2]
	\arrow["i", from=3-2, to=3-3]
	\arrow[from=3-2, to=4-2]
	\arrow["\partial", from=3-3, to=3-4]
	\arrow[from=3-3, to=4-3]
	\arrow[from=3-4, to=3-5]
	\arrow[from=3-4, to=4-4]
\end{tikzcd}\]
Since $C_{\bullet}$ is assumed to be a free abelian subgroup, the sequence splits and we can apply the lemma to get the dual ses.
% https://q.uiver.app/#q=WzAsMTYsWzEsMCwiLi4uIl0sWzIsMCwiLi4uIl0sWzMsMCwiLi4uIl0sWzAsMSwiMCJdLFsxLDEsIlpfbiBeKiJdLFsyLDEsIkNfbl4qIl0sWzMsMSwiQl97bi0xfV4qIl0sWzQsMSwiMCJdLFswLDIsIjAiXSxbMSwyLCJaX3tuLTF9IF4qIl0sWzIsMiwiQ197bi0xfV4qIl0sWzMsMiwiQl97bi0yfV4qIl0sWzQsMiwiMCJdLFsxLDMsIi4uLiJdLFsyLDMsIi4uLiJdLFszLDMsIi4uLiJdLFs0LDBdLFs1LDFdLFs2LDJdLFs0LDNdLFs1LDQsImleKiIsMl0sWzksNCwiMCIsMV0sWzYsNSwiXFxwYXJ0aWFsXioiLDJdLFsxMCw1LCJcXHBhcnRpYWwiLDFdLFs3LDZdLFsxMSw2LCIwIiwxXSxbOSw4XSxbMTAsOSwiaV4qIiwyXSxbMTMsOV0sWzExLDEwLCJcXHBhcnRpYWxeKiIsMl0sWzE0LDEwXSxbMTIsMTFdLFsxNSwxMV1d
\[\begin{tikzcd}
	& {...} & {...} & {...} \\
	0 & {Z_n ^*} & {C_n^*} & {B_{n-1}^*} & 0 \\
	0 & {Z_{n-1} ^*} & {C_{n-1}^*} & {B_{n-2}^*} & 0 \\
	& {...} & {...} & {...}
	\arrow[from=2-2, to=1-2]
	\arrow[from=2-2, to=2-1]
	\arrow[from=2-3, to=1-3]
	\arrow["{i^*}"', from=2-3, to=2-2]
	\arrow[from=2-4, to=1-4]
	\arrow["{\partial^*}"', from=2-4, to=2-3]
	\arrow[from=2-5, to=2-4]
	\arrow["0"{description}, from=3-2, to=2-2]
	\arrow[from=3-2, to=3-1]
	\arrow["\partial"{description}, from=3-3, to=2-3]
	\arrow["{i^*}"', from=3-3, to=3-2]
	\arrow["0"{description}, from=3-4, to=2-4]
	\arrow["{\partial^*}"', from=3-4, to=3-3]
	\arrow[from=3-5, to=3-4]
	\arrow[from=4-2, to=3-2]
	\arrow[from=4-3, to=3-3]
	\arrow[from=4-4, to=3-4]
\end{tikzcd}\]
Last semester we said that a ses of chain complexes induces a long exact sequence in [[Homology group|Homology]]. The same fact holds for cohomology. In homology we get the les: $$...\to \underbrace{H_{n}(Z_{\bullet})}_{Z_{n}} \overset \pi\to H_{n}(C_\bullet)\overset \partial\to \underbrace{H_{n}(B_{\bullet})}_{B_{n-1}}\overset i\to Z_{n-1}\overset \pi\to ...$$ with the natural connected homomorphism being the inclusion $i$. We therefore suspect that the new connecting homomorphism in cohomology will be the dual $i^{*}:Z_{n}^{*}\to B_{n}^{*}$ of $i$ which is just the restriction of a map $Z_{n}\to G$ to $B_{n}$. The [[Snake lemma]] tells us that the map is natural but we still have to give a construction. We have $\text{ker }0 = Z_{n-1}^{*}$ and $\text{coker }0 = B_{n-1}^{*}$. Taking one element $\varphi:Z_{n-1}\to G \in Z_{n-1}^{*}$ this can be extended to a map $\tilde \varphi:C_{n-1}\to G$ (due to surjectivity of $i^{*}$). We map this to $\phi=\partial^{*} \tilde\varphi = \tilde \varphi \partial : C_{n}\to G$. This can be lifted by a $\tilde \phi$ s.t. $\partial^{*}\tilde \phi = \partial ^{*}\tilde \varphi$. This means that $\tilde \phi$ and $\tilde \varphi$ are equal on $B_{n-1}$, so $\tilde \phi$ is actually the restriction to $B_{n-1}$. To reiterate, we get the [[Long exact sequence]] $$...\overset{\pi^{*}}\to Z_{n-1}^{*} \overset{i^{*}}\to B_{n-1}^{*} \overset{\partial^{*}} \to H^{n}(C_{\bullet}) \overset{\pi^{*}}\to Z_{n}^{*} \to ...$$ With the connecting homomorphism $i^{*}$. From the long exact sequence we now extract a ses again. $$0\to \text{coker }i^{*}_{n-1} \to H^{n}(C_{\bullet})\to \text{ker }i_{n}^{*} \to 0$$ where the last term can be identified with $\text{Hom}(H_{n}(C_{\bullet)}, G)$.

This has inside. This are all maps that restrict to in , inducing a map on homology . This does exactly the thing of , i.e. we have motivated our slightly more.

Corollary

There is a split SES

Observe: This Cokernel is measuring st. It measures the “non-right-exactness of Hom applied to a special SES. If is Free Abelian group then ” gives exact sequence so the cokernel is . This is a general construction: Whenever you have a left-exact functor, you can construct a right-derived functor..

A short interlude on derived functors:

Definition

Abelian group. A Free resolution of is an exact sequence

We use infinitely many because some other groups (not abelian) have longer resolutions, and longer abelian resolutions can be useful in calculations.

Lemma

Any abelian group has a free resolution of length .

This has a nice stupid proof. It uses a free abelian group generated over all elements of .

Corollary

Suppose I have a free resolution of and is an Abelian group. Consider the cochain complex obtained by applying Hom. Then this might not be exact. So we can compute cohomology! An the cohomology of this is independent of the free resolution. We call this the first cohomology group . And this Ext Functor is the Derived functor of Hom Functor. This is just Group cohomology!!!! :o

This is the kernel from before (the one we wondered about!) We will use these on problem sets.