Math 2.0

Lemma

The Ping-pong lemma for infinite cyclic subgroups

Statement

Let G be a group acting on a set X. Let a1, ...,ak be elements of G of infinite order, where k ≥ 2. Suppose there exist disjoint nonempty subsets

of XX with the following properties:

  • ai(X−Xi−)⊆Xi+a_{i}(X - X_{i}^{-}) \subseteq X_{i}^{+} for i=1,...,ki = 1, ..., k;
  • ai−1(X−Xi+)⊆Xi−a_{i}^{-1}(X - X_{i}^{+}) \subseteq X_{i}^{-} for i=1,...,ki = 1, ..., k.

Then the subgroup H=⟨a1,...,ak⟩≤GH = \langle a_{1}, ..., a_{k}\rangle \le G generated by a1, ..., ak is free with free basis {a1,...,ak}\{a_{1}, ..., a_{k}\}.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first. The path takes the proof Proof of the Ping-pong lemma for infinite cyclic subgroups.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proof of the Ping-pong lemma for infinite cyclic subgroups proof
  2. The Ping-pong lemma for infinite cyclic subgroups statement

Further reading

  1. Wikipedia, page 18786361, revision 1361203357, Ping-pong lemma, section Formal statements > The Ping-pong lemma for infinite cyclic subgroups. adopted
About this page
TagJ1PF2Q7KG1
URIm2://J1PF2Q7KG1
Kindstatement, lemma
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status J1PF2Q7KG1.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

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

What links here

Proofs