|
|
|
|
ping-pong lemma
|
(Theorem)
|
|
|
Before turning to prove the lemma let's state three simple facts:
Proof.

Proof.  and  are disjoint therefore
 . Similarly,
 so
 . In the same way,
 so
 . 
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:
|
"ping-pong lemma" is owned by uriw.
|
|
(view preamble)
| Other names: |
table-tennis lemma |
|
|
Cross-references: equality, induction hypothesis, induction, reduced, intersects, contradiction, disjoint, generated by, subgroup, complement, subsets, pairwise disjoint, class, group
This is version 5 of ping-pong lemma, born on 2007-06-03, modified 2007-06-03.
Object id is 9507, canonical name is PingPongLemma.
Accessed 821 times total.
Classification:
| AMS MSC: | 20F65 (Group theory and generalizations :: Special aspects of infinite or finite groups :: Geometric group theory) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|