REES MATRIX THEOREM FOR $\mathcal{D}^{(\ell)}$-SIMPLE STRONGLY RPP SEMIGROUPS
Xiaojiang Guo, Yuqi Guo, K. P. Shum
Abstract
Xiaojiang Guo, Yuqi Guo, K. P. Shum
Abstract
A semigroup S is called rpp if all right principal ideals of S, regarded as S1-systems, are projective. An rpp semigroup S is said to be strongly rpp if for any a ∈ S, there exists a unique idempotent e such that [Formula: see text] and a = ea. In this paper, we show that a [Formula: see text]-simple strongly rpp semigroup can be expressed by a Rees matrix semigroup over a left cancellative monoid and conversely. Our result generalizes the classical theorem of Rees in 1940 and also amplifies the Rees theorem in semigroup given by Lallement and Petrich in 1969.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A semigroup S is called rpp if all right principal ideals of S, regarded as S1-systems, are projective. An rpp semigroup S is said to be strongly rpp if for any a ∈ S, there exists a unique idempotent e such that [Formula: see text] and a = ea. In this paper, we show that a [Formula: see text]-simple strongly rpp semigroup can be expressed by a Rees matrix semigroup over a left cancellative monoid and conversely. Our result generalizes the classical theorem of Rees in 1940 and also amplifies the Rees theorem in semigroup given by Lallement and Petrich in 1969.
Key concepts: Semigroup, Mathematics, Simple (philosophy), Idempotence, Monoid, Pure mathematics, Structured program theorem, Matrix (chemical analysis)