Generating self-map monoids of infinite sets. (Q2464353)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating self-map monoids of infinite sets. |
scientific article |
Statements
Generating self-map monoids of infinite sets. (English)
0 references
19 December 2007
0 references
For a countable infinite set \(\Omega\) by \(S=\text{Sym}(\Omega)\) is denoted the group of permutations of \(\Omega\) and by \(E=\text{Self}(\Omega)\) the monoid of self-maps of \(\Omega\). Given two subgroups \(G_1,G_2\subseteq S\), let us write \(G_1\approx_SG_2\) iff there exists a finite subset \(T\subseteq S\) such that the groups generated by \(G_1\cup T\) and \(G_2\cup T\) are equal. \textit{G. M. Bergman} and \textit{S. Shelah} [Algebra Univers. 55, No. 2-3, 137-173 (2006; Zbl 1111.20004)] have shown that the subgroups which are closed in the function topology on \(S\) fall into exactly four equivalence classes with respect to \(\approx_S\). In this paper, letting \(\approx\) denote the obvious analog of \(\approx_S\) for submonoids of \(E\), the author proves an analogous result for a certain class of submonoids of \(E\), from which the theorem for groups can be recovered.
0 references
monoids
0 references
groups of permutations
0 references
large stabilizers
0 references
function topology
0 references
permutation groups on countably infinite set
0 references