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.