Closed subgroups of the infinite symmetric group.

DOI10.1007/S00012-006-1959-ZzbMATH Open1111.20004arXivmath/0401305OpenAlexW2163622252MaRDI QIDQ861597FDOQ861597

Authors: George M. Bergman, S. Shelah 

Publication date: 29 January 2007

Published in: Algebra Universalis (Search for Journal in Brave)

Abstract: Let S=Sym(Omega) be the group of all permutations of a countably infinite set Omega, and for subgroups G_1, G_2leq S let us write G_1approx G_2 if there exists a finite set Usubseteq S such that < G_1cup U > = < G_2cup U >. It is shown that the subgroups closed in the function topology on S lie in precisely four equivalence classes under this relation. Which of these classes a closed subgroup G belongs to depends on which of the following statements about pointwise stabilizer subgroups G_{(Gamma)} of finite subsets GammasubseteqOmega holds: (i) For every finite set Gamma, the subgroup G_{(Gamma)} has at least one infinite orbit in Omega. (ii) There exist finite sets Gamma such that all orbits of G_{(Gamma)} are finite, but none such that the cardinalities of these orbits have a common finite bound. (iii) There exist finite sets Gamma such that the cardinalities of the orbits of G_{(Gamma)} have a common finite bound, but none such that G_{(Gamma)}={1}. (iv) There exist finite sets Gamma such that G_{(Gamma)}={1}. Some questions for further investigation are discussed.

Full work available at URL: https://arxiv.org/abs/math/0401305

Recommendations

• Orbit-equivalent infinite permutation groups.
• A note on automorphism groups of countably infinite structures
• scientific article; zbMATH DE number 3124845
• Generating self-map monoids of infinite sets.
• Generating the infinite symmetric group using a closed subgroup and the least number of other elements

zbMATH Keywords

cardinalities of orbits of stabilizers of finite setsequivalence relations on subgroupsfull permutation group on countably infinite setsubgroups closed in function topology

Mathematics Subject Classification ID

Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05) General theory for infinite permutation groups (20B07)

Cited In (17)

• Generating self-map monoids of infinite sets.
• Some results on embeddings of algebras, after de Bruijn and McKenzie
• Relative ranks of Lipschitz mappings on countable discrete metric spaces
• The Bergman-Shelah preorder on transformation semigroups
• Title not available (Why is that?)
• A note on automorphism groups of countably infinite structures
• Orbit-equivalent infinite permutation groups.
• Generating the infinite symmetric group using a closed subgroup and the least number of other elements
• Endomorphism rings generated using small numbers of elements
• Effectively closed subgroups of the infinite symmetric group
• Collineation group as a subgroup of the symmetric group.
• From isolated subgroups to generic permutation representations
• Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.
• Maximal subsemigroups of the semigroup of all mappings on an infinite set.
• Topological automorphism groups of compact quantum groups
• Infinite symmetric groups.
• Coarse groups, and the isomorphism problem for oligomorphic groups

This page was built for publication: Closed subgroups of the infinite symmetric group.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861597)