Adequate and Ehresmann semigroups

Similar documents
CSA16: Embedding in factorisable restriction monoids

Partial Transformations: Semigroups, Categories and Equations. Ernie Manes, UMass, Amherst Semigroups/Categories workshop U Ottawa, May 2010

Valence automata over E-unitary inverse semigroups

An Introduction to Thompson s Group V

NOTES ON RESTRICTION SEMIGROUPS AND RELATED STRUCTURES FORMERLY (WEAKLY) LEFT E-AMPLE SEMIGROUPS

arxiv: v1 [math.gr] 18 Nov 2011

Pseudo-finite monoids and semigroups

Completely regular semigroups and (Completely) (E, H E )-abundant semigroups (a.k.a. U-superabundant semigroups): Similarities and Contrasts

Approaches to tiling semigroups

Tightness and Inverse Semigroups

ENLARGEMENTS, SEMIABUNDANCY AND UNIPOTENT MONOIDS 1. John Fountain, Gracinda Gomes and Victoria Gould

Monoids and Their Cayley Graphs

INVERSE SEMIQUANDLES. Michael Kinyon. 4th Mile High, 2 August University of Lisbon. Department of Mathematics 1 / 21

The kernel of a monoid morphism. Part I Kernels and extensions. Outline. Basic definitions. The kernel of a group morphism

PARTIAL ACTIONS OF INVERSE AND WEAKLY LEFT E-AMPLE SEMIGROUPS

Finiteness conditions and index in semigroup theory

Varieties of P -restriction semigroups

A four element semigroup that is inherently nonfinitely based?

Prove proposition 68. It states: Let R be a ring. We have the following

Introduction to Restriction Categories

PRIMER ON INVERSE SEMIGROUPS

Semigroup presentations via boundaries in Cayley graphs 1

arxiv: v4 [math.rt] 27 Jul 2017

Research Statement. MUHAMMAD INAM 1 of 5

Duality and Automata Theory

F -inverse covers of E-unitary inverse monoids

Skew Boolean algebras

arxiv: v1 [math.ra] 25 May 2013

arxiv: v2 [math.ra] 1 Nov 2017

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.

Topological aspects of restriction categories

Attempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.

Three Approaches to Inverse Semigroups

endomorphism monoids of free G-acts

Overlapping tile automata:

Extensions and I-semidirect products. inverse semigroups

Permutation Groups and Transformation Semigroups Lecture 2: Semigroups

SANDWICH SETS AND CONGRUENCES IN COMPLETELY INVERSE AG -GROUPOIDS

Notes on Monoids and Automata

PROBLEMS, MATH 214A. Affine and quasi-affine varieties

MAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS

Research Article Tight Representations of 0-E-Unitary Inverse Semigroups

CHARACTERIZATION OF IDEAL SEMIGROUPS OF INVERSE SEMIGROUPS. K.V.R.Srinivas

Categories and Quantum Informatics

On divisors of pseudovarieties generated by some classes of full transformation semigroups

arxiv: v3 [math.gr] 18 Aug 2011

COSE212: Programming Languages. Lecture 1 Inductive Definitions (1)

Commutative orders. David Easdown and Victoria Gould. December Abstract. A subsemigroup S of a semigroup Q is a left (right) order in Q if every

Compact Primitive Semigroups Having (CEP)

ON F -INVERSE COVERS OF FINITE-ABOVE INVERSE MONOIDS

Categories, Functors, Natural Transformations

Stojan Bogdanović and Miroslav Ćirić

Binary Operations. Chapter Groupoids, Semigroups, Monoids

Solving the word problem of the O Hare monoid far, far away from sweet home Chicago

Categories and functors

2. ETALE GROUPOIDS MARK V. LAWSON

Combinatorial Methods in Study of Structure of Inverse Semigroups

COSE212: Programming Languages. Lecture 1 Inductive Definitions (1)

An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras

Abel-Grassmann s bands. 1. Introduction

CHAPTER 2 BOOLEAN ALGEBRA

Möbius Functions and Semigroup Representation Theory

MV-algebras and fuzzy topologies: Stone duality extended

ERRATA: MODES, ROMANOWSKA & SMITH

(1) is an invertible sheaf on X, which is generated by the global sections

On the Complete Join of Permutative Combinatorial Rees-Sushkevich Varieties

Monoids of languages, monoids of reflexive. relations and ordered monoids. Ganna Kudryavtseva. June 22, 2010

arxiv: v1 [math.gr] 5 Oct 2015

On Monoids over which All Strongly Flat Right S-Acts Are Regular

INTRODUCTION TO SEMIGROUPS AND MONOIDS

REGULAR IDENTITIES IN LATTICES

Characterizing Families of Tree Languages by Syntactic Monoids. Szeged 2006

1 + 1 = 2: applications to direct products of semigroups

Axioms of Kleene Algebra

Boolean Algebra and Propositional Logic

On finite congruence-simple semirings

Extending Algebraic Operations to D-Completions

INTRODUCTION TO PART V: CATEGORIES OF CORRESPONDENCES

Duality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +

One Relation Semigroups

An Introduction to the Theory of Lattice

arxiv: v4 [math.gr] 22 Nov 2017

Ordered categories and ordered semigroups

ON VARIETIES OF LEFT DISTRIBUTIVE LEFT IDEMPOTENT GROUPOIDS

Polycyclic monoids and their generalisations

Kiddie Talk - The Diamond Lemma and its applications

On Projective Semimodules

Adian inverse semigroups

The Idempotent Regular Elements of Semigroups

arxiv: v1 [math.ra] 3 Oct 2009

Equational Logic. Chapter Syntax Terms and Term Algebras

FUNCTORS AND ADJUNCTIONS. 1. Functors

Identities in upper triangular tropical matrix semigroups and the bicyclic monoid

On the membership problem for pseudovarieties

Bands with High Symmetry and Uniform Bands

Universal sequences for groups and semigroups

Ana Rita Garcia Alves. Semigroup Operators and Applications. Universidade do Minho Escola de Ciências. outubro de 2015

MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA

GROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache

Chapter 1. Sets and Mappings

Transcription:

Adequate and Ehresmann semigroups NSAC2013: June 8th, 2013, Novi Sad Victoria Gould University of York

What is this talk about? Classes of semigroups with semilattices of idempotents inverse ample adequate restriction Ehresmann

What is this talk about? Classes of semigroups with semilattices of idempotents Ehresmann, adequate, restriction, ample semigroups 1 What are these classes? Why are they important? Natural examples. 2 Correspondence with inductive categories. 3 Free objects. 4 Proper Ehresmann semigroups. For any semigroup S, the set of idempotents of S is denoted by E(S).

Inverse semigroups A semigroup S is inverse if and only if S is regular (i.e. for all a S there exists b S with a = aba) and ef = fe for all e,f E(S). Fact An inverse semigroup S is a semigroup such that every a S has a unique inverse, i.e. for all a S there is a unique b S with We write b = a. a = aba and b = bab. Fact If ef = fe for all e,f E(S), then E(S) is a semilattice i.e. a commutative semigroup of idempotents. Fact If Y is a semilattice, then Y is partially ordered by e f e = ef and e f = ef.

Inverse semigroups as bi-unary semigroups A bi-unary semigroup is a semigroup equipped with two unary operations. We regard bi-unary semigroups as algebras with signature (2, 1, 1). Let S be inverse, so for any a S we have a = aa a and a = a aa. Then S is a bi-unary semigroup (S,, +, ) where a + = aa and a = a a. For any e E(S) we have e = eee so that e = e = e + = e. S satisfies the identities Σ : (a ) + = a, (a + ) = a +, a + a + = a +, a + b + = b + a +, (a + b + ) + = a + b +, a + a = a, (ab + ) + = (ab) +, aa = a and (a b) = (ab).

Ehresmann semigroups: a variety of bi-unary semigroups Definition A bi-unary semigroup (S,, +, ) is Ehresmann if it satisfies the identities Σ. Let E = {a : a S} = {a + : a S}. Then E is a semilattice, the semilattice of projections of S. We have noted that inverse semigroups are Ehresmann (with a + = aa,a = a a and E = E(S)). The converse is not true: any monoid is Ehresmann with a + = 1 = a for all a M. Such an Ehresmann semigroup is called reduced.

What is this talk about? Classes of bi-unary semigroups with semilattices of idempotents inverse ample adequate restriction Ehresmann

What is this talk not really about? Ample and restriction semigroups If S is inverse, then it satisfies the ample (type A) identities: ab + = (ab) + a and b a = a(ba). Proof: Let S be inverse, let a,b S. Then ab + = a(a a)(bb ) = a(bb )(a a) = (abb a )a = (ab) + a. Restriction and ample semigroups (and their one-sided versions) are classes of bi-unary and unary semigroups satisfying the ample identities. These identities allow the essence of techniques for inverse semigroups to be used. Without the identities, we have to think again.

Restriction, adequate, ample semigroups: definitions 1 An Ehresmann semigroup is restriction if and only if it satisfies the ample identities: ab + = (ab) + a and b a = a(ba). 2 An Ehresmann semigroup is adequate if and only if it satisfies the quasi-identities and xz = yz xz + = yz +,zx = zy z x = z y x 2 = x x = x +. 3 An Ehresmann semigroup is ample if it it is both adequate and restriction.

What is this talk about? Classes of bi-unary semigroups with semilattices of idempotents ample identities no ample identities inverse ample: quasi-variety adequate: quasi-variety restriction: variety Ehresmann: variety

Restriction, adequate, ample semigroups: observations, examples 1 Inverse semigroups are ample. 2 Any bi-unary subsemigroup of an inverse semigroup is ample. 3 An Ehresmann semigroup S is left restriction iff it embeds into PT S where α + is the identity map in the domain of α. 4 An Ehresmann semigroup S is left ample iff it embeds into I S. 5 Monoids are restriction under a + = a = 1, cancellative monoids are ample. 6 Certain semidirect products Y M where Y is a semilattice and M is a (cancellative) monoid are restriction (ample). 7 Let Y be a semilattice. Then the free idempotent generated semigroup IG(Y) is adequate but not ample. G, D. Yang, 2013.

Correspondence with inductive categories: Ehresmann semigroups as ordered structures Let S be an Ehresmann semigroup. Define r and l on S by Then r, l are partial orders. a r b a = a + b, (a l b a = ba ). Fact If S satisfies the ample identity, then r = l and is compatible with multiplication. Without the ample identity, they are not, in general, equal, nor compatible on both sides with multiplication. Define on S by a b a = b + and then a b = ab. Then r and l are compatible with where defined.

Correspondence with inductive categories An Ehresmann category is a small category ordered by two partial orders, possessing restrictions and co-restrictions. Theorem Lawson, 1986 The category of Ehresmann semigroups and morphisms is isomorphic to the category of Ehresmann categories and strongly ordered functors. There are corollaries all the way up. The existence of the ample identities means we need just one partial order; for adequate and ample semigroups the Ehresmann categories are cancellative. In the inverse case they are inductive groupoids and we recover the Ehresmann-Schein-Nambooripad Theorem.

Correspondence with inductive categories: Going up to Ehresmann-Schein-Nambooripad inverse 1 order, groupoid ample 1 order, cancellative adequate 2 orders, cancellative restriction1 order Ehresmann 2 orders

Free objects: Free inverse semigroup FIS(X): Munn 1972 a b a a b a tree T: word in FIS(X) is (a a)(babb a b )a(aa ) = a (bab) + aa + trunk is a For operation TS : within the Cayley graph of free group on X, glue end of T onto start of S.

Free objects: Free ample/restriction semigroup FAmS(X) Fountain, Gomes, G 2009 Trees in FIS(X) with trunk in X e.g. a a a b a b for + take to for take to

Free objects: Free adequate/ehresmann semigroup FAdS(X) Kambites 2011 X-trees: birooted X-labelled trees with trunk in X e.g. Tree T: word a (bab) + (ab) + aa + TS: glue end of T to start of S a b and take trunk preserving retracts b for a a + take to a for take to b a

Free objects: Free adequate/ehresmann semigroup FAdS(X) Kambites 2011 a b b a a a b a if we have ample condition, then a (bab) + (ab) + aa + = a (bab) + ab + a +

Proper Ehresmann semigroups: Proper inverse semigroups Let S be an inverse semigroup. 1 σ = E(S) E(S) is the least group congruence on S. 2 S is proper if (a + = b + and aσb) implies a = b; this definition is left/right dual. 3 If S is proper, S E(S) S/σ given by is clearly a SET embedding. s (s +,sσ) 4 S is proper if and only if it embeds into a semidirect product Y G where Y is a semilattice and G is a group O Carroll 1981. 5 S has a proper cover McAlister 1974. That is, there exists a proper inverse semigroup Ŝ and an idempotent separating morphism Ŝ S. 6 The free inverse semigroup is proper.

Proper Ehresmann semigroups: Proper ample and restriction semigroups 1 Let S be Ehresmann; put σ = E E. 2 S/σ is reduced, if S is ample then S/σ is cancellative. 3 A restriction/ample S is proper iff the following condition and its dual hold: (a + = b + and aσb) implies a = b. 4 Results involving semidirect products for restriction/ample semigroups analogous to those in the inverse case hold where group is replaced by monoid/cancellative monoid Lawson 1986, Cornock, G 2012. 5 The free restriction semigroup is proper.

Proper Ehresmann semigroups: What makes such results involving semidirect products work? Let S be an Ehresmann monoid. 1 Suppose that S = X (2,1,1,0). Put T = X (2,0) so that T is the monoid generated by X. 2 S = T E (2) so that any s S can be written as s = t 0 e 1 t 1...e n t n, for some t 0,...,t n T and e 1,...,e n E. 3 If the ample identities hold then S = ET. 4 The above is what is behind results connecting restriction/ample/inverse monoids to semidirect products Y T of a semilattice Y and a monoid T.

Proper Ehresmann semigroups: Losing our identity Without the ample identities, we must think again. Adequate and Ehresmann semigroups do not behave like inverse, ample or restriction semigroups.

Proper Ehresmann monoids: Structure of Ehresmann monoids: E The old notion of proper is no good - it leads inexorably to a semidirect product construction, which is no longer appropriate. Want condition P for Ehresmann monoids such that: (i) all monoids satisfying P have their structure described by monoids acting on semilattices; (ii) if S E then there exists Ŝ E satisfying P and a projection-separating morphism Ŝ S, i.e. Ŝ is a cover of S; (iii) the free objects in E satisfy P.

Proper Ehresmann monoids: Generators and T-normal form Branco, Gomes, G Suppose that M E and M = E T (2) where T is a submonoid of M. Then any x M can be written as x = t 0 e 1 t 1...e n t n, where n 0,e 1,...,e n E,t 1,...,t n 1 T \{1},t 0,t n T and for 1 i n e i < (t i e i+1...t n ) + and e i < (t 0 e 1 t 1...t i 1 ).

Proper Ehresmann monoids: Generators and T-normal form Branco, Gomes, G Suppose that M E and M = E T (2) where T is a submonoid of M. Then any x M can be written as x = (t 0 e 1 )(t 1 e 2 )...(e n t n ), where n 0,e 1,...,e n E,t 1,...,t n 1 T \{1},t 0,t n T and for 1 i n e i < (t i e i+1...t n ) + and e i < (t 0 e 1 t 1...t i 1 ).

Proper Ehresmann monoids: Generators and T-normal form Branco, Gomes, G Let M E with M = E T (2) where T is a submonoid of M. M is said to be T-proper if it satisfies the following condition and its dual: for all s,t T,e,f E (se) + = (te) + and seσte, then se = te. Note If M is restriction, then M is M-proper if and only if it is proper. Fact The free adequate monoid FAdM(X) on X is X -proper.

T-proper Ehresmann monoids: Ehresmann monoids and actions on E Branco, Gomes, G Let M E with M = E T (2) where T is a submonoid of M. T acts on E on the left/right via via order preserving maps. t e = (te) +, e t = (et) If S is restriction, the action of T on E is by morphisms. The actions are linked by the compatibility identities: for e,f E,t T e(t f) = e(t ((e t)f)) and (e t)f = ((e(t f)) t)f.

T-proper Ehresmann monoids: The construction Branco, Gomes, G Let T be a monoid acting by order-preserving maps on the left and right of a semilattice E satisfying the compatibility conditions. Theorem There is an Ehresmann monoid P(T,E) such that 1 the semilattice of projections of P(T,E) is E; 2 T is a submonoid of P(T,E); 3 P(T,E) = T E (2) ; 4 P(T,E) is T-proper; 5 P(T,E)/σ = T; 6 if T = X, then P(T,E) is adequate; 7 the free adequate monoid on X is of the form P(X,E).

T-proper covers for Ehresmann monoids Branco, Gomes, G A note on the construction Extend the action of T on E to the action of the free product T E on E. Let w + = w 1 and w = 1 w. Put = (u + u,u),(u,uu ). Then P(T,E) = (T E)/.

T-proper covers for Ehresmann monoids Branco, Gomes, G and Jones Theorem Let M E and let T be a submonoid of M such that M = T E (2). Then M has a T-proper cover; in particular, P(T,E) is a cover for M.

Questions: 1 Is P(T,E) always adequate for T cancellative? 2 An O Carroll type embedding theorem? A McAlister P-theorem?