Fair semigroups. Valdis Laan. University of Tartu, Estonia. (Joint research with László Márki) 1/19

Similar documents
MORITA EQUIVALENCE OF SEMIGROUPS REVISITED: FIRM SEMIGROUPS

On axiomatisablity questions about monoid acts

CATEGORICAL SKEW LATTICES

ORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis

Gödel algebras free over finite distributive lattices

Translates of (Anti) Fuzzy Submodules

KAPLANSKY'S PROBLEM ON VALUATION RINGS

Skew lattices of matrices in rings

Laurence Boxer and Ismet KARACA

Introduction to Priestley duality 1 / 24

The illustrated zoo of order-preserving functions

Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups

Congruence lattices of finite intransitive group acts

GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019

TENSOR PRODUCT IN CATEGORY O κ.

Notes on the symmetric group

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET

Laurence Boxer and Ismet KARACA

A Property Equivalent to n-permutability for Infinite Groups

maps 1 to 5. Similarly, we compute (1 2)(4 7 8)(2 1)( ) = (1 5 8)(2 4 7).

κ-bounded Exponential-Logarithmic Power Series Fields

Characterizing large cardinals in terms of layered partial orders

Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals

Chain conditions, layered partial orders and weak compactness

ON PRESENTATIONS OF COMMUTATIVE MONOIDS

SEMICENTRAL IDEMPOTENTS IN A RING

Covering properties of derived models

Theorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.

INTERVAL DISMANTLABLE LATTICES

The finite lattice representation problem and intervals in subgroup lattices of finite groups

Ratio Mathematica 20, Gamma Modules. R. Ameri, R. Sadeghi. Department of Mathematics, Faculty of Basic Science

New tools of set-theoretic homological algebra and their applications to modules

Decompositions of Binomial Ideals

Some Remarks on Finitely Quasi-injective Modules

Development Separation in Lambda-Calculus

Epimorphisms and Ideals of Distributive Nearlattices

Generating all modular lattices of a given size

PURITY IN IDEAL LATTICES. Abstract.

AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS

Fuzzy L-Quotient Ideals

CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS

Algebra homework 8 Homomorphisms, isomorphisms

NOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING

Equivalence between Semimartingales and Itô Processes

Math-Stat-491-Fall2014-Notes-V

The (λ, κ)-fn and the order theory of bases in boolean algebras

Lie Algebras and Representation Theory Homework 7

The Factor Sets of Gr-Categories of the Type (Π,A)

Two-lit trees for lit-only sigma-game

Ideals and involutive filters in residuated lattices

Modular and Distributive Lattices

Residuated Lattices of Size 12 extended version

An effective perfect-set theorem

CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION

Lesson 3: Basic theory of stochastic processes

being saturated Lemma 0.2 Suppose V = L[E]. Every Woodin cardinal is Woodin with.

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

Ore localizations of nearrings

Chapter 4. Cardinal Arithmetic.

A relation on 132-avoiding permutation patterns

arxiv: v1 [math.lo] 24 Feb 2014

arxiv: v2 [math.lo] 13 Feb 2014

DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH

Strong normalisation and the typed lambda calculus

STAT/MATH 395 PROBABILITY II

5 Deduction in First-Order Logic

PSEUDO SEMI B-FREDHOLM AND GENERALIZED DRAZIN INVERTIBLE OPERATORS THROUGH LOCALIZED SVEP

MITCHELL S THEOREM REVISITED. Contents

Pure Skew Lattices in Rings

On the h-vector of a Lattice Path Matroid

Homomorphism and Cartesian Product of. Fuzzy PS Algebras

PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES

4 Martingales in Discrete-Time

Palindromic Permutations and Generalized Smarandache Palindromic Permutations

INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION

Lecture 22. Survey Sampling: an Overview

The Minimal Dominant Set is a Non-Empty Core-Extension

A Translation of Intersection and Union Types

2 Deduction in Sentential Logic

Forecast Horizons for Production Planning with Stochastic Demand

arxiv: v1 [math.ra] 4 Sep 2007

SHIMON GARTI AND SAHARON SHELAH

THE DEODHAR DECOMPOSITION OF THE GRASSMANNIAN AND THE REGULARITY OF KP SOLITONS

Catalan functions and k-schur positivity

The Sorting Index and Permutation Codes. Abstract

PERFECT TREE FORCINGS FOR SINGULAR CARDINALS

Fractional Graphs. Figure 1

Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes

Generating all nite modular lattices of a given size

Philipp Moritz Lücke

Brownian Motion, the Gaussian Lévy Process

Determinacy models and good scales at singular cardinals

Econ 618: Topic 11 Introduction to Coalitional Games

Virtual Demand and Stable Mechanisms

Unary PCF is Decidable

Double Ore Extensions versus Iterated Ore Extensions

Rational points of Abelian varieties in \Gamma-extension

A relative of the approachability ideal, diamond and non-saturation

LATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES

Projective Lattices. with applications to isotope maps and databases. Ralph Freese CLA La Rochelle

Transcription:

Fair semigroups Valdis Laan University of Tartu, Estonia (Joint research with László Márki) 1/19

A semigroup S is called factorisable if ( s S)( x, y S) s = xy. 2/19

A semigroup S is called factorisable if ( s S)( x, y S) s = xy. A semigroup has weak local units if ( s S)( u, v S) s = su = vs. 2/19

A semigroup S is called factorisable if ( s S)( x, y S) s = xy. A semigroup has weak local units if ( s S)( u, v S) s = su = vs. A semigroup has local units if ( s S)( u, v S) s = su = vs u 2 = u v 2 = v. 2/19

A semigroup S is called factorisable if ( s S)( x, y S) s = xy. A semigroup has weak local units if ( s S)( u, v S) s = su = vs. A semigroup has local units if ( s S)( u, v S) s = su = vs u 2 = u v 2 = v. monoid local units weak local units factorisable 2/19

Let S be a semigroup. A right S-act is a set A with a mapping (action of S on A) A S A, (a, s) as such that a(st) = (as)t for all a A, s, t S. 3/19

Let S be a semigroup. A right S-act is a set A with a mapping (action of S on A) A S A, (a, s) as such that a(st) = (as)t for all a A, s, t S. A right S-act A S is called unitary if AS = A, that is, ( a A)( a A)( s S) a = a s. 3/19

Fair semigroups are non-additive analogues of xst-rings. 4/19

Fair semigroups are non-additive analogues of xst-rings. Definition We say that a semigroup S is a right fair semigroup if every subact of a unitary right S-act is unitary. Dually one defines left fair semigroups. By a fair semigroup we mean a semigroup which is both left and right fair. 4/19

Fair semigroups are non-additive analogues of xst-rings. Definition We say that a semigroup S is a right fair semigroup if every subact of a unitary right S-act is unitary. Dually one defines left fair semigroups. By a fair semigroup we mean a semigroup which is both left and right fair. Proposition A semigroup S has weak local units if and only if S is fair and factorisable. 4/19

Theorem A semigroup S is right fair if and only if ( (s i ) i N S N )( n N)( u S) s n... s 2 s 1 = s n... s 2 s 1 u. 5/19

Theorem A semigroup S is right fair if and only if ( (s i ) i N S N )( n N)( u S) s n... s 2 s 1 = s n... s 2 s 1 u. Corollary If S is a right fair semigroup then ( s S)( n N)( u S) s n = s n u. 5/19

Theorem A semigroup S is right fair if and only if ( (s i ) i N S N )( n N)( u S) s n... s 2 s 1 = s n... s 2 s 1 u. Corollary If S is a right fair semigroup then ( s S)( n N)( u S) s n = s n u. Corollary Free semigroups and free commutative semigroups are not fair. 5/19

A semigroup S is called an epigroup if ( s S)( n N) s n belongs to a subgroup of S. Problem Which epigroups are (right) fair? 6/19

Example Consider a semigroup S = {0, a, e} with the multiplication table 0 a e 0 0 0 0 a 0 0 a e 0 0 e The element e is a right identity of S; in particular, S is factorisable and right fair. On the other hand, S is not left fair because the subproducts of the sequence a, e, e, e,... are all equal to a and sa = 0 for all s S.. 7/19

Let U(S S ) be the union of all right ideals I of a semigroup S which are right unitary, that is, IS = I. Then U(S S ) is the largest right ideal of S which is right unitary. Dually one can consider the left ideal U( S S). 8/19

Let U(S S ) be the union of all right ideals I of a semigroup S which are right unitary, that is, IS = I. Then U(S S ) is the largest right ideal of S which is right unitary. Dually one can consider the left ideal U( S S). If S is a factorisable semigroup then both S S and S S are unitary, hence for factorisable semigroups S we have U(S S ) = U( S S) = S. 8/19

Let U(S S ) be the union of all right ideals I of a semigroup S which are right unitary, that is, IS = I. Then U(S S ) is the largest right ideal of S which is right unitary. Dually one can consider the left ideal U( S S). If S is a factorisable semigroup then both S S and S S are unitary, hence for factorisable semigroups S we have U(S S ) = U( S S) = S. Lemma If S is a right fair semigroup then U(S S ) is a two-sided ideal of S. 8/19

Lemma Let S be a fair semigroup. For every s S, the following assertions are equivalent. 1. s U(S S ). 2. s = su for some u S. 3. s U( S S). 4. s = us for some u S. 9/19

Lemma Let S be a fair semigroup. For every s S, the following assertions are equivalent. 1. s U(S S ). 2. s = su for some u S. 3. s U( S S). 4. s = us for some u S. By this lemma, U(S S ) = U( S S), so we denote this set by U(S) and call it the unitary part of the fair semigroup S. 9/19

Corollary If S is a fair semigroup then the set U(S) = {s S s = su = vs for some u, v S} is a two-sided ideal of S. Moreover, U(S) is a semigroup with weak local units (hence also a fair semigroup). 10/19

Example 1. Every semigroup with weak local units (in particular every monoid) is a fair semigroup. 11/19

Example 1. Every semigroup with weak local units (in particular every monoid) is a fair semigroup. 2. If S is a semigroup such that S n is a right fair semigroup for some n N then S itself is a right fair semigroup. In particular, every nilpotent semigroup (a semigroup with zero in which every product of a given length is zero) is a fair semigroup. 11/19

Example 1. Every semigroup with weak local units (in particular every monoid) is a fair semigroup. 2. If S is a semigroup such that S n is a right fair semigroup for some n N then S itself is a right fair semigroup. In particular, every nilpotent semigroup (a semigroup with zero in which every product of a given length is zero) is a fair semigroup. 3. The multiplicative semigroup of a right xst-ring is right fair. 11/19

Example 1. Every semigroup with weak local units (in particular every monoid) is a fair semigroup. 2. If S is a semigroup such that S n is a right fair semigroup for some n N then S itself is a right fair semigroup. In particular, every nilpotent semigroup (a semigroup with zero in which every product of a given length is zero) is a fair semigroup. 3. The multiplicative semigroup of a right xst-ring is right fair. 4. Every finite monogenic semigroup is a fair semigroup. 11/19

Example 1. Every semigroup with weak local units (in particular every monoid) is a fair semigroup. 2. If S is a semigroup such that S n is a right fair semigroup for some n N then S itself is a right fair semigroup. In particular, every nilpotent semigroup (a semigroup with zero in which every product of a given length is zero) is a fair semigroup. 3. The multiplicative semigroup of a right xst-ring is right fair. 4. Every finite monogenic semigroup is a fair semigroup. 5. A homomorphic image of a fair semigroup is a fair semigroup. 11/19

Example 1. Every semigroup with weak local units (in particular every monoid) is a fair semigroup. 2. If S is a semigroup such that S n is a right fair semigroup for some n N then S itself is a right fair semigroup. In particular, every nilpotent semigroup (a semigroup with zero in which every product of a given length is zero) is a fair semigroup. 3. The multiplicative semigroup of a right xst-ring is right fair. 4. Every finite monogenic semigroup is a fair semigroup. 5. A homomorphic image of a fair semigroup is a fair semigroup. 6. A direct product of finitely many fair semigroups is a fair semigroup. 11/19

Example 1. A subsemigroup of a fair semigroup need not be a fair semigroup: for any semigroup T, T 1 is a fair semigroup. 12/19

Example 1. A subsemigroup of a fair semigroup need not be a fair semigroup: for any semigroup T, T 1 is a fair semigroup. 2. A direct product of infinitely many fair semigroups is not necessarily a fair semigroup. 12/19

Example 1. A subsemigroup of a fair semigroup need not be a fair semigroup: for any semigroup T, T 1 is a fair semigroup. 2. A direct product of infinitely many fair semigroups is not necessarily a fair semigroup. 3. An ideal extension of a fair semigroup by a fair semigroup need not be itself fair. 12/19

Example 1. A subsemigroup of a fair semigroup need not be a fair semigroup: for any semigroup T, T 1 is a fair semigroup. 2. A direct product of infinitely many fair semigroups is not necessarily a fair semigroup. 3. An ideal extension of a fair semigroup by a fair semigroup need not be itself fair. 4. A finite semigroup generated by two elements need not be fair: {a, e} is a generating set for the non-fair semigroup S = {0, a, e} presented earlier. 12/19

Lemma If a semigroup S has the descending chain condition (DCC) for principal left ideals then for each sequence (s i ) i N S N there exist n N and u S 1 such that s n... s 1 = us n+1 s n... s 1. 13/19

Lemma If a semigroup S has the descending chain condition (DCC) for principal left ideals then for each sequence (s i ) i N S N there exist n N and u S 1 such that s n... s 1 = us n+1 s n... s 1. Proposition Every commutative semigroup with DCC for principal ideals is a fair semigroup. 13/19

Lemma If a semigroup S has the descending chain condition (DCC) for principal left ideals then for each sequence (s i ) i N S N there exist n N and u S 1 such that s n... s 1 = us n+1 s n... s 1. Proposition Every commutative semigroup with DCC for principal ideals is a fair semigroup. Corollary Every finite commutative semigroup is a fair semigroup. 13/19

Definition A right S-act A S is called firm if the mapping is bijective. µ S : A S A, a s as 14/19

Definition A right S-act A S is called firm if the mapping is bijective. µ S : A S A, a s as The category of all firm right S-acts is denoted by FAct S. 14/19

Definition Semigroups S and T are called Morita equivalent if the categories FAct S and FAct T are equivalent; 15/19

Definition Semigroups S and T are called Morita equivalent if the categories FAct S and FAct T are equivalent; strongly Morita equivalent if they are contained in a unitary surjective Morita context. 15/19

Definition Semigroups S and T are called Morita equivalent if the categories FAct S and FAct T are equivalent; strongly Morita equivalent if they are contained in a unitary surjective Morita context. If S and T are strongly Morita equivalent then they are factorisable. 15/19

Definition A semigroup S has common weak right local units if ( s, t S)( u S) s = su t = tu. 16/19

Definition A semigroup S has common weak right local units if ( s, t S)( u S) s = su t = tu. Proposition If S is a right fair semigroup such that U(S S ) has common weak right local units then S and U(S S ) are Morita equivalent. 16/19

Definition A semigroup S has common weak right local units if ( s, t S)( u S) s = su t = tu. Proposition If S is a right fair semigroup such that U(S S ) has common weak right local units then S and U(S S ) are Morita equivalent. Corollary Finite monogenic semigroup is Morita equivalent to its group part. Hence Morita equivalent semigroups need not be strongly Morita equivalent. 16/19

Theorem Let S, T be right fair semigroups such that U(S S ), U(T T ) have common weak right local units. Then the following are equivalent: 17/19

Theorem Let S, T be right fair semigroups such that U(S S ), U(T T ) have common weak right local units. Then the following are equivalent: 1. S and T are Morita equivalent; 17/19

Theorem Let S, T be right fair semigroups such that U(S S ), U(T T ) have common weak right local units. Then the following are equivalent: 1. S and T are Morita equivalent; 2. U(S S ) and U(T T ) are Morita equivalent; 17/19

Theorem Let S, T be right fair semigroups such that U(S S ), U(T T ) have common weak right local units. Then the following are equivalent: 1. S and T are Morita equivalent; 2. U(S S ) and U(T T ) are Morita equivalent; 3. U(S S ) and U(T T ) are strongly Morita equivalent. 17/19

References 1. V. Laan, L. Márki, Fair semigroups and Morita equivalence, Semigroup Forum 92 (2016), 633 644. 2. Y. Xu, K.P. Shum, R.F. Turner-Smith, Morita-like equivalence of infinite matrix subrings, J. Algebra 159 (1993), 425 435. 3. J.L. García, L. Marín, Rings having a Morita-like equivalence, Commun. Algebra 27 (1999), 665 680. 18/19

Thank you! 19/19