Ping-pong lemma

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.

History

The ping-pong argument goes back to the late 19th century and is commonly attributed

.

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

Formal statements

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 Olijnyk and Suchchansky (2004),^[5] and the proof is from de la Harpe (2000).^[1]

Let G be a group acting on a set X and let H₁, H₂, ..., H_k be 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 X₁, X₂, ...,X_k of X such that the following holds:

• For any i ≠ s and for any h in H_i, h ≠ 1 we have h(X_s) ⊆ X_i.

Then

Proof

By the definition of free product, it suffices to check that a given (nonempty) reduced word represents a nontrivial element of ${\displaystyle G}$. Let ${\displaystyle w}$ be such a word of length ${\displaystyle m\geq 2}$, and let

where ${\textstyle w_{i}\in H_{\alpha _{i}}}$ for some ${\textstyle \alpha _{i}\in \{1,\dots ,k\}}$. Since ${\textstyle w}$ is reduced, we have ${\displaystyle \alpha _{i}\neq \alpha _{i+1}}$ for any ${\displaystyle i=1,\dots ,m-1}$ and each ${\displaystyle w_{i}}$ is distinct from the identity element of ${\displaystyle H_{\alpha _{i}}}$. We then let ${\displaystyle w}$ act on an element of one of the sets ${\textstyle X_{i}}$. As we assume that at least one subgroup ${\displaystyle H_{i}}$ has order at least 3, without loss of generality we may assume that ${\displaystyle H_{1}}$ has order at least 3. We first make the assumption that ${\displaystyle \alpha _{1}}$and ${\displaystyle \alpha _{m}}$ are both 1 (which implies ${\displaystyle m\geq 3}$). From here we consider ${\displaystyle w}$ acting on ${\displaystyle X_{2}}$. We get the following chain of containments:

By the assumption that different ${\displaystyle X_{i}}$'s are disjoint, we conclude that ${\displaystyle w}$ acts nontrivially on some element of ${\displaystyle X_{2}}$, thus ${\displaystyle w}$ represents a nontrivial element of ${\displaystyle G}$.

To finish the proof we must consider the three cases:

• if ${\displaystyle \alpha _{1}=1,\,\alpha _{m}\neq 1}$, then let ${\displaystyle h\in H_{1}\setminus \{w_{1}^{-1},1\}}$ (such an ${\displaystyle h}$ exists since by assumption ${\displaystyle H_{1}}$ has order at least 3);
• if ${\displaystyle \alpha _{1}\neq 1,\,\alpha _{m}=1}$, then let ${\displaystyle h\in H_{1}\setminus \{w_{m},1\}}$;
• and if ${\displaystyle \alpha _{1}\neq 1,\,\alpha _{m}\neq 1}$, then let ${\displaystyle h\in H_{1}\setminus \{1\}}$.

In each case, ${\displaystyle hwh^{-1}}$ after reduction becomes a reduced word with its first and last letter in ${\displaystyle H_{1}}$. Finally, ${\displaystyle hwh^{-1}}$ represents a nontrivial element of ${\displaystyle G}$, and so does ${\displaystyle w}$. This proves the claim.

The Ping-pong lemma for cyclic subgroups

Let G be a group acting on a set X. Let a₁, ...,a_k be elements of G of infinite order, where k ≥ 2. Suppose there exist disjoint nonempty subsets

of X with the following properties:

• a_i(X − X_i^–) ⊆ X_i⁺ for i = 1, ..., k;
• a_i⁻¹(X − X_i⁺) ⊆ X_i^– for i = 1, ..., k.

Then the subgroup H = ⟨a₁, ..., a_k⟩ ≤ G generated by a₁, ..., a_k is free with free basis {a₁, ..., a_k}.

Proof

This statement follows as a corollary of the version for general subgroups if we let X_i = X_i⁺ ∪ X_i⁻ and let H_i = ⟨a_i⟩.

Examples

Special linear group example

One can use the ping-pong lemma to prove^[1] that the subgroup H = ⟨A,B⟩ ≤ SL₂(Z), generated by the matrices

and is free of rank two.

Proof

Indeed, let H₁ = ⟨A⟩ and H₂ = ⟨B⟩ be

of SL₂(Z) generated by A and B accordingly. It is not hard to check that A and B are elements of infinite order in SL₂(Z) and that and

Consider the standard

. Put and

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

Word-hyperbolic group example

Let G be a

n ≥ M, m ≥ M the subgroup H = ⟨gⁿ, h^m⟩ ≤ G is free of rank two.

Sketch of the proof[6]

The group G acts on its hyperbolic boundary ∂G by

.

Since g and h do not commute, 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:

• gⁿ(∂G – U_–) ⊆ U₊
• g⁻ⁿ(∂G – U₊) ⊆ U_–
• h^m(∂G – V_–) ⊆ V₊
• h^−m(∂G – V₊) ⊆ V_–

The ping-pong lemma now implies that H = ⟨gⁿ, h^m⟩ ≤ G is free of rank two.

Applications of the ping-pong lemma

• The ping-pong lemma is used in
  geometrically finite
  .
• Similar Schottky-type arguments are widely used in
  word-hyperbolic groups^[6] and for automorphism groups of trees.^[7]
• The 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.^[8] A similar argument is also utilized in the study of subgroups of the outer automorphism group of a free group.^[9]
• 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.^[2] (see also ^[10] 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
  amalgamated free products and HNN extensions.^[3] These generalizations are used, in particular, in the proof of Maskit's Combination Theorem for Kleinian groups.^[11]
• 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,^[12] and for specific types of actions, e.g. in the context of linear groups,^[13] groups acting on trees^[14] and others.^[15]

References

See also

• Free group
• Free product
• Kleinian group
• Tits alternative
• Word-hyperbolic group
• Schottky group