DOCSLIB.ORG

Abstract Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Abstract Algebra 1 Groups Definition 1.1 (Group). A Group G is a set with a binary operation m : G × G ! G (m(g; h) := gh) such that 1. 8a; b; c 2 G, (ab)c = a(bc) 2. 9e 2 G such that 8a 2 G, ea = ae = a 3. 8a 2 G, 9a−1 2 G such that aa−1 = a−1a = e If only 1 is satisfied, then G is a semigroup. If only 1 and 2 are satisfied, then G is a monoid. If a structure has 8a; b 2 G, ab = ba, then it is abelian. Definition 1.2 (Group Homomorphism). A map f : G ! H between groups is a homomorphism if f(ab) = f(a)f(b) If the homomorphism is injective, it is a monomorphism. If the homomorphism is surjective, it is an epimorphism. If the homomorphism is bijective, it is an isomorphism. Lemma 1.1. Let ' : G ! H be a group homomorphism. Then '(eG) = eH and '(a−1) = '(a)−1 Proof. '(a) = '(aeG) = '(a)'(eG) −1 −1 '(a) '(a) = '(a) '(a)'(eG) = eH = eH ')eG) = '(eG) The other part is similar. Definition 1.3 (Kernel of a Homomorphism). The kernel of a homomorphism f : G ! H is the set fa 2 G : f(a) = eH g and is denoted ker f Definition 1.4 (Subgroup). If G is a group and H ⊆ G is itself a group under G's multiplication, then H is a subgroup of G, denoted H < G Trivially, ker f < G Lemma 1.2. A nonempty subset H ⊆ G is a subgroup iff 8a; b 2 H, ab−1 2 G Definition 1.5 (hom(G; H)). If G; H are groups, then hom(G; H) is the set of homomorphisms from G to H. Definition 1.6 (Cosets). Let H < G. The the left coset of H containing a is aH = fah : h 2 Hg. Right cosets are similarly defined. Lemma 1.3. If jHj < 1 then jaHj = jHj = jHaj Proof. Let h : H ! aH : h 7! ah. Then ah = ah0 ) h = h0, so f is bijective. Lemma 1.4. Let H < G. Then for a; b 2 G, either aH = bH or aH \ bH = ;. Also, aH = bH iff a−1b 2 H 1 Proof. Suppose aH \ bH 6= ;. Then 9h; h0 2 H such that ah = bh0. So a = bh0h−1 thus a 2 bH. Thus aH ⊂ bH. This argument is symmetric, thus aH = bH. Then, if aH = bH we have a−1b = hh0−1 2 H If a−1b = h 2 H, then b = ah so b 2 aH and aH \ bH 6= ;, so aH = bH. Definition 1.7 (Order of g). The order of g 2 G is the smallest positive n such that gn = e, or 1 is no such n exists. Theorem 1.5 (Lagrange's Theorem). If G is a finite group, then the order of any element divides jGj. Proof. We first check that each element has finite order. Since jGj < 1, there must be m; n > 0 such that gn = gm, where n < m So gm−n = e. Suppose that g has order n. Then consider fe; g; g2; : : : ; gn−1g = H The left cosets of H partition G, and each is size n, so jGj = nk, where k is the number of left cosets of G. Definition 1.8 (Direct Product Group). If G; H are groups, then G × H has elements f(g; h): g 2 G; h 2 Hg and multiplication (g; h)(g0; h0) = (gg0; hh0) Definition 1.9 (Normal Subgroup). A subgroup H of G is said to be normal if 8a 2 G; aH = Ha. We write H E G −1 −1 Lemma 1.6. N E G iff aNa = H 8a 2 G iff aNa ⊆ N 8a 2 G. Proof. If N is normal, then aN = Na, so aNa−1 ⊆ N. Also, 8n0 2 N, 9n 2 N such that an = n0a so ana−1 = n0 2 N, thus n0 2 aNa−1. Thus aNa−1 = N If aNa−1 = N, then 8n 2 N, 9n0 2 N such that an0a−1 = n so an0 = na and thus Na ⊂ aN. This argument is symmetric, so N E G. Definition 1.10 (Index). If H < G then the index of H in G, written [G : H] is the number of left cosets of H. This may be infinite. Theorem 1.7. If N E G then the set faN : a 2 Gg is a group of order [G : N] with operation (aN)(bN) = (ab)N Proof. If aN = a0N, bN = b0N then abN = a0b0N. as aN = a0N; a−1a0 2 N, similarly b−1b0 2 N. (ab)−1(a0b0) = b−1a−1a0b0 = b−1nb for some n 2 N. Then, there is an n0 such that b−1nb0 = b−1b0n0 = n00 2 N Thus, abN = a0b0N This multiplication is associative, because G is a group, and the other group properties follow similarly. Definition 1.11 (Quotient Group). The group in the theorem above is called G=N. 2 Note: f : G ! H a homomorphism, then ker f E G. Theorem 1.8. If f : G ! H is a homomorphism and N E G, N ⊆ ker f then 9!f~ : G=N ! H such that f~(aN) = f(a) 8a 2 G. Then Im f~ = Im(f) and ker f~ = ker f=N and f~ is an isomorphism iff f is surjective and N = ker f. Proof. See Hungerford. Corollary 1.9 (First Isomorphism Theorem). If f : G ! H is a group homo- morphism, then G= ker f ' Im f Definition 1.12 (HK). If H and K are subsets of a group, then HK = fhk : h 2 H; k 2 Kg Definition 1.13 (Join). If H; K < G then H _ K is the smallest subgroup of G containing both H and K. Whenever the smallest subgroup of G containing some set S is mentioned, it is the subgroup \Hi, where Hi < G and S ⊆ Hi. Lemma 1.10. If N E G; K < G, then 1. N \ K E K 2. N E N _ K 3. NK = N _ K = KN Proof. 1. If n 2 N\K, a 2 K, then ana−1 2 N\K, so a(N\K)a−1 ⊂ N\K, so N \ K E K 2. N E G and N < N _ K < G, so N E N _ K. 3. Since N _K is closed under multiplication, NK ⊆ N _K. Let a 2 N _K, write a = n1k1 : : : ; nrkr 0 0 Since N is normal, 8n 2 N, we can write kjn = n kj for some n 2 N. So a = nk1 : : : kr = nk with n 2 N; k 2 K. So a 2 NK. Theorem 1.11 (Second Isomorphism Theorem). If K; N < G and N E G then K=N \ K ' NK=N Proof. Define a homomorphism f : K ! NK=N by f(k) = kN. f ... K ............................................................................................................................................................................................................................................... NK=N .... ..... ....... ..... ...... ..... ...... ..... ..... ..... ..... ..... ..... ..... ..... ..... ι ..... ..... π ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... ...... ..... ........ ..... N _ K ker f = N \ K. By the first isomorphism theorem, K=N \ K ' Im f 3 Thus, it remains to show that Im f = NK=N. Consider nkN 2 NK=N. Since N is normal, 9n0 such that nkN = kn0N = kN = f(k). Theorem 1.12 (Third Isomorphism Theorem). Let K E G and H E G, with K < H. Then H=K E G=K and (G=K)=(H=K) E G=H Proof. Define a homomorphism f : G=K ! G=H by f(aK) = aH. f is a homomorphism, as K ⊂ ker(G ! G=H) ker f = H=K, and f is surjective by definition, so by the first isomorphism theorem, the result follows. Definition 1.14 (Simple Group). A group G is a simple group if it has no proper nontrivial normal subgroups. Now we will determine solutions to the problem of how can a group be described. 1. Listing the elements and making a table 2. Give the generators for G as a subgroups of Sn, finite groups only. 3. Give it as Aut X for some structure X. 4. Build up from simpler groups 5. Give generators for G as a subgroup of GLn (giving a homomorphism f : G ! GLn is the beginning of representation theory) 6. Generators and Relations. Theorem 1.13 (Cayley). Any finite group G is isomorphic to a subgroup of Sn for some n. Proof. Let n = jGj, and fix a bijection f1; : : : ; ng ! G such that G = fg1; : : : ; gng. Given g 2 G, 8i9j such that ggi = gj. Note that if ggi = ggk then gi = gk. Define σg : f1; : : : ; ng ! f1; : : : ; ng by σg(i) = j if ggi = gj This is an injection from a finite set into itself, and so a bijection. We will define ' : G ! Sn : g 7! σg Check that σgh = σgσh. ' is a homomorphism. Also, if ggi = gi then g = e, so σg 6= 1 for g 6= e. So ' is an injection, this '(G) ' G and is a subgroup of Sn. Corollary 1.14. Every finite group is isomorphic to a subgroup of GLn(R) for n = jGj. Proof. By Cayley's Theorem, it suffices to show that Sn is isomorphic to a subgroup of GLn 1 if σ(j) = i Define ' : S ! GL ( ): σ 7! A written A = n n R ij 0 else 4 Definition 1.15 (F (X)). Given a set X, we choose a set X−1 which is disjoint from X and has the same cardinality, with a bijection X ! X−1 : x 7! x−1, and we define an element 1 2 X [ X−1.
Load more

Recommended publications
  • Group Homomorphisms
    1-17-2018 Group Homomorphisms Here are the operation tables for two groups of order 4: · 1 a a2 + 0 1 2 1 1 a a2 0 0 1 2 a a a2 1 1 1 2 0 a2 a2 1 a 2 2 0 1 There is an obvious sense in which these two groups are “the same”: You can get the second table from the first by replacing 0 with 1, 1 with a, and 2 with a2. When are two groups the same? You might think of saying that two groups are the same if you can get one group’s table from the other by substitution, as above. However, there are problems with this. In the first place, it might be very difficult to check — imagine having to write down a multiplication table for a group of order 256! In the second place, it’s not clear what a “multiplication table” is if a group is infinite. One way to implement a substitution is to use a function. In a sense, a function is a thing which “substitutes” its output for its input. I’ll define what it means for two groups to be “the same” by using certain kinds of functions between groups. These functions are called group homomorphisms; a special kind of homomorphism, called an isomorphism, will be used to define “sameness” for groups. Definition. Let G and H be groups. A homomorphism from G to H is a function f : G → H such that f(x · y)= f(x) · f(y) forall x,y ∈ G.
    [Show full text]
  • Categories of Sets with a Group Action
    Categories of sets with a group action Bachelor Thesis of Joris Weimar under supervision of Professor S.J. Edixhoven Mathematisch Instituut, Universiteit Leiden Leiden, 13 June 2008 Contents 1 Introduction 1 1.1 Abstract . .1 1.2 Working method . .1 1.2.1 Notation . .1 2 Categories 3 2.1 Basics . .3 2.1.1 Functors . .4 2.1.2 Natural transformations . .5 2.2 Categorical constructions . .6 2.2.1 Products and coproducts . .6 2.2.2 Fibered products and fibered coproducts . .9 3 An equivalence of categories 13 3.1 G-sets . 13 3.2 Covering spaces . 15 3.2.1 The fundamental group . 15 3.2.2 Covering spaces and the homotopy lifting property . 16 3.2.3 Induced homomorphisms . 18 3.2.4 Classifying covering spaces through the fundamental group . 19 3.3 The equivalence . 24 3.3.1 The functors . 25 4 Applications and examples 31 4.1 Automorphisms and recovering the fundamental group . 31 4.2 The Seifert-van Kampen theorem . 32 4.2.1 The categories C1, C2, and πP -Set ................... 33 4.2.2 The functors . 34 4.2.3 Example . 36 Bibliography 38 Index 40 iii 1 Introduction 1.1 Abstract In the 40s, Mac Lane and Eilenberg introduced categories. Although by some referred to as abstract nonsense, the idea of categories allows one to talk about mathematical objects and their relationions in a general setting. Its origins lie in the field of algebraic topology, one of the topics that will be explored in this thesis. First, a concise introduction to categories will be given.
    [Show full text]
  • The General Linear Group
    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
    [Show full text]
  • Nearly Locally Presentable Categories Are Locally Presentable Is Equivalent to Vopˇenka’S Principle
    NEARLY LOCALLY PRESENTABLE CATEGORIES L. POSITSELSKI AND J. ROSICKY´ Abstract. We introduce a new class of categories generalizing locally presentable ones. The distinction does not manifest in the abelian case and, assuming Vopˇenka’s principle, the same happens in the regular case. The category of complete partial orders is the natural example of a nearly locally finitely presentable category which is not locally presentable. 1. Introduction Locally presentable categories were introduced by P. Gabriel and F. Ulmer in [6]. A category K is locally λ-presentable if it is cocomplete and has a strong generator consisting of λ-presentable objects. Here, λ is a regular cardinal and an object A is λ-presentable if its hom-functor K(A, −): K → Set preserves λ-directed colimits. A category is locally presentable if it is locally λ-presentable for some λ. This con- cept of presentability formalizes the usual practice – for instance, finitely presentable groups are precisely groups given by finitely many generators and finitely many re- lations. Locally presentable categories have many nice properties, in particular they are complete and co-wellpowered. Gabriel and Ulmer [6] also showed that one can define locally presentable categories by using just monomorphisms instead all morphisms. They defined λ-generated ob- jects as those whose hom-functor K(A, −) preserves λ-directed colimits of monomor- phisms. Again, this concept formalizes the usual practice – finitely generated groups are precisely groups admitting a finite set of generators. This leads to locally gener- ated categories, where a cocomplete category K is locally λ-generated if it has a strong arXiv:1710.10476v2 [math.CT] 2 Apr 2018 generator consisting of λ-generated objects and every object of K has only a set of strong quotients.
    [Show full text]
  • Notes and Solutions to Exercises for Mac Lane's Categories for The
    Stefan Dawydiak Version 0.3 July 2, 2020 Notes and Exercises from Categories for the Working Mathematician Contents 0 Preface 2 1 Categories, Functors, and Natural Transformations 2 1.1 Functors . .2 1.2 Natural Transformations . .4 1.3 Monics, Epis, and Zeros . .5 2 Constructions on Categories 6 2.1 Products of Categories . .6 2.2 Functor categories . .6 2.2.1 The Interchange Law . .8 2.3 The Category of All Categories . .8 2.4 Comma Categories . 11 2.5 Graphs and Free Categories . 12 2.6 Quotient Categories . 13 3 Universals and Limits 13 3.1 Universal Arrows . 13 3.2 The Yoneda Lemma . 14 3.2.1 Proof of the Yoneda Lemma . 14 3.3 Coproducts and Colimits . 16 3.4 Products and Limits . 18 3.4.1 The p-adic integers . 20 3.5 Categories with Finite Products . 21 3.6 Groups in Categories . 22 4 Adjoints 23 4.1 Adjunctions . 23 4.2 Examples of Adjoints . 24 4.3 Reflective Subcategories . 28 4.4 Equivalence of Categories . 30 4.5 Adjoints for Preorders . 32 4.5.1 Examples of Galois Connections . 32 4.6 Cartesian Closed Categories . 33 5 Limits 33 5.1 Creation of Limits . 33 5.2 Limits by Products and Equalizers . 34 5.3 Preservation of Limits . 35 5.4 Adjoints on Limits . 35 5.5 Freyd's adjoint functor theorem . 36 1 6 Chapter 6 38 7 Chapter 7 38 8 Abelian Categories 38 8.1 Additive Categories . 38 8.2 Abelian Categories . 38 8.3 Diagram Lemmas . 39 9 Special Limits 41 9.1 Interchange of Limits .
    [Show full text]
  • Ring Extension Problem, Shukla Cohomology and Ann-Category Theory the Relationship Between Ring Extension Problem in the General Case and Ann- Category Theory
    RING EXTENSION PROBLEM, SHUKLA COHOMOLOGY AND ANN-CATEGORY THEORY Nguyen Tien Quang and Nguyen Thu Thuy November 4, 2018 Abstract. Every ring extension of A by R induces a pair of group ho- ∗ ∗ momorphisms L : R → EndZ(A)/L(A); R : R → EndZ(A)/R(A), preserving multiplication, satisfying some certain conditions. A such 4-tuple (R, A, L∗, R∗) is called a ring pre-extension. Each ring pre-extension induces a R-bimodule structure on bicenter KA of ring A, and induces an obstruction k, which is a 3-cocycle of Z-algebra R, with coefficients in R-bimodule KA in the sense of Shukla. Each obstruction k in this sense induces a structure of a regular Ann-category of type (R,KA). This result gives us the first application of Ann- category in extension problems of algebraic structures, as well as in cohomology theories. 1 Introduction Group extension problem has been presented with group of automorphisms Aut(G) and quotient group Aut(G)/In(G) by group of inner automorphisms. For ring extension problem, Mac Lane [1] has replaced the above groups by the ring of bimultiplications MA and the quotient ring PA of MA upon ring of in- ner bimultiplications. Besides, Maclane has replaced commutative, associative laws for addition in ring R by commutative-associative law (u + v) + (r + s)= arXiv:0706.0315v1 [math.CT] 3 Jun 2007 (u+r)+(v+s) and therefore proved that each obstruction of ring extension prob- lem is an element of 3-dimensional cohomology group in the sense of Maclane, and the number of solutions corresponds to 2-dimensional cohomology group of ring under a bijection.
    [Show full text]
  • Självständiga Arbeten I Matematik
    SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Geometric interpretation of non-associative composition algebras av Fredrik Cumlin 2020 - No K13 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET, 106 91 STOCKHOLM Geometric interpretation of non-associative composition algebras Fredrik Cumlin Självständigt arbete i matematik 15 högskolepoäng, grundnivå Handledare: Wushi Goldring 2020 Abstract This paper aims to discuss the connection between non-associative composition algebra and geometry. It will first recall the notion of an algebra, and investigate the properties of an algebra together with a com- position norm. The composition norm will induce a law on the algebra, which is stated as the composition law. This law is then used to derive the multiplication and conjugation laws, where the last is also known as convolution. These laws are then used to prove Hurwitz’s celebrated the- orem concerning the different finite composition algebras. More properties of composition algebras will be covered, in order to look at the structure of the quaternions H and octonions O. The famous Fano plane will be the finishing touch of the relationship between the standard orthogonal vectors which construct the octonions. Lastly, the notion of invertible maps in relation to invertible loops will be covered, to later show the connection between 8 dimensional rotations − and multiplication of unit octonions. 2 Contents 1 Algebra 4 1.1 The multiplication laws . .6 1.2 The conjugation laws . .7 1.3 Dickson double . .8 1.4 Hurwitz’s theorem . 11 2 Properties of composition algebras 14 2.1 The left-, right- and bi-multiplication maps . 16 2.2 Basic properties of quaternions and octonions .
    [Show full text]
  • On the Semisimplicity of Group Algebras
    ON THE SEMISIMPLICITY OF GROUP ALGEBRAS ORLANDO E. VILLAMAYOR1 In this paper we find sufficient conditions for a group algebra over a commutative ring to be semisimple. In particular, the case in which the group is abelian is solved for fields of characteristic zero, and, in a more general case, for semisimple commutative rings which are uniquely divisible by every integer. Under similar restrictions on the ring of coefficients, it is proved the semisimplicity of group alge- bras when the group is not abelian but the factor group module its center is locally finite.2 In connection with this problem, we study homological properties of group algebras generalizing some results of M. Auslander [l, Theorems 6 and 9]. In fact, Lemmas 3 and 4 give new proofs of Aus- lander's Theorems 6 and 9 in the case C=(l). 1. Notations. A group G will be called a torsion group if every ele- ment of G has finite order, it will be called locally finite if every finitely generated subgroup is finite and it will be called free (or free abelian) if it is a direct sum of infinite cyclic groups. Direct sum and direct product are defined as in [3]. Given a set of rings Ri, their direct product will be denoted by J{Ri. If G is a group and R is a ring, the group algebra generated by G over R will be denoted by R(G). In a ring R, radical and semisimplicity are meant in the sense of Jacobson [5]. A ring is called regular in the sense of von Neumann [7].
    [Show full text]
  • The Fundamental Homomorphism Theorem
    Lecture 4.3: The fundamental homomorphism theorem Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 4.3: The fundamental homomorphism theorem Math 4120, Modern Algebra 1 / 10 Motivating example (from the previous lecture) Define the homomorphism φ : Q4 ! V4 via φ(i) = v and φ(j) = h. Since Q4 = hi; ji: φ(1) = e ; φ(−1) = φ(i 2) = φ(i)2 = v 2 = e ; φ(k) = φ(ij) = φ(i)φ(j) = vh = r ; φ(−k) = φ(ji) = φ(j)φ(i) = hv = r ; φ(−i) = φ(−1)φ(i) = ev = v ; φ(−j) = φ(−1)φ(j) = eh = h : Let's quotient out by Ker φ = {−1; 1g: 1 i K 1 i iK K iK −1 −i −1 −i Q4 Q4 Q4=K −j −k −j −k jK kK j k jK j k kK Q4 organized by the left cosets of K collapse cosets subgroup K = h−1i are near each other into single nodes Key observation Q4= Ker(φ) =∼ Im(φ). M. Macauley (Clemson) Lecture 4.3: The fundamental homomorphism theorem Math 4120, Modern Algebra 2 / 10 The Fundamental Homomorphism Theorem The following result is one of the central results in group theory. Fundamental homomorphism theorem (FHT) If φ: G ! H is a homomorphism, then Im(φ) =∼ G= Ker(φ). The FHT says that every homomorphism can be decomposed into two steps: (i) quotient out by the kernel, and then (ii) relabel the nodes via φ. G φ Im φ (Ker φ C G) any homomorphism q i quotient remaining isomorphism process (\relabeling") G Ker φ group of cosets M.
    [Show full text]
  • A Review of Commutative Ring Theory Mathematics Undergraduate Seminar: Toric Varieties
    A REVIEW OF COMMUTATIVE RING THEORY MATHEMATICS UNDERGRADUATE SEMINAR: TORIC VARIETIES ADRIANO FERNANDES Contents 1. Basic Definitions and Examples 1 2. Ideals and Quotient Rings 3 3. Properties and Types of Ideals 5 4. C-algebras 7 References 7 1. Basic Definitions and Examples In this first section, I define a ring and give some relevant examples of rings we have encountered before (and might have not thought of as abstract algebraic structures.) I will not cover many of the intermediate structures arising between rings and fields (e.g. integral domains, unique factorization domains, etc.) The interested reader is referred to Dummit and Foote. Definition 1.1 (Rings). The algebraic structure “ring” R is a set with two binary opera- tions + and , respectively named addition and multiplication, satisfying · (R, +) is an abelian group (i.e. a group with commutative addition), • is associative (i.e. a, b, c R, (a b) c = a (b c)) , • and the distributive8 law holds2 (i.e.· a,· b, c ·R, (·a + b) c = a c + b c, a (b + c)= • a b + a c.) 8 2 · · · · · · Moreover, the ring is commutative if multiplication is commutative. The ring has an identity, conventionally denoted 1, if there exists an element 1 R s.t. a R, 1 a = a 1=a. 2 8 2 · ·From now on, all rings considered will be commutative rings (after all, this is a review of commutative ring theory...) Since we will be talking substantially about the complex field C, let us recall the definition of such structure. Definition 1.2 (Fields).
    [Show full text]
  • Isomorphic Groups and Group Rings
    Pacific Journal of Mathematics ISOMORPHIC GROUPS AND GROUP RINGS DONALD STEVEN PASSMAN Vol. 15, No. 2 October 1965 PACIFIC JOURNAL OF MATHEMATICS Vol. 15, No. 2, 1965 ISOMORPHIC GROUPS AND GROUP RINGS D. S. PASSMAN Let © be a finite group, £ a commutative ring with one and S[@] the group ring of © over S. If ξ> is a group with © = £ then clearly S[(S] = S[£>] where the latter is an S-iso- morphism. We study here the converse question: For which groups © and rings S does £[©] ^ S[ξ>] imply that © is iso- morphic to £)? We consider first the case where S = K is a field. It is known that if © is abelian then Q[@] = Q[ξ>] implies that © = §> where Q is the field of rational numbers. We show here that this result does not extend to all groups ©. In fact by a simple counting argument we exhibit a large set of noniso- morphic p-groups with isomorphic group algebras over all noncharacteristic p fields. Thus for groups in general the only fields if interest are those whose characteristic divides the order of the group. We now let S = R be the ring of integers in some finite algebraic extension of the rationale. We show here that the group ring R[@>] determines the set of normal subgroups of © along with many of the natural operations defined on this set. For example, under the assumption that © is nilpotent, we show that given normal subgroups 3Dΐ and 9ΐ, the group ring determines the commutator subgroup (3JI, 91). Finally we consider several special cases. In particular we show that if © is nilpotent of class 2 then R[(g\ = β[§] implies © = €>.
    [Show full text]
  • CLIFFORD ALGEBRAS Property, Then There Is a Unique Isomorphism (V ) (V ) Intertwining the Two Inclusions of V
    CHAPTER 2 Clifford algebras 1. Exterior algebras 1.1. Definition. For any vector space V over a field K, let T (V ) = k k k Z T (V ) be the tensor algebra, with T (V ) = V V the k-fold tensor∈ product. The quotient of T (V ) by the two-sided⊗···⊗ ideal (V ) generated byL all v w + w v is the exterior algebra, denoted (V ).I The product in (V ) is usually⊗ denoted⊗ α α , although we will frequently∧ omit the wedge ∧ 1 ∧ 2 sign and just write α1α2. Since (V ) is a graded ideal, the exterior algebra inherits a grading I (V )= k(V ) ∧ ∧ k Z M∈ where k(V ) is the image of T k(V ) under the quotient map. Clearly, 0(V )∧ = K and 1(V ) = V so that we can think of V as a subspace of ∧(V ). We may thus∧ think of (V ) as the associative algebra linearly gener- ated∧ by V , subject to the relations∧ vw + wv = 0. We will write φ = k if φ k(V ). The exterior algebra is commutative | | ∈∧ (in the graded sense). That is, for φ k1 (V ) and φ k2 (V ), 1 ∈∧ 2 ∈∧ [φ , φ ] := φ φ + ( 1)k1k2 φ φ = 0. 1 2 1 2 − 2 1 k If V has finite dimension, with basis e1,...,en, the space (V ) has basis ∧ e = e e I i1 · · · ik for all ordered subsets I = i1,...,ik of 1,...,n . (If k = 0, we put { } k { n } e = 1.) In particular, we see that dim (V )= k , and ∅ ∧ n n dim (V )= = 2n.
    [Show full text]