DOCSLIB.ORG

Math 412. Examples and Types of Rings and Their Homomorphisms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Math 412. Examples and Types of Rings and Their Homomorphisms (c)Karen E. Smith 2018 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Math 412. Examples and Types of Rings and their Homomorphisms DEFINITION:A domain is a commutative ring R in which 0R 6= 1R, and which has the property that whenever ab = 0 for a; b 2 R, then either a = 0 or b = 0. DEFINITION:A field is a commutative ring R in which 0R 6= 1R in which every non-zero element has a multiplicative inverse. DEFINITION:A subring1 S of a ring R is a subset of R satisfying the following (1) 1R 2 S; (2) S is closed under multiplication; (3) S is closed under addition and taking additive inverses. Equivalently, a subring S of a ring R as a subset which is a also a ring with the same +; ×; 0 and 1. “DEFINITION:” Fix a commutative ring R. The polynomial ring over R is the set n R[x] = fa0 + a1x + ··· + anx j ai 2 R; n 2 Ng; with operations + and × extended from those on the coefficients in R in the natural way. THEOREM 4.3: Fix a ring R. Then the polynomial R[x] is a domain if and only if R is a domain. THEOREM 4.5: For any domain R, the units in R[x] are the units in the subring R of constant polynomials. In particular, if F is a field, then the units in F[x] are the non-zero constant polynomials. A. WARM-UP: For each inclusion S ⊂ R, set whether or not S subring of R. (1) Z ⊂ Q; Z ⊂ R; R ⊂ C. (2) N ⊂ Z, (3) The set of even integers S = f2n j n 2 Zg ⊂ Z. f(x) (4) R[x] ⊂ R(x) := f g(x) jf(x); g(x) 2 R[x]; g 6= 0g (the set of rational functions). a 0 (5) The set of diagonal matrices D := f j a; b; 2 g ⊂ M ( ). 0 b R 2 R (6) The set of integer matrices M2(Z) ⊂ M2(R). a b (7) The set of determinant 1 matrices GL ( ) = f j ad − bc = 1; 2 g ⊂ M ( ). 2 R c d R 2 R (8) The set of constant polynomials R ⊂ R[x]. (9) The set of polynomials with integer coefficients Z[x] ⊂ R[x]. (10) Z ⊂ Z[i] (11) The imaginary integers Zi = fni j n 2 Zg ⊂ Z[i]. (1) All yes. (2) No, no additive inverses. (3) No. missing multiplicative identity. (4) Yes. (5) yes. (6) yes. (7) No, no zero. (8) Yes. (9) YEs. (10) Yes. (11) No, no 1. B. FIND AN EXAMPLE OF: 2 (1) A non-commutative ring, with a commutative subring. (2) An infinite ring with a finite subring. (3) A field which has a subring which is not a field. For (1) use (5) above. For (2), use Z2 ⊂ Z2[x]. For (3), use Z ⊂ Q. C. BASIC PROOFS. (1) Prove that every field is a domain. (2) Prove that a subring of a field is a domain. Is the converse true? (3) Let S be a subset of a ring R. Explain why S is a subring if and only if the inclusion map S,! R sending s 7! s is a ring homomorphism. For this, you don’t have to write a lot, but think carefully about the meaning of the symbols you are using in different contexts. (1) Let F be a field. Assume a; b 2 F satisfy ab = 0 but a 6= 0. Multiplication on the left by a−1 gives a−1(ab) = (a−1a)b = 1 · b = b = 0: QED. (2) It is clear that a subring of a domain is a domain: assume a; b 2 S ⊂ R, where R is a domain, and ab = 0 in S. This also holds in the bigger ring R, so a = 0R or b = 0R, since R is a a domain. Since 0R = 0S, it follows that S is a domain too. (3) Call the inclusion map φ. First, assume S ⊂ R is a subring. We need to prove φ is a ring homo- morphism. Since the 1 in R is the 1 of S, we know φ(1S) = 1R. Also since φ is the inclusion map, φ(s1 + s2) = s1 + s2 = φ(s1) + φ(s2): Ditto for muiltiplication. So φ is a ring homomorphism. Conversely, assume that φ : S,! R is a ring homomorphism. In particular S is a ring. Then 1S = φ(1S) = 1R, so S and R have the same identity. Also φ(s1 +S s2) = φ(s1) +R φ(s2) = s1 +R s2. This is in S, since it is in the image of s1 +S s2 under φ. So S is closed under the multiplication of R. Similarly, S is closed under the multiplication of R. Finally, for all s 2, we have s +R −s = 0S using the addition in S. Applying φ, we have φ(s +R −s) = φ(0S), which means that φ(s) +R Sφ(−s) = 0R. D. POLYNOMIAL RING PRACTICE. Answer the following questions, using Theorem 4.5 and 4.5 above where appropriate. (1) What is the zero and one in Z3[x]? Is Z3[x] commutative? Is it a domain? (2) Use a theorem to investigate if Z72[x] a domain? If not, find a pair of non-zero elements in Z72[x] whose product is zero. 2 3 3 (3) In Z8: for f = (1+3x) and g = (2x +4x ), compute and simplify f +4g and (3x) +g. Here, we abuse notation by representing congruence classes by any integer representative. (4) How many polynomials of degree less than 3 in the ring Z2[x]? (5) How many units in Z[x]? (6) Suppose that f 2 Q[x] has degree 5. Find the degrees of the following polynomials: f − x, f 2, f + 4x51; f − 2x5, (x2 + 1)f 3. 7 16 15 (7) Find the leading coefficient of h where h = 5x + 3x + 1 2 Z7[x]. 2 (8) Does x + 1 have a multiplicative inverse in Z2[x]? (9) Is there any field F such that F[x] is a field? (10) In Z8[x], compute (1 + 4x)(1 − 4x). Is the hypothesis that R is a domain necessary in Theorem 4.5? (1) The zero and one are the constant polynomials [0]3 and [1]3. Yes, F3[x] is commutative and a domain by Theorem 4.3. 3 2 (2) Theorem 4.3 implies Z72[x] is not a domain. Note: [8]72x · ([9]x ) = 0. 3 3 2 (3) In Z8: f + 4g = 1 + 3x and (3x) + g = 7x + 2x . (4) There are 7 polynomials of degree less than 3 in the ring Z2[x], if we go with the convention that the 0 polynomial has undefined degree. There are 8 if we go with the convention that the 0 polynomial has degree −∞. Only 1 is a unit. (5) There are two units in Z[x]; ±1, by Theorem 4.5. (6) deg(f − x) = 5, deg(f 2) = 10, deg(f + 4x51) = 51, deg(f − 2x5) is 5 if the leading coefficient of f is not 2, less otherwise. deg((x2 + 1)f 3) = 17. 16 15 7 7 (7) The leading coefficient of (5x + 3x + 1) 2 Z7[x] is 5 = 5. (8) Nope. Thm 4.5. (9) Nope. Thm 4.5 says x is never a unit. (10) In Z8[x], (1 + 4x)(1 − 4x) = 1. So the hypothesis that R is a domain necessary in Theorem 4.5. E. PROOF OF THEOREM 4.5 Let R be a domain. Consider R as the subring of constant polynomials in R[x]. (1) Show that any unit in R is a unit in R[x]. (2) Explain why, for any two polynomials f; g 2 R[x], deg(fg) = deg f + deg g. Is this true even when R is not a domain? (3) Prove that if f 2 R[x] is a unit, then f is a constant polynomial. (4) Prove Theorem 4.5 (5) Find a formula for the number of units in Zp[x] where p is prime. This is all in the book, in Section 4.1. For (1), just show directly that if u is a unit in R, with inverse v, then uv = 1 interpreted in R or in R[x]. For (2) see Theorem 4.2. It is false when R is not a domain: 2x · (3x + 1) = 2x in Z6[x]. For (3) and (4), read the proof of Theorem 4.5 in the book. For (5), the theorem × × says that (Zp[x]) = Zp . Since Zp is a field, all elements (except 0) are units, so there are p − 1. F. HOMOMORPHISMS. Let F be an arbitrary field. Fix any a 2 F. (1) Prove that the map F[x] ! F sending f(x) 7! f(a) is surjective homomorphism. Write the kernel in set-builder notation. (2) Find an injective homomorphism F ! M2(F). Also find an injective map F ! M2(F) which is not a ring homomorphism. (3) Is the map M2(F) ! F × F sending a matrix A to its first row a ring homomorphism? G. THE DIVISION ALGORITHM FOR POLYNOMIALS. In high school, you learned to divide polynomials to find a quotient and remainder. This works for polynomials over any field,. Let’s practice. (1) Let f = x3 + 4x2 + x + 1 in R[x]. Find q and r so that f = qx2 + r, where deg r < 2.
Load more

Recommended publications
  • 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 Field Γ-Semiring and Complemented Γ-Semiring with Identity
    BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 189-202 DOI: 10.7251/BIMVI1801189RA Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA LUKA ISSN 0354-5792 (o), ISSN 1986-521X (p) ON FIELD Γ-SEMIRING AND COMPLEMENTED Γ-SEMIRING WITH IDENTITY Marapureddy Murali Krishna Rao Abstract. In this paper we study the properties of structures of the semi- group (M; +) and the Γ−semigroup M of field Γ−semiring M, totally ordered Γ−semiring M and totally ordered field Γ−semiring M satisfying the identity a + aαb = a for all a; b 2 M; α 2 Γand we also introduce the notion of com- plemented Γ−semiring and totally ordered complemented Γ−semiring. We prove that, if semigroup (M; +) is positively ordered of totally ordered field Γ−semiring satisfying the identity a + aαb = a for all a; b 2 M; α 2 Γ, then Γ-semigroup M is positively ordered and study their properties. 1. Introduction In 1995, Murali Krishna Rao [5, 6, 7] introduced the notion of a Γ-semiring as a generalization of Γ-ring, ring, ternary semiring and semiring. The set of all negative integers Z− is not a semiring with respect to usual addition and multiplication but Z− forms a Γ-semiring where Γ = Z: Historically semirings first appear implicitly in Dedekind and later in Macaulay, Neither and Lorenzen in connection with the study of a ring. However semirings first appear explicitly in Vandiver, also in connection with the axiomatization of Arithmetic of natural numbers.
    [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]
  • Introduction to the P-Adic Space
    Introduction to the p-adic Space Joel P. Abraham October 25, 2017 1 Introduction From a young age, students learn fundamental operations with the real numbers: addition, subtraction, multiplication, division, etc. We intuitively understand that distance under the reals as the absolute value function, even though we never have had a fundamental introduction to set theory or number theory. As such, I found this topic to be extremely captivating, since it almost entirely reverses the intuitive notion of distance in the reals. Such a small modification to the definition of distance gives rise to a completely different set of numbers under which the typical axioms are false. Furthermore, this is particularly interesting since the p-adic system commonly appears in natural phenomena. Due to the versatility of this metric space, and its interesting uniqueness, I find the p-adic space a truly fascinating development in algebraic number theory, and thus chose to explore it further. 2 The p-adic Metric Space 2.1 p-adic Norm Definition 2.1. A metric space is a set with a distance function or metric, d(p, q) defined over the elements of the set and mapping them to a real number, satisfying: arXiv:1710.08835v1 [math.HO] 22 Oct 2017 (a) d(p, q) > 0 if p = q 6 (b) d(p,p)=0 (c) d(p, q)= d(q,p) (d) d(p, q) d(p, r)+ d(r, q) ≤ The real numbers clearly form a metric space with the absolute value function as the norm such that for p, q R ∈ d(p, q)= p q .
    [Show full text]
  • Discriminants and the Monoid of Quadratic Rings
    DISCRIMINANTS AND THE MONOID OF QUADRATIC RINGS JOHN VOIGHT Abstract. We consider the natural monoid structure on the set of quadratic rings over an arbitrary base scheme and characterize this monoid in terms of discriminants. Quadratic field extensions K of Q are characterized by their discriminants. Indeed, there is a bijection 8Separable quadratic9 < = ∼ × ×2 algebras over Q −! Q =Q : up to isomorphism ; p 2 ×2 Q[ d] = Q[x]=(x − d) 7! dQ wherep a separable quadratic algebra over Q is either a quadratic field extension or the algebra Q[ 1] ' Q × Q of discriminant 1. In particular, the set of isomorphism classes of separable quadratic extensions of Q can be given the structure of an elementary abelian 2-group, with identity element the class of Q × Q: we have simply p p p Q[ d1] ∗ Q[ d2] = Q[ d1d2] p × ×2 up to isomorphism. If d1; d2; dp1d2 2pQ n Q then Q( d1d2) sits as the third quadratic subfield of the compositum Q( d1; d2): p p Q( d1; d2) p p p Q( d1) Q( d1d2) Q( d2) Q p Indeed, ifpσ1 isp the nontrivial elementp of Gal(Q( d1)=Q), then therep is a unique extension of σ1 to Q( d1; d2) leaving Q( d2) fixed, similarly with σ2, and Q( d1d2) is the fixed field of the composition σ1σ2 = σ2σ1. This characterization of quadratic extensions works over any base field F with char F 6= 2 and is summarized concisely in the Kummer theory isomorphism H1(Gal(F =F ); {±1g) = Hom(Gal(F =F ); {±1g) ' F ×=F ×2: On the other hand, over a field F with char F = 2, all separable quadratic extensions have trivial discriminant and instead they are classified by the (additive) Artin-Schreier group F=}(F ) where }(F ) = fr + r2 : r 2 F g Date: January 17, 2021.
    [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]
  • Fields Besides the Real Numbers Math 130 Linear Algebra
    manner, which are both commutative and asso- ciative, both have identity elements (the additive identity denoted 0 and the multiplicative identity denoted 1), addition has inverse elements (the ad- ditive inverse of x denoted −x as usual), multipli- cation has inverses of nonzero elements (the multi- Fields besides the Real Numbers 1 −1 plicative inverse of x denoted x or x ), multipli- Math 130 Linear Algebra cation distributes over addition, and 0 6= 1. D Joyce, Fall 2015 Of course, one example of a field is the field of Most of the time in linear algebra, our vectors real numbers R. What are some others? will have coordinates that are real numbers, that is to say, our scalar field is R, the real numbers. Example 2 (The field of rational numbers, Q). Another example is the field of rational numbers. But linear algebra works over other fields, too, A rational number is the quotient of two integers like C, the complex numbers. In fact, when we a=b where the denominator is not 0. The set of discuss eigenvalues and eigenvectors, we'll need to all rational numbers is denoted Q. We're familiar do linear algebra over C. Some of the applications with the fact that the sum, difference, product, and of linear algebra such as solving linear differential quotient (when the denominator is not zero) of ra- equations require C as as well. tional numbers is another rational number, so Q Some applications in computer science use linear has all the operations it needs to be a field, and algebra over a two-element field Z (described be- 2 since it's part of the field of the real numbers R, its low).
    [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]
  • Arxiv:1709.01693V2 [Math.AC] 14 May 2018 Togypiaymnis Rl Ood,C-Monoids
    PUISEUX MONOIDS AND TRANSFER HOMOMORPHISMS FELIX GOTTI Abstract. There are several families of atomic monoids whose arithmetical invari- ants have received a great deal of attention during the last two decades. The factoriza- tion theory of finitely generated monoids, strongly primary monoids, Krull monoids, and C-monoids are among the most systematically studied. Puiseux monoids, which are additive submonoids of Q≥0 consisting of nonnegative rational numbers, have only been studied recently. In this paper, we provide evidence that this family com- prises plenty of monoids with a basically unexplored atomic structure. We do this by showing that the arithmetical invariants of the well-studied atomic monoids men- tioned earlier cannot be transferred to most Puiseux monoids via homomorphisms that preserve atomic configurations, i.e., transfer homomorphisms. Specifically, we show that transfer homomorphisms from a non-finitely generated atomic Puiseux monoid to a finitely generated monoid do not exist. We also find a large family of Puiseux monoids that fail to be strongly primary. In addition, we prove that the only nontrivial Puiseux monoid that accepts a transfer homomorphism to a Krull monoid is N0. Finally, we classify the Puiseux monoids that happen to be C-monoids. 1. Introduction The study of the phenomenon of non-unique factorizations in the ring of integers OK of an algebraic number field K was initiated by L. Carlitz in the 1950’s, and it was later carried out on more general integral domains. As a result, many techniques to measure the non-uniqueness of factorizations in several families of integral domains were sys- tematically developed during the second half of the last century (see [2] and references therein).
    [Show full text]
  • A Brief History of Ring Theory
    A Brief History of Ring Theory by Kristen Pollock Abstract Algebra II, Math 442 Loyola College, Spring 2005 A Brief History of Ring Theory Kristen Pollock 2 1. Introduction In order to fully define and examine an abstract ring, this essay will follow a procedure that is unlike a typical algebra textbook. That is, rather than initially offering just definitions, relevant examples will first be supplied so that the origins of a ring and its components can be better understood. Of course, this is the path that history has taken so what better way to proceed? First, it is important to understand that the abstract ring concept emerged from not one, but two theories: commutative ring theory and noncommutative ring the- ory. These two theories originated in different problems, were developed by different people and flourished in different directions. Still, these theories have much in com- mon and together form the foundation of today's ring theory. Specifically, modern commutative ring theory has its roots in problems of algebraic number theory and algebraic geometry. On the other hand, noncommutative ring theory originated from an attempt to expand the complex numbers to a variety of hypercomplex number systems. 2. Noncommutative Rings We will begin with noncommutative ring theory and its main originating ex- ample: the quaternions. According to Israel Kleiner's article \The Genesis of the Abstract Ring Concept," [2]. these numbers, created by Hamilton in 1843, are of the form a + bi + cj + dk (a; b; c; d 2 R) where addition is through its components 2 2 2 and multiplication is subject to the relations i =pj = k = ijk = −1.
    [Show full text]
  • Formal Power Series License: CC BY-NC-SA
    Formal Power Series License: CC BY-NC-SA Emma Franz April 28, 2015 1 Introduction The set S[[x]] of formal power series in x over a set S is the set of functions from the nonnegative integers to S. However, the way that we represent elements of S[[x]] will be as an infinite series, and operations in S[[x]] will be closely linked to the addition and multiplication of finite-degree polynomials. This paper will introduce a bit of the structure of sets of formal power series and then transfer over to a discussion of generating functions in combinatorics. The most familiar conceptualization of formal power series will come from taking coefficients of a power series from some sequence. Let fang = a0; a1; a2;::: be a sequence of numbers. Then 2 the formal power series associated with fang is the series A(s) = a0 + a1s + a2s + :::, where s is a formal variable. That is, we are not treating A as a function that can be evaluated for some s0. In general, A(s0) is not defined, but we will define A(0) to be a0. 2 Algebraic Structure Let R be a ring. We define R[[s]] to be the set of formal power series in s over R. Then R[[s]] is itself a ring, with the definitions of multiplication and addition following closely from how we define these operations for polynomials. 2 2 Let A(s) = a0 + a1s + a2s + ::: and B(s) = b0 + b1s + b1s + ::: be elements of R[[s]]. Then 2 the sum A(s) + B(s) is defined to be C(s) = c0 + c1s + c2s + :::, where ci = ai + bi for all i ≥ 0.
    [Show full text]