Introduction to Modern Algebra

Total Page:16

File Type:pdf, Size:1020Kb

Introduction to Modern Algebra Introduction to Modern Algebra David Joyce Clark University Version 1.2.7, 5 Dec 2017 1 1Copyright (C) 2008,2017. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write this book. I'm sorry that he did not live to see it finished. Arthur was born in 1954 in Taipei, Taiwan. He received his bachelors in mathematics in 1976 from Tunghai University and his PhD from Stony Brook in 1982. After a year at the Institute for Advanced Study at Princeton, he joined Clark University in 1983. He was promoted to Associate Professor six years later and promoted to full professor in 2008, the year he died. Besides mathematics, he had many other interests. Among other things, he was the general manager of the North America Elite Youth Orchestra which performed at Dallas, Beijing, and Taipei, and he was the deacon of the Chinese Gospel Church in Southborough, Massachusetts. Contents List of Figures vi List of Tables viii 1 Introduction1 1.1 Algebra.......................................1 1.2 Structures in Modern Algebra...........................2 1.2.1 Operations on sets.............................2 1.2.2 Fields....................................4 1.2.3 Rings....................................5 1.2.4 Groups....................................6 1.2.5 Other algebraic structures besides fields, rings, and groups....... 10 1.3 Isomorphisms, homomorphisms, etc......................... 11 1.3.1 Isomorphisms................................ 11 1.3.2 Homomorphisms.............................. 12 1.3.3 Monomorphisms and epimorphisms.................... 13 1.3.4 Endomorphisms and automorphisms................... 14 1.4 A little number theory............................... 15 1.4.1 Mathematical induction on the natural numbers N ........... 15 1.4.2 Divisibility.................................. 16 1.4.3 Prime numbers............................... 17 1.4.4 The Euclidean algorithm.......................... 19 1.5 The fundamental theorem of arithmetic...................... 22 1.6 Polynomials...................................... 25 1.6.1 Division for polynomials.......................... 26 1.6.2 Roots of unity and cyclotomic polynomials................ 28 2 Fields 31 2.1 Introduction to fields................................ 31 2.1.1 Definition of fields............................. 31 2.1.2 Subtraction, division, multiples, and powers............... 32 2.1.3 Properties that follow from the axioms.................. 33 2.1.4 Subfields................................... 34 2.1.5 Fields of rational functions......................... 35 2.1.6 Vector spaces over arbitrary fields..................... 35 2.2 Cyclic rings and finite fields............................ 35 iii iv CONTENTS 2.2.1 The cyclic ring Zn ............................. 36 2.2.2 The cyclic prime fields Zp ......................... 39 2.2.3 Characteristics of fields, and prime fields................. 41 2.3 Field Extensions, algebraic fields, the complex numbers............. 41 2.3.1 Algebraic fields............................... 42 2.3.2 The field of complex numbers C ...................... 43 2.3.3 General quadratic extensions........................ 44 2.4 Real numbers and ordered fields.......................... 45 2.4.1 Ordered fields................................ 45 2.4.2 Archimedean orders............................. 47 2.4.3 Complete ordered fields........................... 49 2.5 Skew fields (division rings) and the quaternions................. 50 2.5.1 Skew fields (division rings)......................... 50 2.5.2 The quaternions H ............................. 51 3 Rings 55 3.1 Introduction to rings................................ 55 3.1.1 Definition and properties of rings..................... 55 3.1.2 Products of rings.............................. 57 3.1.3 Integral domains.............................. 57 3.1.4 The Gaussian integers, Z[i]........................ 59 3.1.5 Finite fields again.............................. 59 3.2 Factoring Zn by the Chinese remainder theorem................. 60 3.2.1 The Chinese remainder theorem...................... 60 3.2.2 Brahmagupta's solution.......................... 62 3.2.3 Qin Jiushao's solution........................... 62 3.3 Boolean rings.................................... 63 3.3.1 Introduction to Boolean rings....................... 64 3.3.2 Factoring Boolean rings.......................... 65 3.3.3 A partial order on a Boolean ring..................... 66 3.4 The field of rational numbers, fields of fractions................. 67 3.5 Categories and the category of rings........................ 69 3.5.1 The formal definition of categories..................... 70 3.5.2 The category R of rings.......................... 71 3.5.3 Monomorphisms and epimorphisms in a category............ 73 3.6 Kernels, ideals, and quotient rings......................... 74 3.6.1 Kernels of ring homomorphisms...................... 74 3.6.2 Ideals of a ring............................... 74 3.6.3 Quotient rings, R=I ............................. 76 3.6.4 Prime and maximal ideals......................... 78 3.7 Krull's theorem................................... 79 3.8 UFDs, PIDs, and EDs............................... 80 3.8.1 Divisibility in an integral domain..................... 80 3.8.2 Unique factorization domains....................... 81 3.8.3 Principal ideal domains........................... 82 3.8.4 Euclidean domains............................. 84 CONTENTS v 3.9 Real and complex polynomial rings R[x] and C[x]................ 87 3.9.1 C[x] and the Fundamental Theorem of Algebra............. 87 3.9.2 The polynomial ring R[x]......................... 89 3.10 Rational and integer polynomial rings....................... 90 3.10.1 Roots of polynomials............................ 90 3.10.2 Gauss's lemma and Eisenstein's criterion................. 92 3.10.3 Prime cyclotomic polynomials....................... 95 3.10.4 Polynomial rings with coefficients in a UFD, and polynomial rings in several variables............................... 95 3.11 Number fields and their rings of integers..................... 97 4 Groups 99 4.1 Groups and subgroups............................... 99 4.1.1 Definition and basic properties of groups................. 99 4.1.2 Subgroups.................................. 100 4.1.3 Cyclic groups and subgroups........................ 101 4.1.4 Products of groups............................. 102 4.1.5 Cosets and Lagrange's theorem...................... 103 4.2 Symmetric Groups Sn ............................... 104 4.2.1 Permutations and the symmetric group.................. 104 4.2.2 Even and odd permutations........................ 106 4.2.3 Alternating and dihedral groups...................... 107 4.3 Cayley's theorem and Cayley graphs....................... 110 4.3.1 Cayley's theorem.............................. 110 4.3.2 Some small finite groups.......................... 112 4.4 The category of groups G .............................. 115 4.5 Conjugacy classes and quandles.......................... 115 4.5.1 Conjugacy classes.............................. 116 4.5.2 Quandles and the operation of conjugation................ 117 4.6 Kernels, normal subgroups, and quotient groups................. 120 4.6.1 Kernels of group homomorphisms and normal subgroups........ 120 4.6.2 Quotient groups, and projections γ : G ! G=N ............. 121 4.6.3 Isomorphism theorems........................... 122 4.6.4 Internal direct products.......................... 123 4.7 Matrix rings and linear groups........................... 124 4.7.1 Linear transformations........................... 124 4.7.2 The general linear groups GLn(R)..................... 125 4.7.3 Other linear groups............................. 126 4.7.4 Projective space and the projective linear group P GLn(F )....... 127 4.8 Structure of finite groups.............................. 130 4.8.1 Simple groups................................ 131 4.8.2 The Jordan-H¨oldertheorem........................ 131 4.9 Abelian groups................................... 134 4.9.1 The category A of Abelian groups..................... 136 4.9.2 Finite Abelian groups............................ 137 vi CONTENTS Appendices 141 A Background mathematics 143 A.1 Logic and proofs.................................. 143 A.2 Sets......................................... 144 A.2.1 Basic set theory............................... 144 A.2.2 Functions and relations........................... 149 A.2.3 Equivalence relations............................ 150 A.2.4 Axioms of set theory............................ 151 A.3 Ordered structures................................. 153 A.3.1 Partial orders and posets.......................... 153 A.3.2 Lattices................................... 155 A.3.3 Boolean algebras............................... 157 A.4 Axiom of choice................................... 158 A.4.1 Zorn's lemma................................ 158 A.4.2 Well-ordering principle........................... 159 Index 161 List of Figures 1.1 Equilateral triangle with lines of symmetry....................8 1.2 Unit circle S1 .................................... 10 1.3 Divisors of 432................................... 17 1.4 Divisibility up through 12............................. 17 2.1 Cyclic rings Z6; Z19; Z ............................... 37 3.1 Lattice of Gaussian integers Z[i].......................... 59 3.2 Free Boolean ring on two elements......................... 66 3.3 Lattice of Eisenstein integers............................ 85 3.4 Primitive 7th roots of unity............................
Recommended publications
  • On Regular Matrix Semirings
    Thai Journal of Mathematics Volume 7 (2009) Number 1 : 69{75 www.math.science.cmu.ac.th/thaijournal Online ISSN 1686-0209 On Regular Matrix Semirings S. Chaopraknoi, K. Savettaseranee and P. Lertwichitsilp Abstract : A ring R is called a (von Neumann) regular ring if for every x 2 R; x = xyx for some y 2 R. It is well-known that for any ring R and any positive integer n, the full matrix ring Mn(R) is regular if and only if R is a regular ring. This paper examines this property on any additively commutative semiring S with zero. The regularity of S is defined analogously. We show that for a positive integer n, if Mn(S) is a regular semiring, then S is a regular semiring but the converse need not be true for n = 2. And for n ≥ 3, Mn(S) is a regular semiring if and only if S is a regular ring. Keywords : Matrix ring; Matrix semiring; Regular ring; Regular semiring. 2000 Mathematics Subject Classification : 16Y60, 16S50. 1 Introduction A triple (S; +; ·) is called a semiring if (S; +) and (S; ·) are semigroups and · is distributive over +. An element 0 2 S is called a zero of the semiring (S; +; ·) if x + 0 = 0 + x = x and x · 0 = 0 · x = 0 for all x 2 S. Note that every semiring contains at most one zero. A semiring (S; +; ·) is called additively [multiplicatively] commutative if x + y = y + x [x · y = y · x] for all x; y 2 S: We say that (S; +; ·) is commutative if it is both additively and multiplicatively commutative.
    [Show full text]
  • 1 Jun 2020 Flat Semimodules & Von Neumann Regular Semirings
    Flat Semimodules & von Neumann Regular Semirings* Jawad Abuhlail† Rangga Ganzar Noegraha‡ [email protected] [email protected] Department of Mathematics and Statistics Universitas Pertamina King Fahd University of Petroleum & Minerals Jl. Teuku Nyak Arief 31261Dhahran,KSA Jakarta12220,Indonesia June 2, 2020 Abstract Flat modules play an important role in the study of the category of modules over rings and in the characterization of some classes of rings. We study the e-flatness for semimodules introduced by the first author using his new notion of exact sequences of semimodules and its relationships with other notions of flatness for semimodules over semirings. We also prove that a subtractive semiring over which every right (left) semimodule is e-flat is a von Neumann regular semiring. Introduction Semirings are, roughly, rings not necessarily with subtraction. They generalize both rings and distributive bounded lattices and have, along with their semimodules many applications in Com- arXiv:1907.07047v2 [math.RA] 1 Jun 2020 puter Science and Mathematics (e.g., [1, 2, 3]). Some applications can be found in Golan’s book [4], which is our main reference on this topic. A systematic study of semimodules over semirings was carried out by M. Takahashi in a series of papers 1981-1990. However, he defined two main notions in a way that turned out to be not natural. Takahashi’s tensor products [5] did not satisfy the expected Universal Property. On *MSC2010: Primary 16Y60; Secondary 16D40, 16E50, 16S50 Key Words: Semirings; Semimodules; Flat Semimodules; Exact Sequences; Von Neumann Regular Semirings; Matrix Semirings The authors would like to acknowledge the support provided by the Deanship of Scientific Research (DSR) at King Fahd University of Petroleum & Minerals (KFUPM) for funding this work through projects No.
    [Show full text]
  • Representation Theory and Quantum Mechanics Tutorial a Little Lie Theory
    Representation theory and quantum mechanics tutorial A little Lie theory Justin Campbell July 6, 2017 1 Groups 1.1 The colloquial usage of the words \symmetry" and \symmetrical" is imprecise: we say, for example, that a regular pentagon is symmetrical, but what does that mean? In the mathematical parlance, a symmetry (or more technically automorphism) of the pentagon is a (distance- and angle-preserving) transformation which leaves it unchanged. It has ten such symmetries: 2π 4π 6π 8π rotations through 0, 5 , 5 , 5 , and 5 radians, as well as reflection over any of the five lines passing through a vertex and the center of the pentagon. These ten symmetries form a set D5, called the dihedral group of order 10. Any two elements of D5 can be composed to obtain a third. This operation of composition has some important formal properties, summarized as follows. Definition 1.1.1. A group is a set G together with an operation G × G ! G; denoted by (x; y) 7! xy, satisfying: (i) there exists e 2 G, called the identity, such that ex = xe = g for all x 2 G, (ii) any x 2 G has an inverse x−1 2 G satisfying xx−1 = x−1x = e, (iii) for any x; y; z 2 G the associativity law (xy)z = x(yz) holds. To any mathematical (geometric, algebraic, etc.) object one can attach its automorphism group consisting of structure-preserving invertible maps from the object to itself. For example, the automorphism group of a regular pentagon is the dihedral group D5.
    [Show full text]
  • Algebraic Properties of the Richard Thompson's Group F
    ALGEBRAIC PROPERTIES OF THE RICHARD THOMPSON’S GROUP F AND ITS APPLICATIONS IN CRYPTOGRAPHY A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF MIDDLE EAST TECHNICAL UNIVERSITY BY HAKAN YETER IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN MATHEMATICS FEBRUARY 2021 Approval of the thesis: ALGEBRAIC PROPERTIES OF THE RICHARD THOMPSON’S GROUP F AND ITS APPLICATIONS IN CRYPTOGRAPHY submitted by HAKAN YETER in partial fulfillment of the requirements for the de- gree of Master of Science in Mathematics Department, Middle East Technical University by, Prof. Dr. Halil Kalıpçılar Dean, Graduate School of Natural and Applied Sciences Prof. Dr. Yıldıray Ozan Head of Department, Mathematics Assoc. Prof. Dr. Mustafa Gökhan Benli Supervisor, Mathematics Department, METU Examining Committee Members: Assoc. Prof. Dr. Fatih Sulak Mathematics Department, Atilim University Assoc. Prof. Dr. Mustafa Gökhan Benli Mathematics Department, METU Assist. Prof. Dr. Burak Kaya Mathematics Department, METU Date: I hereby declare that all information in this document has been obtained and presented in accordance with academic rules and ethical conduct. I also declare that, as required by these rules and conduct, I have fully cited and referenced all material and results that are not original to this work. Name, Surname: Hakan Yeter Signature : iv ABSTRACT ALGEBRAIC PROPERTIES OF THE RICHARD THOMPSON’S GROUP F AND ITS APPLICATIONS IN CRYPTOGRAPHY Yeter, Hakan M.S., Department of Mathematics Supervisor: Assoc. Prof. Dr. Mustafa Gökhan Benli February 2021, 69 pages Thompson’s groups F; T and V , especially F , are widely studied groups in group theory.
    [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]
  • LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
    LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students.
    [Show full text]
  • Homotopy Theory and Circle Actions on Symplectic Manifolds
    HOMOTOPY AND GEOMETRY BANACH CENTER PUBLICATIONS, VOLUME 45 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1998 HOMOTOPY THEORY AND CIRCLE ACTIONS ON SYMPLECTIC MANIFOLDS JOHNOPREA Department of Mathematics, Cleveland State University Cleveland, Ohio 44115, U.S.A. E-mail: [email protected] Introduction. Traditionally, soft techniques of algebraic topology have found much use in the world of hard geometry. In recent years, in particular, the subject of symplectic topology (see [McS]) has arisen from important and interesting connections between sym- plectic geometry and algebraic topology. In this paper, we will consider one application of homotopical methods to symplectic geometry. Namely, we shall discuss some aspects of the homotopy theory of circle actions on symplectic manifolds. Because this paper is meant to be accessible to both geometers and topologists, we shall try to review relevant ideas in homotopy theory and symplectic geometry as we go along. We also present some new results (e.g. see Theorem 2.12 and x5) which extend the methods reviewed earlier. This paper then serves two roles: as an exposition and survey of the homotopical ap- proach to symplectic circle actions and as a first step to extending the approach beyond the symplectic world. 1. Review of symplectic geometry. A manifold M 2n is symplectic if it possesses a nondegenerate 2-form ! which is closed (i.e. d! = 0). The nondegeneracy condition is equivalent to saying that !n is a true volume form (i.e. nonzero at each point) on M. Furthermore, the nondegeneracy of ! sets up an isomorphism between 1-forms and vector fields on M by assigning to a vector field X the 1-form iX ! = !(X; −).
    [Show full text]
  • Single Elements
    Beitr¨agezur Algebra und Geometrie Contributions to Algebra and Geometry Volume 47 (2006), No. 1, 275-288. Single Elements B. J. Gardner Gordon Mason Department of Mathematics, University of Tasmania Hobart, Tasmania, Australia Department of Mathematics & Statistics, University of New Brunswick Fredericton, N.B., Canada Abstract. In this paper we consider single elements in rings and near- rings. If R is a (near)ring, x ∈ R is called single if axb = 0 ⇒ ax = 0 or xb = 0. In seeking rings in which each element is single, we are led to consider 0-simple rings, a class which lies between division rings and simple rings. MSC 2000: 16U99 (primary), 16Y30 (secondary) Introduction If R is a (not necessarily unital) ring, an element s is called single if whenever asb = 0 then as = 0 or sb = 0. The definition was first given by J. Erdos [2] who used it to obtain results in the representation theory of normed algebras. More recently the idea has been applied by Longstaff and Panaia to certain matrix algebras (see [9] and its bibliography) and they suggest it might be worthy of further study in other contexts. In seeking rings in which every element is single we are led to consider 0-simple rings, a class which lies between division rings and simple rings. In the final section we examine the situation in nearrings and obtain information about minimal N-subgroups of some centralizer nearrings. 1. Single elements in rings We begin with a slightly more general definition. If I is a one-sided ideal in a ring R an element x ∈ R will be called I-single if axb ∈ I ⇒ ax ∈ I or xb ∈ I.
    [Show full text]
  • Formal Power Series - Wikipedia, the Free Encyclopedia
    Formal power series - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Formal_power_series Formal power series From Wikipedia, the free encyclopedia In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics, they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions. Contents 1 Introduction 2 The ring of formal power series 2.1 Definition of the formal power series ring 2.1.1 Ring structure 2.1.2 Topological structure 2.1.3 Alternative topologies 2.2 Universal property 3 Operations on formal power series 3.1 Multiplying series 3.2 Power series raised to powers 3.3 Inverting series 3.4 Dividing series 3.5 Extracting coefficients 3.6 Composition of series 3.6.1 Example 3.7 Composition inverse 3.8 Formal differentiation of series 4 Properties 4.1 Algebraic properties of the formal power series ring 4.2 Topological properties of the formal power series
    [Show full text]
  • 7. Euclidean Domains Let R Be an Integral Domain. We Want to Find Natural Conditions on R Such That R Is a PID. Looking at the C
    7. Euclidean Domains Let R be an integral domain. We want to find natural conditions on R such that R is a PID. Looking at the case of the integers, it is clear that the key property is the division algorithm. Definition 7.1. Let R be an integral domain. We say that R is Eu- clidean, if there is a function d: R − f0g −! N [ f0g; which satisfies, for every pair of non-zero elements a and b of R, (1) d(a) ≤ d(ab): (2) There are elements q and r of R such that b = aq + r; where either r = 0 or d(r) < d(a). Example 7.2. The ring Z is a Euclidean domain. The function d is the absolute value. Definition 7.3. Let R be a ring and let f 2 R[x] be a polynomial with coefficients in R. The degree of f is the largest n such that the coefficient of xn is non-zero. Lemma 7.4. Let R be an integral domain and let f and g be two elements of R[x]. Then the degree of fg is the sum of the degrees of f and g. In particular R[x] is an integral domain. Proof. Suppose that f has degree m and g has degree n. If a is the leading coefficient of f and b is the leading coefficient of g then f = axm + ::: and f = bxn + :::; where ::: indicate lower degree terms then fg = (ab)xm+n + :::: As R is an integral domain, ab 6= 0, so that the degree of fg is m + n.
    [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]
  • The Role of the Interval Domain in Modern Exact Real Airthmetic
    The Role of the Interval Domain in Modern Exact Real Airthmetic Andrej Bauer Iztok Kavkler Faculty of Mathematics and Physics University of Ljubljana, Slovenia Domains VIII & Computability over Continuous Data Types Novosibirsk, September 2007 Teaching theoreticians a lesson Recently I have been told by an anonymous referee that “Theoreticians do not like to be taught lessons.” and by a friend that “You should stop competing with programmers.” In defiance of this advice, I shall talk about the lessons I learned, as a theoretician, in programming exact real arithmetic. The spectrum of real number computation slow fast Formally verified, Cauchy sequences iRRAM extracted from streams of signed digits RealLib proofs floating point Moebius transformtions continued fractions Mathematica "theoretical" "practical" I Common features: I Reals are represented by successive approximations. I Approximations may be computed to any desired accuracy. I State of the art, as far as speed is concerned: I iRRAM by Norbert Muller,¨ I RealLib by Branimir Lambov. What makes iRRAM and ReaLib fast? I Reals are represented by sequences of dyadic intervals (endpoints are rationals of the form m/2k). I The approximating sequences need not be nested chains of intervals. I No guarantee on speed of converge, but arbitrarily fast convergence is possible. I Previous approximations are not stored and not reused when the next approximation is computed. I Each next approximation roughly doubles the amount of work done. The theory behind iRRAM and RealLib I Theoretical models used to design iRRAM and RealLib: I Type Two Effectivity I a version of Real RAM machines I Type I representations I The authors explicitly reject domain theory as a suitable computational model.
    [Show full text]