Rahul Sharma (Editor)

Ping pong lemma

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, the ping-pong lemma, or table-tennis lemma, is any of several mathematical statements that ensure that several elements in a group acting on a set freely generates a free subgroup of that group.

Contents

History

The ping-pong argument goes back to late 19th century and is commonly attributed to Felix Klein who used it to study subgroups of Kleinian groups, that is, of discrete groups of isometries of the hyperbolic 3-space or, equivalently Möbius transformations of the Riemann sphere. The ping-pong lemma was a key tool used by Jacques Tits in his 1972 paper containing the proof of a famous result now known as the Tits alternative. The result states that a finitely generated linear group is either virtually solvable or contains a free subgroup of rank two. The ping-pong lemma and its variations are widely used in geometric topology and geometric group theory.

Modern versions of the ping-pong lemma can be found in many books such as Lyndon&Schupp, de la Harpe, Bridson&Haefliger and others.

Ping-pong lemma for several subgroups

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, and the proof is from.

Let G be a group acting on a set X and let H1, H2,...., Hk be nontrivial 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 X1, X2,....,Xk of X such that the following holds:

  • For any i≠s and for any h∈Hi, h≠1 we have h(Xs)⊆Xi.

    • Then

    ⟨ H 1 , … , H k ⟩ = H 1 ∗ ⋯ ∗ H k .

    Proof

    By the definition of free product, it suffices to check that a given reduced word is nontrivial. Let w be such a word, and let

    w = ∏ i = 1 m w α i , β i .

    Where ws,βk∈ Hs for all such βk, and since w is fully reduced αi≠ αi+1 for any i. We then let w act on an element of one of the sets Xi. As we assume for at least one subgroup Hi has order at least 3, without loss we may assume that H1 is at least 3. We first make the assumption that α1 and αm are both 1. From here we consider w acting on X2. We get the following chain of containments and note that since the Xi are disjoint that w acts nontrivially and is thus not the identity element.

    w ( X 2 ) ⊆ ∏ i = 1 m − 1 w α i , β i ( X 1 ) ⊆ ∏ i = 1 m − 2 w α i , β i ( X α m − 1 ) ⊆ ⋯ ⊆ w 1 , β 1 w α 2 , β 2 ( X α 3 ) ⊆ ⊆ w 1 , β 1 ( X α 2 ) ⊆ X 1

    To finish the proof we must consider the three cases:

  • If α 1 = 1 ; α m ≠ 1 , then let h ∈ H 1 ∖ { w 1 , β 1 − 1 , 1 }
  • If α 1 ≠ 1 ; α m = 1 , then let h ∈ H 1 ∖ { w 1 , β m , 1 }
  • And if α 1 ≠ 1 ; α m ≠ 1 , then let h ∈ H 1 ∖ { 1 }

    • In each case, hwh−1 is a reduced word with α1' and αm '' both 1, and thus is nontrivial. Finally, hwh−1 is not 1, and so neither is w. This proves the claim.

    The Ping-pong lemma for cyclic subgroups

    Let G be a group acting on a set X. Let a1,...,ak be elements of G, where k ≥ 2. Suppose there exist disjoint nonempty subsets

    X1+,...,Xk+ and X1–,...,Xk–

    of X with the following properties:

  • ai(X − Xi–) ⊆ Xi+ for i = 1, ..., k;
  • ai−1(X − Xi+) ⊆ Xi– for i = 1, ..., k.

    • Then the subgroup H = <a1, ..., ak> ≤ G generated by a1, ..., ak is free with free basis {a1, ..., ak}.

    Proof

    This statement follows as a corollary of the version for general subgroups if we let Xi= Xi+∪Xi− and let Hi = ⟨ai⟩.

    Special linear group example

    One can use the ping-pong lemma to prove that the subgroup H = <A,B>≤SL(2,Z), generated by the matrices

    A = ( 1 2 0 1 ) and B = ( 1 0 2 1 )

    is free of rank two.

    Proof

    Indeed, let H1 = <A> and H2 = <B> be cyclic subgroups of SL(2,Z) generated by A and B accordingly. It is not hard to check that A and B are elements of infinite order in SL(2,Z) and that

    H 1 = { A n | n ∈ Z } = { ( 1 2 n 0 1 ) : n ∈ Z }

    and

    H 2 = { B n | n ∈ Z } = { ( 1 0 2 n 1 ) : n ∈ Z } .

    Consider the standard action of SL(2,Z) on R2 by linear transformations. Put

    X 1 = { ( x y ) ∈ R 2 : | x | > | y | }

    and

    X 2 = { ( x y ) ∈ R 2 : | x | < | y | } .

    It is not hard to check, using the above explicitly descriptions of H1 and H2 that for every nontrivial g ∈ H1 we have g(X2) ⊆ X1 and that for every nontrivial g ∈ H2 we have g(X1) ⊆ X2. Using the alternative form of the ping-pong lemma, for two subgroups, given above, we conclude that H = H1∗H2. Since the groups H1 and H2 are infinite cyclic, it follows that H is a free group of rank two.

    Word-hyperbolic group example

    Let G be a word-hyperbolic group which is torsion-free, that is, with no nontrivial elements of finite order. Let g, h ∈ G be two non-commuting elements, that is such that gh ≠ hg. Then there exists M≥1 such that for any integers n ≥ M, m ≥ M the subgroup H = <gn, hm> ≤ G is free of rank two.

    Sketch of the proof

    The group G acts on its hyperbolic boundary ∂G by homeomorphisms. It is known that if a ∈ G is a nontrivial element then a has exactly two distinct fixed points, a∞ and a−∞ in ∂G and that a∞ is an attracting fixed point while a−∞ is a repelling fixed point.

    Since g and h do not commute, the basic facts about word-hyperbolic groups imply that g∞, g−∞, h∞ and h−∞ are four distinct points in ∂G. Take disjoint neighborhoods U+, U–, V+ and V– of g∞, g−∞, h∞ and h−∞ in ∂G respectively. Then the attracting/repelling properties of the fixed points of g and h imply that there exists M ≥ 1 such that for any integers n ≥ M, m ≥ M we have:

  • gn(∂G – U–) ⊆ U+
  • g−n(∂G – U+) ⊆ U–
  • hm(∂G – V–) ⊆ V+
  • h−m(∂G – V+) ⊆ V–

    • The ping-pong lemma now implies that H = <gn, hm> ≤ G is free of rank two.

    Applications of the ping-pong lemma

  • The ping-pong lemma is used in Kleinian groups to study their so-called Schottky subgroups. In the Kleinian groups context the ping-pong lemma can be used to show that a particular group of isometries of the hyperbolic 3-space is not just free but also properly discontinuous and geometrically finite.
  • Similar Schottky-type arguments are widely used in geometric group theory, particularly for subgroups of word-hyperbolic groups and for automorphism groups of trees.
  • Ping-pong lemma is also used for studying Schottky-type subgroups of mapping class groups of Riemann surfaces, where the set on which the mapping class group acts is the Thurston boundary of the Teichmüller space. A similar argument is also utilized in the study of subgroups of the outer automorphism group of a free group.
  • One of the most famous applications of the ping-pong lemma is in the proof of Jacques Tits of the so-called Tits alternative for linear groups. (see also for an overview of Tits' proof and an explanation of the ideas involved, including the use of the ping-pong lemma).
  • There are generalizations of the ping-pong lemma that produce not just free products but also amalgamated free products and HNN extensions. These generalizations are used, in particular, in the proof of Maskit's Combination Theorem for Kleinian groups.
  • There are also versions of the ping-pong lemma which guarantee that several elements in a group generate a free semigroup. Such versions are available both in the general context of a group action on a set, and for specific types of actions, e.g. in the context of linear groups, groups acting on trees and others.

    • References

    Ping-pong lemma Wikipedia
    (Text) CC BY-SA


    Similar Topics