ping-pong lemma


Theorem (Ping Pong Lemma).

Let k≥2 and let G be a group acting on a space X. Suppose we are given a class M={A1,A2,…,Ak,B1,B2,…,Bk} of 2⁢k pairwise disjoint subsets of X and suppose y1,y2,…,yk are elements of G such that

Bic⊆yi⁢(Ai) i=1,2,…,k

(Bic is the complement of Bi in X). Then, the subgroupMathworldPlanetmathPlanetmath of G generated by y1,y2,…,yk is free.

Before turning to prove the lemma let’s state three simple facts:

Fact 1.

For all i=1,…,k we have yi⁢(Aic)⊆Bi and yi-1⁢(Bic)⊆Ai

Proof.

Bic⊆yi⁢(Ai)⟹Bi⊇yi⁢(Ai)c=yi⁢(Aic) ∎

Fact 2.

If i≠j then Aj∪Bj⊆Aic∩Bic.

Proof.

Ai and Aj are disjoint therefore Aj⊆Aic. Similarly, Aj⊆Bic so Aj⊆Aic∩Bic. In the same way, Bj⊆Aic∩Bic so Aj∪Bj⊆Aic∩Bic. ∎

Fact 3.

If R,S∈M then Rc⊈S

Proof.

Assume by contradictionMathworldPlanetmathPlanetmath that Rc⊆S. Then, X=R∪S and therefore any element of M intersects with either R or S. However, the elements of M are pairwise disjoint and there are at least 4 elements in M 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 w=znϵn⁢⋯⁢z2ϵ2⁢z1ϵ1 such that zℓ∈{y1,y2,…,yk} and ϵℓ∈{-1,+1}. and suppose further that w is freely reduced, namely, if zi=zi+1 then ϵi=ϵi+1. We want to show that w≠1 in G. Assume by contradiction that w=1. We get a contradiction by giving R,S∈ℳ such that w⁢(Sc)⊆R and therefore contradicting Fact 3 above since Sc=w⁢(Sc)⊆R.

The set S is chosen as follows. Assume that z1=yi then:

S={Aiif ⁢ϵ1=1Biif ⁢ϵ1=-1

Define the following subsets P0,P1,…,Pn of X:

P0=Sc;P1=z1ϵ1⁢(P0),…,Pn=znϵn⁢(Pn-1)=w⁢(Sc)

To completePlanetmathPlanetmathPlanetmathPlanetmathPlanetmath the proof we show by inductionMathworldPlanetmath that for ℓ=1,2,…,n if zℓ=yi then:

  1. 1.

    if ϵℓ=1 then Pℓ⊆Bi.

  2. 2.

    if ϵℓ=-1 then Pℓ⊆Ai.

For ℓ=1 the above follows from Fact 1 and the specific choice of P0. Assume it is true for ℓ-1 and assume that zℓ=yi. We have two cases to check:

  1. 1.

    zℓ-1≠zℓ: by the induction hypothesis Pℓ-1 is a subset of Aj∪Bj for some j≠i. Therefore, by Fact 2 we get that Pℓ-1 is a subset of Aic∩Bic. Consequently, we get the following:

    Pℓ=zℓϵℓ⁢(Pℓ-1)=yiϵℓ⁢(Pℓ-1)⊆yiϵℓ⁢(Aic∩Bic)

    Hence, if ϵℓ=1 then:

    Pℓ⊆yi⁢(Aic∩Bic)⊆yi⁢(Aic)⊆Bi

    And if ϵℓ=-1 then:

    Pℓ⊆yi-1⁢(Aic∩Bic)⊆yi-1⁢(Bic)⊆Ai
  2. 2.

    zℓ-1=zℓ: by the fact that w is freely reduced we get an equality between ϵℓ-1 and ϵℓ. Hence, if ϵℓ=1 then Pℓ-1⊆Bi⊆Aic and therefore:

    Pℓ=zℓϵℓ⁢(Pℓ-1)=yi⁢(Pℓ-1)⊆yi⁢(Aic)⊆Bi

    Similiarly, if ϵℓ=-1 then Pℓ-1⊆Ai⊆Bic and therefore:

    Pℓ=zℓϵℓ⁢(Pℓ-1)=yi-1⁢(Pℓ-1)⊆yi-1⁢(Bic)⊆Ai

∎

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 TheoremMathworldPlanetmath
Classification msc 20F65
Synonym table-tennis lemma