We describe the structure of any congruence of a permutable inverse semigroup of finite rank.As is known, any two congruences on a group are permutable with respect to the ordinary operation of superposition of binary relations. It is obvious that algebraic structures containing a group structure (rings, moduli, etc.) possess the corresponding property. Equasigroups and finite quasigroups also belong to the class of binary algebras with permutable congruences. As for the theory of semigroups, only classes of semigroups with permutable congruences (Brandt semigroups, all types of finite symmetric semigroups, semigroups of endomorphisms and partial automorphisms of a linearly ordered set, etc.) are known. Necessary and sufficient conditions under which an antigroup of finite rank is permutable (for the definition, see Sec. 1) were established in [1]. In the present paper, we substantially generalize the results of [1]. In Sec. 4 (Theorem 4), we describe the structure of any congruence of a permutable inverse semigroup with zero of finite rank. Main Terminology and NotationA semilattice S is called a semilattice of finite length if there exists a natural number n such that the length of any chain from S does not exceed n.Let P be an ordered set of finite length with smallest element 0. The supremum of the lengths of chains that connect 0 and an element x is called the height of the element x and is denoted by h ( x ).Let S be an arbitrary semigroup and let N 0 be the set of all nonnegative integers. A function rank : S → N 0 is called a rank function on a semigroup S if, for any elements a, b ∈ S, the following inequality is true:The number rank ( a ) is called the rank of the element a.A semigroup is called permutable if any two congruences on it are permutable with respect to the ordinary superposition of binary relations.For other necessary notions from the theory of semigroups and theory of inverse semigroups, see [2, 3]. Rank Function and Its Main PropertiesIn this section, we introduce a rank function on an inverse semigroup whose semilattice of idempotents is of finite length and establish its main properties. To this end, we first define the rank of an element of a semilattice of finite length.
We consider maximal stable orders on semigroups that belong to a certain class of inverse semigroups of finite rank.
We describe the structure of a Munn semigroup of finite rank every stable order of which is fundamental or antifundamental.The Munn semigroup (see [1]), i.e., the inverse semigroup of all isomorphisms between principal ideals of a semilattice with respect to the ordinary operation of composition of binary relations, plays a fundamental role in the theory of representations of inverse semigroups (see [2, p. 170]). This explains the importance of comprehensive investigation of these semigroups and their classification.In the present paper, we investigate the structure of a Munn semigroup of finite rank every order of which is fundamental or antifundamental (for definitions, see Sec. 1). The main result of this paper is Theorem 1. Main Definitions and TerminologyA semilattice E is called a semilattice of finite length if there exists a natural number n such that the length of any chain from E does not exceed n.Let E be a semilattice of finite length. It is obvious that it contains the least element, which we denote by 0. Let T E denote the Munn semigroup, i.e., the inverse semigroup of all isomorphisms between the principal ideals of the semilattice E with respect to the ordinary operation of composition of binary relations. It is clear that the transformation 0 0 ⎛ ⎝ ⎜ ⎞ ⎠ ⎟ is the least element of the semigroup T E . Denote the domain of definition and the range of values of the transformation f T E ∈ by dom ( ) f and im ( ) f , respectively. Let S be an arbitrary semigroup and let N 0 be the set of all nonnegative integers. A function rank : S → N 0 is called a rank function on the semigroup S if rank ( ) ab ≤ min ( ) rank a ( , rank ( ) b ) for any a b S , ∈ . The number rank ( )x is called the rank of the element x. Let S be an inverse semigroup whose lattice of idempotents has finite length. The function rank ( ) a = h aa -1 ( ) , where h aa -1 ( ) is the height of the idempotent aa -1 in the semilattice of idempotents of the semigroup S, is a rank function (see [3]). We say that an inverse semigroup is a semigroup of finite rank if the semilattice of its idempotents has finite length.Let f T E ∈ . If dom ( ) f = aE, then, by definition, rank ( ) f = rank ( ) a , where rank ( ) a is the height of the element a in the semilattice E. In [4], it was proved that rank : T E → N 0 is a rank function.An order relation τ on an arbitrary semigroup S is called fundamental (see [5] or [6, p. 289]) if the ordered semigroup ( ; ) S τ is O-isomorphic to a certain semigroup of partial transformations of a set ordered by in-
A semigroup any two congruences of which commute as binary relations is called a permutable semigroup. We describe the structure of a permutable Munn semigroup of finite rank.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.