×

Acceptable Morita contexts for semigroups. (English) Zbl 1250.20052

Summary: This short note deals with Morita equivalence of (arbitrary) semigroups. We give a necessary and sufficient condition for a Morita context containing two semigroups \(S\) and \(T\) to induce an equivalence between the category of closed right \(S\)-acts and the category of closed right \(T\)-acts.

MSC:

20M50 Connections of semigroups with homological algebra and category theory
20M30 Representation of semigroups; actions of semigroups on sets
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] S. Talwar, “Morita equivalence for semigroups,” Australian Mathematical Society A, vol. 59, no. 1, pp. 81-111, 1995. · Zbl 0840.20067
[2] M. V. Lawson, “Morita equivalence of semigroups with local units,” Journal of Pure and Applied Algebra, vol. 215, no. 4, pp. 455-470, 2011. · Zbl 1229.20060
[3] V. Laan and L. Márki, “Strong Morita equivalence of semigroups with local units,” Journal of Pure and Applied Algebra, vol. 215, no. 10, pp. 2538-2546, 2011. · Zbl 1237.20057
[4] S. Talwar, “Strong Morita equivalence and a generalisation of the Rees theorem,” Journal of Algebra, vol. 181, no. 2, pp. 371-394, 1996. · Zbl 0855.20054
[5] Y. Q. Chen and K. P. Shum, “Morita equivalence for factorisable semigroups,” Acta Mathematica Sinica, vol. 17, no. 3, pp. 437-454, 2001. · Zbl 0991.20046
[6] L. Marín, “Morita equivalence based on contexts for various categories of modules over associative rings,” Journal of Pure and Applied Algebra, vol. 133, no. 1-2, pp. 219-232, 1998. · Zbl 0928.16007
[7] J. M. Howie, Fundamentals of Semigroup Theory, Clarendon Press, Oxford, UK, 1995. · Zbl 0835.20077
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.