Proof of the Ping-pong lemma for infinite cyclic subgroups
Proof
This statement follows as a corollary of the version for general subgroups if we let and let .
Where this leads
1 page builds on this one.
Further reading
- Wikipedia, page 18786361, revision 1361203357, Ping-pong lemma, section Formal statements > The Ping-pong lemma for infinite cyclic subgroups > Proof. adopted
About this page
| Tag | HM52W253FQ |
|---|---|
| URI | m2://HM52W253FQ |
| Kind | proof |
| Writing | W0 stub |
| Proves | The Ping-pong lemma for infinite cyclic subgroups |
| Changed | 4 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)
- edge uses out: each node that the argument 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
No page links to this page yet.