Ping-pong lemma

The ping-pong lemma is a criterion for proving that group elements generate a free subgroup by showing they move specified subsets of a set into one another in a prescribed way.

Group action: A group action is a rule assigning each group element a permutation of a set, compatibly with group multiplication. The lemma translates conditions on a group action into a conclusion about subgroup relations.
Schottky group: A Schottky group is a free, discrete group of Möbius transformations constructed using paired circles or disks. Its defining geometric construction supplies ping-pong regions for free generators.
Felix Klein: Felix Klein was a German mathematician whose work shaped geometry, group theory, and the Erlangen program. Klein developed geometric methods for constructing groups that became standard examples of ping-pong.
Nielsen–Schreier theorem: The Nielsen–Schreier theorem states that every subgroup of a free group is free. It derives freeness from an already free ambient group, unlike ping-pong’s action-based criterion.
Free group: A free group is generated by elements subject only to the group axioms, with no additional relations. The ping-pong conditions establish that the chosen generators satisfy no nontrivial relations.
North-south dynamics: North-south dynamics describes a transformation with an attracting point and a repelling point on a compact space. Attracting and repelling regions can satisfy the lemma’s required set inclusions.
Heinrich Martin Weber: Heinrich Martin Weber was a German mathematician who worked in algebra, number theory, and function theory. Weber’s late nineteenth-century work is associated with early formulations of the ping-pong method.
Small cancellation theory: Small cancellation theory studies groups whose presentations have relators with limited overlap. It proves strong structural results from presentation constraints rather than disjoint action regions.
Reduced word: A reduced word is a sequence of group generators and inverses containing no adjacent mutually inverse pair. The proof tracks how successive letters of a reduced word move a point between subsets.
Klein combination theorem: Klein’s combination theorem gives conditions under which groups acting on a space combine into a larger group with controlled structure. Its geometric group constructions use related disjoint-region arguments to establish subgroup structure.

Linked from 1 page