Ping-pong lemma for several subgroups
Statement
This version of the ping-pong lemma ensures that several subgroups of a group acting on a set generate a free product. The following statement appears in Olijnyk and Suchchansky (2004), and the proof is from de la Harpe (2000).
Let G be a group acting on a set X and let H1, H2, ..., Hk be subgroups of G where k ≥ 2, such that at least one of these subgroups has order greater than 2. Suppose there exist pairwise disjoint nonempty subsets of such that the following holds:
- For any and for any in , we have .
Then
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 Ping-pong lemma for several subgroups.
Show the path as a graph
- no evidence level
Further reading
- Wikipedia, page 18786361, revision 1361203357, Ping-pong lemma, section Formal statements > Ping-pong lemma for several subgroups. adopted
About this page
| Tag | K71BN4C02T |
|---|---|
| URI | m2://K71BN4C02T |
| Kind | statement, lemma |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status K71BN4C02T. |
| 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.