Approaching cosets using Green s relations and Schützenberger groups

Similar documents
Approaching cosets using Green s relations and Schützenberger groups

Finiteness conditions and index in semigroup theory

Monoids and Their Cayley Graphs

Semigroup presentations via boundaries in Cayley graphs 1

arxiv: v1 [math.gr] 26 Jul 2013

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

HOMOTOPY BASES AND FINITE DERIVATION TYPE FOR SUBGROUPS OF MONOIDS

On disjoint unions of finitely many copies of the free monogenic semigroup

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

A graph theoretic approach to combinatorial problems in semigroup theory

One Relation Semigroups

SOLVABLE GROUPS OF EXPONENTIAL GROWTH AND HNN EXTENSIONS. Roger C. Alperin

Computing Transformation Semigroups

Pseudo-finite monoids and semigroups

SEMIGROUP PRESENTATIONS FOR CONGRUENCES ON GROUPS

CANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS

Transformation Semigroups:

Topological dynamics: basic notions and examples

Combinatorial Methods in Study of Structure of Inverse Semigroups

CHAPTER 4. βs as a semigroup

ULTRAFILTER AND HINDMAN S THEOREM

arxiv: v1 [math.gr] 20 Nov 2018

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

1 Adeles over Q. 1.1 Absolute values

PRESENTATIONS OF INVERSE SEMIGROUPS, THEIR KERNELS AND EXTENSIONS October 21, 2010

Permutation Group Algorithms

Journal Algebra Discrete Math.

Congruences on Inverse Semigroups using Kernel Normal System

ACTING FREELY GABRIEL GASTER

Linear growth for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup

Congruences on the product of two full transformation monoids

Research Statement. MUHAMMAD INAM 1 of 5

Equivalence Relations and Partitions, Normal Subgroups, Quotient Groups, and Homomorphisms

Krull Dimension and Going-Down in Fixed Rings

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract

3. The Sheaf of Regular Functions

Duality and Automata Theory

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

Permutations of a semigroup that map to inverses

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

Journal Algebra Discrete Math.

Lecture 3.7: Conjugacy classes

An Introduction to Thompson s Group V

NOTES IN COMMUTATIVE ALGEBRA: PART 2

SMALL CONGRUENCE LATTICES

HINDMAN S COLORING THEOREM IN ARBITRARY SEMIGROUPS

Ultrafilter Space Methods in Infinite Ramsey Theory

Semigroup invariants of symbolic dynamical systems

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying:

Group. Orders. Review. Orders: example. Subgroups. Theorem: Let x be an element of G. The order of x divides the order of G

Endomorphism Monoids of Graphs and Partial Orders

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

Groups and Symmetries

arxiv: v2 [math.gr] 25 Mar 2013

arxiv: v1 [math.gr] 10 Jan 2011

Margulis Superrigidity I & II

STABILITY OF THE THEORY OF EXISTENTIALLY CLOSED S-ACTS OVER A RIGHT COHERENT MONOID S. For Professor L.A. Bokut on the occasion of his 70th birthday

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

endomorphism monoids of free G-acts

GENERALIZED GREEN S EQUIVALENCES ON THE SUBSEMIGROUPS OF THE BICYCLIC MONOID

The p n sequences of semigroup varieties generated by combinatorial 0-simple semigroups

Séminaire Dubreil. Algèbre et théorie des nombres

Permutation Groups and Transformation Semigroups Lecture 2: Semigroups

Sets and Motivation for Boolean algebra

INTRODUCTION TO THE GROUP THEORY

ON THE STAR-HEIGHT OF SUBWORD COUNTING LANGUAGES AND THEIR RELATIONSHIP TO REES ZERO-MATRIX SEMIGROUPS

RATIONAL MONOID AND SEMIGROUP AUTOMATA

arxiv: v1 [math.gr] 21 Nov 2017

LECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS

MATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.

Lecture 6c: Green s Relations

Parameterizing orbits in flag varieties

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 2

Formal power series rings, inverse limits, and I-adic completions of rings

GENERATING SINGULAR TRANSFORMATIONS

SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS

MONOCHROMATIC FORESTS OF FINITE SUBSETS OF N

Answers to Final Exam

int cl int cl A = int cl A.

The Membership Problem for a, b : bab 2 = ab

IRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT

Maximal non-commuting subsets of groups

A four element semigroup that is inherently nonfinitely based?

For a group G and a subgroup H G, denoteby[g:h] the set of right cosets of H in G, thatis

1 Differentiable manifolds and smooth maps

Additive Combinatorics Lecture 12

On a topological simple Warne extension of a semigroup

Endomorphism monoids of ω-categorical structures

Conjugacy in epigroups

Part V. Chapter 19. Congruence of integers

MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST

MA441: Algebraic Structures I. Lecture 18

Large subsets of semigroups

Quizzes for Math 401

NOTES ON AUTOMATA. Date: April 29,

Unions of Dominant Chains of Pairwise Disjoint, Completely Isolated Subsemigroups

ALGEBRAIC GROUPS J. WARNER

DEDEKIND S TRANSPOSITION PRINCIPLE

Infinite Galois theory

Tamagawa Numbers in the Function Field Case (Lecture 2)

Transcription:

Approaching cosets using Green s relations and Schützenberger groups Robert Gray Mini workshop in Algebra, CAUL April 2008 1 / 14

General question How are the properties of a semigroup related to those of its substructures? Index in group theory G - group, H - subgroup of G The right cosets of H in G are the sets {Hg : g G}. The index [G : H] is the number of (right) cosets of H in G. G is the disjoint union of the cosets of H Subgroups of finite index share many properties with their parent groups. 2 / 14

Finiteness conditions Definition A property P of semigroups is a finiteness condition if all finite semigroups satisfy P. Examples For a semigroup S the properties of being: finite finitely generated finitely presented S is definable by a presentation A R with A and R both finite residually finite for any two distinct elements x, y S there exists a finite monoid T and a homomorphism φ : S T such that φ(x) φ(y) are all finiteness conditions. And the list goes on: periodic, locally finite, automatic,... 3 / 14

Finiteness conditions Proposition For groups the following finiteness conditions are preserved when taking finite index subgroups and when taking finite index extensions: finitely generated periodic residually finite finitely presented FP n automatic locally finite soluble word problem finite derivation type. Idea Develop a theory of index for semigroups Use it to gain a better understanding of the relationship between the properties of a semigroup and those of its substructures. 4 / 14

Subgroups of monoids: translational index S - monoid, K - subgroup of S The right cosets of K are the elements of the strong orbit of K under the action of S by right multiplication. So Ks (s S) is a right coset t S : Kst = K. The (right) translational index of K is the number of right cosets. 5 / 14

Subgroups of monoids: translational index S - monoid, K - subgroup of S The right cosets of K are the elements of the strong orbit of K under the action of S by right multiplication. So Ks (s S) is a right coset t S : Kst = K. The (right) translational index of K is the number of right cosets. Green s relations interpretation H - the H-class of S containing K, R - the R-class containing K. The right cosets of K partition R K has finite translational index iff [H : K] < and R contains only finitely many H-classes. 5 / 14

Subgroups of monoids: translational index S - monoid, K - subgroup of S The right cosets of K are the elements of the strong orbit of K under the action of S by right multiplication. So Ks (s S) is a right coset t S : Kst = K. The (right) translational index of K is the number of right cosets. Green s relations interpretation H - the H-class of S containing K, R - the R-class containing K. The right cosets of K partition R K has finite translational index iff [H : K] < and R contains only finitely many H-classes. 5 / 14

Properties inherited S - monoid, K - subgroup of S with finite translational index Theorem (Ruskuc (1999)) If S is finitely presented (resp. generated) then K is finitely presented (resp. generated). Steinberg (2003) - for inverse semigroups gives an alternative proof using a topological approach. 6 / 14

Properties inherited S - monoid, K - subgroup of S with finite translational index Theorem (Ruskuc (1999)) If S is finitely presented (resp. generated) then K is finitely presented (resp. generated). Steinberg (2003) - for inverse semigroups gives an alternative proof using a topological approach. Higher dimensions - Finite derivation type Is a property of finitely presented semigroups Can be thought of as a higher dimensional version of the property of being finitely presented. Think relations between relations Originated from work of C. Squier on finite complete rewriting systems Theorem (RG & Malheiro (2007)) If S has finite derivation type then K has finite derivation type. 6 / 14

The converse Cosets are local In general the properties of a single subgroup K of finite index in S will not influence the properties of S. e.g. Adjoin an extra identity 1 to S, let K = {1}, and consider K S 1. Covering the semigroup S - monoid, and suppose there exists a finite collection K 1,..., K r of subgroups: each K i has finite translational index the cosets of K 1..., K r cover S. For a given property P we can ask: If all K i have property P does it follow that S has property P? 7 / 14

Regular semigroups Let S be a regular semigroup with finitely many left and right ideals. Theorem (Ruskuc (1999)) S is finitely presented (resp. finitely generated) if and only if all its maximal subgroups are finitely presented (resp. finitely generated). Theorem (RG & Malheiro (2008)) S has finite derivation type if and only if all its maximal subgroups have finite derivation type. Theorem (Golubov (1975)) S is residually finite if and only if all its maximal subgroups are residually finite. Actually, Golubov proved a stronger result, assuming only that each J -class contains finitely many L- and R-classes. Question What about arbitrary (non-regular) semigroups? 8 / 14

Schützenberger groups...the groups that never were Given an H-class H of any semigroup S we can associate a group with H. Let S be a monoid and let H be any H-class of S. T(H) = {s S : Hs = H} : the stabilizer of H in S. The relation on T(H) defined by: x y ( h H)(hx = hy) is a congruence. Γ(H) = T(H)/ is a group, called the Schützenberger group of H. Basic properties Γ(H) = H If H 1 and H 2 belong to the same D-class then Γ(H 1 ) = Γ(H 2 ). If H is a group then Γ(H) = H. 9 / 14

Non-regular semigroups Let S be a monoid with finitely many left and right ideals. Theorem (Ruskuc (2000)) S is finitely presented (resp. finitely generated) if and only if all its Schützenberger groups are finitely presented (resp. finitely generated). Theorem (RG & Ruskuc 2007) S is residually finite if and only if all its Schützenberger groups are residually finite. Applies to non-regular semigroups :-) But does not generalise Golubov :-( 10 / 14

Subsemigroups of monoids: relative Green s relations Wallace (1962) - developed a theory of relative Green s relations S - semigroup, T - subsemigroup of S, a, b S. Definition (Relative Green s relations) al T b T 1 a = T 1 b, ar T b at 1 = bt 1, H T = R T L T. The L T -classes are the strong orbits under the action of T 1 on S by left multiplication (dually for R T ). L T, R T, and H T are equivalence relations. T is a union of R T -classes and is a union of L T -classes. 11 / 14

Subsemigroups of monoids: relative Green s relations Wallace (1962) - developed a theory of relative Green s relations S - semigroup, T - subsemigroup of S, a, b S. Definition (Relative Green s relations) al T b T 1 a = T 1 b, ar T b at 1 = bt 1, H T = R T L T. The L T -classes are the strong orbits under the action of T 1 on S by left multiplication (dually for R T ). L T, R T, and H T are equivalence relations. T is a union of R T -classes and is a union of L T -classes. Connection with cosets in group theory G - group, H - subgroup. { R H -classes } = { left cosets of H } { L H -classes } = { right cosets of H } 11 / 14

Green index S - semigroup, T subsemigroup of S Definition The Green index of T in S is the number of H T -classes of S \ T. Example (Finite Green index) Definition The Rees index of T in S is S \ T T has finite Rees index in S T has finite Green index in S. G - group, H - subgroup of G H has finite Green index H has finite group-theoretic index. 12 / 14

Green index S - semigroup, T subsemigroup of S Definition The Green index of T in S is the number of H T -classes of S \ T. Example (Finite Green index) Definition The Rees index of T in S is S \ T T has finite Rees index in S T has finite Green index in S. G - group, H - subgroup of G H has finite Green index H has finite group-theoretic index. Generalised Schützenberger groups Associated with each H T -class H i is a group Γ i arising from the action of T on H i. Question How are the properties of S related to those of T and the groups Γ i? 12 / 14

Green index S - semigroup, T subsemigroup of S Definition The Green index of T in S is the number of H T -classes of S \ T. Example (Finite Green index) Definition The Rees index of T in S is S \ T T has finite Rees index in S T has finite Green index in S. G - group, H - subgroup of G H has finite Green index H has finite group-theoretic index. If T has finite Rees index in S then all the groups Γ i are finite. If S = G and T = N G then Γ i = N for all i I. In both cases T has P Γ i has P for all i. (P = any finiteness condition) 12 / 14

Green index results S - semigroup, T - subsemigroup with finite Green index H i (i I) - relative H-classes in S \ T Γ i (i I) - generalised Schützenberger groups Theorem (RG and Ruskuc (2006)) S is finitely generated (resp. periodic, locally finite) if and only if T is finitely generated (resp. periodic, locally finite), in which case all the groups Γ i are finitely generated (resp. periodic, locally finite). 13 / 14

Green index results S - semigroup, T - subsemigroup with finite Green index H i (i I) - relative H-classes in S \ T Γ i (i I) - generalised Schützenberger groups Theorem (RG and Ruskuc (2006)) S is finitely generated (resp. periodic, locally finite) if and only if T is finitely generated (resp. periodic, locally finite), in which case all the groups Γ i are finitely generated (resp. periodic, locally finite). Theorem (RG & Ruskuc (2006)) S is residually finite if and only if T and all the groups Γ i are residually finite. There is an example of a semigroup S, with a finite Green index subsemigroup T S such that T is residually finite but S is not. 13 / 14

Green index results S - semigroup, T - subsemigroup with finite Green index. Theorem (RG & Ruskuc (2006)) If T is finitely presented and each group Γ i is finitely presented then S is finitely presented. These results provide common generalisations of the corresponding results for finite index subgroups of groups, and finite Rees index subsemigroups of semigroups. e.g. for finite generation we obtain a common generalisation of Schreier s lemma for groups and Jura (1978) for semigroups. Open problem. Prove that if S is finitely presented then T is finitely presented and each group Γ i is finitely presented. 14 / 14