Submonoids of Infinite Symmetric Inverse Monoids
Abstract
In this thesis we study the subsemigroup structure of the symmetric inverse monoid IX, the inverse semigroup of bijections between subsets of the set X, when X is an infinite set. We explore three different approaches to this task. First, we classify the maximal subsemigroups of IX containing certain subgroups of the symmetric group on X. The subgroups in question are the symmetric group itself, the pointwise stabiliser of a finite non-empty subset of X, the stabiliser of an ultrafilter on X, and the stabiliser of a finite partition of X. Next, we study subsemigroups of IX which are closed in semigroup topologies on IX introduced by Elliot et al. in 2023. We discover that the closed subsemigroups in these topologies that contain all the idempotents of IX coincide exactly with semigroups of partial endomorphisms and partial automorphisms of relational structures defined on X. Furthermore, we show that if a relational structure R on a countable set X only contains a finite number of relations, then there exists a finite subset U of IX such that the union of the partial automorphisms of R together with U generates all of IX. Finally, we study the subsemigroup structure of IX under a preorder introduced by George Bergman and Saharon Shelah in 2006 for the symmetric group. Extending the preorder to IX, if S1 and S2 are subsemigroups of IX, we say that S1 S2 if there exists a finite subset U of IX such that S1 is contained in the semigroup generated by the union of S2 and U. We classify certain types of subsemigroups of IX according the Bergman-Shelah preorder, and we formulate a conjecture analogous to the main result by Bergman and Shelah.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.