DOCSLIB.ORG

Non–Commutative Computer Algebra for Polynomial Algebras: Gröbner

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Non–Commutative Computer Algebra for Polynomial Algebras: Gröbner Non–commutative Computer Algebra for polynomial algebras: Gr¨obnerbases, applications and implementation Viktor Levandovskyy Vom Fachbereich Mathematik der Universit¨atKaiserslautern zur Verleihung des akademischen Grades Doktor der Naturwissenschaften (Doctor rerum naturalium, Dr. rer. nat) genehmigte Dissertation 1. Gutachter: Prof. Dr. G.-M. Greuel 2. Gutachter: Prof. Dr. Yu. Drozd Vollzug der Promotion: 08.06.2005 D 386 iii Viktor Levandovskyy. ”Non-commutative Computer Algebra for polynomial algebras: Gr¨obnerbases, applications and implementation”. Abstract. Non-commutative polynomial algebras appear in a wide range of applications, from quantum groups and theoretical physics to linear differential and difference equations. In the thesis, we have developed a framework, unifying many impor- tant algebras in the classes of G– and GR–algebras and studied their ring– theoretic properties. Let A be a G–algebra in n variables. We establish necessary and sufficient conditions for A to have a Poincar´e–Birkhoff–Witt (PBW) basis. Further on, we show that besides the existence of a PBW ba- sis, A shares some other properties with the commutative polynomial ring K[x1, . , xn]. In particular, A is a Noetherian integral domain of Gel’fand– Kirillov dimension n. Both Krull and global homological dimension of A are bounded by n; we provide examples of G–algebras where these inequalities are strict. Finally, we prove that A is Auslander–regular and a Cohen– Macaulay algebra. In order to perform symbolic computations with modules over GR– algebras, we generalize Gr¨obnerbases theory, develop and respectively en- hance new and existing algorithms. We unite the most fundamental algo- rithms in a suite of applications, called ”Gr¨obnerbasics” in the literature. Furthermore, we discuss algorithms appearing in the non-commutative case only, among others two–sided Gr¨obnerbases for bimodules, annihilators of left modules and operations with opposite algebras. An important role in Representation Theory is played by various sub- algebras, like the center and the Gel’fand–Zetlin subalgebra. We discuss their properties and their relations to Gr¨obnerbases, and briefly comment some aspects of their computation. We proceed with these subalgebras in the chapter devoted to the algorithmic study of morphisms between GR– algebras. We provide new results and algorithms for computing the preim- age of a left ideal under a morphism of GR–algebras and show both merits and limitations of several methods that we propose. We use this technique for the computation of the kernel of a morphism, decomposition of a mod- ule into central characters and algebraic dependence of pairwise commuting elements. We give an algorithm for computing the set of one–dimensional representations of a G–algebra A, and prove, moreover, that if the set of finite dimensional representations of A over a ground field K is not empty, then the homological dimension of A equals n. iv All the algorithms are implemented in a kernel extension Plural of the computer algebra system Singular. We discuss the efficiency of com- putations and provide a comparison with other computer algebra systems. We propose a collection of benchmarks for testing the performance of al- gorithms; the comparison of timings shows that our implementation out- performs all of the modern systems with the combination of both broad functionality and fast implementation. In the thesis, there are many new non-trivial examples, and also the solutions to various problems, arising in different fields of mathematics. All of them were obtained with the developed theory and the implementation in Plural, most of them are treated computationally in this thesis for the first time. Viktor Levandovskyy. ”Nichtkommutative Computeralgebra f¨ur Polynomalgebren: Gr¨obnerbasen, Anwendungen und Implementierung”. Zusammenfassung. Nichtkommutative Polynomalgebren entstehen in vielen verschiedenen Anwendungen, von Quantengruppen und Theoretis- cher Physik bis zu linearen Differentiellen und Differenzengleichungen. In der Arbeit wurde ein Rahmen entwickelt, in dem viele wichtige Alge- bren der Klassen G– und GR–Algebren zusammengef¨uhrtund ihre ringth- eoretischen Eigenschaften untersucht wurden. Sei A eine G–Algebra mit n Variablen. Es werden notwendige und hinreichende Bedingungen daf¨ur angegeben, daß A eine Poincar´e–Birkhoff–Witt(PBW) Basis besitzt. Es wird gezeigt, dass A neben der Existenz einer PBW Basis, weitere Eigen- schaften mit dem kommutativen Polynomring K[x1, . , xn] gemeinsam hat. A ist ein Noetherscher Integrit¨atsbereich der Gel’fand–Kirillov–Dimension n. Die Krull– und die globale homologische Dimension von A sind durch n beschr¨ankt; es werden Beispiele von G–Algebren gegeben, bei denen diese Ungleichheiten strikt sind. Schließlich wurde bewiesen, dass A eine Auslander–regul¨areund eine Cohen–Macaulay Algebra ist. F¨ursymbolische Berechnungen mit Moduln ¨uber GR–Algebren, wurde die Gr¨obnerbasentheorie verallgemeinert, neue und bestehende Algorith- men werden entwickelt und verbessert. Wir verbinden die grundlegendsten Algorithmen mit einer Reihe von Anwendungen, welche man in der Lit- eratur als ”Gr¨obnerbasics” bezeichnet. Weiterhin wurden Algorithmen v diskutiert, die nur im nichtkommutativen Fall existieren, darunter zwei- seitige Gr¨obnerbasenf¨urBimoduln, Annihilatoren von Linksmoduln und Operationen mit entgegengesetzten Algebren. Eine wichtige Rolle in der Darstellungstheorie spielen die verschiedenen Unteralgebren, wie z.B. das Zentrum und die Gel’fand–Zetlin Unteralgebra. Die Eigenschaften und ihre Beziehungen zu Gr¨obnerbasenwurden untersucht und einige Aspekte ihrer Berechnung diskutiert. Im Kapitel ¨uber algorithmische Studien von Morphismen zwischen GR–Algebren wurde die Untersuchung zu diesen Un- teralgebren fortgesetzt. Es wurden neue Ergebnisse and Algorithmen zur Berechnung des Urbilds eines Linksideals unter einem Morphismus von GR– Algebren erzielt. Die Ergebnisse und Begrenzungen verschiedener Meth- oden, die vorgeschlagen wurden, wurden gezeigt. Diese Technik wurde auch f¨urdie Berechnung des Kerns eines Morphismus, die Zerlegung eines Moduls in zentrale Charaktere und die algebraische Abh¨angigkeit von paar- weise kommutierenden Elementen verwendet. Es wurde ein Algorithmus f¨urdie Berechnung von eindimensionalen Darstellungen einer G–Algebra A erstellt. Es wurde bewiesen, dass die homologische Dimension von A ¨uber einem K¨orper K gleich der Anzahl der Variablen von A ist, falls es endlich–dimensionale Darstellungen von A existieren. Alle Algorithmen wurden in eine Kern-Erweiterung Plural des Com- puteralgebrasystem Singular implementiert. Die Effizienz der Berechnun- gen wurde diskutiert und ein Vergleich mit anderen Computeralgebrasys- temen erstellt. Es wurde eine Reihe von Benchmarks zum Test der Leis- tung von Algorithmen vorgeschlagen. Der Zeitvergleich zeigt, dass unsere Implementierung alle modernen Systeme hinsichtlich der Kombination von Funktionalit¨atund Geschwindigkeit ¨ubertrifft. In der Arbeit gibt es eine Vielzahl von nichttrivialen Beispielen und L¨osungenzu verschiedenen Problemen aus verschiedensten Bereichen der Mathematik. All wurden mit Hilfe der entwickelten Theorie und der Im- plementation in Plural erzielt, die meisten von ihnen wurden in dieser Arbeit zum ersten Mal berechnet. Contents Introduction ix Chapter 1. From NDC Towards G–algebras 1 1. Gr¨obnerBases on Free Associative Algebras 2 2. Non–degeneracy Conditions and PBW Theorem 6 3. Introduction to G–algebras 11 4. Filtrations and Properties of G–algebras. 18 5. Opposite algebras 24 6. The Ubiquity of GR–algebras 27 7. Applications of Non–degeneracy Conditions 28 8. Conclusion and Future Work 43 Chapter 2. Gr¨obnerbases in G–algebras 45 1. Left Gr¨obnerBases 45 2. Gr¨obnerbasics I 54 3. Two–sided Gr¨obnerBases and GR–algebras 61 4. Syzygies and Free Resolutions 67 5. Gr¨obnerbasics II 78 6. Conclusion and Future Work 92 Chapter 3. Morphisms of GR–algebras 95 1. Subalgebras and Morphisms 95 2. Morphisms from Commutative Algebras to GR–algebras 102 3. Central Character Decomposition of the Module 111 4. Morphisms between GR–algebras 116 5. Conclusion and Future Work 129 Chapter 4. Implementation in the system Singular:Plural 131 1. Singular and Plural: history and development 131 2. Aspects of Implementation 137 3. Timings, Performance and Experience 141 4. Download ans Support 144 5. Conclusion and Future Work 145 Chapter 5. Small Atlas of Important Algebras 147 1. Universal Enveloping Algebras of Lie Algebras 147 vii viii CONTENTS 2. Quantum Algebras 149 Chapter 6. Singular:Plural User Manual 151 1. Getting Started with Plural 151 2. Data Types (plural) 152 3. Functions (plural) 170 4. Mathematical Background (plural) 195 5. Plural Libraries 201 Appendix A. Noncommutative Algebra: Examples 240 A.1. Left and two-sided Groebner bases 240 A.2. Right Groebner bases and syzygies 242 Conclusion and Future Work 245 Bibliography 247 Introduction This thesis is devoted to symbolic computations in non–commutative algebras with PBW bases (G–algebras). These algebras already have their own history as well as symbolic methods, algorithms and implementations. Yet it is still a long way towards the acceptance and wide usage of these methods by the community of scientists, comparable to the years which were gone before the Buchberger’s algorithm for computing a Gr¨obnerbasis of an ideal in a commutative ring become accepted by everybody. G–algebras appear in many fields of science, from Non–commutative Algebra, Ring Theory and Representation Theory
Load more

Recommended publications
  • Commuting Ordinary Differential Operators and the Dixmier Test
    Symmetry, Integrability and Geometry: Methods and Applications SIGMA 15 (2019), 101, 23 pages Commuting Ordinary Differential Operators and the Dixmier Test Emma PREVIATO y, Sonia L. RUEDA z and Maria-Angeles ZURRO x y Boston University, USA E-mail: [email protected] z Universidad Polit´ecnica de Madrid, Spain E-mail: [email protected] x Universidad Aut´onomade Madrid, Spain E-mail: [email protected] Received February 04, 2019, in final form December 23, 2019; Published online December 30, 2019 https://doi.org/10.3842/SIGMA.2019.101 Abstract. The Burchnall{Chaundy problem is classical in differential algebra, seeking to describe all commutative subalgebras of a ring of ordinary differential operators whose coefficients are functions in a given class. It received less attention when posed in the (first) Weyl algebra, namely for polynomial coefficients, while the classification of commutative subalgebras of the Weyl algebra is in itself an important open problem. Centralizers are maximal-commutative subalgebras, and we review the properties of a basis of the centralizer of an operator L in normal form, following the approach of K.R. Goodearl, with the ultimate goal of obtaining such bases by computational routines. Our first step is to establish the Dixmier test, based on a lemma by J. Dixmier and the choice of a suitable filtration, to give necessary conditions for an operator M to be in the centralizer of L. Whenever the centralizer equals the algebra generated by L and M, we call L, M a Burchnall{Chaundy (BC) pair. A construction of BC pairs is presented for operators of order 4 in the first Weyl algebra.
    [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]
  • 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]
  • Dynamic Algebras: Examples, Constructions, Applications
    Dynamic Algebras: Examples, Constructions, Applications Vaughan Pratt∗ Dept. of Computer Science, Stanford, CA 94305 Abstract Dynamic algebras combine the classes of Boolean (B ∨ 0 0) and regu- lar (R ∪ ; ∗) algebras into a single finitely axiomatized variety (BR 3) resembling an R-module with “scalar” multiplication 3. The basic result is that ∗ is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residu- ally finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper originally appeared as Technical Memo #138, Laboratory for Computer Science, MIT, July 1979, and was subsequently revised, shortened, retitled, and published as [Pra80b]. After more than a decade of armtwisting I. N´emeti and H. Andr´eka finally persuaded the author to publish TM#138 itself on the ground that it contained a substantial body of interesting material that for the sake of brevity had been deleted from the STOC-80 version. The principal changes here to TM#138 are the addition of footnotes and the sections at the end on retrospective citations and reflections. ∗This research was supported by the National Science Foundation under NSF grant no.
    [Show full text]
  • Arxiv:1705.02958V2 [Math-Ph]
    LMU-ASC 30/17 HOCHSCHILD COHOMOLOGY OF THE WEYL ALGEBRA AND VASILIEV’S EQUATIONS ALEXEY A. SHARAPOV AND EVGENY D. SKVORTSOV Abstract. We propose a simple injective resolution for the Hochschild com- plex of the Weyl algebra. By making use of this resolution, we derive ex- plicit expressions for nontrivial cocycles of the Weyl algebra with coefficients in twisted bimodules as well as for the smash products of the Weyl algebra and a finite group of linear symplectic transformations. A relationship with the higher-spin field theory is briefly discussed. 1. Introduction The polynomial Weyl algebra An is defined to be an associative, unital algebra over C on 2n generators yj subject to the relations yj yk − ykyj =2iπjk. Here π = (πjk) is a nondegenerate, anti-symmetric matrix over C. Bringing the ⊗n matrix π into the canonical form, one can see that An ≃ A1 . The Hochschild (co)homology of the Weyl algebra is usually computed employing a Koszul-type resolution, see e.g. [1], [2], [3]. More precisely, the Koszul complex of the Weyl algebra is defined as a finite subcomplex of the normalized bar-resolution, so that the restriction map induces an isomorphism in (co)homology [3]. This makes it relatively easy to calculate the dimensions of the cohomology spaces for various coefficients. Finding explicit expressions for nontrivial cocycles appears to be a much more difficult problem. For example, it had long been known that • ∗ 2n ∗ HH (An, A ) ≃ HH (An, A ) ≃ C . arXiv:1705.02958v2 [math-ph] 6 Sep 2017 n n (The only nonzero group is dual to the homology group HH2n(An, An) generated by 1 2 2n the cycle 1⊗y ∧y ∧···∧y .) An explicit formula for a nontrivial 2n-cocycle τ2n, however, remained unknown, until it was obtained in 2005 paper by Feigin, Felder and Shoikhet [4] as a consequence of the Tsygan formality for chains [5], [6].
    [Show full text]
  • SEMIFIELDS from SKEW POLYNOMIAL RINGS 1. INTRODUCTION a Semifield Is a Division Algebra, Where Multiplication Is Not Necessarily
    SEMIFIELDS FROM SKEW POLYNOMIAL RINGS MICHEL LAVRAUW AND JOHN SHEEKEY Abstract. Skew polynomial rings were used to construct finite semifields by Petit in [20], following from a construction of Ore and Jacobson of associative division algebras. Johnson and Jha [10] later constructed the so-called cyclic semifields, obtained using irreducible semilinear transformations. In this work we show that these two constructions in fact lead to isotopic semifields, show how the skew polynomial construction can be used to calculate the nuclei more easily, and provide an upper bound for the number of isotopism classes, improving the bounds obtained by Kantor and Liebler in [13] and implicitly by Dempwolff in [2]. 1. INTRODUCTION A semifield is a division algebra, where multiplication is not necessarily associative. Finite nonassociative semifields of order q are known to exist for each prime power q = pn > 8, p prime, with n > 2. The study of semifields was initiated by Dickson in [4] and by now many constructions of semifields are known. We refer to the next section for more details. In 1933, Ore [19] introduced the concept of skew-polynomial rings R = K[t; σ], where K is a field, t an indeterminate, and σ an automorphism of K. These rings are associative, non-commutative, and are left- and right-Euclidean. Ore ([18], see also Jacobson [6]) noted that multiplication in R, modulo right division by an irreducible f contained in the centre of R, yields associative algebras without zero divisors. These algebras were called cyclic algebras. We show that the requirement of obtaining an associative algebra can be dropped, and this construction leads to nonassociative division algebras, i.e.
    [Show full text]
  • Algebra + Homotopy = Operad
    Symplectic, Poisson and Noncommutative Geometry MSRI Publications Volume 62, 2014 Algebra + homotopy = operad BRUNO VALLETTE “If I could only understand the beautiful consequences following from the concise proposition d 2 0.” —Henri Cartan D This survey provides an elementary introduction to operads and to their ap- plications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher homotopies. We try to show how universal this theory is by giving many applications in algebra, geometry, topology, and mathematical physics. (This text is accessible to any student knowing what tensor products, chain complexes, and categories are.) Introduction 229 1. When algebra meets homotopy 230 2. Operads 239 3. Operadic syzygies 253 4. Homotopy transfer theorem 272 Conclusion 283 Acknowledgements 284 References 284 Introduction Galois explained to us that operations acting on the solutions of algebraic equa- tions are mathematical objects as well. The notion of an operad was created in order to have a well defined mathematical object which encodes “operations”. Its name is a portemanteau word, coming from the contraction of the words “operations” and “monad”, because an operad can be defined as a monad encoding operations. The introduction of this notion was prompted in the 60’s, by the necessity of working with higher operations made up of higher homotopies appearing in algebraic topology. Algebra is the study of algebraic structures with respect to isomorphisms. Given two isomorphic vector spaces and one algebra structure on one of them, 229 230 BRUNO VALLETTE one can always define, by means of transfer, an algebra structure on the other space such that these two algebra structures become isomorphic.
    [Show full text]
  • On Minimally Free Algebras
    Can. J. Math., Vol. XXXVII, No. 5, 1985, pp. 963-978 ON MINIMALLY FREE ALGEBRAS PAUL BANKSTON AND RICHARD SCHUTT 1. Introduction. For us an "algebra" is a finitary "universal algebra" in the sense of G. Birkhoff [9]. We are concerned in this paper with algebras whose endomorphisms are determined by small subsets. For example, an algebra A is rigid (in the strong sense) if the only endomorphism on A is the identity id^. In this case, the empty set determines the endomorphism set E(A). We place the property of rigidity at the bottom rung of a cardinal-indexed ladder of properties as follows. Given a cardinal number K, an algebra .4 is minimally free over a set of cardinality K (K-free for short) if there is a subset X Q A of cardinality K such that every function f\X —-> A extends to a unique endomorphism <p e E(A). (It is clear that A is rigid if and only if A is 0-free.) Members of X will be called counters; and we will be interested in how badly counters can fail to generate the algebra. The property "«-free" is a solipsistic version of "free on K generators" in the sense that A has this property if and only if A is free over a set of cardinality K relative to the concrete category whose sole object is A and whose morphisms are the endomorphisms of A (thus explaining the use of the adverb "minimally" above). In view of this we see that the free algebras on K generators relative to any variety give us examples of "small" K-free algebras.
    [Show full text]
  • 5. Polynomial Rings Let R Be a Commutative Ring. a Polynomial of Degree N in an Indeterminate (Or Variable) X with Coefficients
    5. polynomial rings Let R be a commutative ring. A polynomial of degree n in an indeterminate (or variable) x with coefficients in R is an expression of the form f = f(x)=a + a x + + a xn, 0 1 ··· n where a0, ,an R and an =0.Wesaythata0, ,an are the coefficients of f and n ··· ∈ ̸ ··· that anx is the highest degree term of f. A polynomial is determined by its coeffiecients. m i n i Two polynomials f = i=0 aix and g = i=1 bix are equal if m = n and ai = bi for i =0, 1, ,n. ! ! Degree··· of a polynomial is a non-negative integer. The polynomials of degree zero are just the elements of R, these are called constant polynomials, or simply constants. Let R[x] denote the set of all polynomials in the variable x with coefficients in R. The addition and 2 multiplication of polynomials are defined in the usual manner: If f(x)=a0 + a1x + a2x + a x3 + and g(x)=b + b x + b x2 + b x3 + are two elements of R[x], then their sum is 3 ··· 0 1 2 3 ··· f(x)+g(x)=(a + b )+(a + b )x +(a + b )x2 +(a + b )x3 + 0 0 1 1 2 2 3 3 ··· and their product is defined by f(x) g(x)=a b +(a b + a b )x +(a b + a b + a b )x2 +(a b + a b + a b + a b )x3 + · 0 0 0 1 1 0 0 2 1 1 2 0 0 3 1 2 2 1 3 0 ··· Let 1 denote the constant polynomial 1 and 0 denote the constant polynomial zero.
    [Show full text]
  • Notes on Ring Theory
    Notes on Ring Theory by Avinash Sathaye, Professor of Mathematics February 1, 2007 Contents 1 1 Ring axioms and definitions. Definition: Ring We define a ring to be a non empty set R together with two binary operations f,g : R × R ⇒ R such that: 1. R is an abelian group under the operation f. 2. The operation g is associative, i.e. g(g(x, y),z)=g(x, g(y,z)) for all x, y, z ∈ R. 3. The operation g is distributive over f. This means: g(f(x, y),z)=f(g(x, z),g(y,z)) and g(x, f(y,z)) = f(g(x, y),g(x, z)) for all x, y, z ∈ R. Further we define the following natural concepts. 1. Definition: Commutative ring. If the operation g is also commu- tative, then we say that R is a commutative ring. 2. Definition: Ring with identity. If the operation g has a two sided identity then we call it the identity of the ring. If it exists, the ring is said to have an identity. 3. The zero ring. A trivial example of a ring consists of a single element x with both operations trivial. Such a ring leads to pathologies in many of the concepts discussed below and it is prudent to assume that our ring is not such a singleton ring. It is called the “zero ring”, since the unique element is denoted by 0 as per convention below. Warning: We shall always assume that our ring under discussion is not a zero ring.
    [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]
  • The Weyl Algebras
    THE WEYL ALGEBRAS David Cock Supervisor: Dr. Daniel Chan School of Mathematics, The University of New South Wales. November 2004 Submitted in partial fulfillment of the requirements of the degree of Bachelor of Science with Honours Contents Chapter 1 Introduction 1 Chapter 2 Basic Results 3 Chapter 3 Gradings and Filtrations 16 Chapter 4 Gelfand-Kirillov Dimension 21 Chapter 5 Automorphisms of A1 29 References 53 i Chapter 1 Introduction An important result in single-variable calculus is the so-called product rule. That is, for two polynomials (or more generally, functions) f(x), g(x): R → R: δ δ δ (fg) = ( f)g + f( g) δx δx δx It turns out that this formula, which is firmly rooted in calculus has very inter- esting algebraic properties. If k[x] denotes the ring of polynomials in one variable over a characteristic 0 field k, differentiation (in the variable x) can be considered as a map δ : k[x] → k[x]. It is relatively straighforward to verify that the map δ is in fact a k-linear vector space endomorphism of k[x]. Similarly, we can define another k-linear endomorphism X by left multiplication by x ie. X(f) = xf. Consider the expression (δ · X)f(x). Expanding this gives: (δ · X)f(x) = δ(xf(x)) applying the product rule gives (δ · X)f(x) = δ(x)f(x) + xδf(x) = f(x) + (X · δ)f(x) 1 noting the common factor of f(x) gives us the relation (this time in the ring of k-linear endomorphisms of k[x]): δ · X = X · δ + 1 where 1 is the identity map.
    [Show full text]