CatDat

ℵ₁-cofiltered limits of finitely generated abelian groups

While the category Abfg\Ab_\fg of finitely generated abelian groups has neither filtered colimits nor cofiltered limits, it does have 1\aleph_1-filtered colimits and 1\aleph_1-cofiltered limits. The first claim is proved in MO/400763. The second claim is proved here. In fact, we will show that the embedding AbfgAb\Ab_\fg \hookrightarrow \Ab is closed under 1\aleph_1-cofiltered limits.

Let D:IAbD : \I \to \Ab be an 1\aleph_1-cofiltered diagram such that each D(i)D(i) is finitely generated. We will show that its limit is finitely generated as well. The proof proceeds in three steps:

  1. Reduce to the case where every morphism D(ij):D(i)D(j)D(i \to j) : D(i) \to D(j) is surjective.
  2. Reduce further to the case where the groups D(i)D(i) all have the same rank.
  3. Reduce further to the case where the torsion subgroups T(i)T(i) all have the same cardinality.

In case (3), we will see that all morphisms D(ij)D(i \to j) are bijective, from which the claim follows immediately.

For iIi \in \I let Si{im(D(ji)):ji}.S_i \coloneqq \{\im(D(j \to i)) : j \to i\}. This is a set of subgroups of D(i)D(i). Since every subgroup of D(i)D(i) is finitely generated, D(i)D(i) has only countably many subgroups. Hence SiS_i is countable as well. For every HSiH \in S_i, choose a morphism iHii_H \to i such that H=im(D(iHi))H = \im(D(i_H \to i)). Since I\I is 1\aleph_1-cofiltered, the diagram consisting of the morphisms iHii_H \to i admits a cone. That is, there exists a morphism iii_\infty \to i together with morphisms iiHi_\infty \to i_H over ii for every HSiH \in S_i. Now consider the subgroup M(i)im(D(ii))D(i).M(i) \coloneqq \im(D(i_\infty \to i)) \subseteq D(i). It belongs to SiS_i, but it is also contained in every HSiH \in S_i, since iii_\infty \to i factors through iHii_H \to i. Hence M(i)M(i) is the minimal element of SiS_i with respect to inclusion.

For every morphism kik \to i_\infty we have M(i)=im(D(ki)),M(i) = \im(D(k \to i)), since the inclusion \supseteq is obvious, while \subseteq follows from the minimality just established.

Now let iji \to j be a morphism. We claim that D(i)D(j)D(i) \to D(j) maps M(i)M(i) onto M(j)M(j). Since I\I is cofiltered, we can find a commutative diagram

kii= kjj. \begin{CD} k @>>> i_\infty @>>> i \\ @V{=}VV @. @VVV \\ k @>>> j_\infty @>>> j. \end{CD}

Hence

M(j)=im(D(kj))=D(ij)(im(D(ki)))=D(ij)(M(i)).M(j) = \im(D(k \to j)) = D(i \to j)(\im(D(k \to i))) = D(i \to j)(M(i)).

The canonical injective homomorphism limiIM(i)limiID(i)\textstyle \lim_{i \in \I} M(i) \hookrightarrow \lim_{i \in \I} D(i) is an isomorphism. Indeed, for every xlimiID(i)x \in \lim_{i \in \I} D(i), we have xj=D(ij)(xi)x_j = D(i \to j)(x_i) for all iji \to j, showing that xjMjx_j \in M_j. Thus, we may replace DD by the diagram MM.

In other words, we may assume from now on that for every morphism iji \to j the induced morphism D(i)D(j)D(i) \to D(j) is surjective. Then rank(D(i))rank(D(j))\rank(D(i)) \geq \rank(D(j)) for every morphism iji \to j. It follows that the set {rank(D(i)):iI}\{\rank(D(i)) : i \in \I\} is bounded. Indeed, otherwise for every nNn \in \IN we could choose an object inIi_n \in \I such that D(in)D(i_n) has rank at least nn. Choosing a cone (jin)nN(j \to i_n)_{n \in \IN}, we would obtain a group D(j)D(j) of infinite rank, a contradiction.

Therefore the natural number Rmax{rank(D(i)):iI}R \coloneqq \max\{\rank(D(i)) : i \in \I\} is well-defined. Let JI\J \subseteq \I be the full subcategory consisting of those objects iIi \in \I for which D(i)D(i) has rank RR. If iji \to j is a morphism and jJj \in \J, then necessarily iJi \in \J as well. Since I\I is cofiltered, it follows from this property that J\J is an initial subcategory of I\I, i.e. that J/i\J/i is connected for every iIi \in \I. Hence the limit of DD coincides with the limit of DJD|_{\J}.

Thus, we may assume from now on that all groups D(i)D(i) have the same rank RR. Let T(i)D(i)T(i) \subseteq D(i) denote the torsion subgroup, which is finite, and let F(i)D(i)/T(i)F(i) \coloneqq D(i)/T(i), which is a finitely generated free abelian group. For a morphism iji \to j consider the commutative diagram with exact rows:

0T(i)D(i)F(i)0 0T(j)D(j)F(j)0 \begin{CD} 0 @>>> T(i) @>>> D(i) @>>> F(i) @>>> 0 \\ @. @VVV @VVV @VVV @. \\ 0 @>>> T(j) @>>> D(j) @>>> F(j) @>>> 0 \end{CD}

The homomorphism F(i)F(j)F(i) \to F(j) is surjective, since D(i)D(j)D(i) \to D(j) is surjective. Since it is a surjective homomorphism between finitely generated free abelian groups of the same rank, it is an isomorphism. Applying the snake lemma to the diagram above, we conclude that T(i)T(j)T(i) \to T(j) is surjective.

As before, it follows that the natural number Nmax{card(T(i)):iI}N \coloneqq \max\{\card(T(i)) : i \in \I\} is well-defined, and that the full subcategory consisting of those objects iIi \in \I for which card(T(i))=N\card(T(i)) = N is initial. Hence we may assume that all groups T(i)T(i) have the same cardinality.

Now for every morphism iji \to j the induced homomorphism T(i)T(j)T(i) \to T(j) is a surjective map between finite sets of the same cardinality, and is therefore bijective. Applying the snake lemma once more to the diagram above, we conclude that D(i)D(j)D(i) \to D(j) is an isomorphism.

In this case, the limit of DD is simply given by any of the groups D(i)D(i), and is therefore finitely generated.

Author: Martin Brandenburg

Context

This page is referenced by the following categories.