# Short Exact Sequences & Rank Nullity

This is a well known lemma that consistently appears in textbooks, either as a statement without proof, or as an exercise (see for example pp. 146 of Hatcher)

If $0 \stackrel{id}{\to} A \stackrel{f}{\to} B \stackrel{g}{\to} C\stackrel{h}{\to} 0$ is a short exact sequence of finitely generated abelian groups, then rank B = rank A + rank C

I've been trying to prove this unsuccessfully.

What do we know? $f$ is injective, $g$ is surjective, $\mathrm{Im} f = \mathrm{ker} g$, $\mathrm{Im} g = \mathrm{ker} h$, $C\simeq B/A$

So I start with a maximally linearly independent subset $\{ a_\alpha \}$ of $A$ such that the sum (with only finite non-zero entries) $$\sum n_\alpha a_\alpha=0$$ for $n_\alpha \in \mathbb{Z}$, implies that $n_\alpha=0$.

Where to go from here is a puzzle? Any hints would be appreciated

-
Try simultaneous basis theorem, applied to $A, B$. See eg math.uiuc.edu/~r-ash/Algebra/Chapter4.pdf, p.17. –  Soarer Feb 28 '11 at 4:26

Pick a maximal linearly independent subset $\{c_{\beta}\}$ of $C$. Now push the $a_{\alpha}$ to $B$ using $f$, and for each $c_{\beta}$ pick $c'_{\beta}\in B$ such that $g(c'_{\beta}) = c_{\beta}$.

Now suppose that you have a finite linear combination of the $a_{\alpha}$ and the $c'_{\beta}$ that is equal to $0$, $$n_{\alpha_1}f(a_{\alpha_1}) + \cdots + n_{\alpha_k}f(a_{\alpha_k}) + m_{\beta_1}c'_{\beta_1} + \cdots + m_{\beta_{\ell}}c'_{\beta_{\ell}} = 0.$$ Use $g$ to get a conclusion about the $m_{\beta_j}$; then use $f$ to get a conclusion about the $n_{\alpha_i}$. This will give you that $\mathrm{rank}(B)\geq \mathrm{rank}(A)+\mathrm{rank}(C)$.

Do you also need help with the converse inequality?

-
@Arturo - thank you, I will have a look and see if I can work it out from here –  Juan S Feb 28 '11 at 5:32
@Arturo - are we taking a finite linear combination of all the $a_\alpha$'s and $c'_\beta$'s? (i.e in your formula the rank of $A$ is $k$ and the rank of $C$ is t? –  Juan S Feb 28 '11 at 6:20
@Qwirk: Linear combinations, by definition, are finite (or have only finitely many nonzero coefficients). So I'm not assuming that the ranks are finite, but you only consider finite linear combinations in any case, just as in linear algebra. –  Arturo Magidin Feb 28 '11 at 14:05
@Arturo - sorry, maybe my question wasn't clear. Say that $A$ has the maximum independent subset $a_{\alpha 1}, \cdots a_{\alpha_k}$, then when we form the linear combination do we use $a_{\alpha 1}, \cdots a_{\alpha_k}$, or $a_{\alpha 1}, \cdots a_{\alpha_i}$ for some $i \le k$? (obviously we need the $c'_{\beta}$ terms as well) –  Juan S Feb 28 '11 at 20:22
@Fahad: The standard way is to tensor with $\mathbb{Q}$: the argument above shows that the tensored sequence is exact, and using the fact that the tensor product distributes over the direct sum shows that the rank of a finitely generated abelian group $A$ is equal to the dimension of the $\mathbb{Q}$-vector space $A\otimes\mathbb{Q}$. Alternatively, show that no subgroup of a group of rank $k$ can have rank strictly larger than $k$, and show that a linearly independent subset of $B$ of size greater than rank A + rank C would lead to a lin. ind. subset of A of size larger than rank A. –  Arturo Magidin May 23 '11 at 19:13


For a finitely generated abelian group $A$, note that $\mathrm{rank}(A) = \dim_\Q(A\otimes_\Z \Q)$. One can show (basically following Arturo's answer) that given a short exact sequence of abelian groups $0\to A\to B\to C\to 0$, the sequence obtained by tensoring with $\Q$ is also exact: $$0\to A\otimes_\Z \Q \to B\otimes_\Z \Q \to C\otimes_\Z \Q \to 0$$

Now the statement about ranks boils down to an easy statement about how dimensions of vector spaces add in a short exact sequence.

-
thanks. I knew there was an answer involving tensor products, but I am not really comfortable with them yet, so I will accept Arturo's answer –  Juan S Feb 28 '11 at 5:32
@Qwirk: In this case, it is all fairly straightforward because you can "clear denominators" and get an expression involving only integer coefficients. –  Arturo Magidin Feb 28 '11 at 5:34