DOCSLIB.ORG

ABSTRACT ALGEBRA with APPLICATIONS Irwin Kra, State

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ABSTRACT ALGEBRA with APPLICATIONS Irwin Kra, State ABSTRACT ALGEBRA WITH APPLICATIONS Irwin Kra, State University of New York at Stony Brook and University of California at Berkeley Contents Introduction 7 Standard Notation and Commonly Used Symbols 9 Chapter 1. The integers 11 1. Introduction 11 2. Induction 12 3. The division algorithm: gcd and lcm 19 4. Primes 29 5. The rationals, algebraic numbers and other beasts 34 5.1. The rationals, Q 34 5.2. The reals, R 35 5.3. The complex numbers, C 36 5.4. The algebraic numbers 36 5.5. The quaternions, H 36 6. Modular arithmetic 37 7. Solutions of linear congruences 44 8. Euler 50 9. Public key cryptography 55 10. A collection of beautiful results 57 Chapter 2. Foundations 59 1. Naive set theory 59 2. Functions 60 3. Relations 64 4. Order relations on Z and Q 67 4.1. Orders on Z 67 4.2. Orders on Q 68 5. The complex numbers 68 Chapter 3. Groups 71 1. Permutation groups 71 2. The order and sign of a permutation 77 3. Definitions and more examples of groups 83 Chapter 4. Group homomorphisms and isomorphisms. 95 1. Elementary group theory 95 2. Lagrange's theorem 98 3. Homomorphisms 100 4. Groups of small order 101 3 4 CONTENTS 4.1. G = 1 103 4.2. jGj = 2, 3, 5, 7 and, in fact, all primes 103 4.3. jGj = 4 103 4.4. jGj = 6 103 4.5. jGj = 8 104 5. Homomorphismsj j and quotients 106 6. Isomorphisms 110 6.1. Every group is a subgroup of a permutation group 110 6.2. Solvable groups 111 6.3. MORE sections to be included 111 Chapter 5. Algebraic structures 113 1. A collection of algebraic structures 113 2. The algebra of polynomials 118 2.1. The vector space of polynomials of degree n 120 2.2. The Euclidean algorithm (for polynomials) 120 2.3. Differentiation 124 3. Ideals 125 3.1. Ideals in commutative rings 125 3.2. Ideals in Z and C[x] 127 4. CRT revisited 128 5. Polynomials over more general fields 129 6. Fields of quotients and rings of rational functions 130 Chapter 6. Error correcting codes 131 1. ISBN 131 2. Groups and codes 131 Chapter 7. Roots of polynomials 143 1. Roots of polynomials 143 1.1. Derivatives and multiple roots 147 2. Circulant matrices 147 3. Roots of polynomials of small degree 152 3.1. Roots of linear and quadratic polynomials 153 3.2. The general case 154 3.3. Roots of cubics 155 3.4. Roots of quartics 156 3.5. Real roots and roots of absolute value 1 158 3.6. What goes wrong for polynomials of higher degree? 159 Chapter 8. Moduli for polynomials 161 1. Polynomials in three guises 161 2. An example from high school math: the quadratic polynomial 162 3. An equivalence relation 162 4. An example all high school math teachers should know: the cubic polynomial 164 5. Arbitrary real or complex polynomials 164 6. Back to the cubic polynomial 165 7. Standard forms for cubics 168 CONTENTS 5 8. Solving the cubic 170 9. Solving the quartic 171 10. Concluding remarks 172 11. A moduli (parameter) count 172 Chapter 9. Nonsolvability by radicals 175 1. Algebraic extensions of fields 175 2. Field embeddings 177 3. Splitting fields 178 4. Galois extensions 179 5. Quadratic, cubic and quartic extensions 179 5.1. Linear extensions 179 5.2. Quadratic extensions 179 5.3. Cubic extensions 179 5.4. Quartic extensions 180 6. Nonsolvability 180 Bibliography 183 Index 185 Introduction This book is closest in spirit to [7]. Except for Chapters 7 and 91, where the reader will need some results from linear algebra (which are reviewed), this book requires no formal mathematics prerequisites. Readers should, however, posses sufficient mathematical sophis- tication to appreciate a logical argument and what constitutes a proof. More than enough information on these topics can be found in [10]. The reader should be aware of the following features of the book that may not be stan- dard. I have cut the book down to a bare minimum. If a reader is interested in a given • chapter or it is part of a mathematics course, then every word in it should be read and understood. When requested all the details should be filled in and all exercises and problems done (their content may be needed in subsequent parts of the "main" text). At times I use a "familiar" concept before if is formally defined as in Example 1.3. • I use italics for terms defined, either formally in definitions or informally during a • proof or discussion. Most nontrivial calculations and nontrivial management of sets as well as certain • algebraic manipulations are performed using the symbolic manipulation programs MAPLE or MATHEMATICA. MAPLE and MATHEMATICA worksheets are included both in the text and on an • accompanying disc { this latter format will permit easy program modifications by the reader for further exploration and experimentation. This is not a text book on MAPLE nor on MATHEMATICA. See [3] for such a treatise. Rather, these pro- grams are used as tools to learn and do mathematics. I have tried to use only very simple MAPLE and MATHEMATICA programs and routines and to use, when- ever possible, commands that are similar to ordinary mathematical expressions and formulae. I have tried to keep a reasonable mixture between formal proofs and informality • (claims that certain statements are "obvious"). This book is an introduction to abstract algebra. I have particularly tried to pay attention to the needs of future high school mathematics teachers. With this in mind I have chosen applications such as public key cryptography and error correcting codes which use basic algebra as well as a study of polynomials and their roots which is such a big part of pre- college mathematics. Portions of the the material in this book were used as a basis for courses tought at Stony Brook and at Berkeley. The students challenged me with good questions and suggestions. I 1The tone and level of mathematical sophistication of these two chapters is considerably different in these two chapters from those in the others. Much more background is expected from the reader interested in these sections. 7 8 INTRODUCTION am very grateful to the students who read the material, corrected errors, and pointed out ways for improving the exposition. Errors, of course, remain and are the responsibility of the author. Standard Notation and Commonly Used Symbols A LIST OF SYMBOLS TERM MEANING Z integers Zn congruence classes of integers modulo n Zn∗ the units (invertible elements) in Zn Q rationals R reals C complex numbers a the absolute value of the number a j j gcd(a1; a2; :::; an) = (a1; a2; :::; an) the greatest common divisor of the integers a1, a2, ..., an lcm(a1; a2; :::; an) the least common multiple of the integers a1, a2, ..., an [a]n the congruence class modulo n containing the integer a { a square root of 1 z real part of the complex−number z <z imaginary part of the complex number z z ==x + {y x = z and y = z z¯ conjugate of<the complex=number z r = z absolute value of the complex number z θ = argj jz an argument of the complex number z z = reıθ r = z and θ = arg z R cardinalitj j y of set R j j Xcondition the set of x X that satisfy condition '(n) the Euler '-function2evaluated at the positive integer n ord[a]n the order of the congruence class [a]n a b the integer a divides the integer b j redn reduction of integers modulo n ker(θ) kernel of homomorphism θ Im(θ) image of homomorphism θ F ∗ the units (invertible elements) in the ring F R[x] polynomial ring over the commutative ring R F (α) smallest subfield of C containing F and α F (x) the field of rational functions for the field F 9 10 STANDARD NOTATION AND COMMONLY USED SYMBOLS STANDARD TERMINOLOGY TERM MEANING LHS left hand side elements of sets usually denoted by lower case letters sets usually denoted by upper case letters RHS right hand side iff if and only if proper subset ⊂ subset, may not be proper a ⊆A the element a is a member of the set A a 2 A the element a is not a member of the set A 62 the empty set A; the cardinality of the set A Aj jB the union of the sets A and B A [ B the intersection of the sets A and B A\c the complement of the set A A B A Bc − \ Xcondition the elements of X that satisfy condition CHAPTER 1 The integers All of us have been dealing with integers from a very young age. They have been studied by mathematicians for thousands of years. Yet much about them is unknown and, in their education, most people though they have consistently used integers have not paid much attention to their basic properties. Only in 2003 was it proven that it does not take too long to decide whether an integer is a prime or not. It is still unknown whether one can factor an integer (into its prime factors) in a reasonably short time; although the belief is that it cannot be done in what is called \polynomial time." It is also surprising, perhaps, that in addition to their obvious role in counting and recording of data, they have deep applications to everyday life. The next to the last section of the chapter descibes a public key encryption system that allows secure communication, (on the INTERNET, for example) that is based on a beautiful theorem of Euler and the fact that it is very hard to factor large integers; the last section contains a small collection of results that I found fascinating { some of them will be needed in subsequent chapters of the book.
Load more

Recommended publications
  • 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]
  • Problems in Abstract Algebra
    STUDENT MATHEMATICAL LIBRARY Volume 82 Problems in Abstract Algebra A. R. Wadsworth 10.1090/stml/082 STUDENT MATHEMATICAL LIBRARY Volume 82 Problems in Abstract Algebra A. R. Wadsworth American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell (Chair) Erica Flapan Serge Tabachnikov 2010 Mathematics Subject Classification. Primary 00A07, 12-01, 13-01, 15-01, 20-01. For additional information and updates on this book, visit www.ams.org/bookpages/stml-82 Library of Congress Cataloging-in-Publication Data Names: Wadsworth, Adrian R., 1947– Title: Problems in abstract algebra / A. R. Wadsworth. Description: Providence, Rhode Island: American Mathematical Society, [2017] | Series: Student mathematical library; volume 82 | Includes bibliographical references and index. Identifiers: LCCN 2016057500 | ISBN 9781470435837 (alk. paper) Subjects: LCSH: Algebra, Abstract – Textbooks. | AMS: General – General and miscellaneous specific topics – Problem books. msc | Field theory and polyno- mials – Instructional exposition (textbooks, tutorial papers, etc.). msc | Com- mutative algebra – Instructional exposition (textbooks, tutorial papers, etc.). msc | Linear and multilinear algebra; matrix theory – Instructional exposition (textbooks, tutorial papers, etc.). msc | Group theory and generalizations – Instructional exposition (textbooks, tutorial papers, etc.). msc Classification: LCC QA162 .W33 2017 | DDC 512/.02–dc23 LC record available at https://lccn.loc.gov/2016057500 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society.
    [Show full text]
  • Abstract Algebra
    Abstract Algebra Martin Isaacs, University of Wisconsin-Madison (Chair) Patrick Bahls, University of North Carolina, Asheville Thomas Judson, Stephen F. Austin State University Harriet Pollatsek, Mount Holyoke College Diana White, University of Colorado Denver 1 Introduction What follows is a report summarizing the proposals of a group charged with developing recommendations for undergraduate curricula in abstract algebra.1 We begin by articulating the principles that shaped the discussions that led to these recommendations. We then indicate several learning goals; some of these address specific content areas and others address students' general development. Next, we include three sample syllabi, each tailored to meet the needs of specific types of institutions and students. Finally, we present a brief list of references including sample texts. 2 Guiding Principles We lay out here several principles that underlie our recommendations for undergraduate Abstract Algebra courses. Although these principles are very general, we indicate some of their specific implications in the discussions of learning goals and curricula below. Diversity of students We believe that a course in Abstract Algebra is valuable for a wide variety of students, including mathematics majors, mathematics education majors, mathematics minors, and majors in STEM disciplines such as physics, chemistry, and computer science. Such a course is essential preparation for secondary teaching and for many doctoral programs in mathematics. Moreover, algebra can capture the imagination of students whose attraction to mathematics is primarily to structure and abstraction (for example, 1As with any document that is produced by a committee, there were some disagreements and compromises. The committee members had many lively and spirited communications on what undergraduate Abstract Algebra should look like for the next ten years.
    [Show full text]
  • Abstract Algebra
    Abstract Algebra Paul Melvin Bryn Mawr College Fall 2011 lecture notes loosely based on Dummit and Foote's text Abstract Algebra (3rd ed) Prerequisite: Linear Algebra (203) 1 Introduction Pure Mathematics Algebra Analysis Foundations (set theory/logic) G eometry & Topology What is Algebra? • Number systems N = f1; 2; 3;::: g \natural numbers" Z = f:::; −1; 0; 1; 2;::: g \integers" Q = ffractionsg \rational numbers" R = fdecimalsg = pts on the line \real numbers" p C = fa + bi j a; b 2 R; i = −1g = pts in the plane \complex nos" k polar form re iθ, where a = r cos θ; b = r sin θ a + bi b r θ a p Note N ⊂ Z ⊂ Q ⊂ R ⊂ C (all proper inclusions, e.g. 2 62 Q; exercise) There are many other important number systems inside C. 2 • Structure \binary operations" + and · associative, commutative, and distributive properties \identity elements" 0 and 1 for + and · resp. 2 solve equations, e.g. 1 ax + bx + c = 0 has two (complex) solutions i p −b ± b2 − 4ac x = 2a 2 2 2 2 x + y = z has infinitely many solutions, even in N (thei \Pythagorian triples": (3,4,5), (5,12,13), . ). n n n 3 x + y = z has no solutions x; y; z 2 N for any fixed n ≥ 3 (Fermat'si Last Theorem, proved in 1995 by Andrew Wiles; we'll give a proof for n = 3 at end of semester). • Abstract systems groups, rings, fields, vector spaces, modules, . A group is a set G with an associative binary operation ∗ which has an identity element e (x ∗ e = x = e ∗ x for all x 2 G) and inverses for each of its elements (8 x 2 G; 9 y 2 G such that x ∗ y = y ∗ x = e).
    [Show full text]
  • 1 Algebra Vs. Abstract Algebra 2 Abstract Number Systems in Linear
    MATH 2135, LINEAR ALGEBRA, Winter 2017 and multiplication is also called the “logical and” operation. For example, we Handout 1: Lecture Notes on Fields can calculate like this: Peter Selinger 1 · ((1 + 0) + 1) + 1 = 1 · (1 + 1) + 1 = 1 · 0 + 1 = 0+1 1 Algebra vs. abstract algebra = 1. Operations such as addition and multiplication can be considered at several dif- 2 Abstract number systems in linear algebra ferent levels: • Arithmetic deals with specific calculation rules, such as 8 + 3 = 11. It is As you already know, Linear Algebra deals with subjects such as matrix multi- usually taught in elementary school. plication, linear combinations, solutions of systems of linear equations, and so on. It makes heavy use of addition, subtraction, multiplication, and division of • Algebra deals with the idea that operations satisfy laws, such as a(b+c)= scalars (think, for example, of the rule for multiplying matrices). ab + ac. Such laws can be used, among other things, to solve equations It turns out that most of what we do in linear algebra does not rely on the spe- such as 3x + 5 = 14. cific laws of arithmetic. Linear algebra works equally well over “alternative” • Abstract algebra is the idea that we can use the laws of algebra, such as arithmetics. a(b + c) = ab + ac, while abandoning the rules of arithmetic, such as Example 2.1. Consider multiplying two matrices, using arithmetic modulo 2 8 + 3 = 11. Thus, in abstract algebra, we are able to speak of entirely instead of the usual arithmetic. different “number” systems, for example, systems in which 1+1=0.
    [Show full text]
  • Algebraic Topology - Wikipedia, the Free Encyclopedia Page 1 of 5
    Algebraic topology - Wikipedia, the free encyclopedia Page 1 of 5 Algebraic topology From Wikipedia, the free encyclopedia Algebraic topology is a branch of mathematics which uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariants that classify topological spaces up to homeomorphism, though usually most classify up to homotopy equivalence. Although algebraic topology primarily uses algebra to study topological problems, using topology to solve algebraic problems is sometimes also possible. Algebraic topology, for example, allows for a convenient proof that any subgroup of a free group is again a free group. Contents 1 The method of algebraic invariants 2 Setting in category theory 3 Results on homology 4 Applications of algebraic topology 5 Notable algebraic topologists 6 Important theorems in algebraic topology 7 See also 8 Notes 9 References 10 Further reading The method of algebraic invariants An older name for the subject was combinatorial topology , implying an emphasis on how a space X was constructed from simpler ones (the modern standard tool for such construction is the CW-complex ). The basic method now applied in algebraic topology is to investigate spaces via algebraic invariants by mapping them, for example, to groups which have a great deal of manageable structure in a way that respects the relation of homeomorphism (or more general homotopy) of spaces. This allows one to recast statements about topological spaces into statements about groups, which are often easier to prove. Two major ways in which this can be done are through fundamental groups, or more generally homotopy theory, and through homology and cohomology groups.
    [Show full text]
  • Introduction to Abstract Algebra (Math 113)
    Introduction to Abstract Algebra (Math 113) Alexander Paulin, with edits by David Corwin FOR FALL 2019 MATH 113 002 ONLY Contents 1 Introduction 4 1.1 What is Algebra? . 4 1.2 Sets . 6 1.3 Functions . 9 1.4 Equivalence Relations . 12 2 The Structure of + and × on Z 15 2.1 Basic Observations . 15 2.2 Factorization and the Fundamental Theorem of Arithmetic . 17 2.3 Congruences . 20 3 Groups 23 1 3.1 Basic Definitions . 23 3.1.1 Cayley Tables for Binary Operations and Groups . 28 3.2 Subgroups, Cosets and Lagrange's Theorem . 30 3.3 Generating Sets for Groups . 35 3.4 Permutation Groups and Finite Symmetric Groups . 40 3.4.1 Active vs. Passive Notation for Permutations . 40 3.4.2 The Symmetric Group Sym3 . 43 3.4.3 Symmetric Groups in General . 44 3.5 Group Actions . 52 3.5.1 The Orbit-Stabiliser Theorem . 55 3.5.2 Centralizers and Conjugacy Classes . 59 3.5.3 Sylow's Theorem . 66 3.6 Symmetry of Sets with Extra Structure . 68 3.7 Normal Subgroups and Isomorphism Theorems . 73 3.8 Direct Products and Direct Sums . 83 3.9 Finitely Generated Abelian Groups . 85 3.10 Finite Abelian Groups . 90 3.11 The Classification of Finite Groups (Proofs Omitted) . 95 4 Rings, Ideals, and Homomorphisms 100 2 4.1 Basic Definitions . 100 4.2 Ideals, Quotient Rings and the First Isomorphism Theorem for Rings . 105 4.3 Properties of Elements of Rings . 109 4.4 Polynomial Rings . 112 4.5 Ring Extensions . 115 4.6 Field of Fractions .
    [Show full text]
  • Abstract Linear Algebra Math 350
    Abstract Linear Algebra Math 350 April 29, 2015 Contents 1 An introduction to vector spaces 2 1.1 Basic definitions & preliminaries . .4 1.2 Basic algebraic properties of vector spaces . .6 1.3 Subspaces . .7 2 Dimension 10 2.1 Linear combination . 10 2.2 Bases . 13 2.3 Dimension . 14 2.4 Zorn's lemma & the basis extension theorem . 16 3 Linear transformations 18 3.1 Definition & examples . 18 3.2 Rank-nullity theorem . 21 3.3 Vector space isomorphisims . 26 3.4 The matrix of a linear transformation . 28 4 Complex operators 34 4.1 Operators & polynomials . 34 4.2 Eigenvectors & eigenvalues . 36 4.3 Direct sums . 45 4.4 Generalized eigenvectors . 49 4.5 The characteristic polynomial . 54 4.6 Jordan basis theorem . 56 1 Chapter 1 An introduction to vector spaces Abstract linear algebra is one of the pillars of modern mathematics. Its theory is used in every branch of mathematics and its applications can be found all around our everyday life. Without linear algebra, modern conveniences such as the Google search algorithm, iPhones, and microprocessors would not exist. But what is abstract linear algebra? It is the study of vectors and functions on vectors from an abstract perspective. To explain what we mean by an abstract perspective, let us jump in and review our familiar notion of vectors. Recall that a vector of length n is a n × 1 array 2 3 a1 6 a2 7 6 7 ; 6 . 7 4 . 5 an where ai are real numbers, i.e., ai 2 R. It is also customary to define 82 3 9 a1 > > <>6 a2 7 => n = 6 7 j a 2 ; R 6 .
    [Show full text]
  • Math 171 Abstract Algebra I: Groups & Rings Shahriar Shahriari
    Course Description Math 171 Abstract Algebra I: Groups & Rings Shahriar Shahriari What is Abstract Algebra? Is there a formula|similar to the quadratic formula|for solving fifth degree algebraic equations? How do you go about finding all the integer solutions to an equation like y3 = x2 + 4? Abstract Algebra has its roots in attempts to answer these classical problems, but its methods and techniques permeate all of modern mathematics. Modern abstract algebra is organized around the axiomatic study of algebraic structures. Vector spaces|that you studied in linear algebra|are an example of an algebraic structure, but there are many more. All algebraic structures have common features, but each has its own distinct personality and its own areas of application. This first semester of abstract algebra will be devoted to the study of groups and rings. Groups are mathematicians way of capturing and analyzing symmetry while rings allow for a thorough study of arithmetical operations. The course develops groups and rings axiomatically and from first principles. While, we will prove everything along the way, we will also spend time developing mathematical intuition for these algebraic structures. From very meager beginnings, we will develop a powerful theory. My hope is that, by the end of the semester, you will have an appreciation for the depth, beauty, and power of this area of mathematics. Text. We will cover a good bit of Chapters 1{12 and 15{18 of the following text: Shahriar Shahriari, Algebra in Action, A course in groups, rings, and fields, Amer- ican Mathematical Society, 2017. Sample Questions. Here are three problems that you will be to do by the end of the course.
    [Show full text]
  • A Gentle Introduction to Abstract Algebra
    A GENTLE INTRODUCTION TO ABSTRACT ALGEBRA B.A. Sethuraman California State University Northridge ii Copyright © 2015 B.A. Sethuraman. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sec- tions, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License". Source files for this book are available at http://www.csun.edu/~asethura/GIAAFILES/GIAAV2.0-T/GIAAV2. 0-TSource.zip History 2012 Version 1.0. Created. Author B.A. Sethuraman. 2015 Version 2.0-T. Tablet Version. Author B.A. Sethuraman Contents To the Student: How to Read a Mathematics Book2 To the Student: Proofs 10 1 Divisibility in the Integers 35 1.1 Further Exercises........................ 63 2 Rings and Fields 79 2.1 Rings: Definition and Examples................ 80 2.2 Subrings............................ 120 2.3 Integral Domains and Fields.................. 131 2.4 Ideals.............................. 149 iii CONTENTS iv 2.5 Quotient Rings......................... 161 2.6 Ring Homomorphisms and Isomorphisms........... 173 2.7 Further Exercises........................ 203 3 Vector Spaces 246 3.1 Vector Spaces: Definition and Examples........... 247 3.2 Linear Independence, Bases, Dimension............ 264 3.3 Subspaces and Quotient Spaces................ 307 3.4 Vector Space Homomorphisms: Linear Transformations... 324 3.5 Further Exercises........................ 355 4 Groups 370 4.1 Groups: Definition and Examples............... 371 4.2 Subgroups, Cosets, Lagrange's Theorem........... 423 4.3 Normal Subgroups, Quotient Groups............. 450 4.4 Group Homomorphisms and Isomorphisms.........
    [Show full text]
  • Abstract Algebra Paul Garrett
    - Abstract Algebra Paul Garrett ii I covered this material in a two-semester graduate course in abstract algebra in 2004-05, rethinking the material from scratch, ignoring traditional prejudices. I wrote proofs which are natural outcomes of the viewpoint. A viewpoint is good if taking it up means that there is less to remember. Robustness, as opposed to fragility, is a desirable feature of an argument. It is burdensome to be clever. Since it is non-trivial to arrive at a viewpoint that allows proofs to seem easy, such a viewpoint is revisionist. However, this is a good revisionism, as opposed to much worse, destructive revisionisms which are nevertheless popular, most notably the misguided impulse to logical perfection [sic]. Logical streamlining is not the same as optimizing for performance. The worked examples are meant to be model solutions for many of the standard traditional exercises. I no longer believe that everyone is obliged to redo everything themselves. Hopefully it is possible to learn from others’ efforts. Paul Garrett June, 2007, Minneapolis Garrett: Abstract Algebra iii Introduction Abstract Algebra is not a conceptually well-defined body of material, but a conventional name that refers roughly to one of the several lists of things that mathematicians need to know to be competent, effective, and sensible. This material fits a two-semester beginning graduate course in abstract algebra. It is a how-to manual, not a monument to traditional icons. Rather than an encyclopedic reference, it tells a story, with plot-lines and character development propelling it forward. The main novelty is that most of the standard exercises in abstract algebra are given here as worked examples.
    [Show full text]
  • An Inquiry-Based Approach to Abstract Algebra
    An Inquiry-Based Approach to Abstract Algebra Dana C. Ernst, PhD Northern Arizona University Fall 2016 c 2016 Dana C. Ernst. Some Rights Reserved. This work is licensed under the Creative Commons Attribution-Share Alike 3.0 United States License. You may copy, distribute, display, and perform this copyrighted work, but only if you give credit to Dana C. Ernst, and all derivative works based upon it must be published under the Creative Commons Attribution-Share Alike 4.0 International Li- cense. Please attribute this work to Dana C. Ernst, Mathematics Faculty at Northern Arizona University, [email protected]. To view a copy of this license, visit https://creativecommons.org/licenses/by-sa/4.0/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, Cali- fornia, 94105, USA. cba Here is a partial list of people that I need to thank for supplying content, advice, and feedback. • Ben Woodruff • Josh Wiscons • Dave Richeson • Nathan Carter • AppendixB: The Elements of Style for Proofs is a blending of work by Anders Hen- drickson and Dave Richeson. • Dave Richeson is the original author of AppendixC: Fancy Mathematical Terms and AppendixD: Definitions in Mathematics. Contents 1 Introduction4 1.1 What is Abstract Algebra?............................4 1.2 An Inquiry-Based Approach...........................4 1.3 Rules of the Game.................................5 1.4 Structure of the Notes...............................6 1.5 Some Minimal Guidance.............................6 2 An Intuitive Approach to Groups8 3 Cayley Diagrams 15 4 An Introduction to Subgroups and Isomorphisms 25 4.1 Subgroups..................................... 26 4.2 Isomorphisms................................... 29 5 A Formal Approach to Groups 34 5.1 Binary Operations................................
    [Show full text]