DOCSLIB.ORG

Topologies for the Free Monoid*

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Topologies for the Free Monoid* JOURPZAL OF ALGEBRA 137, 297-337 (1991) Topologies for the Free Monoid* J. E. PIN C.N.R.S., L.I.T.P. Universitd Paris VI, Tour 55-45, 4 place Jussieu, 75252 Paris Cedex 05, France Communicated by T. E. Hall Received March 11, 1988 The finite group (or protinite) topology was first introduced for the free group by M. Hall, Jr. and by Reutenauer for free monoids. This is the initial topology defined by all the monoid morphisms from the free monoid into a discrete finite group. The p-adic topology is defined in the same way by replacing “group” by “p-group” in the definition. In this paper we study the properties of these topologies and their connexions with the theory of formal languages. (0 1991 Academic Press, Inc. The finite group (or prolinite) topology was first introduced for the free group by M. Hall, Jr. [S] and extended by Reutenauer [ 151 to the case of free monoids. This is the initial topology defined by all the monoid morphisms from the free monoid into a discrete finite group. The p-adic topology is defined in the same way by replacing “group” by “p-group” in the definition. (Similarly, the “prolinite topology” introduced by D. Scott [17] is obtained by replacing “group” by “monoid” in the definition, but we are not concerned with this topology in this paper.) The aim of this paper is to found a “descriptive theory” of these topologies for the free monoid. That is, one restricts one’s attention to “simple” subsets of the free monoid and one tries to decide whether these sets are open, closed, com- pact, or if one can describe their topological closure, etc. The “simple” sets we have in mind in this paper are the recognizable (or regular) sets of automata theory. It is fair to say immediately that we are not completely successful, and therefore part of our paper is devoted to the discussion of various conjectures. The main tools for this study are the free group (especially the topologies for the free group) and the theory of finite automata. It is well known that every subset L of the free monoid A* defines in a natural way a congruence on A*, called the syntactic congruence. The sub- sets of A* for which this congruence is of finite index are called l Supported by the PRC Mathdmatiques et Informatique. 297 0021~8693/91 $3.00 Copyright Q 1991 by Academic Press, Inc. All rights 01 reproduction in any form reserved. 298 J. E. PIN recognizable. If L is a recognizable subset of A*, the quotient of A* by the syntactic congruence of L is a finite monoid M, called the syntactic monoid of L. The image P of L in M is the syntactic image of L. This syntactic monoid turns out to be a very powerful concept in language theory, and a number of fascinating results relate the combinatorial properties of recognizable languages with algebraic properties of their syntactic monoid (see [4, 7, 121 for more details). A central idea of this paper is that topological properties of L are also reflected by algebraic properties of it4 and P. For instance, it is easy to show that if L is closed, then the property holds that for every s, t E M, and for every idempotent e E M (set E P 3 st E P). (*) We conjecture that the converse is true in general, and we prove this con- jecture in two significant particular cases: if P is a submonoid of M, or if the idempotents of M commute. This conjecture is not only interesting by itself, but also has some surprising consequences. For instance, a positive answer to the conjecture would solve an open problem on finite semigroups for the solution of which J. Rhodes has recently offered $100. Next, this conjecture, if true, gives an algorithm to decide whether a given recognizable set is open or closed. In fact, we show that it also gives an algorithm to compute the closure of a given recognizable set. Two such algorithms are presented in this paper. One of the main results of the paper shows that open sets are preserved under concatenation products of the form (L,, L,, . Lk) -+ L,a,L,az ... akL,. This result is based on a detailed analysis of a counting operation and furnishes many explicit examples of open sets. Another interesting result is that every open free submonoid of the free monoid is also closed. This is reminiscent of the well-known fact that every open subgroup of a topological group is closed, but here the condition “free” is required. The paper requires a basic knowledge of finite automata, finite semi- groups, and elementary topology, However, we have tried to keep the paper self-contained as far as possible. The paper is organized as follows. Section 1 contains the basic definitions and some useful results (including some new results) used in the paper. Section 2 introduces the definition and the basic properties of the topologies for the free monoid. Section 3 is devoted to the proof of a language theoretic result on concatenation product with counter. Properties of open sets are analysed in Section 4. Here we show that open sets are preserved under some natural operation of language theory: quotients, concatenation product, plus operation, inverse (non-empty) substitutions, etc. and we discuss the connections between the topologies for the free monoid and the free group. In Section 5, we study the topological properties of recognizable sets. In particular, we characterize the clopen recognizable sets and the compact recognizable sets. FREE MONOID 299 Even more is known on the submonoids of the free monoid, the properties of which are presented in Section 6. Section 7 is devoted to a detailed discussion of our major conjectures and their consequences. Part of the results of this paper have been announced in [ 111. 1. PRELIMINARIES In this section, we briefly recall the main definitions or properties that are used throughout this paper. For more details, the reader is referred to [l, 4, 7, 123 for languages and to [3] for topology. (a) Semigroups and Monoids A semigroup S is a set equipped with an associative operation, usually denoted multiplicatively. A monoid is a semigroup with identity. Given two monoids M and N, a map cp:M+ N is a monoid morphism if 1~ = 1 and (mn)q = (mcp)(ncp)for every m, n E M. A relational morphism z: M + N is a map from M into the subsets of N such that (1) for every m E M, mr is nonempty, (2) 1 ElZ, (3) for every m, n E M, (mz)(nz) c (mn)z. Let r: M -+ N be a relational morphism. If M’ is a submonoid of M, then M’z is a submonoid of N. Similarly, if N’ is a submonoid of N, N’z-I= {meMImznN’#IZ(} is a submonoid of M. Further properties of relational morphisms can be found in [ 12, 211. We just mention here a new result, inspired by an unpublished paper of Schtitzenberger. PROPOSITION 1.1. Let G be a finite group, H an arbitrary group, and let z: G + H be a surjective relational morphism. Then G’ = lz-’ is a normal subgroup of G, H’ = lr is a normal subgroup of H, and G/G’ = H/H’. Furthermore, for every gE G, gz is a coset of H’. ProoJ: We first claim that for every g E G, h E gz implies h - ’ E g- ‘2. Indeed, since r is surjective, there exists x E G such that h - ’ E xz. Let n be the order of G. Then hk’ = (h-l)” h”-‘E (xz)” (gz)“-’ c (xngn-‘)z= g-lz, since x”= g” = 1. In particular, H’ = 17 is a subgroup of H. Furthermore, if h E gz and XE 17, then by the claim, hxh-’ E (gt)(lr)(g-‘t)c (gg-‘)r = 17. Thus H’ is normal in H. Furthermore, the following property holds: for every h E gz, gz = H’h. (1) 481/137/2-4 300 J. E. PIN Indeed, H’h c (lz)(gz) c gr and, on the other hand, (gz) h ’ c (gz)(g-‘z) c 1~. Thus z induces a group morphism from G onto H/H’, the kernel of which is the group N= {gEGJ gt= lr}. We claim that N = G’ = {g E G 1 1 E gz}. Indeed, since 1 E lz, N is contained in G’. Conversely, if g E G’, then 1 E gr, whence gr = (17). 1 = It by (1). Thus N = G’, G’ is normal in G and G/G’ = H/H’. 1 (b) Languages Let A be a finite set, called the alphabet. We denote by A* the free monoid over A and by F(A) the free group over A. A letter is an element of A, a word is an element of A * and a language is a subset of A*. The empty word is denoted by 1. The product of two words u and u is simply denoted by uv. Thus every word u can be written in an unique way as u=a,a,~.~a,, where a,, . a, are letters. In this case, n is the length of u, denoted by (u(. In particular, the empty word 1 is the only word of length 0. If u is a word, we set u” = 1, and, for every n 2 0, u”+ i = uu”. If L is a language, L+ (resp. L*) denotes the subsemigroup (resp.
Load more

Recommended publications
  • Combinatorial Operads from Monoids Samuele Giraudo
    Combinatorial operads from monoids Samuele Giraudo To cite this version: Samuele Giraudo. Combinatorial operads from monoids. Journal of Algebraic Combinatorics, Springer Verlag, 2015, 41 (2), pp.493-538. 10.1007/s10801-014-0543-4. hal-01236471 HAL Id: hal-01236471 https://hal.archives-ouvertes.fr/hal-01236471 Submitted on 1 Dec 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. COMBINATORIAL OPERADS FROM MONOIDS SAMUELE GIRAUDO Abstract. We introduce a functorial construction which, from a monoid, produces a set- operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative monoids of integers and cyclic monoids. They involve various familiar combinatorial objects: endo- functions, parking functions, packed words, permutations, planar rooted trees, trees with a fixed arity, Schröder trees, Motzkin words, integer compositions, directed animals, and segmented integer compositions. We also recover some already known (symmetric or not) operads: the magmatic operad, the associative commutative operad, the diassociative op- erad, and the triassociative operad. We provide presentations by generators and relations of all constructed nonsymmetric operads. Contents Introduction 1 1. Syntax trees and operads3 1.1.
    [Show full text]
  • On Free Quasigroups and Quasigroup Representations Stefanie Grace Wang Iowa State University
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2017 On free quasigroups and quasigroup representations Stefanie Grace Wang Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Mathematics Commons Recommended Citation Wang, Stefanie Grace, "On free quasigroups and quasigroup representations" (2017). Graduate Theses and Dissertations. 16298. https://lib.dr.iastate.edu/etd/16298 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. On free quasigroups and quasigroup representations by Stefanie Grace Wang A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Jonathan D.H. Smith, Major Professor Jonas Hartwig Justin Peters Yiu Tung Poon Paul Sacks The student author and the program of study committee are solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2017 Copyright c Stefanie Grace Wang, 2017. All rights reserved. ii DEDICATION I would like to dedicate this dissertation to the Integral Liberal Arts Program. The Program changed my life, and I am forever grateful. It is as Aristotle said, \All men by nature desire to know." And Montaigne was certainly correct as well when he said, \There is a plague on Man: his opinion that he knows something." iii TABLE OF CONTENTS LIST OF TABLES .
    [Show full text]
  • Automata, Semigroups and Duality
    Automata, semigroups and duality Mai Gehrke1 Serge Grigorieff2 Jean-Eric´ Pin2 1Radboud Universiteit 2LIAFA, CNRS and University Paris Diderot TANCL’07, August 2007, Oxford LIAFA, CNRS and University Paris Diderot Outline (1) Four ways of defining languages (2) The profinite world (3) Duality (4) Back to the future LIAFA, CNRS and University Paris Diderot Part I Four ways of defining languages LIAFA, CNRS and University Paris Diderot Words and languages Words over the alphabet A = {a, b, c}: a, babb, cac, the empty word 1, etc. The set of all words A∗ is the free monoid on A. A language is a set of words. Recognizable (or regular) languages can be defined in various ways: ⊲ by (extended) regular expressions ⊲ by finite automata ⊲ in terms of logic ⊲ by finite monoids LIAFA, CNRS and University Paris Diderot Basic operations on languages • Boolean operations: union, intersection, complement. • Product: L1L2 = {u1u2 | u1 ∈ L1,u2 ∈ L2} Example: {ab, a}{a, ba} = {aa, aba, abba}. • Star: L∗ is the submonoid generated by L ∗ L = {u1u2 · · · un | n > 0 and u1,...,un ∈ L} {a, ba}∗ = {1, a, aa, ba, aaa, aba, . .}. LIAFA, CNRS and University Paris Diderot Various types of expressions • Regular expressions: union, product, star: (ab)∗ ∪ (ab)∗a • Extended regular expressions (union, intersection, complement, product and star): A∗ \ (bA∗ ∪ A∗aaA∗ ∪ A∗bbA∗) • Star-free expressions (union, intersection, complement, product but no star): ∅c \ (b∅c ∪∅caa∅c ∪∅cbb∅c) LIAFA, CNRS and University Paris Diderot Finite automata a 1 2 The set of states is {1, 2, 3}. b The initial state is 1. b a 3 The final states are 1 and 2.
    [Show full text]
  • An Introduction to Operad Theory
    AN INTRODUCTION TO OPERAD THEORY SAIMA SAMCHUCK-SCHNARCH Abstract. We give an introduction to category theory and operad theory aimed at the undergraduate level. We first explore operads in the category of sets, and then generalize to other familiar categories. Finally, we develop tools to construct operads via generators and relations, and provide several examples of operads in various categories. Throughout, we highlight the ways in which operads can be seen to encode the properties of algebraic structures across different categories. Contents 1. Introduction1 2. Preliminary Definitions2 2.1. Algebraic Structures2 2.2. Category Theory4 3. Operads in the Category of Sets 12 3.1. Basic Definitions 13 3.2. Tree Diagram Visualizations 14 3.3. Morphisms and Algebras over Operads of Sets 17 4. General Operads 22 4.1. Basic Definitions 22 4.2. Morphisms and Algebras over General Operads 27 5. Operads via Generators and Relations 33 5.1. Quotient Operads and Free Operads 33 5.2. More Examples of Operads 38 5.3. Coloured Operads 43 References 44 1. Introduction Sets equipped with operations are ubiquitous in mathematics, and many familiar operati- ons share key properties. For instance, the addition of real numbers, composition of functions, and concatenation of strings are all associative operations with an identity element. In other words, all three are examples of monoids. Rather than working with particular examples of sets and operations directly, it is often more convenient to abstract out their common pro- perties and work with algebraic structures instead. For instance, one can prove that in any monoid, arbitrarily long products x1x2 ··· xn have an unambiguous value, and thus brackets 2010 Mathematics Subject Classification.
    [Show full text]
  • Sage 9.4 Reference Manual: Monoids Release 9.4
    Sage 9.4 Reference Manual: Monoids Release 9.4 The Sage Development Team Aug 24, 2021 CONTENTS 1 Monoids 3 2 Free Monoids 5 3 Elements of Free Monoids 9 4 Free abelian monoids 11 5 Abelian Monoid Elements 15 6 Indexed Monoids 17 7 Free String Monoids 23 8 String Monoid Elements 29 9 Utility functions on strings 33 10 Hecke Monoids 35 11 Automatic Semigroups 37 12 Module of trace monoids (free partially commutative monoids). 47 13 Indices and Tables 55 Python Module Index 57 Index 59 i ii Sage 9.4 Reference Manual: Monoids, Release 9.4 Sage supports free monoids and free abelian monoids in any finite number of indeterminates, as well as free partially commutative monoids (trace monoids). CONTENTS 1 Sage 9.4 Reference Manual: Monoids, Release 9.4 2 CONTENTS CHAPTER ONE MONOIDS class sage.monoids.monoid.Monoid_class(names) Bases: sage.structure.parent.Parent EXAMPLES: sage: from sage.monoids.monoid import Monoid_class sage: Monoid_class(('a','b')) <sage.monoids.monoid.Monoid_class_with_category object at ...> gens() Returns the generators for self. EXAMPLES: sage: F.<a,b,c,d,e>= FreeMonoid(5) sage: F.gens() (a, b, c, d, e) monoid_generators() Returns the generators for self. EXAMPLES: sage: F.<a,b,c,d,e>= FreeMonoid(5) sage: F.monoid_generators() Family (a, b, c, d, e) sage.monoids.monoid.is_Monoid(x) Returns True if x is of type Monoid_class. EXAMPLES: sage: from sage.monoids.monoid import is_Monoid sage: is_Monoid(0) False sage: is_Monoid(ZZ) # The technical math meaning of monoid has ....: # no bearing whatsoever on the result: it's ....: # a typecheck which is not satisfied by ZZ ....: # since it does not inherit from Monoid_class.
    [Show full text]
  • Irreducible Representations of Finite Monoids
    U.U.D.M. Project Report 2019:11 Irreducible representations of finite monoids Christoffer Hindlycke Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Mars 2019 Department of Mathematics Uppsala University Irreducible representations of finite monoids Christoffer Hindlycke Contents Introduction 2 Theory 3 Finite monoids and their structure . .3 Introductory notions . .3 Cyclic semigroups . .6 Green’s relations . .7 von Neumann regularity . 10 The theory of an idempotent . 11 The five functors Inde, Coinde, Rese,Te and Ne ..................... 11 Idempotents and simple modules . 14 Irreducible representations of a finite monoid . 17 Monoid algebras . 17 Clifford-Munn-Ponizovski˘ıtheory . 20 Application 24 The symmetric inverse monoid . 24 Calculating the irreducible representations of I3 ........................ 25 Appendix: Prerequisite theory 37 Basic definitions . 37 Finite dimensional algebras . 41 Semisimple modules and algebras . 41 Indecomposable modules . 42 An introduction to idempotents . 42 1 Irreducible representations of finite monoids Christoffer Hindlycke Introduction This paper is a literature study of the 2016 book Representation Theory of Finite Monoids by Benjamin Steinberg [3]. As this book contains too much interesting material for a simple master thesis, we have narrowed our attention to chapters 1, 4 and 5. This thesis is divided into three main parts: Theory, Application and Appendix. Within the Theory chapter, we (as the name might suggest) develop the necessary theory to assist with finding irreducible representations of finite monoids. Finite monoids and their structure gives elementary definitions as regards to finite monoids, and expands on the basic theory of their structure. This part corresponds to chapter 1 in [3]. The theory of an idempotent develops just enough theory regarding idempotents to enable us to state a key result, from which the principal result later follows almost immediately.
    [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]
  • 1. Language of Operads 2. Operads As Monads
    OPERADS, APPROXIMATION, AND RECOGNITION MAXIMILIEN PEROUX´ All missing details can be found in [May72]. 1. Language of operads Let S = (S; ⊗; I) be a (closed) symmetric monoidal category. Definition 1.1. An operad O in S is a collection of object fO(j)gj≥0 in S endowed with : • a right-action of the symmetric group Σj on O(j) for each j, such that O(0) = I; • a unit map I ! O(1) in S; • composition operations that are morphisms in S : γ : O(k) ⊗ O(j1) ⊗ · · · ⊗ O(jk) −! O(j1 + ··· + jk); defined for each k ≥ 0, j1; : : : ; jk ≥ 0, satisfying natural equivariance, unit and associativity relations. 0 0 A morphism of operads : O ! O is a sequence j : O(j) ! O (j) of Σj-equivariant morphisms in S compatible with the unit map and γ. Example 1.2. ⊗j Let X be an object in S. The endomorphism operad EndX is defined to be EndX (j) = HomS(X ;X), ⊗j with unit idX , and the Σj-right action is induced by permuting on X . Example 1.3. Define Assoc(j) = ` , the associative operad, where the maps γ are defined by equivariance. Let σ2Σj I Com(j) = I, the commutative operad, where γ are the canonical isomorphisms. Definition 1.4. Let O be an operad in S. An O-algebra (X; θ) in S is an object X together with a morphism of operads ⊗j θ : O ! EndX . Using adjoints, this is equivalent to a sequence of maps θj : O(j) ⊗ X ! X such that they are associative, unital and equivariant.
    [Show full text]
  • Algebras of Boolean Inverse Monoids – Traces and Invariant Means
    C*-algebras of Boolean inverse monoids { traces and invariant means Charles Starling∗ Abstract ∗ To a Boolean inverse monoid S we associate a universal C*-algebra CB(S) and show that it is equal to Exel's tight C*-algebra of S. We then show that any invariant mean on S (in the sense of Kudryavtseva, Lawson, Lenz and Resende) gives rise to a ∗ trace on CB(S), and vice-versa, under a condition on S equivalent to the underlying ∗ groupoid being Hausdorff. Under certain mild conditions, the space of traces of CB(S) is shown to be isomorphic to the space of invariant means of S. We then use many known results about traces of C*-algebras to draw conclusions about invariant means on Boolean inverse monoids; in particular we quote a result of Blackadar to show that any metrizable Choquet simplex arises as the space of invariant means for some AF inverse monoid S. 1 Introduction This article is the continuation of our study of the relationship between inverse semigroups and C*-algebras. An inverse semigroup is a semigroup S for which every element s 2 S has a unique \inverse" s∗ in the sense that ss∗s = s and s∗ss∗ = s∗: An important subsemigroup of any inverse semigroup is its set of idempotents E(S) = fe 2 S j e2 = eg = fs∗s j s 2 Sg. Any set of partial isometries closed under product and arXiv:1605.05189v3 [math.OA] 19 Jul 2016 involution inside a C*-algebra is an inverse semigroup, and its set of idempotents forms a commuting set of projections.
    [Show full text]
  • Binary Opera- Tions, Magmas, Monoids, Groups, Rings, fields and Their Homomorphisms
    1. Introduction In this chapter, I introduce some of the fundamental objects of algbera: binary opera- tions, magmas, monoids, groups, rings, fields and their homomorphisms. 2. Binary Operations Definition 2.1. Let M be a set. A binary operation on M is a function · : M × M ! M often written (x; y) 7! x · y. A pair (M; ·) consisting of a set M and a binary operation · on M is called a magma. Example 2.2. Let M = Z and let + : Z × Z ! Z be the function (x; y) 7! x + y. Then, + is a binary operation and, consequently, (Z; +) is a magma. Example 2.3. Let n be an integer and set Z≥n := fx 2 Z j x ≥ ng. Now suppose n ≥ 0. Then, for x; y 2 Z≥n, x + y 2 Z≥n. Consequently, Z≥n with the operation (x; y) 7! x + y is a magma. In particular, Z+ is a magma under addition. Example 2.4. Let S = f0; 1g. There are 16 = 42 possible binary operations m : S ×S ! S . Therefore, there are 16 possible magmas of the form (S; m). Example 2.5. Let n be a non-negative integer and let · : Z≥n × Z≥n ! Z≥n be the operation (x; y) 7! xy. Then Z≥n is a magma. Similarly, the pair (Z; ·) is a magma (where · : Z×Z ! Z is given by (x; y) 7! xy). Example 2.6. Let M2(R) denote the set of 2 × 2 matrices with real entries. If ! ! a a b b A = 11 12 , and B = 11 12 a21 a22 b21 b22 are two matrices, define ! a b + a b a b + a b A ◦ B = 11 11 12 21 11 12 12 22 : a21b11 + a22b21 a21b12 + a22b22 Then (M2(R); ◦) is a magma.
    [Show full text]
  • Ring (Mathematics) 1 Ring (Mathematics)
    Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right.
    [Show full text]
  • Loop Near-Rings and Unique Decompositions of H-Spaces
    Algebraic & Geometric Topology 16 (2016) 3563–3580 msp Loop near-rings and unique decompositions of H-spaces DAMIR FRANETICˇ PETAR PAVEŠIC´ For every H-space X , the set of homotopy classes ŒX; X possesses a natural al- gebraic structure of a loop near-ring. Albeit one cannot say much about general loop near-rings, it turns out that those that arise from H-spaces are sufficiently close to rings to have a viable Krull–Schmidt type decomposition theory, which is then reflected into decomposition results of H-spaces. In the paper, we develop the algebraic theory of local loop near-rings and derive an algebraic characterization of indecomposable and strongly indecomposable H-spaces. As a consequence, we obtain unique decomposition theorems for products of H-spaces. In particular, we are able to treat certain infinite products of H-spaces, thanks to a recent breakthrough in the Krull–Schmidt theory for infinite products. Finally, we show that indecomposable finite p–local H-spaces are automatically strongly indecomposable, which leads to an easy alternative proof of classical unique decomposition theorems of Wilkerson and Gray. 55P45; 16Y30 Introduction In this paper, we discuss relations between unique decomposition theorems in alge- bra and homotopy theory. Unique decomposition theorems usually state that sum or product decompositions (depending on the category) whose factors are strongly indecomposable are essentially unique. The standard algebraic example is the Krull– Schmidt–Remak–Azumaya theorem. In its modern form, the theorem states that any decomposition of an R–module into a direct sum of indecomposable modules is unique, provided that the endomorphism rings of the summands are local rings; see Facchini [8, Theorem 2.12].
    [Show full text]