infinite symmetric group

infinite symmetric group The infinite symmetric group is the group of all permutations of a countably infinite set, typically the natural numbers, and serves as a central example in permutation group theory, combinatorics, set theory, and representation theory. It connects to the work of Évariste Galois, Camille Jordan, William Burnside, Issai Schur, and modern developments involving Andrei Kolmogorov, Alfred Tarski, Alexander Grothendieck, and John von Neumann. Fundamental problems about its algebraic structure, topological refinements, and unitary representations have influenced research at institutions such as University of Cambridge, Harvard University, Institute for Advanced Study, and École Normale Supérieure.

Definition and basic properties

The group is defined as the set of bijections of a countably infinite set, usually ℕ, under composition, relating to classical work of Arthur Cayley, Sophus Lie, Camille Jordan, Felix Klein, and Évariste Galois. It contains all finite symmetric groups Sym(n) as increasing unions, a fact studied by William Burnside and Issai Schur. Algebraic properties echo results by Otto Schreier and Heinrich Zassenhaus: it is not simple, is locally finite, and has rich subgroup lattices examined by Philip Hall and Marshall Hall Jr.. Conjugacy classes correspond to cycle type partitions, an approach rooted in James Joseph Sylvester and Alfred Young combinatorics. Its automorphism group interacts with work of Andrei N. Kolmogorov and Paul Erdős on permutations and combinatorial number theory.

Topologies and symmetric group as a topological group

Equipping the group with the topology of pointwise convergence yields a Polish group structure studied in the tradition of Andrey Kolmogorov, Polish Academy of Sciences, Kurt Gödel, and Alfred Tarski; this topology is compatible with considerations from Andrei Nikolaevich Kolmogorov and André Weil on topological transformation groups. The permutation topology, inherited from product topology on ℕ^ℕ, makes it a non-locally compact, separable, completely metrizable group appearing in research by Alexander Kechris, Greg Hjorth, Saharon Shelah, and H. Jerome Keisler. Other topologies, including the topology of pointwise convergence on finite subsets, connect to profinite completions relevant to Jean-Pierre Serre and Gerd Faltings. Interactions with universal Polish groups and extreme amenability have been explored by Vladimir Pestov and Gábor Székely, while links to the Banach–Tarski paradox invoke investigations by Stefan Banach and Alfred Tarski.

Representations and characters

The classification of unitary representations and characters ties to the pioneering analysis of Issai Schur, Hermann Weyl, Harish-Chandra, and George Mackey. Thoma's theorem, proved by Elmar Thoma, describes extremal characters and relates to harmonic analysis traditions from Norbert Wiener, Salomon Bochner, and John von Neumann. Vershik and Kerov's asymptotic representation theory connects with work by Andrei Vershik and Sergey Kerov on Young diagrams, which also resonates with combinatorial themes developed by Richard Stanley and William Fulton. Connections to factor representations and type II_1 factors draw in contributions from Alain Connes, F. J. Murray, and John von Neumann. Branching rules, induction and restriction between finite symmetric groups echo classical results of Frobenius and Alfred Young.

Subgroups and normal structure

The lattice of subgroups is profoundly intricate, reflecting classical subgroup studies by Philip Hall, Marshall Hall Jr., and Wolfgang Wielandt. Notable subgroups include finitary permutations, oligomorphic permutation groups linked to Peter Cameron, and stabilizer subgroups central to model-theoretic work by Wilfrid Hodges and David Marker. Normal subgroups were classified in landmark results influenced by Oystein Ore and modern refinements by H. Wielandt and Macpherson; the structure involves the finitary alternating group and intersections with permutation modules studied by C. T. C. Wall and John G. Thompson. Embedding theorems involving wreath products relate to contributions by Bertram Huppert and Peter Neumann, while generation and presentation questions recall research by G. A. Miller and R. Steinberg.

Applications and connections (combinatorics, logic, operator algebras)

The infinite symmetric group is central in enumerative combinatorics and asymptotic representation theory as developed by Richard Stanley, Persi Diaconis, Donald Knuth, and Andrei Vershik. In model theory and permutation group theory it appears in work of Alfred Tarski, Saharon Shelah, David M. Evans, and John T. Baldwin on homogeneous structures and oligomorphic groups. Operator algebra connections involve type II_1 factors and noncommutative probability studied by Alain Connes, Dan Voiculescu, Murray and von Neumann, and Frederic Riesz-style functional analysis. Probabilistic methods for random permutations draw on research by Persi Diaconis, Igor Piatetski-Shapiro, and William Feller, while links to statistical mechanics and the symmetric group underlie work by Lars Onsager and Richard Feynman. The group also informs categorical and topos-theoretic perspectives pursued by Alexander Grothendieck and William Lawvere.

Category:Permutation groups