ping-pong lemma
Theorem (Ping Pong Lemma).
Let and let be a group acting on a space . Suppose we are given a class of pairwise disjoint subsets of and suppose are elements of such that
( is the complement of in ). Then, the subgroup of generated by is free.
Before turning to prove the lemma let’s state three simple facts:
Fact 1.
For all we have and
Proof.
∎
Fact 2.
If then .
Proof.
and are disjoint therefore . Similarly, so . In the same way, so . ∎
Fact 3.
If then
Proof.
Assume by contradiction that . Then, and therefore any element of intersects with either or . However, the elements of are pairwise disjoint and there are at least 4 elements in so this is a contradiction. ∎
Using the above 3 facts, we now turn to the proof of the Ping Pong Lemma:
Proof.
Suppose we are given such that and . and suppose further that is freely reduced, namely, if then . We want to show that in . Assume by contradiction that . We get a contradiction by giving such that and therefore contradicting Fact 3 above since .
The set is chosen as follows. Assume that then:
Define the following subsets of :
To complete the proof we show by induction that for if then:
-
1.
if then .
-
2.
if then .
For the above follows from Fact 1 and the specific choice of . Assume it is true for and assume that . We have two cases to check:
-
1.
: by the induction hypothesis is a subset of for some . Therefore, by Fact 2 we get that is a subset of . Consequently, we get the following:
Hence, if then:
And if then:
-
2.
: by the fact that is freely reduced we get an equality between and . Hence, if then and therefore:
Similiarly, if then and therefore:
∎
Title | ping-pong lemma |
---|---|
Canonical name | PingpongLemma |
Date of creation | 2013-03-22 17:11:21 |
Last modified on | 2013-03-22 17:11:21 |
Owner | uriw (288) |
Last modified by | uriw (288) |
Numerical id | 8 |
Author | uriw (288) |
Entry type | Theorem |
Classification | msc 20F65 |
Synonym | table-tennis lemma |