DOCSLIB.ORG

CDM Semirings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CDM Semirings CDM 1 Semirings and Rings Semirings Klaus Sutner Polynomials: Applications Carnegie Mellon University 30-semi-rings 2017/12/15 23:16 Polynomials: Definition Roots Semirings 3 Example Some standard examples of semirings are the following. The ring of integers Z, +, , 0, 1 is a semiring under the standard operations of addition and A semiring is a structure X, , , 0, 1 that satisfies the following conditions: h ∗ i h ⊕ ⊗ i multiplication. More generally any ring is a semiring; the additive monoid here is a group. 1 X, , 0 and X, , 1 are monoids, the former is commutative. h ⊕ i h ⊗ i 2 Operation distributes over on the left and right: Example ⊗ ⊕ x (y z) = (x y) (x z) and (y z) x = (y x) (z x). The Boolean semiring B = 0, 1 , , , 0, 1 where the operations are logical ⊗ ⊕ ⊗ ⊕ ⊗ ⊕ ⊗ ⊗ ⊕ ⊗ h { } ∨ ∧ i ’or’ and ’and’. 3 0 is a null (or annihilator) with respect to : x 0 = 0 x = 0. ⊗ ⊗ ⊗ Example (The Relation Semiring) A semiring is commutative if x y = y x and idempotent if x x = x. The semiring of all binary relations over a set A has set union as the ⊗ ⊗ ⊕ R additive operation, and relational composition as the multiplicative operation. 0 is the empty relation, and 1 is the identity relation. Example (The Language Semiring) Example (Matrix Semirings) ? The semiring (Σ) of all languages over Σ is the algebra P(Σ ), , , , ε . It L h ∪ · ∅ i is easy to check that all the equations for a semiring are satisfied by (Σ). Let S = S, , , 0, 1 be a semiring. The operations and naturally h ⊕ ⊗ i ⊕ n,n ⊗ L n Note that one can introduce a metric on (Σ) by setting dist(L, K) := 2− extend to n by n matrices over S. One can show that S , , , 0, 1 is L h ⊕ ⊗ i where n is minimal such that L Σn = K Σn for L = K and dist(L, L) = 0. again a semiring. Here 0 and 1 are the appropriate null and identity matrices ∩ 6 ∩ 6 It is not hard to see that (Σ) is a complete metric space with respect to this over S. L distance function. Matrix semirings will be of importance to us later. To describe the behavior of a finite state machine one can often use homomorphisms of the form Example (Tropical Semiring) h :Σ? Sn,n where Sn,n stands for the monoid of n n matrices over S → ? × The tropical semiring is defined by TS = N , min, +, , 0 . It is used with multiplication. Since Σ is free, any such homomorphism can be specified h ∪ {∞} ∞ i by a list of matrices h(a), a Σ. for example in Dijkstra’s algorithm for minimal cost paths. We will encounter it ∈ in chapter ?? in our discussion of the finite power property. Exercise Verify all the examples given above are indeed semirings. Exercise (Fusion Semiring) Exercise Show that all the following structures are semirings. Recall the partial operation of fusion on words. We have extended fusion to languages as usual (note that fusion on languages is a total operation). Show 1 R + , min, +, , 0 , that the structure (Γ∗), , , , Γ is a semiring, the fusion semiring over Γ. h ∪ { ∞} ∞ i h P ∪ • ∅ i 2 R , max, +, , 0 , h ∪ {−∞} −∞ i 3 x R 0 x 1 , max, , 0, 1 , { ∈ ≤ ≤ } ≥ 4 R 0 + , max, min, 0, . h ≥ ∪ { ∞} ∞ i Star Semirings and Closed Semirings 9 We can define the star operation in terms of an infinitary operation i 0 1 2 x∗ = x = x + x + x + ... i 0 X≥ Note that this approach does not quite fit into the equational framework used Consider again the semiring of all binary relations on a set A. The to describe the other algebras. Here is a more precise definition. Suppose S is R multiplicative operation here is composition of relations. As we have seen, an idempotent semiring with an additional infinitary operation i I ai which is ∈ there is important operation closely related to composition: transitive closure. defined for any family (ai i I) of elements in S where I is an arbitrary index | ∈ P How about adding a unary operation ∗ to the semiring that denotes transitive set. S is a closed semiring iff this infinite summation operation behaves closure? properly with respect to finite sums, distributivity and reordering of the arguments. More precisely, we require This additional unary operation also occurs in other semirings. For example, in the semiring (Σ) of all languages over some alphabet, there is the Kleene star L operation, that is of central importance in language theory. As it turns out, the ai = a1 + ... + an, star operation will allow us to solve linear equations of the form x = a x + b. i [n] · X∈ ( ai)( bj ) = aibj , i I j J (i,j) I J X∈ X∈ X∈ × ai = ( ai), i I j J i I X∈ X∈ X∈ j We will denote semirings with a star operation by X, +, , ∗, 0, 1 . For a more h · i detailed description of closed semirings and star semirings see [?, ?]. where in the last equation I is the disjoint union of the sets Ij . The star operation in a closed semiring is then defined as above. We can then verify Exercise equations such as Show that the collection of all Boolean n by n matrices forms a closed semiring. Think about the case n = 1 first. (x + y)∗ = (x∗y)∗x∗, (xy)∗ = 1 + x(yx)∗y, Exercise It is easy to check that (Σ) is in fact a closed semiring, since plus here Verify the equations given above in (Σ). Solve the equation x = a x + b over L L · corresponds to set theoretic union and can naturally be expanded to infinitely ( a, b ). L { } many arguments. Note that in this case we also have the super idempotency property: ai = a if for all i I: ai = a. It follows that (x∗)∗ = x∗ and Exercise ∈ 1∗ = 1. P Show that in a closed semiring with super idempotency we have (x∗)∗ = x∗ and 1∗ = 1. Also show that these equations hold in any closed semiring satisfying (x + y)∗ = (x∗y)∗x∗ and (xy)∗ = 1 + x(yx)∗y. Rings 13 Rings 14 Definition A ring is an algebraic structure of the form A ring is a semiring where the additive monoid is an Abelian group. A field is a = R, +, , 0, 1 ring where in addition the multiplicative monoid is Abelian, and is essentially a R h · i group: X 0 , , 1 is a group. h − { } ⊗ i where 1 Note that one cannot give a reasonable definition of 0− , which is why 0 is R, +, 0 is a commutative group (additive group), h i excluded from the multiplicative group of a field. R, , 1 is a monoid (not necessarily commutative), Thus, in a field one has a good chance to solve polynomial equations such as h · i x2 5x + 3 = 0. Note, though, that we cannot hope to solve all such − multiplication distributes over addition: equations in all fields: over the real numbers, x2 + 1 = 0 has no solution (but is has a solution over C, the algebraic completion of the reals). x (y + z) = x y + x z · · · (y + z) x = y x + z x · · · Commutative Rings 15 Examples: Rings 16 Example (Integers) The integers Z, +, , 0, 1 with the usual addition and multiplication for a h ∗ i Note that we need two distributive laws since multiplication is not assumed to ring. be commutative. If multiplication is commutative the ring itself is called commutative. Example (Modular Numbers) One can relax the conditions a bit and deal with rings without a 1: for The integers modulo n, Zn, +, , 0, 1 with the usual addition and h ∗ i example, 2Z is a ring without 1. Instead of a multiplicative monoid one has a multiplication form a ring. If n is prime, this ring is actually a field. In semigroup. particular there is a two-element field consisting just of 0 and 1. Note that these fields are finite. For our purposes there is no need for this. Example (Standard Fields) The rationals Q, the reals R, the complex numbers C. Examples: Rings 17 Annihilators, Inverses and Units 18 Example (Univariate Polynomials) Definition A ring element a is an annihilator if for all x: xa = ax = a. Given a ring R we can construct a new ring by considering all polynomials with coefficients in R, written R[x] where x indicates the “unknown” or “variable”. An inverse u0 of a ring element u is any element such that uu0 = u0u = 1. For example, Z[x] is the ring of all polynomials with integer coefficients. A ring element u is called a unit if it has an inverse u0. Example (Matrix Rings) Proposition Another important way to construct rings is to consider square matrices with 0 is an annihilator in any ring. coefficients in a ground ring R. n,n For example, R denotes the ring of all n by n matrices with real coefficients. Proof. Note that a0 = a(0 + 0) = a0 + a0, done by cancellation in the Note that this ring is not commutative unless n = 1. additive group. 2 Inverses 19 Integral Domains 20 We are interested in rings that have lots of units. One obstruction to having a Note that an annihilator cannot be a unit. multiplicative inverse is described in the next definition. For suppose aa0 = 1. We have xa = a, so that x = 1, contradiction. Definition A ring element a = 0 is a zero divisor if there exist b, c = 0 such that The multiplicative 1 in a ring is uniquely determined: 1 = 1 10 = 10.
Load more

Recommended publications
  • Semiring Frameworks and Algorithms for Shortest-Distance Problems
    Journal of Automata, Languages and Combinatorics u (v) w, x–y c Otto-von-Guericke-Universit¨at Magdeburg Semiring Frameworks and Algorithms for Shortest-Distance Problems Mehryar Mohri AT&T Labs – Research 180 Park Avenue, Rm E135 Florham Park, NJ 07932 e-mail: [email protected] ABSTRACT We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently clas- sical shortest paths problems or to find the k-shortest distances in a directed graph. It can be used to solve single-source shortest-distance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity. Keywords: semirings, finite automata, shortest-paths algorithms, rational power series Classical shortest-paths problems in a weighted directed graph arise in various contexts. The problems divide into two related categories: single-source shortest- paths problems and all-pairs shortest-paths problems. The single-source shortest-path problem in a directed graph consists of determining the shortest path from a fixed source vertex s to all other vertices. The all-pairs shortest-distance problem is that of finding the shortest paths between all pairs of vertices of a graph.
    [Show full text]
  • Subset Semirings
    University of New Mexico UNM Digital Repository Faculty and Staff Publications Mathematics 2013 Subset Semirings Florentin Smarandache University of New Mexico, [email protected] W.B. Vasantha Kandasamy [email protected] Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebraic Geometry Commons, Analysis Commons, and the Other Mathematics Commons Recommended Citation W.B. Vasantha Kandasamy & F. Smarandache. Subset Semirings. Ohio: Educational Publishing, 2013. This Book is brought to you for free and open access by the Mathematics at UNM Digital Repository. It has been accepted for inclusion in Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. Subset Semirings W. B. Vasantha Kandasamy Florentin Smarandache Educational Publisher Inc. Ohio 2013 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA Toll Free: 1-866-880-5373 Copyright 2013 by Educational Publisher Inc. and the Authors Peer reviewers: Marius Coman, researcher, Bucharest, Romania. Dr. Arsham Borumand Saeid, University of Kerman, Iran. Said Broumi, University of Hassan II Mohammedia, Casablanca, Morocco. Dr. Stefan Vladutescu, University of Craiova, Romania. Many books can be downloaded from the following Digital Library of Science: http://www.gallup.unm.edu/eBooks-otherformats.htm ISBN-13: 978-1-59973-234-3 EAN: 9781599732343 Printed in the United States of America 2 CONTENTS Preface 5 Chapter One INTRODUCTION 7 Chapter Two SUBSET SEMIRINGS OF TYPE I 9 Chapter Three SUBSET SEMIRINGS OF TYPE II 107 Chapter Four NEW SUBSET SPECIAL TYPE OF TOPOLOGICAL SPACES 189 3 FURTHER READING 255 INDEX 258 ABOUT THE AUTHORS 260 4 PREFACE In this book authors study the new notion of the algebraic structure of the subset semirings using the subsets of rings or semirings.
    [Show full text]
  • Exercises and Solutions in Groups Rings and Fields
    EXERCISES AND SOLUTIONS IN GROUPS RINGS AND FIELDS Mahmut Kuzucuo˘glu Middle East Technical University [email protected] Ankara, TURKEY April 18, 2012 ii iii TABLE OF CONTENTS CHAPTERS 0. PREFACE . v 1. SETS, INTEGERS, FUNCTIONS . 1 2. GROUPS . 4 3. RINGS . .55 4. FIELDS . 77 5. INDEX . 100 iv v Preface These notes are prepared in 1991 when we gave the abstract al- gebra course. Our intention was to help the students by giving them some exercises and get them familiar with some solutions. Some of the solutions here are very short and in the form of a hint. I would like to thank B¨ulent B¨uy¨ukbozkırlı for his help during the preparation of these notes. I would like to thank also Prof. Ismail_ S¸. G¨ulo˘glufor checking some of the solutions. Of course the remaining errors belongs to me. If you find any errors, I should be grateful to hear from you. Finally I would like to thank Aynur Bora and G¨uldaneG¨um¨u¸sfor their typing the manuscript in LATEX. Mahmut Kuzucuo˘glu I would like to thank our graduate students Tu˘gbaAslan, B¨u¸sra C¸ınar, Fuat Erdem and Irfan_ Kadık¨oyl¨ufor reading the old version and pointing out some misprints. With their encouragement I have made the changes in the shape, namely I put the answers right after the questions. 20, December 2011 vi M. Kuzucuo˘glu 1. SETS, INTEGERS, FUNCTIONS 1.1. If A is a finite set having n elements, prove that A has exactly 2n distinct subsets.
    [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]
  • Arxiv:0704.2561V2 [Math.QA] 27 Apr 2007 Nttto O Xeln Okn Odtos H Eoda Second the Conditions
    DUAL FEYNMAN TRANSFORM FOR MODULAR OPERADS J. CHUANG AND A. LAZAREV Abstract. We introduce and study the notion of a dual Feynman transform of a modular operad. This generalizes and gives a conceptual explanation of Kontsevich’s dual construction producing graph cohomology classes from a contractible differential graded Frobenius alge- bra. The dual Feynman transform of a modular operad is indeed linear dual to the Feynman transform introduced by Getzler and Kapranov when evaluated on vacuum graphs. In marked contrast to the Feynman transform, the dual notion admits an extremely simple presentation via generators and relations; this leads to an explicit and easy description of its algebras. We discuss a further generalization of the dual Feynman transform whose algebras are not neces- sarily contractible. This naturally gives rise to a two-colored graph complex analogous to the Boardman-Vogt topological tree complex. Contents Introduction 1 Notation and conventions 2 1. Main construction 4 2. Twisted modular operads and their algebras 8 3. Algebras over the dual Feynman transform 12 4. Stable graph complexes 13 4.1. Commutative case 14 4.2. Associative case 15 5. Examples 17 6. Moduli spaces of metric graphs 19 6.1. Commutative case 19 6.2. Associative case 21 7. BV-resolution of a modular operad 22 7.1. Basic construction and description of algebras 22 7.2. Stable BV-graph complexes 23 References 26 Introduction arXiv:0704.2561v2 [math.QA] 27 Apr 2007 The relationship between operadic algebras and various moduli spaces goes back to Kontse- vich’s seminal papers [19] and [20] where graph homology was also introduced.
    [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]
  • The Structure Theory of Complete Local Rings
    The structure theory of complete local rings Introduction In the study of commutative Noetherian rings, localization at a prime followed by com- pletion at the resulting maximal ideal is a way of life. Many problems, even some that seem \global," can be attacked by first reducing to the local case and then to the complete case. Complete local rings turn out to have extremely good behavior in many respects. A key ingredient in this type of reduction is that when R is local, Rb is local and faithfully flat over R. We shall study the structure of complete local rings. A complete local ring that contains a field always contains a field that maps onto its residue class field: thus, if (R; m; K) contains a field, it contains a field K0 such that the composite map K0 ⊆ R R=m = K is an isomorphism. Then R = K0 ⊕K0 m, and we may identify K with K0. Such a field K0 is called a coefficient field for R. The choice of a coefficient field K0 is not unique in general, although in positive prime characteristic p it is unique if K is perfect, which is a bit surprising. The existence of a coefficient field is a rather hard theorem. Once it is known, one can show that every complete local ring that contains a field is a homomorphic image of a formal power series ring over a field. It is also a module-finite extension of a formal power series ring over a field. This situation is analogous to what is true for finitely generated algebras over a field, where one can make the same statements using polynomial rings instead of formal power series rings.
    [Show full text]
  • Chapter 1 Logic and Set Theory
    Chapter 1 Logic and Set Theory To criticize mathematics for its abstraction is to miss the point entirely. Abstraction is what makes mathematics work. If you concentrate too closely on too limited an application of a mathematical idea, you rob the mathematician of his most important tools: analogy, generality, and simplicity. – Ian Stewart Does God play dice? The mathematics of chaos In mathematics, a proof is a demonstration that, assuming certain axioms, some statement is necessarily true. That is, a proof is a logical argument, not an empir- ical one. One must demonstrate that a proposition is true in all cases before it is considered a theorem of mathematics. An unproven proposition for which there is some sort of empirical evidence is known as a conjecture. Mathematical logic is the framework upon which rigorous proofs are built. It is the study of the principles and criteria of valid inference and demonstrations. Logicians have analyzed set theory in great details, formulating a collection of axioms that affords a broad enough and strong enough foundation to mathematical reasoning. The standard form of axiomatic set theory is denoted ZFC and it consists of the Zermelo-Fraenkel (ZF) axioms combined with the axiom of choice (C). Each of the axioms included in this theory expresses a property of sets that is widely accepted by mathematicians. It is unfortunately true that careless use of set theory can lead to contradictions. Avoiding such contradictions was one of the original motivations for the axiomatization of set theory. 1 2 CHAPTER 1. LOGIC AND SET THEORY A rigorous analysis of set theory belongs to the foundations of mathematics and mathematical logic.
    [Show full text]
  • The Quotient Field of an Intersection of Integral Domains
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF ALGEBRA 70, 238-249 (1981) The Quotient Field of an Intersection of Integral Domains ROBERT GILMER* Department of Mathematics, Florida State University, Tallahassee, Florida 32306 AND WILLIAM HEINZER' Department of Mathematics, Purdue University, West Lafayette, Indiana 47907 Communicated by J. DieudonnP Received August 10, 1980 INTRODUCTION If K is a field and 9 = {DA} is a family of integral domains with quotient field K, then it is known that the family 9 may possess the following “bad” properties with respect to intersection: (1) There may exist a finite subset {Di}rzl of 9 such that nl= I Di does not have quotient field K; (2) for some D, in 9 and some subfield E of K, the quotient field of D, n E may not be E. In this paper we examine more closely conditions under which (1) or (2) occurs. In Section 1, we work in the following setting: we fix a subfield F of K and an integral domain J with quotient field F, and consider the family 9 of K-overrings’ of J with quotient field K. We then ask for conditions under which 9 is closed under intersection, or finite intersection, or under which D n E has quotient field E for each D in 9 and each subfield E of K * The first author received support from NSF Grant MCS 7903123 during the writing of this paper. ‘The second author received partial support from NSF Grant MCS 7800798 during the writing of this paper.
    [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]
  • SOME ALGEBRAIC DEFINITIONS and CONSTRUCTIONS Definition
    SOME ALGEBRAIC DEFINITIONS AND CONSTRUCTIONS Definition 1. A monoid is a set M with an element e and an associative multipli- cation M M M for which e is a two-sided identity element: em = m = me for all m M×. A−→group is a monoid in which each element m has an inverse element m−1, so∈ that mm−1 = e = m−1m. A homomorphism f : M N of monoids is a function f such that f(mn) = −→ f(m)f(n) and f(eM )= eN . A “homomorphism” of any kind of algebraic structure is a function that preserves all of the structure that goes into the definition. When M is commutative, mn = nm for all m,n M, we often write the product as +, the identity element as 0, and the inverse of∈m as m. As a convention, it is convenient to say that a commutative monoid is “Abelian”− when we choose to think of its product as “addition”, but to use the word “commutative” when we choose to think of its product as “multiplication”; in the latter case, we write the identity element as 1. Definition 2. The Grothendieck construction on an Abelian monoid is an Abelian group G(M) together with a homomorphism of Abelian monoids i : M G(M) such that, for any Abelian group A and homomorphism of Abelian monoids−→ f : M A, there exists a unique homomorphism of Abelian groups f˜ : G(M) A −→ −→ such that f˜ i = f. ◦ We construct G(M) explicitly by taking equivalence classes of ordered pairs (m,n) of elements of M, thought of as “m n”, under the equivalence relation generated by (m,n) (m′,n′) if m + n′ = −n + m′.
    [Show full text]
  • Algebraic Number Theory
    Algebraic Number Theory William B. Hart Warwick Mathematics Institute Abstract. We give a short introduction to algebraic number theory. Algebraic number theory is the study of extension fields Q(α1; α2; : : : ; αn) of the rational numbers, known as algebraic number fields (sometimes number fields for short), in which each of the adjoined complex numbers αi is algebraic, i.e. the root of a polynomial with rational coefficients. Throughout this set of notes we use the notation Z[α1; α2; : : : ; αn] to denote the ring generated by the values αi. It is the smallest ring containing the integers Z and each of the αi. It can be described as the ring of all polynomial expressions in the αi with integer coefficients, i.e. the ring of all expressions built up from elements of Z and the complex numbers αi by finitely many applications of the arithmetic operations of addition and multiplication. The notation Q(α1; α2; : : : ; αn) denotes the field of all quotients of elements of Z[α1; α2; : : : ; αn] with nonzero denominator, i.e. the field of rational functions in the αi, with rational coefficients. It is the smallest field containing the rational numbers Q and all of the αi. It can be thought of as the field of all expressions built up from elements of Z and the numbers αi by finitely many applications of the arithmetic operations of addition, multiplication and division (excepting of course, divide by zero). 1 Algebraic numbers and integers A number α 2 C is called algebraic if it is the root of a monic polynomial n n−1 n−2 f(x) = x + an−1x + an−2x + ::: + a1x + a0 = 0 with rational coefficients ai.
    [Show full text]