DOCSLIB.ORG

Nine Chapters on the Semigroup Art

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Nine Chapters on the Semigroup Art Alan J. Cain Nine Chapters on the Semigroup Art Lecture notes for a tour through semigroups Porto & Lisbon 2020 version 0.66.62 (2020-06-13) [A4 / Two-sided / Colour] 3b9596955641bc1af1e88645064dd8dc6c2cf041 : 000000005ee533ff To download the most recent version, and files suitable for colour or greyscale printing, or for viewing on tablets and ebook readers, visit http://www-groups.mcs.st-andrews.ac.uk/~alanc/pub/c_ semigroups/ • © 2012–20 Alan J. Cain ([email protected]) This work is licensed under the Creative Commons Attribu- tion–Non-Commercial–NoDerivs 4.0 International Licence. To view a copy of this licence, visit https://creativecommons.org/licenses/by-nc-nd/4.0/ Contents Preface v Prerequisites vii ◆ Acknowledgements vii Chapter 1 | Elementary semigroup theory 1 Basic concepts and examples 1 ◆ Generators and subsemi- groups 8 ◆ Binary relations 11 ◆ Orders and lattices 15 ◆ Homomorphisms 19 ◆ Congruences and quotients 20 ◆ Generating equivalences and congruences 22 ◆ Subdirect products 28 ◆ Actions 29 ◆ Cayley graphs 30 ◆ Exercises 32 ◆ Notes 34 Chapter 2 | Free semigroups & presentations 37 Alphabets and words 37 ◆ Universal property 38 ◆ Proper- ties of free semigroups 41 ◆ Semigroup presentations 42 ◆ Exercises 51 ◆ Notes 53 Chapter 3 | Structure of semigroups 55 Green’s relations 55 ◆ Simple and 0-simple semigroups 58 ◆ D-class structure 60 ◆ Inverses and D-classes 63 ◆ Schützenberger groups 65 ◆ Exercises 68 ◆ Notes 70 Chapter 4 | Regular semigroups 73 Completely 0-simple semigroups 75 ◆ Ideals and completely 0-simple semigroups 81 ◆ Completely simple semigroups 82 ◆ Completely regular semigroups 84 ◆ Left and right groups 86 ◆ Homomorphisms 88 ◆ Exercises 89 ◆ Notes 91 Chapter 5 | Inverse semigroups 93 Equivalent characterizations 93 ◆ Vagner–Preston theo- rem 97 ◆ The natural partial order 100 ◆ Clifford semi- groups 102 ◆ Free inverse semigroups 106 ◆ Exercises 116 ◆ Notes 119 Chapter 6 | Commutative semigroups 121 Cancellative commutative semigroups 121 ◆ Free commut- ative semigroups 123 ◆ Rédei’s theorem 125 ◆ Exercises 128 ◆ Notes 129 • iii Chapter 7 | Finite semigroups 131 Green’s relations and ideals 131 ◆ Semidirect and wreath products 133 ◆ Division 135 ◆ Krohn–Rhodes decomposition theorem 140 ◆ Exercises 147 ◆ Notes 148 Chapter 8 | Varieties & pseudovarieties 149 Varieties 149 ◆ Pseudovarieties 157 ◆ Pseudovarieties of semigroups and monoids 159 ◆ Free objects for pseudovari- eties 161 ◆ Projective limits 162 ◆ Pro-V semigroups 164 ◆ Pseudoidentities 167 ◆ Semidirect products of pseudovarie- ties 172 ◆ Exercises 173 ◆ Notes 174 Chapter 9 | Automata & finite semigroups 175 Finite automata and rational languages 175 ◆ Syntactic sem- igroups and monoids 184 ◆ Eilenberg correspondence 188 ◆ Schützenberger’s theorem 195 ◆ Exercises 201 ◆ Notes 202 Solutions to exercises 203 Bibliography 251 Index 255 List of Tables Table 8.1 Varieties of semigroups 156 Table 8.2 Varieties of monoids 156 Table 8.3 Varieties of semigroups with a unary operation −1 157 Table 8.4 S-pseudovarieties of semigroups 169 Table 8.5 M-pseudovarieties of monoids 169 Table 9.3 Varieties of rational ∗-languages 193 Table 9.4 Varieties of rational +-languages 193 • iv • Preface A preface is frequently a superior composition to the work itself ‘ — Isaac D’Israeli,’ ‘Prefaces’. In: Curiosities of Literature. • This course is a tour through selected areas of semi- group theory. There are essentially three parts: ◆ Chapters 1–3 study general semigroups, including presentations for semigroups and basic structure theory. ◆ Chapters 4–6 examine special classes: namely regular, inverse, and commutative semigroups. ◆ Chapters 7–9 study finite semigroups, their classification using pseu- dovarieties, and connections with the theory of automata and regular languages. The course is broad rather than deep. It is not intended to be comprehens- ive: it does not try to study (for instance) structure theory as deeply as Howie, Fundamentals of Semigroup Theory, pseudovarieties as deeply as Almeida, Finite Semigroups and Universal Algebra, or languages as deeply as Pin, Varieties of Formal Languages; rather, it samples highlights from each area. It should be emphasized that there is very little that is original in this course. It is heavily based on the treatments in these and other standard textbooks, as the bibliographic notes in each chapter make clear. The main novelty is in the selection and arrangement of material, the slightly slower pace, and the general policy of avoiding leaving proofs to the reader when the corresponding results are required for later proofs. Figure P.1 shows the dependencies between the chapters. At the end of each chapter, there are a number of exercises, intended to reinforce concepts introduced in the chapter, and also to explore some related topics that are not covered in the main text. The most important exercises are marked with a star ✴ . Solutions are supplied for all exercises. At the end of each chapter are bibliographic notes, which give sources and suggestions for further reading. Warnings against potential misunderstandings are marked (like this) with a ‘dangerous bend’ symbol, as per Bourbaki or Knuth. Important observations that are not potential misunderstandings per se are marked with an ‘exclamation’ symbol (like this). This course was originally delivered to master’s students at the Uni- • v Chapter 1 Elementary semigroup theory Chapter 2 Free semigroups & presentations Chapter 3 Structure of semigroups Chapter 4 Regular semigroups Chapter 5 Inverse semigroups Chapter 6 Commutative semigroups Chapter 7 Finite semigroups FIGURE P.1 Chapter 8 Chart of the dependencies Varieties & pseudovarieties between the chapters. Dotted arrows indicate that the Chapter 9 dependency is only in the Automata & finite semigroups exercises, not in the main text. versities of Porto and Santiago de Compostella. The course was covered during 56 hours of classes, which included lectures and discussions of the exercises. Revisions have increased the length of the notes, and about 70 hours of class time would now be required to cover them fully. These notes were heavily revised in 2013–15. Most of the main text is now stable, but Chapter 8 will be further revised, and further exercises will be added. At present, the index is limited to names and ‘named results’ only. There may be minor typesetting problems that arise from the ‘in-development’ status of the LuaLaTEX software and many of the required packages. The author welcomes any corrections, observations, or constructive criticisms; please send them to the email address on the copyright page. vi • Preface Prerequisites There are few formal prerequisites: general mathematical maturity is the main one. An understanding of the most basic concepts from elementary group theory is assumed, such as the definition of groups, cosets, and factor groups. Some knowledge of linear algebra will help with understanding certain examples, but is not vital. For Chapters 1 and 5, knowledge of the basic definitions of graph theory is assumed. Some basic topology is necessary to appreciate part of Chapter 8 fully (although most of the chapter can be understood without it, and the relevant sections can simply be skipped), and some background in universal algebra is useful, but not essential. For Chapter 9, some experience with formal language theory and automata is useful, but again not essential. Acknowledgements Attila Egri-Nagy, Darij Grinberg, Akihiko Koga, and Guil- herme Rito made valuable suggestions and indicated various errors. Some exercises were suggested by Victor Maltcev. Typos were pointed out by Nick Ham, Samuel Herman, José Manuel dos Santos dos Santos, and Alexandre Trocado. Many improvements are due to the students who took the first version of this course: Miguel Couto, Xabier García, and Jorge Soares. The imperfections that remain are my responsibility. The title alludes to 九章算術 (Jiuzhāngˇ Suànshù), Nine Chapters on the Mathematical Art. A. J. C. • Prerequisites • vii viii • Elementary semigroup theory 1 I use the word “elementary” in the sense ‘ in which professional mathematicians use it — G.H. Hardy, A Mathematician’s’ Apology, § 21. • A binary operation ∘ on a set 푆 is a map ∘ ∶ 푆 × 푆 → 푆. Binary operation This operation is associative if 푥 ∘ (푦 ∘ 푧) = (푥 ∘ 푦) ∘ 푧 for all elements 푥, 푦, 푧 ∈ 푆.A semigroup is a non-empty set equipped with an associative Semigroup binary operation. Semigroups are therefore one of the most basic types of algebraic structure. We could weaken the definition further by removing the as- sociativity condition and requiring only a binary operation on a set. A structure that satisfies this weaker condition is called a magma or group- oid. (These ‘groupoids’ are different from the category-theoretic notion of groupoid.) On the other hand, we can strengthen the definition by requiring an identity and inverses. Structures satisfying this stronger condition are of course groups. However, there are many more semigroups than groups. For instance, there are 5 essentially different groups with 8 elements (the cyclic group 퐶8, the direct products 퐶4 × 퐶2 and 퐶2 × 퐶2 × 퐶2, the dihed- ral group 퐷4, and the quaternion group 푄8), but there are 3 684 030 417 different (non-isomorphic) semigroups with 8 elements. Some authors define a semigroup as a (possibly empty) set equipped with ‘Empty semigroup’ an associative binary operation. That is, the empty set forms the ‘empty semigroup’. This has advantages from a category-theoretic viewpoint. Note, however, that other definitions must be adjusted if a semigroup can be empty. In these notes, semigroups are required to be non-empty. Basic concepts and examples Throughout this chapter, 푆 will denote a semigroup with operation ∘. Formally, we write (푆, ∘) to indicate that we are considering the set 푆 with the operation ∘, but we will only do this when we need to distinguish a particular operation. Unless we need to distinguish between • 1 different operations, we will often write 푥푦 instead of 푥∘푦 (where 푥, 푦 ∈ 푆) Multiplication, product and we will call the operation multiplication and the element 푥푦 (i.e. the result of applying the operation to 푥 and 푦) the product of the elements 푥 and 푦.
Load more

Recommended publications
  • Math 5111 (Algebra 1) Lecture #14 of 24 ∼ October 19Th, 2020
    Math 5111 (Algebra 1) Lecture #14 of 24 ∼ October 19th, 2020 Group Isomorphism Theorems + Group Actions The Isomorphism Theorems for Groups Group Actions Polynomial Invariants and An This material represents x3.2.3-3.3.2 from the course notes. Quotients and Homomorphisms, I Like with rings, we also have various natural connections between normal subgroups and group homomorphisms. To begin, observe that if ' : G ! H is a group homomorphism, then ker ' is a normal subgroup of G. In fact, I proved this fact earlier when I introduced the kernel, but let me remark again: if g 2 ker ', then for any a 2 G, then '(aga−1) = '(a)'(g)'(a−1) = '(a)'(a−1) = e. Thus, aga−1 2 ker ' as well, and so by our equivalent properties of normality, this means ker ' is a normal subgroup. Thus, we can use homomorphisms to construct new normal subgroups. Quotients and Homomorphisms, II Equally importantly, we can also do the reverse: we can use normal subgroups to construct homomorphisms. The key observation in this direction is that the map ' : G ! G=N associating a group element to its residue class / left coset (i.e., with '(a) = a) is a ring homomorphism. Indeed, the homomorphism property is precisely what we arranged for the left cosets of N to satisfy: '(a · b) = a · b = a · b = '(a) · '(b). Furthermore, the kernel of this map ' is, by definition, the set of elements in G with '(g) = e, which is to say, the set of elements g 2 N. Thus, kernels of homomorphisms and normal subgroups are precisely the same things.
    [Show full text]
  • Computational Techniques in Finite Semigroup Theory
    COMPUTATIONAL TECHNIQUES IN FINITE SEMIGROUP THEORY Wilf A. Wilson A Thesis Submitted for the Degree of PhD at the University of St Andrews 2018 Full metadata for this item is available in St Andrews Research Repository at: http://research-repository.st-andrews.ac.uk/ Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/16521 This item is protected by original copyright Computational techniques in finite semigroup theory WILF A. WILSON This thesis is submitted in partial fulfilment for the degree of Doctor of Philosophy (PhD) at the University of St Andrews November 2018 Declarations Candidate's declarations I, Wilf A. Wilson, do hereby certify that this thesis, submitted for the degree of PhD, which is approximately 64500 words in length, has been written by me, and that it is the record of work carried out by me, or principally by myself in collaboration with others as acknowledged, and that it has not been submitted in any previous application for any degree. I was admitted as a research student at the University of St Andrews in September 2014. I received funding from an organisation or institution and have acknowledged the funders in the full text of my thesis. Date: . Signature of candidate:. Supervisor's declaration I hereby certify that the candidate has fulfilled the conditions of the Resolution and Regulations appropriate for the degree of PhD in the University of St Andrews and that the candidate is qualified to submit this thesis in application for that degree. Date: . Signature of supervisor: . Permission for publication In submitting this thesis to the University of St Andrews we understand that we are giving permission for it to be made available for use in accordance with the regulations of the University Library for the time being in force, subject to any copyright vested in the work not being affected thereby.
    [Show full text]
  • Product Systems Over Ore Monoids
    Documenta Math. 1331 Product Systems over Ore Monoids Suliman Albandik and Ralf Meyer Received: August 22, 2015 Revised: October 10, 2015 Communicated by Joachim Cuntz Abstract. We interpret the Cuntz–Pimsner covariance condition as a nondegeneracy condition for representations of product systems. We show that Cuntz–Pimsner algebras over Ore monoids are con- structed through inductive limits and section algebras of Fell bundles over groups. We construct a groupoid model for the Cuntz–Pimsner algebra coming from an action of an Ore monoid on a space by topolog- ical correspondences. We characterise when this groupoid is effective or locally contracting and describe its invariant subsets and invariant measures. 2010 Mathematics Subject Classification: 46L55, 22A22 Keywords and Phrases: Crossed product; product system; Ore con- ditions; Cuntz–Pimsner algebra; correspondence; groupoid model; higher-rank graph algebra; topological graph algebra. 1. Introduction Let A and B be C∗-algebras. A correspondence from A to B is a Hilbert B-module with a nondegenerate ∗-homomorphism from A to the C∗-algebra of adjointableE operators on . It is called proper if the left A-action is by E compact operators, A K( ). If AB and BC are correspondences from A → E E E to B and from B to C, respectively, then AB B BC is a correspondence from A to C. E ⊗ E A triangle of correspondences consists of three C∗-algebras A, B, C, corre- spondences AB, AC and BC between them, and an isomorphism of corre- E E E spondences u: AB B BC AC ; that is, u is a unitary operator of Hilbert C-modules thatE also⊗ intertwinesE →E the left A-module structures.
    [Show full text]
  • Partial Semigroups and Convolution Algebras
    Partial Semigroups and Convolution Algebras Brijesh Dongol, Victor B F Gomes, Ian J Hayes and Georg Struth February 23, 2021 Abstract Partial Semigroups are relevant to the foundations of quantum mechanics and combina- torics as well as to interval and separation logics. Convolution algebras can be understood either as algebras of generalised binary modalities over ternary Kripke frames, in particular over partial semigroups, or as algebras of quantale-valued functions which are equipped with a convolution-style operation of multiplication that is parametrised by a ternary relation. Convolution algebras provide algebraic semantics for various substructural logics, includ- ing categorial, relevance and linear logics, for separation logic and for interval logics; they cover quantitative and qualitative applications. These mathematical components for par- tial semigroups and convolution algebras provide uniform foundations from which models of computation based on relations, program traces or pomsets, and verification components for separation or interval temporal logics can be built with little effort. Contents 1 Introductory Remarks 2 2 Partial Semigroups 3 2.1 Partial Semigroups ................................... 3 2.2 Green’s Preorders and Green’s Relations ....................... 3 2.3 Morphisms ....................................... 4 2.4 Locally Finite Partial Semigroups ........................... 5 2.5 Cancellative Partial Semigroups ............................ 5 2.6 Partial Monoids ..................................... 6 2.7
    [Show full text]
  • GROUP ACTIONS 1. Introduction the Groups Sn, An, and (For N ≥ 3)
    GROUP ACTIONS KEITH CONRAD 1. Introduction The groups Sn, An, and (for n ≥ 3) Dn behave, by their definitions, as permutations on certain sets. The groups Sn and An both permute the set f1; 2; : : : ; ng and Dn can be considered as a group of permutations of a regular n-gon, or even just of its n vertices, since rigid motions of the vertices determine where the rest of the n-gon goes. If we label the vertices of the n-gon in a definite manner by the numbers from 1 to n then we can view Dn as a subgroup of Sn. For instance, the labeling of the square below lets us regard the 90 degree counterclockwise rotation r in D4 as (1234) and the reflection s across the horizontal line bisecting the square as (24). The rest of the elements of D4, as permutations of the vertices, are in the table below the square. 2 3 1 4 1 r r2 r3 s rs r2s r3s (1) (1234) (13)(24) (1432) (24) (12)(34) (13) (14)(23) If we label the vertices in a different way (e.g., swap the labels 1 and 2), we turn the elements of D4 into a different subgroup of S4. More abstractly, if we are given a set X (not necessarily the set of vertices of a square), then the set Sym(X) of all permutations of X is a group under composition, and the subgroup Alt(X) of even permutations of X is a group under composition. If we list the elements of X in a definite order, say as X = fx1; : : : ; xng, then we can think about Sym(X) as Sn and Alt(X) as An, but a listing in a different order leads to different identifications 1 of Sym(X) with Sn and Alt(X) with An.
    [Show full text]
  • Right Product Quasigroups and Loops
    RIGHT PRODUCT QUASIGROUPS AND LOOPS MICHAEL K. KINYON, ALEKSANDAR KRAPEZˇ∗, AND J. D. PHILLIPS Abstract. Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which left translations are bijective). If we do not assume associativity we get right quasigroups which are not necessarily representable as direct products of right zero semigroups and quasigroups. To obtain such a representation, we need stronger assumptions which lead us to the notion of right product quasigroup. If the quasigroup component is a (one-sided) loop, then we have a right product (left, right) loop. We find a system of identities which axiomatizes right product quasigroups, and use this to find axiom systems for right product (left, right) loops; in fact, we can obtain each of the latter by adjoining just one appropriate axiom to the right product quasigroup axiom system. We derive other properties of right product quasigroups and loops, and conclude by show- ing that the axioms for right product quasigroups are independent. 1. Introduction In the semigroup literature (e.g., [1]), the most commonly used definition of right group is a semigroup (S; ·) which is right simple (i.e., has no proper right ideals) and left cancellative (i.e., xy = xz =) y = z). The structure of right groups is clarified by the following well-known representation theorem (see [1]): Theorem 1.1. A semigroup (S; ·) is a right group if and only if it is isomorphic to a direct product of a group and a right zero semigroup.
    [Show full text]
  • Language and Automata Theory and Applications
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS Carlos Martín-Vide Characterization • It deals with the description of properties of sequences of symbols • Such an abstract characterization explains the interdisciplinary flavour of the field • The theory grew with the need of formalizing and describing the processes linked with the use of computers and communication devices, but its origins are within mathematical logic and linguistics A bit of history • Early roots in the work of logicians at the beginning of the XXth century: Emil Post, Alonzo Church, Alan Turing Developments motivated by the search for the foundations of the notion of proof in mathematics (Hilbert) • After the II World War: Claude Shannon, Stephen Kleene, John von Neumann Development of computers and telecommunications Interest in exploring the functions of the human brain • Late 50s XXth century: Noam Chomsky Formal methods to describe natural languages • Last decades Molecular biology considers the sequences of molecules formed by genomes as sequences of symbols on the alphabet of basic elements Interest in describing properties like repetitions of occurrences or similarity between sequences Chomsky hierarchy of languages • Finite-state or regular • Context-free • Context-sensitive • Recursively enumerable REG ⊂ CF ⊂ CS ⊂ RE Finite automata: origins • Warren McCulloch & Walter Pitts. A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, 5:115-133, 1943 • Stephen C. Kleene. Representation of events in nerve nets and
    [Show full text]
  • On Identities in Groups of Fractions of Cancellative Semigroups
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 133, Number 7, Pages 1873–1879 S 0002-9939(05)07903-7 Article electronically published on February 24, 2005 ON IDENTITIES IN GROUPS OF FRACTIONS OF CANCELLATIVE SEMIGROUPS S. V. IVANOV AND A. M. STOROZHEV (Communicated by Jonathan I. Hall) Abstract. To solve two problems of Bergman stated in 1981, we construct agroupG such that G contains a free noncyclic subgroup (hence, G satisfies no group identity) and G, as a group, is generated by its subsemigroup that satisfies a nontrivial semigroup identity. 1. Introduction AsemigroupS is called cancellative if for arbitrary a, b, x ∈ S either of equalities xa = xb, ax = bx implies that a = b. AsemigroupS is said to satisfy the left (resp. right) Ore condition if for arbitrary a, b ∈ S there are x, y ∈ S such that xa = yb (resp. ax = by). It is well known that a cancellative semigroup S with the left (or right) Ore condition embeds in a group F(S)=S−1S = SS−1 of its fractions (see [M53], [NT63], [CP67, Theorem 1.23]; recall that, in general, a cancellative semigroup need not embed in a group, see [M37]) and a group F(S)offractionsofS is unique in the sense that if G is a group such that G contains S and G, as a group, is generated by S,thenG is naturally isomorphic to F(S). In particular, if S is a cancellative semigroup satisfying a nontrivial identity, then S satisfies (both) Ore conditions and so S embeds in the group F(S) of its fractions.
    [Show full text]
  • Dissertation Submitted to the University of Auckland in Fulfillment of the Requirements of the Degree of Doctor of Philosophy (Ph.D.) in Statistics
    Thesis Consent Form This thesis may be consulted for the purposes of research or private study provided that due acknowledgement is made where appropriate and that permission is obtained before any material from the thesis is published. Students who do not wish their work to be available for reasons such as pending patents, copyright agreements, or future publication should seek advice from the Graduate Centre as to restricted use or embargo. Author of thesis Jared Tobin Title of thesis Embedded Domain-Specific Languages for Bayesian Modelling and Inference Name of degree Doctor of Philosophy (Statistics) Date Submitted 2017/05/01 Print Format (Tick the boxes that apply) I agree that the University of Auckland Library may make a copy of this thesis available for the ✔ collection of another library on request from that library. ✔ I agree to this thesis being copied for supply to any person in accordance with the provisions of Section 56 of the Copyright Act 1994. Digital Format - PhD theses I certify that a digital copy of my thesis deposited with the University is the same as the final print version of my thesis. Except in the circumstances set out below, no emendation of content has occurred and I recognise that minor variations in formatting may occur as a result of the conversion to digital format. Access to my thesis may be limited for a period of time specified by me at the time of deposit. I understand that if my thesis is available online for public access it can be used for criticism, review, news reporting, research and private study.
    [Show full text]
  • Lecture 1.2: Group Actions
    Lecture 1.2: Group actions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8510, Abstract Algebra I M. Macauley (Clemson) Lecture 1.2: Group actions Math 8510, Abstract Algebra I 1 / 29 The symmetric group Definition The group of all permutations of f1;:::; ng is the symmetric group, denoted Sn. We can concisely describe permutations in cycle notation, e.g., 1 2 3 4 as (1 2 3 4). Observation 1 Every permutation can be decomposed into a product of disjoint cycles, and disjoint cycles commute. We usually don't write 1-cycles (fixed points). For example, in S10, we can write 1 2 3 4 5 6 7 8 9 10 as (1 4 6 5) (2 3) (8 10 9). By convention, we'll read cycles from right-to-left, like function composition. [Note. Many sources read left-to-right.] M. Macauley (Clemson) Lecture 1.2: Group actions Math 8510, Abstract Algebra I 2 / 29 The symmetric group Remarks The inverse of the cycle (1 2 3 4) is (4 3 2 1) = (1 4 3 2). If σ is a k-cycle, then jσj = k. If σ = σ1 ··· σm, all disjoint, then jσj = lcm(jσ1j;:::; jσmj). A 2-cycle is called a transposition. Every cycle (and hence element of Sn) can be written as a product of transpositions: (1 2 3 ··· k) = (1 k) (1 k −1) ··· (1 3) (1 2): We say σ 2 Sn is even if it can be written as a product of an even number of transpositions, otherwise it is odd.
    [Show full text]
  • Arxiv:1707.05940V1 [Math.OA] 19 Jul 2017 ..Aeaiiyo Eirusi Em Fc-Lers66 61 47 C*-Algebras of Terms in Semigroups Red of of Amenability Descriptions C*-Algebra 6.8
    SEMIGROUP C*-ALGEBRAS XIN LI Abstract. We give an overview of some recent developments in semigroup C*-algebras. Contents 1. Introduction 2 2. C*-algebrasgeneratedbyleftregularrepresentations 3 3. Examples 4 3.1. The natural numbers 4 3.2. Positive cones in totally ordered groups 4 3.3. Monoids given by presentations 5 3.4. Examples from rings in general, and number theory in particular 8 3.5. Finitely generated abelian cancellative semigroups 9 4. Preliminaries 9 4.1. Embedding semigroups into groups 9 4.2. Graph products 11 4.3. Krull rings 14 5. C*-algebras attached to inverse semigroups, partial dynamical systems, and groupoids 16 5.1. Inverse semigroups 16 5.2. Partial dynamical systems 22 5.3. Etale´ groupoids 26 5.4. The universal groupoid of an inverse semigroup 29 5.5. InversesemigroupC*-algebrasasgroupoidC*-algebras 30 5.6. C*-algebras of partial dynamical systems as C*-algebras of partial transformation groupoids 33 arXiv:1707.05940v1 [math.OA] 19 Jul 2017 5.7. The case of inverse semigroups admitting an idempotent pure partial homomorphism to a group 36 6. Amenability and nuclearity 37 6.1. Groups and groupoids 37 6.2. Amenability for semigroups 40 6.3. Comparing reduced C*-algebras for left cancellative semigroups and their left inverse hulls 42 6.4. C*-algebrasgeneratedbysemigroupsofprojections 47 6.5. The independence condition 54 6.6. Construction of full semigroup C*-algebras 61 6.7. Crossed product and groupoid C*-algebra descriptions of reduced semigroup C*-algebras 63 6.8. Amenability of semigroups in terms of C*-algebras 66 1 2 XIN LI 6.9.
    [Show full text]
  • A Characterization of Seminormal C-Monoids
    Bollettino dell’Unione Matematica Italiana https://doi.org/10.1007/s40574-019-00194-9 A characterization of seminormal C-monoids Alfred Geroldinger1 · Qinghai Zhong1 Received: 27 September 2018 / Accepted: 30 January 2019 © The Author(s) 2019 Abstract It is well-known that a C-monoid is completely integrally closed if and only if its reduced class semigroup is a group and if this holds, then the C-monoid is a Krull monoid and the reduced class semigroup coincides with the usual class group of Krull monoids. We prove that a C-monoid is seminormal if and only if its reduced class semigroup is a union of groups. Based on this characterization we establish a criterion (in terms of the class semigroup) when seminormal C-monoids are half-factorial. Keywords Krull monoids · C-monoids · Seminormal · Class semigroups · Half-factorial Mathematics Subject Classification 20M13 · 13A05 · 13A15 · 13F05 · 13F45 1 Introduction A C-monoid H is a submonoid of a factorial monoid, say H ⊂ F,suchthatH × = H ∩ F× and the reduced class semigroup is finite. A commutative ring is a C-ring if its multiplicative monoid of regular elements is a C-monoid. Every C-monoid is Mori (i.e., v-noetherian), its complete integral closure H is a Krull monoid with finite class group C(H),andthe conductor (H : H) is non-trivial. Conversely, every Mori domain R with non-zero conductor f = (R : R), for which the residue class ring R/f and the class group C(R) are finite, is a C-domain ([10, Theorem 2.11.9]), and these two finiteness conditions are equivalent to being a C-domain for non-local semilocal noetherian domains ([23, Corollary 4.5]).
    [Show full text]