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 with the following properties:
- for ;
- for .
Then the subgroup generated by a1, ..., ak is free with free basis .
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
- no evidence level
Further reading
- Wikipedia, page 18786361, revision 1361203357, Ping-pong lemma, section Formal statements > The Ping-pong lemma for infinite cyclic subgroups. adopted
About this page
| Tag | J1PF2Q7KG1 |
|---|---|
| URI | m2://J1PF2Q7KG1 |
| Kind | statement, lemma |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status J1PF2Q7KG1. |
| Changed | 4 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.