For a finitely generated group , every quotient group is generated by the images of the . Thus finite generation passes to quotients.
For a group extension , suppose and are finitely generated. Choose finite group generators of and lifts to of finite group generators of . For any , a word in the lifts has the same image as in , so their difference belongs to . Thus the two finite sets together generate , proving preservation under extensions.
For a subgroup of finite index, choose representatives of the right cosets , with representing , and a finite symmetric generating set for . Write for the chosen representative of . The finitely many Schreier generatorsbelong to . If , set , so . ThenEach factor is a listed generator because . Therefore is finitely generated. This proves Schreier's lemma directly.
An infinite locally finite group isIts elements are binary sequences of finite support, with coordinatewise addition. It is infinite because the unit vectors are distinct. Any finite collection of elements has its supports contained in one finite set of coordinates, and the subgroup it generates lies in the corresponding finite product of copies of . Hence every finitely generated subgroup is finite.
Local finiteness passes to subgroups because a finitely generated subgroup of a subgroup is also one of the ambient group. It passes to quotients as well: lift finitely many group generators of a subgroup in the quotient; the subgroup generated by their lifts is finite, and its image is exactly the desired subgroup.
For local finiteness is closed under extensions, suppose and are locally finite, and take a finitely generated subgroup . Its image is finitely generated, hence finite. The map has kernel , soThe finite-index result already proved makes finitely generated. Local finiteness of makes it finite, and thenSince was arbitrary, is locally finite. Thus finite generation is preserved by quotients, extensions and finite-index subgroups; local finiteness is preserved by subgroups, quotients and extensions.
The assumed group is a Tarski monster group. For any , its cyclic subgroup must be proper. Otherwise would be infinite cyclic, and would be a proper nontrivial infinite subgroup, contrary to the hypothesis. Hence has order .
Choose , possible because is infinite. The subgroup contains strictly. If it were proper, it would have order and could not strictly contain the order- subgroup . ThereforeIn particular, is a finitely generated group, generated by two elements.
Suppose is proper. The defining property makes cyclic of order . Conjugation gives a homomorphismwhose kernel is the centralizer . The automorphism group has order , so the kernel has finite index in . It contains , because is abelian. If this kernel were proper, it would be an order- subgroup, and its finite index would force itself to be finite. Therefore , so is central.
Choose . Part (i) shows that has order . Its cyclic subgroup meets trivially, since two order- subgroups with nontrivial intersection are equal. Since is central,This subgroup has order and is proper because is infinite, contradicting the assumed order of every proper nontrivial subgroup. Thus no such exists:Together with part (i), this proves that Tarski monster groups are two-generated and simple.
For the replacement condition, interpret “every element has order ” in the usual exponent- sense: every nonidentity element has order , while the identity has order one. ConsiderEvery nonzero element has order . It is infinite, but no finite collection generates it: the supports of finitely many group generators cover only finitely many coordinates, so a unit vector outside those coordinates is missing from their generated subgroup. Also is abelian, and one coordinate subgroup is a proper nontrivial normal subgroup. ThereforeThe stronger restriction on all proper subgroups, rather than just individual element orders, is what forces the conclusions in parts (i) and (ii).
Articles by others on the same topic
There are currently no matching articles.