Finitely generated groups do not have -ℵ1-filtered colimits
We show that the category Grpfg of finitely generated groups does not have -ℵ1-filtered colimits.
Lemma 1. Assume that an uncountable group H exists with the following two properties:
- Every countable subset of H is contained in a finitely generated subgroup of .H.
- H is a subgroup of a product ∏n∈NHn of finitely generated groups .Hn.
Then Grpfg does not have -ℵ1-filtered colimits.
Proof. Let I be the set of finitely generated subgroups of ,H, partially ordered by inclusion, and let D:I→Grpfg be the diagram which maps each U∈I to U and each inclusion U⊆U′ to the inclusion homomorphism .U↪U′. The poset I is -ℵ1-filtered by (1): every countable subset of I has an upper bound in ,I, since the union of countably many finitely generated subgroups is countable.
Assume that D has a colimit C in Grpfg with colimit cocone λU:U→C for .U∈I. Since H is the directed union of all ,U∈I, these homomorphisms glue to a homomorphism f:H→C with .f∣U=λU. For each ,n, the restrictions πn∣U:U→Hn of the projection πn:H→Hn form a cocone of D with tip ,Hn, so there is a homomorphism hn:C→Hn with hn∘λU=πn∣U for all ,U∈I, i.e. .hn∘f=πn. By (2), the πn are jointly injective, so f is injective. But H is uncountable, whereas C is countable as a finitely generated group. □
It remains to find such a group .H.
Idea
For (2), it is natural to look for H of the form ,VN⋊G, where V is a countable vector space and G⊆Aut(V) is a finitely generated group acting on VN coordinatewise. Such a group is uncountable and embeds into .(V⋊G)N. The real task is (1): given countably many ,w0,w1,…∈VN, we want to find them in a finitely generated subgroup. Our plan is to store all of them in a single element c∈VN and to compute them from c using .G. In ,H, the elements of G act on VN by conjugation, so everything we compute from c in this way lies in the subgroup generated by G and .c. This is the purpose of the semidirect product. Let us see which operations G needs for this.
First, c needs room for infinitely many vectors. So we let V contain infinitely many independent copies V0,V1,V2,… of one subspace, together with an element u∈G mapping Vi to .Vi+1. We will put the data of wk,n into the coordinate .cn. Since vectors in V have finite support, cn can only use finitely many copies, so we only put wk,n for k≤n into .cn.
Second, we need to read off a single copy. Moving Vi back to V0 with ,u−i, it remains to discard everything outside of ,V0, that is, to apply the projection P onto V0 along a complement .W. Since P is not invertible, it cannot be an element of .G. But if s∈G acts as −1 on V0 and as 1 on ,W, then ,s⋅v−v=−2P(v), which is P(v) when we work over .F3.
Third, wk,n is an arbitrary vector of V and does not fit into the single copy .V0. So we split it into two vectors of V0 with an involution φ∈G which interchanges V0 and :W: both P(v) and P(φ⋅v) lie in ,V0, and .v=P(v)+φ⋅P(φ⋅v). Thus, wk,n takes up two copies, and we use V2k+1 and .V2k+2.
Finally, since c only contains wk,n for ,n≥k, we only recover wk up to finitely many coordinates. To correct these, we add an element b∈VN which, together with ,G, generates all sequences with only finitely many non-zero coordinates. For this, it is convenient if a single basis vector of V can be moved to all others by ,G, which also makes V⋊G finitely generated. This is the reason for a second shift .r∈G.
Construction
We now make this precise. Let ,Ω:=Z×Z, and let V be the -F3-vector space of finitely supported functions ,Ω→F3, with basis .(ep)p∈Ω. Every bijection σ:Ω→Ω induces an automorphism of V by .σ⋅ep:=eσ(p). For i∈Z let Vi⊆V be the subspace of functions supported on ,{i}×Z, and let W⊆V be the subspace of functions vanishing on .{0}×Z. Then ,V=V0⊕W, and we let P:V→V be the projection onto .V0.
Let u,r be the automorphisms of V induced by the bijections u(i,j):=(i+1,j) and r(i,j):=(i,j+1) of ,Ω, and let φ be the automorphism induced by an involution of Ω which maps {0}×Z onto its complement (both sets are countably infinite). Thus, we have
u⋅Vi=Vi+1,φ⋅V0=W,φ⋅W=V0,φ2=idV.
Let s be the automorphism of V with s⋅x=−x for x∈V0 and s⋅y=y for .y∈W. Let G⊆Aut(V) be the subgroup generated by ,u,r,φ,s, and define the semidirect product
H:=VN⋊G,
where G acts on VN coordinatewise.
Lemma 2. The group H is uncountable and satisfies (2) in Lemma 1.
Proof. Since VN is uncountable, so is .H. The map (z,g)↦((zn,g))n∈N embeds H into ,(V⋊G)N, and V⋊G is generated by ,u,r,φ,s,e(0,0), since .uirj⋅e(0,0)=e(i,j). □
For the proof of (1), we regard VN and G as subgroups of H via z↦(z,1) and ,g↦(0,g), and we keep writing the group VN additively. We extend P coordinatewise to .VN.
Lemma 3. Let x∈V0 and .d∈Z. Then P(ud⋅x)=x if ,d=0, and P(ud⋅x)=0 otherwise.
Proof. For d=0 this holds since P is the identity on .V0. For ,d=0, we have ,ud⋅x∈Vd⊆W, and P vanishes on .W. □
Lemma 4. For v∈V we have
v=P(v)+φ⋅P(φ⋅v).
Proof. Write v=x+y with x∈V0 and ,y∈W, so that .P(v)=x. Since φ⋅x∈W and ,φ⋅y∈V0, we have ,P(φ⋅v)=φ⋅y, and hence .φ⋅P(φ⋅v)=φ2⋅y=y. Therefore, .P(v)+φ⋅P(φ⋅v)=x+y=v. □
Lemma 5. Let Γ⊆H be a subgroup containing .G. Then Γ∩VN is a subgroup of VN which is closed under the action of G and under .P.
Proof. By definition of the semidirect product, conjugation with g∈G in H acts on VN by .z↦g⋅z. Hence, Γ∩VN is closed under the action of .G. For v=x+y with x∈V0 and ,y∈W, we have
s⋅v−v=(−x+y)−(x+y)=−2x=x=P(v),
since −2=1 in .F3. Hence, P(z)=s⋅z−z for ,z∈VN, so Γ∩VN is also closed under .P. □
Proposition 6. The group H satisfies (1) in Lemma 1.
Proof. Let X⊆H be countable. Since every element of H is a product of an element of VN and an element of ,G, there are w0,w1,…∈VN such that X is contained in the subgroup generated by G and .w0,w1,…. Write wk=(wk,n)n∈N and define b,c∈VN by
bn:=un⋅e(0,0),cn:=∑k=0n(u2k+1⋅P(wk,n)+u2k+2⋅P(φ⋅wk,n)).
Let Γ⊆H be the finitely generated subgroup generated by ,u,r,φ,s,b,c, i.e. by ,G, b and .c. By Lemma 5, Γ∩VN is a subgroup of VN containing b and c which is closed under the action of G and under .P. We show that wk∈Γ for all ,k, which implies .X⊆Γ.
First, Γ contains every z∈VN with zn=0 for almost all .n. Indeed, let .n∈N. The coordinate of P(u−n⋅b)∈Γ at n′ is ,P(un′−n⋅e(0,0)), which is e(0,0) for n′=n and 0 otherwise. Acting on this element with uirj replaces e(0,0) by ,e(i,j), and these elements generate all z∈VN with zn′=0 for .n′=n.
Second, let k∈N and .n≥k. All vectors P(wk′,n) and P(φ⋅wk′,n) lie in .V0. If we apply the linear map P∘u−(2k+1) to ,cn, Lemma 3 shows that only the summand with u2k+1 survives, so that .P(u−(2k+1)⋅cn)=P(wk,n). Similarly, .P(u−(2k+2)⋅cn)=P(φ⋅wk,n). Therefore, by Lemma 4, the element
yk:=P(u−(2k+1)⋅c)+φ⋅P(u−(2k+2)⋅c)∈Γ
has coordinate P(wk,n)+φ⋅P(φ⋅wk,n)=wk,n for all .n≥k. Hence, wk−yk has only finitely many non-zero coordinates, so it lies in Γ by the first step, and therefore .wk∈Γ. □
Corollary 7. The category Grpfg of finitely generated groups does not have -ℵ1-filtered colimits.
Proof. Apply Lemma 1 to the group ,H, using Lemma 2 and Proposition 6. □
This page is referenced by the following categories.