Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
type: Item
instance of: scholarly article
title: Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
zbMATH Open document ID: 0626.20050
DOI: 10.1016/0021-8693(86)90070-0
author: Jianyong Qiao
author: Sumit K. Garg
published in: Journal of Algebra
publication date: 1986-01-01T00:00:00Z
review text: This paper is Part II of a nearly monograph-sized study of the ``global theory of semigroups'' [Part I, ibid. 98, 422-451 (1986; Zbl 0584.20053)]. In part I, a structure theory for torsion semigroups was derived. It is based on an iterated matrix construction. In this second part, the structure theory for arbitrary semigroups is developed. The ``global theory of semigroups'' will, given a semigroup T, determine semigroups S and X and a surjective morphism \(\vartheta\) such that X is ``easily globally computed'', S is a ``special'' subsemigroup of X, and \(\vartheta\) is a ``fine'' morphism of S onto T. In this paper, ``special'' means ``equal'', that is, \(S=X\); ``fine'' means ``aperiodic'', that is, \(\vartheta\) is aperiodic if and only if the pre- images of aperiodic subsemigroups of T are aperiodic subsemigroups of S; finally and roughly speaking, a semigroup X is ``easily globally computed'' in the context of this paper, if it is a cyclic monoid, a Rees matrix semigroup over easily globally computed semigroups with countable index sets, or an elementary projective limit of easily globally computed semigroups - at least, this is the construction for the countable case; a modified definition is also given for the uncountable case. Thus, easily globally computed semigroups in the sense of this paper are infinite iterations of matrix semigroups over cyclic monoids. The main result of this paper is as follows: For any given monoid T there exist a monoid X and a surjective morphism \(\vartheta\) : \(X\to T\) such that X is an infinite iteration of matrix semigroups over cyclic monoids and \(\vartheta\) is aperiodic. The result implies that the maximal subgroups of X are finite cyclic groups. In the course of proving this and some related results, quite a few statements of independent importance are derived. Clearly this paper is an outstanding contribution to the structure theory of semigroups and, furthermore, to the discussion concerning its methodology. The revi…
Mathematics Subject Classification ID: 20M10
Mathematics Subject Classification ID: 20M20
Mathematics Subject Classification ID: 20M15
Mathematics Subject Classification ID: 20M30
zbMATH DE Number: 4017197
zbMATH Keywords: torsion semigroups
zbMATH Keywords: aperiodic subsemigroups
zbMATH Keywords: cyclic monoid
zbMATH Keywords: Rees matrix semigroup
zbMATH Keywords: easily globally computed semigroups
zbMATH Keywords: infinite iterations of matrix semigroups
MaRDI profile type: Publication
full work available at URL: 0021-8693(86)90070-0
OpenAlex ID: W2060936678
cites work: Q5570933
cites work: Classification of noncounting events
cites work: Q5515373
cites work: Q5564342
cites work: Q4132170
cites work: Q3853827
cites work: Unending chess, symbolic dynamics and a problem in semi-groups
cites work: Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
cites work: Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
cites work: The kernel of monoid morphisms
cites work: Q3691943
cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions
cites work: On finite \(\mathcal J\)-trivial monoids
cites work: On the complexity of finite semigroups
cites work: Categories as algebra: An essential ingredient in the theory of monoids
cites work: Embedding of regular semigroups in wreath products
cites work: Examples of varieties of semigroups
description: scientific article; zbMATH DE number 4017197