DOCSLIB.ORG

Selected Exercises from Abstract Algebra by Dummit and Foote (3Rd Edition)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Selected Exercises from Abstract Algebra by Dummit and Foote (3Rd Edition) Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan F´elix Abril 12, 2017 Section 7.1 Exercise 5. Decide which of the following are subrings of Q: (a) the set of all rational numbers with odd denominators (when written in lowest terms) Proof. Indeed, the set is a subring. First we show that it is a subgroup of Q by means of the subgroup criterion; i.e. a c Let b ; d be in the set. Then a c ad − bc − = b d bd is a rational number with odd denominator (since both b and d are odd). Furthermore a c ac · = b d bd is in the set by the same argument. Hence, the set is closed under multiplication, proving itself a subring. (b) the set of all rational numbers with even denominators (when written in lowest terms) 1 1 Proof. The set is not a subring as it ain't a group. Observe that 2 and 6 are in the set, but 1 1 1 − = 2 6 3 is not. (c) The set of nonnegative rational numbers Proof. Again, the set is not a subring since it is not a subgroup. Note that 1 and 3 are in the set, but 1 − 3 = −2 is not. (d) the set of squares of rational numbers 1 Proof. Again, the set is not a subring since it ain't a subgroup. Note that 4 is in the set, 1 1 1 1 but 4 + 4 = 2 is not since 2 is not the square of a rational number. (e) the set of all rational numbers with odd numerators (when written in lowest terms) 1 1 Proof. Again, the set is not a subring because it is not a group. Note that 3 is in the set, 1 1 2 but 3 + 3 = 3 is not. (f) the set of all rational numbers with even numerators (when written in lowest terms) 2 Proof. The set is a subring. Note that the set is not empty ( 3 is an element). We show that the set is a subgroup by means of the subgroup criterion. 2a 2c Let b and d be elements of the group. Note that both b and d are odd, otherwise the fraction is not written in lowest terms. Furthermore 2a 2c 2(ad − bc) − = b d bd is an element of the set, since the product bd is still odd and therefore, the factor 2 in 2a 2c the numerator survives. Then, the set is closed under multiplication, note that b · d = 2(2ac) bd : Exercise 12. Prove that any subring of a field which contains the identity is an integral domain. Proof. By construction, 1 is already in the set. Now we assume that the set is not an integral domain, and therefore, there exist two non-zero elements a and b, such that ab = 0. Since a and b are element of a field, they have multiplicative inverses and therefore the following holds a−1ab = a−10: Equivalently b = 0; a contradiction to the assumption that both a and b were non-zero elements. Exercise 14. Let x be a nilpotent element of a commutative ring R. (a) Prove that x is either zero or a zero divisor. Proof. Assume that xn = 0, where n is the least positive integer that satisfies the equation. Then x · xn−1 = 0, and therefore x is a zero divisor. (b) Prove that rx is nilpotent for all r 2 R. Proof. Let n be defined as in part (a). Then, since the ring is commutative, (rx)n = rnxn = 0 as desired. (c) Prove that 1 + x is a unit in R. Proof. Note that (1 + x)(1 − x + x2 − · · · ± xn−1) = (1 ± xn) = (1 + 0) = 1: Therefore 1 + x has a multiplicative inverse, and hence, it is a unit. (d) Deduce that the sum of a nilpotent element and a unit is a unit. Proof. Let a be a unit and x be a nilpotent element with xn = 0. Then, a+x = a(1+a−1x) where a−1x is nilpotent by part (b). Then, by part (c), (1 + a−1x) is a unit, and therefore a(1 + a−1x has a n inverse, namely, (1 + a−1x)−1a−1 . 2 Exercise 26. Let K be a field. A discrete valuation on K is a function v : K× ! Z satisfying (i) v(ab) = v(a) + v(b) (ii) v is surjective, and (iii) v(x + y) ≥ minfv(x); v(y)g for all x; y 2 K× with x + y 6= 0. The set R = fx 2 K×jv(x) ≥ 0g [ f0g is called the valuation ring of v: (a) Prove that R is a subring of K which contains the identity. Proof. Note that the homomorphism characterization of v guarantees that 1 is in R as v(1) = 0. Now we will show that R is a subgroup of the field by means of the subgroup criterion. Let a and b be elements of R. We want to prove that a − b is also an element of R. Assume that a − b 6= 0 (otherwise a − b is in R by construction) and observe that v(a−b) = v(a+(−b)) ≥ minfv(a); v(−b)g = minfv(a); v(−1·b)g = minfv(a); v(−1)+v(b)g: Note that 0 = v(1) = v(−1 · −1) = v(−1) + v(−1) = 2v(−1), therefore v(−1) = 0 and v(a − b) ≥ minfv(a); v(b)g ≥ 0 as both a and b are in R. It follows that a − b is in R and therefore R is an subgroup of the field. It is left to show that the group is closed under multiplication, to that end, note that for arbitrary a and b in R v(ab) = v(a) + v(b) ≥ 0 + 0 ≥ 0: We conclude that R is a subring that contains the multiplicative identity. (b) Prove that for each nonzero element x 2 K either x or x−1 is in R. Proof. Observe that v(x · x−1) = v(x) + v(x−1) = v(1) = 0 and assume that x is not in R. Then v(x) < 0 and the previous identity forces v(x) + v(x−1) = 0. It follows that v(x−1) = −v(x) > 0: Hence x−1 is in R: (c) Prove that an element x is a unit of R if and only if v(x) = 0: Proof. Assume x is a unit of R. Then, both v(x) ≥ 0 and v(x−1) ≥ 0. Furthermore v(x) + v(x−1) = v(xx−1) = v(1) = 0: The previous equation is satisfied only if v(x) = v(x−1) = 0. Now assume that v(x) = 0, then v(x−1) = −v(x) (by part (b)) and it follows that v(x−1) = 0: Therefore x−1 is in R and x is a unit in R. 3 Section 7.2 Exercise 5. Let F be a field and define the ring F ((x)) of formal Laurent series with coefficients from F by ( 1 ) X n F ((x)) = anx ; an 2 F and N 2 Z : n≥N (a) Prove that F ((x)) is a field. Proof. We prove the properties of a Field i. F ((x)) is an abelian group under addition. Note that 1 1 1 X n X n X n anx + bnx = (an + bn)x n≥N n≥M n≥minfN;Mg where we extend the series by using 0 coefficients if necessary. Likewise 1 1 1 X n X n X n bnx + anx = (bn + an)x : n≥M n≥N n≥minfN;Mg Since ai and bi are elements of a field, the previous resulting sums are equal. Associa- tivity and closure of + follows from the properties of polynomials. Lastly, the additive P n P n inverse of the element anx for n ≥ N is the sum (−an)x . ii. Multiplication distributes over addition and is commutative. Note that 1 1 1 ! 1 0 1 1 X n X n X n X n X n anx bnx + cnx = anx @ (bn + cn)x A n≥N n≥M n≥L n≥N n≥minfM;Lg To inspect the coefficients of the product we let di = (bi + ci) and K = minfM; Lg and we inspect the following multiplication table aN aN+1 aN+2 aN+3 ··· dK dK aN dK aN+1 dK aN+2 dK aN+3 ··· dK+1 dK+1aN dK+1aN+1 dK+1aN+2 dK+1aN+3 ··· dK+2 dK+2aN dK+2aN+1 dK+2aN+2 dK+2aN+3 ··· dK+3 dK+3aN dK+3aN+1 dK+3aN+2 dK+3aN+3 ··· . .. Note that the coefficient of the term xi are represented as diagonal sums of the entries of the table. Also, the order of multiplication is not important as all the entries come from a field. Furthermore, every coefficient is of the form aj · (bi + ci)ai and since the distributive property holds in F then every coefficient in our table can be rewritten as ajbi + ajci which proves the associative property. Commutativity follows in the same manner by rewriting diaj as ajdi. iii. There is a multiplicative identity. Our good ol' friend 1F (the unit in F ) satisfies. 4 iv. We have multiplicative inverses. We claim that the multiplicative inverse of 1 X n anx n≥N exist and is of the form 1 X n bnx : n≥−N This is clear from our multiplication table. The first term (in the upper left corner) is 0 the coefficient aN b−N of x .
Load more

Recommended publications
  • The Class Number One Problem for Imaginary Quadratic Fields
    MODULAR CURVES AND THE CLASS NUMBER ONE PROBLEM JEREMY BOOHER Gauss found 9 imaginary quadratic fields with class number one, and in the early 19th century conjectured he had found all of them. It turns out he was correct, but it took until the mid 20th century to prove this. Theorem 1. Let K be an imaginary quadratic field whose ring of integers has class number one. Then K is one of p p p p p p p p Q(i); Q( −2); Q( −3); Q( −7); Q( −11); Q( −19); Q( −43); Q( −67); Q( −163): There are several approaches. Heegner [9] gave a proof in 1952 using the theory of modular functions and complex multiplication. It was dismissed since there were gaps in Heegner's paper and the work of Weber [18] on which it was based. In 1967 Stark gave a correct proof [16], and then noticed that Heegner's proof was essentially correct and in fact equiv- alent to his own. Also in 1967, Baker gave a proof using lower bounds for linear forms in logarithms [1]. Later, Serre [14] gave a new approach based on modular curve, reducing the class number + one problem to finding special points on the modular curve Xns(n). For certain values of n, it is feasible to find all of these points. He remarks that when \N = 24 An elliptic curve is obtained. This is the level considered in effect by Heegner." Serre says nothing more, and later writers only repeat this comment. This essay will present Heegner's argument, as modernized in Cox [7], then explain Serre's strategy.
    [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]
  • 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]
  • MAXIMAL and NON-MAXIMAL ORDERS 1. Introduction Let K Be A
    MAXIMAL AND NON-MAXIMAL ORDERS LUKE WOLCOTT Abstract. In this paper we compare and contrast various prop- erties of maximal and non-maximal orders in the ring of integers of a number field. 1. Introduction Let K be a number field, and let OK be its ring of integers. An order in K is a subring R ⊆ OK such that OK /R is finite as a quotient of abelian groups. From this definition, it’s clear that there is a unique maximal order, namely OK . There are many properties that all orders in K share, but there are also differences. The main difference between a non-maximal order and the maximal order is that OK is integrally closed, but every non-maximal order is not. The result is that many of the nice properties of Dedekind domains do not hold in arbitrary orders. First we describe properties common to both maximal and non-maximal orders. In doing so, some useful results and constructions given in class for OK are generalized to arbitrary orders. Then we de- scribe a few important differences between maximal and non-maximal orders, and give proofs or counterexamples. Several proofs covered in lecture or the text will not be reproduced here. Throughout, all rings are commutative with unity. 2. Common Properties Proposition 2.1. The ring of integers OK of a number field K is a Noetherian ring, a finitely generated Z-algebra, and a free abelian group of rank n = [K : Q]. Proof: In class we showed that OK is a free abelian group of rank n = [K : Q], and is a ring.
    [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]
  • Kernel Methods for Knowledge Structures
    Kernel Methods for Knowledge Structures Zur Erlangung des akademischen Grades eines Doktors der Wirtschaftswissenschaften (Dr. rer. pol.) von der Fakultät für Wirtschaftswissenschaften der Universität Karlsruhe (TH) genehmigte DISSERTATION von Dipl.-Inform.-Wirt. Stephan Bloehdorn Tag der mündlichen Prüfung: 10. Juli 2008 Referent: Prof. Dr. Rudi Studer Koreferent: Prof. Dr. Dr. Lars Schmidt-Thieme 2008 Karlsruhe Abstract Kernel methods constitute a new and popular field of research in the area of machine learning. Kernel-based machine learning algorithms abandon the explicit represen- tation of data items in the vector space in which the sought-after patterns are to be detected. Instead, they implicitly mimic the geometry of the feature space by means of the kernel function, a similarity function which maintains a geometric interpreta- tion as the inner product of two vectors. Knowledge structures and ontologies allow to formally model domain knowledge which can constitute valuable complementary information for pattern discovery. For kernel-based machine learning algorithms, a good way to make such prior knowledge about the problem domain available to a machine learning technique is to incorporate it into the kernel function. This thesis studies the design of such kernel functions. First, this thesis provides a theoretical analysis of popular similarity functions for entities in taxonomic knowledge structures in terms of their suitability as kernel func- tions. It shows that, in a general setting, many taxonomic similarity functions can not be guaranteed to yield valid kernel functions and discusses the alternatives. Secondly, the thesis addresses the design of expressive kernel functions for text mining applications. A first group of kernel functions, Semantic Smoothing Kernels (SSKs) retain the Vector Space Models (VSMs) representation of textual data as vec- tors of term weights but employ linguistic background knowledge resources to bias the original inner product in such a way that cross-term similarities adequately con- tribute to the kernel result.
    [Show full text]
  • Nilpotent Elements Control the Structure of a Module
    Nilpotent elements control the structure of a module David Ssevviiri Department of Mathematics Makerere University, P.O BOX 7062, Kampala Uganda E-mail: [email protected], [email protected] Abstract A relationship between nilpotency and primeness in a module is investigated. Reduced modules are expressed as sums of prime modules. It is shown that presence of nilpotent module elements inhibits a module from possessing good structural properties. A general form is given of an example used in literature to distinguish: 1) completely prime modules from prime modules, 2) classical prime modules from classical completely prime modules, and 3) a module which satisfies the complete radical formula from one which is neither 2-primal nor satisfies the radical formula. Keywords: Semisimple module; Reduced module; Nil module; K¨othe conjecture; Com- pletely prime module; Prime module; and Reduced ring. MSC 2010 Mathematics Subject Classification: 16D70, 16D60, 16S90 1 Introduction Primeness and nilpotency are closely related and well studied notions for rings. We give instances that highlight this relationship. In a commutative ring, the set of all nilpotent elements coincides with the intersection of all its prime ideals - henceforth called the prime radical. A popular class of rings, called 2-primal rings (first defined in [8] and later studied in [23, 26, 27, 28] among others), is defined by requiring that in a not necessarily commutative ring, the set of all nilpotent elements coincides with the prime radical. In an arbitrary ring, Levitzki showed that the set of all strongly nilpotent elements coincides arXiv:1812.04320v1 [math.RA] 11 Dec 2018 with the intersection of all prime ideals, [29, Theorem 2.6].
    [Show full text]
  • Classifying the Representation Type of Infinitesimal Blocks of Category
    Classifying the Representation Type of Infinitesimal Blocks of Category OS by Kenyon J. Platt (Under the Direction of Brian D. Boe) Abstract Let g be a simple Lie algebra over the field C of complex numbers, with root system Φ relative to a fixed maximal toral subalgebra h. Let S be a subset of the simple roots ∆ of Φ, which determines a standard parabolic subalgebra of g. Fix an integral weight ∗ µ µ ∈ h , with singular set J ⊆ ∆. We determine when an infinitesimal block O(g,S,J) := OS of parabolic category OS is nonzero using the theory of nilpotent orbits. We extend work of Futorny-Nakano-Pollack, Br¨ustle-K¨onig-Mazorchuk, and Boe-Nakano toward classifying the representation type of the nonzero infinitesimal blocks of category OS by considering arbitrary sets S and J, and observe a strong connection between the theory of nilpotent orbits and the representation type of the infinitesimal blocks. We classify certain infinitesimal blocks of category OS including all the semisimple infinitesimal blocks in type An, and all of the infinitesimal blocks for F4 and G2. Index words: Category O; Representation type; Verma modules Classifying the Representation Type of Infinitesimal Blocks of Category OS by Kenyon J. Platt B.A., Utah State University, 1999 M.S., Utah State University, 2001 M.A, The University of Georgia, 2006 A Thesis Submitted to the Graduate Faculty of The University of Georgia in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Athens, Georgia 2008 c 2008 Kenyon J. Platt All Rights Reserved Classifying the Representation Type of Infinitesimal Blocks of Category OS by Kenyon J.
    [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]
  • Artinian Subrings of a Commutative Ring
    transactions of the american mathematical society Volume 336, Number 1, March 1993 ARTINIANSUBRINGS OF A COMMUTATIVERING ROBERT GILMER AND WILLIAM HEINZER Abstract. Given a commutative ring R, we investigate the structure of the set of Artinian subrings of R . We also consider the family of zero-dimensional subrings of R. Necessary and sufficient conditions are given in order that every zero-dimensional subring of a ring be Artinian. We also consider closure properties of the set of Artinian subrings of a ring with respect to intersection or finite intersection, and the condition that the set of Artinian subrings of a ring forms a directed family. 1. Introduction Suppose R is a commutative ring with unity element. We consider here various properties of the family sf of Artinian subrings of R and the family Z of zero-dimensional subrings of R . We remark that the inclusion s? ç Z may be proper, even if R is Noetherian; for example, Corollary 3.4 implies that if K is an infinite field of positive characteristic, then the local principal ideal ring K[X]/(X2) contains a zero-dimensional subring that is not Artinian. Of course, if every subring of R were Noetherian, the families sf and Z would be identical. Thus one source of motivation for this work comes from papers such as [Gi, Wi, W2, GHi, GH3] that deal with Noetherian and zero- dimensional pairs of rings, hereditarily Noetherian rings, and hereditarily zero- dimensional rings. Another source of motivation is related to our work in [GH3], where we considered several problems concerning a direct product of zero-dimensional rings.
    [Show full text]
  • Maximal Orders of Quaternions
    Maximal Orders of Quaternions Alyson Deines Quaternion Algebras Maximal Orders of Quaternions Maximal Orders Norms, Traces, and Alyson Deines Integrality Local Fields and Hilbert Symbols December 8th Math 581b Final Project Uses A non-commutative analogue of Rings of Integers of Number Field Abstract Maximal Orders of Quaternions Alyson Deines Abstract Quaternion I will define maximal orders of quaternion algebras, give Algebras Maximal examples, discuss how they are similar to and differ from rings Orders of integers, and then I will discuss one of their applications . Norms, Traces, and Integrality Local Fields and Hilbert Symbols Uses Quaternion Algebras over Number Fields Maximal Orders of Definition Quaternions Alyson Deines Let F be a field and a; b 2 F . A quaternion algebra over F is an F -algebra B = a;b Quaternion F Algebras with basis Maximal 2 2 Orders i = a; j = b; and ij = −ji: Norms, Traces, and Integrality Examples: Local Fields −1;−1 and Hilbert = Symbols H R p Uses −1;−1 F = Q( 5), B = F 1;b ∼ Let F be any number field, F = M2(F ) via 1 0 0 b i 7! and j 7! 0 −1 1 0 Maximal Orders Maximal Orders of Quaternions Lattices Alyson Deines Let F be a number field with ring of integers R and let V Quaternion be a finite dimensional F -vector space. Algebras An R-lattice of V is a finitely generated R-submodule Maximal Orders O ⊂ V such that OF = V . Norms, Traces, and Integrality Orders Local Fields and Hilbert Let F be a number field with ring of integers R and let B Symbols be a finite dimensional F -algebra.
    [Show full text]