Math 2.0

Group theory and generalizations Infinite groups and combinatorial group theory Object

Tarski monster group

Description

Let pp be a prime. A Tarski monster group for pp is an infinite group GG in which every subgroup other than {1}\set{1} and GG is cyclic of order pp. Ol'shanskii proved, with small cancellation methods, that a Tarski monster group exists for every prime p>1075p > 10^{75}.

Remarks

Let g≠1g \ne 1 in GG. If ⟨g⟩=G\langle g \rangle = G, then G≅ℤG \cong \Z, which has the subgroup 2ℤ2\Z of infinite order; this is impossible. So ⟨g⟩\langle g \rangle is a proper subgroup other than {1}\set{1}, and gg has order pp. Two elements x,yx, y that do not lie in one subgroup of order pp generate GG, since ⟨x,y⟩\langle x, y \rangle is neither trivial nor cyclic of order pp. So GG is generated by 22 elements and has exponent pp, and it answers the bounded Burnside problem in the negative for this pp.

GG is simple. Let N≠{1}N \ne \set{1} be a normal subgroup with N≠GN \ne G; then NN has order pp. Take x∉Nx \notin N; then ⟨x⟩N\langle x \rangle N is a subgroup of order at most p2p^2, so it is proper since GG is infinite. It contains NN and xx, so it is not cyclic of order pp, a contradiction.

Further reading

  1. Web https://en.wikipedia.org/wiki/Tarski_monster_group
About this page
TagTE19BGFFF1
URIm2://TE19BGFFF1
Kindobject
WritingW0 stub
MSC20F50, 20F06
Instance ofTorsion group, Simple group
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.