DOCSLIB.ORG

Green's Relations on a Semigroup of Transformations with Restricted

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Green's Relations on a Semigroup of Transformations with Restricted mathematics Article Green’s Relations on a Semigroup of Transformations with Restricted Range that Preserves an Equivalence Relation and a Cross-Section Chollawat Pookpienlert 1, Preeyanuch Honyam 2,* and Jintana Sanwong 2 1 Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand; [email protected] 2 Center of Excellence in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand; [email protected] * Correspondence: [email protected] Received: 4 June 2018; Accepted: 2 August 2018; Published: 4 August 2018 Abstract: Let TpX, Yq be the semigroup consisting of all total transformations from X into a fixed nonempty subset Y of X. For an equivalence relation r on X, let rˆ be the restriction of r on Y, R a cross-section of Y{rˆ and define TpX, Y, r, Rq to be the set of all total transformations a from X into Y such that a preserves both r (if pa, bq P r, then paa, baq P r) and R (if r P R, then ra P R). TpX, Y, r, Rq is then a subsemigroup of TpX, Yq. In this paper, we give descriptions of Green’s relations on TpX, Y, r, Rq, and these results extend the results on TpX, Yq and TpX, r, Rq when taking r to be the identity relation and Y “ X, respectively. Keywords: transformation semigroup; Green’s relations; equivalence relation; cross-section MSC: 20M20 1. Introduction Let X be a nonempty set and TpXq denote the semigroup containing all full transformations from X into itself with the composition. It is well-known that TpXq is a regular semigroup, as shown in Reference [1]. Various subsemigroups of TpXq have been investigated in different years. One of the subsemigroups of TpXq is related to an equivalence relation r on X and a cross-section R of the partition X{r (i.e., each r-class contains exactly one element of R), namely TpX, r, Rq, which was first considered by Araújo and Konieczny in 2003 [2], and is defined by TpX, r, Rq “ ta P TpXq : Ra Ď R and pa, bq P r ñ paa, baq P ru, where Za “ tza : z P Zu. They studied automorphism groups of centralizers of idempotents. Moreover, they also determined Green’s relations and described the regular elements of TpX, r, Rq in 2004 [3]. Let Y be a nonempty subset of the set X. Consider another subsemigroup of TpXq, which was first introduced by Symons [4] in 1975, called TpX, Yq, defined by TpX, Yq “ ta P TpXq : Xa Ď Yu, when Xa denotes the image of a. He described all the automorphisms of TpX, Yq and also determined when TpX1, Y1q is isomorphic to TpX2, Y2q. In 2009, Sanwong, Singha and Sullivan [5] described all the maximal and minimal congruences on TpX, Yq. Later, in Reference [6], Sanwong and Sommanee studied other algebraic properties of TpX, Yq. They gave necessary and sufficient conditions for TpX, Yq Mathematics 2018, 6, 134; doi:10.3390/math6080134 www.mdpi.com/journal/mathematics Mathematics 2018, 6, 134 2 of 12 to be regular and also determined Green’s relations on TpX, Yq. Furthermore, they obtained a class of maximal inverse subsemigroups of TpX, Yq and proved that the set FpX, Yq “ ta P TpX, Yq : Xa Ď Yau contains all regular elements in TpX, Yq, and is the largest regular subsemigroup of TpX, Yq. From now on, we study the subsemigroup TpX, Y, r, Rq of TpX, Yq defined by TpX, Y, r, Rq “ ta P TpX, Yq : Ra Ď R and pa, bq P r ñ paa, baq P ru, where r is an equivalence relation on X and R is a cross-section of the partition Y{rˆ in which rˆ “ r X pY ˆ Yq. If Y “ X, then TpX, Y, r, Rq “ TpX, r, Rq; and if r is the identity relation, then TpX, Y, r, Rq “ TpX, Yq, so we may regard TpX, Y, r, Rq as a generalization of TpX, r, Rq and TpX, Yq. Green’s relations play a role in semigroup theory, and the aim of this paper is to characterize Green’s relations on TpX, Y, r, Rq. As consequences, we obtain Green’s relations on TpX, r, Rq and TpX, Yq as corollaries. 2. Preliminaries and Notations For any semigroup S, let S1 be a semigroup obtained from S by adjoining an identity if S has no identity and letting S1 “ S if it already contains an identity. Green’s relations of S are equivalence relations on the set S which were first defined by Green. According to such definitions, we define the L-relation as follows. For any a, b P S, aLb if and only if S1a “ S1b, or equivalently, aLb if and only if a “ xb and b “ ya for some x, y P S1. Furthermore, we dually define the R-relation as follows. aRb if and only if aS1 “ bS1, or equivalently, aRb if and only if a “ bx and b “ ay for some x, y P S1. Moreover, we define the J -relation as follows. aJ b if and only if S1aS1 “ S1bS1, or equivalently, aJ b if and only if a “ xby and b “ uav for some x, y, u, v P S1. Finally, we define H “ L X R and D “ L ˝ R, where ˝ is the composition of relations. Since the relations L and R commute, it follows that L ˝ R “ R ˝ L. In this paper, we write functions on the right; in particular, this means that for a composition ab, a is applied first. Furthermore, the cardinality of a set A is denoted by |A|. For each a P TpXq, we denote by kerpaq the kernel of a, the set of ordered pairs in X ˆ X having the same image under a, that is, kerpaq “ tpa, bq P X ˆ X : aa “ bau. Moreover, the symbol ppaq denotes the partition of X induced by the map a, namely ppaq “ txa´1 : x P Xau. We observe that kerpaq is an equivalence relation on X in which the partition X{ kerpaq and ppaq coincide. Moreover, for all a, b P TpXq, we have kerpaq “ kerpbq if and only if ppaq “ ppbq. Mathematics 2018, 6, 134 3 of 12 In addition, if r is an equivalence relation on the set X and a, b P X, we sometimes write a r b instead of pa, bq P r, and define ar to be the equivalence class that contains a, that is, ar “ tb P X : b r au. For the subsemigroup TpX, Y, r, Rq of TpXq where r is an equivalence relation on X, Y is a nonempty subset of X and R is a cross-section of Y{rˆ in which rˆ “ r X pY ˆ Yq, we see that if a P X and ar X Y ‰H, then there exists a unique r P R such that a r r, and we denote this element by ra. Furthermore, we observe that FpX, Yq X TpX, Y, r, Rq contains all constant maps whose images belong to R. This implies that FpX, Yq X TpX, Y, r, Rq is a subsemigroup of TpX, Y, r, Rq, which will be denoted by F. An element a in a semigroup S is said to be regular if there exists x P S such that a “ axa; and S is a regular semigroup if every element of S is regular. In general, TpX, Y, r, Rq is not a regular semigroup, so we cannot apply Hall’s Theorem to find the L-relation and the R-relation on TpX, Y, r, Rq. Now, we give an example of a non-regular element in TpX, Y, r, Rq. Let X “ t1, 2, 3, 4, 5u, Y “ t3, 4, 5u, X{r “ tt1, 2u, t3, 4, 5uu, Y{rˆ “ tt3, 4, 5uu and R “ t3u. Define a P TpX, Y, r, Rq by 1 2 3 4 5 a “ . ˜4 3 3 5 5¸ Suppose that a is regular. Then a “ aba for some b P TpX, Y, r, Rq. We see that 4 “ 1a “ 1pabaq “ p4bqa, which implies that 1 “ 4b P Y, a contradiction. Throughout this paper, the set X we study can be a finite or an infinite set. For convenience, we will denote TpX, Y, r, Rq by T. 3. Green’s Relations on TpX, Y, r, Rq Unlike TpX, r, Rq, in general T has no identity, as shown in the following example. Example 1. Let X “ t1, 2, 3, 4, 5, 6u, Y “ t1, 3u,X{r “ tt1, 2u, t3, 4u, t5, 6uu, Y{rˆ “ tt1u, t3uu and R “ t1, 3u. Suppose that # is an identity element in T. Consider a P T defined by 1 2 3 4 5 6 a “ . ˜1 1 1 1 3 3¸ We see that p5#qa “ 5p#aq “ 5a “ 3, which implies that 5# P t5, 6u. This leads to a contradiction, since both 5 and 6 are not in Y. Therefore, we use the semigroup T with identity adjoined, given by T1, in studying its Green’s relations. From now on, the notation La (Ra, Ha, Da) denote the set of all elements of T which are L-related (R-related, H-related, D-related) to a, where a P T. Let A and B be families of sets. If for each set A P A there is a set B P B such that A Ď B, we say that A refines B, denoted by A ãÑ B.
Load more

Recommended publications
  • Filtering Germs: Groupoids Associated to Inverse Semigroups
    FILTERING GERMS: GROUPOIDS ASSOCIATED TO INVERSE SEMIGROUPS BECKY ARMSTRONG, LISA ORLOFF CLARK, ASTRID AN HUEF, MALCOLM JONES, AND YING-FEN LIN Abstract. We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action of the inverse semigroup on the space of idempotent filters. We also investigate the restriction of this isomorphism to the groupoid of tight filters and to the groupoid of ultrafilters. 1. Introduction An inverse semigroup is a set S endowed with an associative binary operation such that for each a 2 S, there is a unique a∗ 2 S, called the inverse of a, satisfying aa∗a = a and a∗aa∗ = a∗: The study of ´etalegroupoids associated to inverse semigroups was initiated by Renault [Ren80, Remark III.2.4]. We consider two well known groupoid constructions: the filter approach and the germ approach, and we show that the two approaches yield isomorphic groupoids. Every inverse semigroup has a natural partial order, and a filter is a nonempty down-directed up-set with respect to this order. The filter approach to groupoid construction first appeared in [Len08], and was later simplified in [LMS13]. Work in this area is ongoing; see for instance, [Bic21, BC20, Cas20]. Every inverse semigroup acts on the filters of its subsemigroup of idempotents. The groupoid of germs associated to an inverse semigroup encodes this action. Paterson pioneered the germ approach in [Pat99] with the introduction of the universal groupoid of an inverse semigroup.
    [Show full text]
  • Relations on Semigroups
    International Journal for Research in Engineering Application & Management (IJREAM) ISSN : 2454-9150 Vol-04, Issue-09, Dec 2018 Relations on Semigroups 1D.D.Padma Priya, 2G.Shobhalatha, 3U.Nagireddy, 4R.Bhuvana Vijaya 1 Sr.Assistant Professor, Department of Mathematics, New Horizon College Of Engineering, Bangalore, India, Research scholar, Department of Mathematics, JNTUA- Anantapuram [email protected] 2Professor, Department of Mathematics, SKU-Anantapuram, India, [email protected] 3Assistant Professor, Rayalaseema University, Kurnool, India, [email protected] 4Associate Professor, Department of Mathematics, JNTUA- Anantapuram, India, [email protected] Abstract: Equivalence relations play a vital role in the study of quotient structures of different algebraic structures. Semigroups being one of the algebraic structures are sets with associative binary operation defined on them. Semigroup theory is one of such subject to determine and analyze equivalence relations in the sense that it could be easily understood. This paper contains the quotient structures of semigroups by extending equivalence relations as congruences. We define different types of relations on the semigroups and prove they are equivalence, partial order, congruence or weakly separative congruence relations. Keywords: Semigroup, binary relation, Equivalence and congruence relations. I. INTRODUCTION [1,2,3 and 4] Algebraic structures play a prominent role in mathematics with wide range of applications in science and engineering. A semigroup
    [Show full text]
  • Computing Finite Semigroups
    Computing finite semigroups J. East, A. Egri-Nagy, J. D. Mitchell, and Y. P´eresse August 24, 2018 Abstract Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids, matrix semigroups, and subsemigroups of finite regular Rees matrix and 0-matrix semigroups over groups. For any subsemigroup of such a semigroup, it is possible to, among other things, efficiently compute its size and Green's relations, test membership, factorize elements over the generators, find the semigroup generated by the given subsemigroup and any collection of additional elements, calculate the partial order of the D-classes, test regularity, and determine the idempotents. This is achieved by representing the given subsemigroup without exhaustively enumerating its elements. It is also possible to compute the Green's classes of an element of such a subsemigroup without determining the global structure of the semigroup. Contents 1 Introduction 2 2 Mathematical prerequisites4 3 From transformation semigroups to arbitrary regular semigroups6 3.1 Actions on Green's classes . .6 3.2 Faithful representations of stabilisers . .7 3.3 A decomposition for Green's classes . .8 3.4 Membership testing . 11 3.5 Classes within classes . 13 4 Specific classes of semigroups 14 4.1 Transformation semigroups . 15 4.2 Partial permutation semigroups and inverse semigroups . 16 4.3 Matrix semigroups .
    [Show full text]
  • Relations in Categories
    Relations in Categories Stefan Milius A thesis submitted to the Faculty of Graduate Studies in partial fulfilment of the requirements for the degree of Master of Arts Graduate Program in Mathematics and Statistics York University Toronto, Ontario June 15, 2000 Abstract This thesis investigates relations over a category C relative to an (E; M)-factori- zation system of C. In order to establish the 2-category Rel(C) of relations over C in the first part we discuss sufficient conditions for the associativity of horizontal composition of relations, and we investigate special classes of morphisms in Rel(C). Attention is particularly devoted to the notion of mapping as defined by Lawvere. We give a significantly simplified proof for the main result of Pavlovi´c,namely that C Map(Rel(C)) if and only if E RegEpi(C). This part also contains a proof' that the category Map(Rel(C))⊆ is finitely complete, and we present the results obtained by Kelly, some of them generalized, i. e., without the restrictive assumption that M Mono(C). The next part deals with factorization⊆ systems in Rel(C). The fact that each set-relation has a canonical image factorization is generalized and shown to yield an (E¯; M¯ )-factorization system in Rel(C) in case M Mono(C). The setting without this condition is studied, as well. We propose a⊆ weaker notion of factorization system for a 2-category, where the commutativity in the universal property of an (E; M)-factorization system is replaced by coherent 2-cells. In the last part certain limits and colimits in Rel(C) are investigated.
    [Show full text]
  • Data Monoids∗
    Data Monoids∗ Mikolaj Bojańczyk1 1 University of Warsaw Abstract We develop an algebraic theory for languages of data words. We prove that, under certain conditions, a language of data words is definable in first-order logic if and only if its syntactic monoid is aperiodic. 1998 ACM Subject Classification F.4.3 Formal Languages Keywords and phrases Monoid, Data Words, Nominal Set, First-Order Logic Digital Object Identifier 10.4230/LIPIcs.STACS.2011.105 1 Introduction This paper is an attempt to combine two fields. The first field is the algebraic theory of regular languages. In this theory, a regular lan- guage is represented by its syntactic monoid, which is a finite monoid. It turns out that many important properties of the language are reflected in the structure of its syntactic monoid. One particularly beautiful result is the Schützenberger-McNaughton-Papert theorem, which describes the expressive power of first-order logic. Let L ⊆ A∗ be a regular language. Then L is definable in first-order logic if and only if its syntactic monoid ML is aperiodic. For instance, the language “words where there exists a position with label a” is defined by the first-order logic formula (this example does not even use the order on positions <, which is also allowed in general) ∃x. a(x). The syntactic monoid of this language is isomorphic to {0, 1} with multiplication, where 0 corresponds to the words that satisfy the formula, and 1 to the words that do not. Clearly, this monoid does not contain any non-trivial group. There are many results similar to theorem above, each one providing a connection between seemingly unrelated concepts of logic and algebra, see e.g.
    [Show full text]
  • Monoids (I = 1, 2) We Can Define 1  C 2000 M
    Geometria Superiore Reference Cards Push out (Sommes amalgam´ees). Given a diagram i : P ! Qi Monoids (i = 1; 2) we can define 1 c 2000 M. Cailotto, Permissions on last. v0.0 u −!2 Send comments and corrections to [email protected] Q1 ⊕P Q2 := coker P −! Q1 ⊕ Q2 u1 The category of Monoids. 1 and it is a standard fact that the natural arrows ji : Qi ! A monoid (M; ·; 1) (commutative with unit) is a set M with a Q1 ⊕P Q2 define a cocartesian square: u1 composition law · : M × M ! M and an element 1 2 M such P −−−! Q1 that: the composition is associative: (a · b) · c = a · (b · c) (for ? ? all a; b; c 2 M), commutative: a · b = b · a (for all a; b 2 M), u2 y y j1 and 1 is a neutral element for the composition: 1 · a = a (for Q2 −! Q1 ⊕P Q2 : all a 2 M). j2 ' ' More explicitly we have Q1 ⊕P Q2 = (Q1 ⊕ Q2)=R with R the A morphism (M; ·; 1M ) −!(N; ·; 1N ) of monoids is a map M ! N smallest equivalence relation stable under product (in Q1 ⊕P of sets commuting with · and 1: '(ab) = '(a)'(b) for all Q2) and making (u1(p); 1) ∼R (1; u2(p)) for all p 2 P . a; b 2 M and '(1 ) = 1 . Thus we have defined the cat- M N In general it is not easy to understand the relation involved in egory Mon of monoids. the description of Q1 ⊕P Q2, but in the case in which one of f1g is a monoid, initial and final object of the category Mon.
    [Show full text]
  • Free Idempotent Generated Semigroups and Endomorphism Monoids of Independence Algebras
    Free idempotent generated semigroups and endomorphism monoids of independence algebras Yang Dandan & Victoria Gould Semigroup Forum ISSN 0037-1912 Semigroup Forum DOI 10.1007/s00233-016-9802-0 1 23 Your article is published under the Creative Commons Attribution license which allows users to read, copy, distribute and make derivative works, as long as the author of the original work is cited. You may self- archive this article on your own website, an institutional repository or funder’s repository and make it publicly available immediately. 1 23 Semigroup Forum DOI 10.1007/s00233-016-9802-0 RESEARCH ARTICLE Free idempotent generated semigroups and endomorphism monoids of independence algebras Yang Dandan1 · Victoria Gould2 Received: 18 January 2016 / Accepted: 3 May 2016 © The Author(s) 2016. This article is published with open access at Springerlink.com Abstract We study maximal subgroups of the free idempotent generated semigroup IG(E), where E is the biordered set of idempotents of the endomorphism monoid End A of an independence algebra A, in the case where A has no constants and has finite rank n. It is shown that when n ≥ 3 the maximal subgroup of IG(E) containing a rank 1 idempotent ε is isomorphic to the corresponding maximal subgroup of End A containing ε. The latter is the group of all unary term operations of A. Note that the class of independence algebras with no constants includes sets, free group acts and affine algebras. Keywords Independence algebra · Idempotent · Biordered set 1 Introduction Let S be a semigroup with set E = E(S) of idempotents, and let E denote the subsemigroup of S generated by E.
    [Show full text]
  • What Are Kinship Terminologies, and Why Do We Care?: a Computational Approach To
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Kent Academic Repository What are Kinship Terminologies, and Why do we Care?: A Computational Approach to Analysing Symbolic Domains Dwight Read, UCLA Murray Leaf, University of Texas, Dallas Michael Fischer, University of Kent, Canterbury, Corresponding Author, [email protected] Abstract Kinship is a fundamental feature and basis of human societies. We describe a set of computat ional tools and services, the Kinship Algebra Modeler, and the logic that underlies these. Thes e were developed to improve how we understand both the fundamental facts of kinship, and h ow people use kinship as a resource in their lives. Mathematical formalism applied to cultural concepts is more than an exercise in model building, as it provides a way to represent and exp lore logical consistency and implications. The logic underlying kinship is explored here thro ugh the kin term computations made by users of a terminology when computing the kinship r elation one person has to another by referring to a third person for whom each has a kin term relationship. Kinship Algebra Modeler provides a set of tools, services and an architecture to explore kinship terminologies and their properties in an accessible manner. Keywords Kinship, Algebra, Semantic Domains, Kinship Terminology, Theory Building 1 1. Introduction The Kinship Algebra Modeller (KAM) is a suite of open source software tools and services u nder development to support the elicitation and analysis of kinship terminologies, building al gebraic models of the relations structuring terminologies, and instantiating these models in lar ger contexts to better understand how people pragmatically interpret and employ the logic of kinship relations as a resource in their individual and collective lives.
    [Show full text]
  • Arxiv:1905.10901V1 [Cs.LG] 26 May 2019
    Seeing Convolution Through the Eyes of Finite Transformation Semigroup Theory: An Abstract Algebraic Interpretation of Convolutional Neural Networks Andrew Hryniowski1;2;3, Alexander Wong1;2;3 1 Video and Image Processing Research Group, Systems Design Engineering, University of Waterloo 2 Waterloo Artificial Intelligence Institute, Waterloo, ON 3 DarwinAI Corp., Waterloo, ON fapphryni, [email protected] Abstract of applications, particularly for prediction using structured data. Despite such successes, a major challenge with lever- Researchers are actively trying to gain better insights aging convolutional neural networks is the sheer number of into the representational properties of convolutional neural learnable parameters within such networks, making under- networks for guiding better network designs and for inter- standing and gaining insights about them a daunting task. As preting a network’s computational nature. Gaining such such, researchers are actively trying to gain better insights insights can be an arduous task due to the number of pa- and understanding into the representational properties of rameters in a network and the complexity of a network’s convolutional neural networks, especially since it can lead architecture. Current approaches of neural network inter- to better design and interpretability of such networks. pretation include Bayesian probabilistic interpretations and One direction that holds a lot of promise in improving information theoretic interpretations. In this study, we take a understanding of convolutional neural networks, but is much different approach to studying convolutional neural networks less explored than other approaches, is the construction of by proposing an abstract algebraic interpretation using finite theoretical models and interpretations of such networks. Cur- transformation semigroup theory.
    [Show full text]
  • Transformation Semigroups and Their Automorphisms
    Transformation Semigroups and their Automorphisms Wolfram Bentz University of Hull Joint work with Jo~aoAra´ujo(CEMAT, Universidade Nova de Lisboa) Peter J. Cameron (University of St Andrews) York Semigroup York, October 9, 2019 X Let X be a set and TX = X be full transformation monoid on X , under composition. Note that TX contains the symmetric group over X (as its group of units) We will only consider finite X , and more specifically Tn = TXn , Sn = SXn , where Xn = f1;:::; ng for n 2 N For S ≤ Tn, we are looking at the interaction of S \ Sn and S Transformation Monoids and Permutation Groups Wolfram Bentz (Hull) Transformation Semigroups October 9, 2019 2 / 23 Note that TX contains the symmetric group over X (as its group of units) We will only consider finite X , and more specifically Tn = TXn , Sn = SXn , where Xn = f1;:::; ng for n 2 N For S ≤ Tn, we are looking at the interaction of S \ Sn and S Transformation Monoids and Permutation Groups X Let X be a set and TX = X be full transformation monoid on X , under composition. Wolfram Bentz (Hull) Transformation Semigroups October 9, 2019 2 / 23 We will only consider finite X , and more specifically Tn = TXn , Sn = SXn , where Xn = f1;:::; ng for n 2 N For S ≤ Tn, we are looking at the interaction of S \ Sn and S Transformation Monoids and Permutation Groups X Let X be a set and TX = X be full transformation monoid on X , under composition. Note that TX contains the symmetric group over X (as its group of units) Wolfram Bentz (Hull) Transformation Semigroups October 9, 2019 2 / 23 Transformation Monoids and Permutation Groups X Let X be a set and TX = X be full transformation monoid on X , under composition.
    [Show full text]
  • Foundations of Relations and Kleene Algebra
    Introduction Foundations of Relations and Kleene Algebra Aim: cover the basics about relations and Kleene algebras within the framework of universal algebra Peter Jipsen This is a tutorial Slides give precise definitions, lots of statements Decide which statements are true (can be improved) Chapman University which are false (and perhaps how they can be fixed) [Hint: a list of pages with false statements is at the end] September 4, 2006 Peter Jipsen (Chapman University) Relation algebras and Kleene algebra September 4, 2006 1 / 84 Peter Jipsen (Chapman University) Relation algebras and Kleene algebra September 4, 2006 2 / 84 Prerequisites Algebraic properties of set operation Knowledge of sets, union, intersection, complementation Some basic first-order logic Let U be a set, and P(U)= {X : X ⊆ U} the powerset of U Basic discrete math (e.g. function notation) P(U) is an algebra with operations union ∪, intersection ∩, These notes take an algebraic perspective complementation X − = U \ X Satisfies many identities: e.g. X ∪ Y = Y ∪ X for all X , Y ∈ P(U) Conventions: How can we describe the set of all identities that hold? Minimize distinction between concrete and abstract notation x, y, z, x1,... variables (implicitly universally quantified) Can we decide if a particular identity holds in all powerset algebras? X , Y , Z, X1,... set variables (implicitly universally quantified) These are questions about the equational theory of these algebras f , g, h, f1,... function variables We will consider similar questions about several other types of algebras, a, b, c, a1,... constants in particular relation algebras and Kleene algebras i, j, k, i1,..
    [Show full text]
  • Geometric Equivalence Relations on Modules 0
    Journal of Pure and Applied Algebra 22 (1981) 165-177 165 North-Holland Publishing Company GEOMETRIC EQUIVALENCE RELATIONS ON MODULES Kent MORRISON Department of Mathematics, California Polytechnic State University, San Luir Obispo, CA 93407. USA Communicated by H. Bass Received June 1980 0. Introduction In [4] Gersten developed the notion of homotopy for ring homomorphisms. A simple homotopy of two ring homomorphisms f,g : A +B can be viewed as a deformation over the parameter space Spec Z[t]. This is a homomorphism A+B[t] which restricts to f when t = 0 and to g when t = 1. Two homomorphisms f and g are homotopic if there is a chain of homomorphisms starting with f and ending with g such that each term is simple homotopic to the next. Let A be a k-algebra and k a field. Consider the finite dimensional representations of A and require that a simple homotopy of representations be given by a deformation over Speck[t] = A:. Using direct sum we can make the homotopy classes of representations into an abelian monoid. Now it is more useful to use any nonsingular, rational affine curve as well as A: for the parameter space of a homotopy. (This becomes apparent when A is commutative; see Section 1.3.) The abelian monoid of homotopy classes is denoted by N(A) and its associated group by R(A). Two modules (representations) whose classes in R(A) are the same are said to be ‘rationally equivalent’. In Section 1.3 we show that when A is commutative R(A) is isomorphic to the Chow group of O-cycles of SpecA modulo rational equivalence.
    [Show full text]