DOCSLIB.ORG

(Group Homomorphism). a Homomorphism from a Group G to a Group G Is a Mapping : G G That Preserves the Group Operation: ! (Ab) = (A)(B) for All A, B G

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
(Group Homomorphism). a Homomorphism from a Group G to a Group G Is a Mapping � : G G That Preserves the Group Operation: ! �(Ab) = �(A)�(B) for All A, B G CHAPTER 10 Group Homomorphisms Definitions and Examples Definition (Group Homomorphism). A homomorphism from a group G to a group G is a mapping φ : G G that preserves the group operation: ! φ(ab) = φ(a)φ(b) for all a, b G. 2 Definition (Kernal of a Homomorphism). The kernel of a homomorphism φ : G G is the set Ker φ = x G φ(x) = e ! { 2 | } Example. (1) Every isomorphism is a homomorphism with Ker φ = e . { } (2) Let G = Z under addition and G = 1, 1 under multiplication. Define φ : G G by { − } ! 1, n is even φ(n) = 1, n is odd (− is a homomorphism. For m and n odd: (even–even) φ(2n + 2m) = φ(2(n + m)) = 1 = φ(2n)φ(2m) (even–odd) φ(2n + m) = 1 = 1( 1) = φ(2n)φ(m) − − (odd–odd) φ(n + m) = 1 = ( 1)( 1) = φ(n)φ(m) − − Ker φ = even integers . { } 134 10. GROUP HOMOMORPHISMS 135 (3) φ : GL(2, R) R⇤ (nonzero reals under multiplication) defined by ! φ(A) = det A is a homomorphism. φ(AB) = det AB = (det A)(det B) = φ(A)φ(B). Ker φ = SL(2, R). (4) Let R[x] denote the group of all polynomials with real coefficients under addition. Let φ : R[x] R[x] be defined by φ(f) = f 0. The group operation preservation is simply “the! derivative of a sum is the sum of the derivatives.” φ(f + g) = (f + g)0 = f 0 + g0 = φ(f) + φ(g). Ker φ is the set of all constant polynomials. (5) The natural homomorphism from Z to Zn is defined by φ(m) = m mod n. Ker φ = n . h i (6) Consider φ : R R under addition defined by φ(x) = x2. Since ! φ(x + y) = (x + y)2 = x2 + 2xy + y2 and φ(x + φ(y) = x2 + y2, this is not a homomorphism. (7) Every vector space linear transformation is a group homomorphism and the nullspace is the kernel. 136 10. GROUP HOMOMORPHISMS Properties of Homomorphisms Theorem (10.1 – Properties of Elements Under Homomorphisms). Let φ be a homomorphism from a group G to a group G and let g G. Then: 2 (1) φ(e) = e. n (2) φ(gn) = φ(g) . Proof. (F⇥or (1)⇤ and (2)) Same as in Theorem 6.2. ⇤ (3) If g is finite, then φ(g) g . | | | | | | Proof. Suppose g = n = gn = e. Then | | ) n e = φ(e) = φ(gn) = φ(g) = (Corollary 2 to Theorem 4.1) φ(g) n. ) | | ⇥ ⇤ ⇤ (4) Ker φ G. Proof. By (1), Ker φ = . Suppose a, b Ker φ. Then 6 ; 2 1 1 1 1 φ(ab− ) = φ(a)φ(b− ) = φ(a) φ(b) − = e e− = e e = e, · · 1 so ab− Ker φ. Thus Ker φ G by the one-step test. 2 ⇥ ⇤ ⇤ (5) φ(a) = φ(b) a Ker φ = b Ker φ. () Proof. φ(a) = φ(b) () 1 1 1 1 e = (φ(b))− φ(a) = φ(b− )φ(a) = φ(b− a) b− a Ker φ () 2 () b Ker φ = a Ker φ (by property 6 of the lemma in Chapter 7) ⇤ 10. GROUP HOMOMORPHISMS 137 1 (6) If φ(g) = g0, then φ− (g0) = x G φ(x) = g0 = g Ker φ. { 2 } Proof. 1 [We prove by mutual set inclusion.] Suppose x φ− (g0). Then 2 φ(x) = g0 = φ(g) = x Ker φ = g Ker φ by property (5)= ) ) x g Ker φ (by property 4 of the lemma in Chapter 7). 2 1 Thus φ− (g0) g Ker φ. ✓ Now suppose k Ker φ, so that φ(gk) = φ(g)φ(k) = g0e = g0. Thus, by 2 1 1 definition, gk φ− (g0) = g Ker φ φ− (g0), and so by mutual set inclusion, 2 ) ✓ 1 g Ker φ = φ− (g0). ⇤ Since homomorphisms preserve the group operation, they also preserve many other group properties. Theorem (10.2 – Properties of Subgroups Under Homomorphisms). Let φ : G G be a homomorphism and let H G. Then ! (1) φ(H) = φ(h) h H G. { | 2 } (2) H cyclic = φ(H) cyclic. ) (3) H Abelian = φ(H) Abelian. ) Proof. (For (1), (2), and (3)) Same as in Theorem 6.3. ⇤ (4) H G = φ(H) φ(G). C ) C Proof. Let φ(h) φ(H) and φ(g) φ(G). Then 2 2 1 1 φ(g)φ(h)φ(g)− = φ(ghg− ) φ(H) 2 1 since ghg− H because H G. 2 C ⇤ 138 10. GROUP HOMOMORPHISMS (5) If Ker φ = n, then φ is an n-to-1 mapping from G onto φ(G). | | Proof. Follows directly from property 6 of Theorem 10.1 and the fact that 1 all cosets of Ker φ = φ− (e). ⇤ (6) If H = n, then φ(H) n. | | | | Proof. Let φH denote the restriction of φ to H. Then φH is a homomorphism from H onto φ(H). Suppose Ker φH = t. Then, from (5), φH is a t-to-1 mapping, so φ(H) t = H . | | | | | | ⇤ 1 (7) If K G, then φ− (K) = k G φ(k) K G. { 2 | 2 } Proof. 1 1 1 Clearly e φ− (K), so φ− (K) = . Let k , k φ− (K). Then 2 6 ; 1 2 2 1 φ(k ), φ(k ) K = φ(k )− K. 1 2 2 ) 2 2 Thus 1 1 1 φ(k1k2− ) = φ(k1)φ(k2− ) = φ(k1)φ(k2)− K. 1 1 1 2 By definition, k k− φ− (K) and so φ− (K) G by the one-step test. 1 2 2 ⇤ 1 (8) If K G, then φ− (K) = k G φ(k) K G. C { 2 | 2 } C Proof. 1 1 1 Every element of xφ− (K)x− has the form xkx− where φ(k) K. Since 2 K C G, 1 1 φ(xkx− ) = φ(x)φ(k)φ(x)− K, 1 1 1 1 21 1 and so xkx− φ− (K). Thus xφ− (K)x− φ− (K) and φ− (K) G by 2 ✓ C Theorem 9.1. ⇤ (9) If φ is onto and Ker φ = e , then φ is an isomorphism from G to G. { } Proof. Follows directly from (5). ⇤ 10. GROUP HOMOMORPHISMS 139 Corollary (To (8)). Ker φ C G. Proof. Let K = e in (8). { } ⇤ Example. Consider φ : C? C? defined by φ(x) = x4. φ is a homomor- phism since ! φ(xy) = (xy)4 = x4y4 = φ(x)φ(y). Ker φ = 1, 1, i, i . Thus φ is a 4-to-1 mapping by property (5) of Theorem 10.2. Since{ φ−(31/4)−=}3, again by property (5) of Theorem 10.2, 1 1/4 1/4 1/4 1/4 1/4 φ− (3) = 3 Ker φ = 3 , 3 , 3 i, 3 i { − − } Now let H = cos 60◦ + i sin 60◦ . Since h i 6 (cos 60◦ + i sin 60◦) = cos 360◦ + i sin 360◦ = 1, H = 6. | | 4 φ(H) = (cos 60◦ + i sin 60◦) = cos 240◦ + i sin 240◦ = φ(H) = 3, h i h i ) | | so φ(H) H . | | | | 140 10. GROUP HOMOMORPHISMS Example. Define φ : Z16 Z16 by φ(x) = 4x. φ is a homomorphism ! since, for x, y Z16, 2 φ(x + y) = 4(x + y) = 4x + 4y = φ(x) + φ(y). Ker φ = 0, 4, 8, 12 . Thus φ is 4-to-1. Since φ(3) = 12, by property (5) of Theorem {10.2, } 1 φ− (12) = 3 + Ker φ = 3, 7, 11, 15 . { } Since 3 is cyclic, so is φ( 3 ). h i h i 3 = 3, 6, 9, 12, 15, 2, 5, 8, 11, 14, 1, 4, 7, 10, 13, 0 . h i { } φ( 3 ) = 12, 8, 4, 0 = 4 = 12 . h i { } h i h i Also, φ(3) = 4 and 3 = 16, so φ(3) 3 . | | | | | | | | 1 With K = 0, 4, 8, 12 Z16, φ− (K)= 3 Z16. { } h i Problem (Page 221 # 25). Hom many homomorphisms are there from Z20 onto Z10? How many are there to Z10? Solution. Z20 and Z10 are both cyclic and additive. By property (2) of Theorem 10.1, written additively, φ(ng) = nφ(g). Such homomorphisms are completely deter- mined by φ(1), i.e., if φ(1) = a, φ(x) = φ(x 1) = xφ(1) = xa. By Lagrange, a 10, and by property (3) of Theorem 10.1,· a 1 or a 20. | | | | | | | | Thus a = 1, 5, 10, or 2. | | a = 10 : 1, 3, 7, 9 have order 10 in Z10, so 4 homomorphisms are onto. | | a = 5 : 2, 4, 6, 8. | | a = 2 : 5. | | a = 1 : 0. | | In all cases, φ(x + y) = (x + y)a = xa + ya = φ(x + φ(y). ⇤ 10. GROUP HOMOMORPHISMS 141 The First Isomorphism Theorem Theorem (10.3 — First Isomorphism Theorem). Let φ : G G be a group homomorphism. Then : G/ Ker φ φ(G) defined by (!g Ker φ) = φ(g) is an isomorphism, i.e., G Ker φ φ(!G). ⇡ Proof. That is well-defined, i.e., the correspondence is independent of the particular coset representation chosen, and is 1–1 follows directly from property (5) of Theorem 10.1. is clearly onto. [To show is operation-preserving.] For all x Ker φ, y Ker φ G/ Ker φ, 2 (x Ker φ y Ker φ) = (xy Ker φ) = φ(xy) = φ(x)φ(y) = (x Ker φ) (y Ker φ), so is operation-preserving and this is an isomorphism. ⇤ Corollary. If φ is a homomorphism from a finite group G to G, then φ(G) divides both G and G . | | | | | | Example. The natural homomorphism from Z to Zn is defined by φ(m) = m mod n has Ker φ = n .
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]
  • Kernel and Image
    Math 217 Worksheet 1 February: x3.1 Professor Karen E Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. T Definitions: Given a linear transformation V ! W between vector spaces, we have 1. The source or domain of T is V ; 2. The target of T is W ; 3. The image of T is the subset of the target f~y 2 W j ~y = T (~x) for some x 2 Vg: 4. The kernel of T is the subset of the source f~v 2 V such that T (~v) = ~0g. Put differently, the kernel is the pre-image of ~0. Advice to the new mathematicians from an old one: In encountering new definitions and concepts, n m please keep in mind concrete examples you already know|in this case, think about V as R and W as R the first time through. How does the notion of a linear transformation become more concrete in this special case? Think about modeling your future understanding on this case, but be aware that there are other important examples and there are important differences (a linear map is not \a matrix" unless *source and target* are both \coordinate spaces" of column vectors). The goal is to become comfortable with the abstract idea of a vector space which embodies many n features of R but encompasses many other kinds of set-ups. A. For each linear transformation below, determine the source, target, image and kernel. 2 3 x1 3 (a) T : R ! R such that T (4x25) = x1 + x2 + x3.
    [Show full text]
  • Derived Functors and Homological Dimension (Pdf)
    DERIVED FUNCTORS AND HOMOLOGICAL DIMENSION George Torres Math 221 Abstract. This paper overviews the basic notions of abelian categories, exact functors, and chain complexes. It will use these concepts to define derived functors, prove their existence, and demon- strate their relationship to homological dimension. I affirm my awareness of the standards of the Harvard College Honor Code. Date: December 15, 2015. 1 2 DERIVED FUNCTORS AND HOMOLOGICAL DIMENSION 1. Abelian Categories and Homology The concept of an abelian category will be necessary for discussing ideas on homological algebra. Loosely speaking, an abelian cagetory is a type of category that behaves like modules (R-mod) or abelian groups (Ab). We must first define a few types of morphisms that such a category must have. Definition 1.1. A morphism f : X ! Y in a category C is a zero morphism if: • for any A 2 C and any g; h : A ! X, fg = fh • for any B 2 C and any g; h : Y ! B, gf = hf We denote a zero morphism as 0XY (or sometimes just 0 if the context is sufficient). Definition 1.2. A morphism f : X ! Y is a monomorphism if it is left cancellative. That is, for all g; h : Z ! X, we have fg = fh ) g = h. An epimorphism is a morphism if it is right cancellative. The zero morphism is a generalization of the zero map on rings, or the identity homomorphism on groups. Monomorphisms and epimorphisms are generalizations of injective and surjective homomorphisms (though these definitions don't always coincide). It can be shown that a morphism is an isomorphism iff it is epic and monic.
    [Show full text]
  • Math 120 Homework 3 Solutions
    Math 120 Homework 3 Solutions Xiaoyu He, with edits by Prof. Church April 21, 2018 [Note from Prof. Church: solutions to starred problems may not include all details or all portions of the question.] 1.3.1* Let σ be the permutation 1 7! 3; 2 7! 4; 3 7! 5; 4 7! 2; 5 7! 1 and let τ be the permutation 1 7! 5; 2 7! 3; 3 7! 2; 4 7! 4; 5 7! 1. Find the cycle decompositions of each of the following permutations: σ; τ; σ2; στ; τσ; τ 2σ. The cycle decompositions are: σ = (135)(24) τ = (15)(23)(4) σ2 = (153)(2)(4) στ = (1)(2534) τσ = (1243)(5) τ 2σ = (135)(24): 1.3.7* Write out the cycle decomposition of each element of order 2 in S4. Elements of order 2 are also called involutions. There are six formed from a single transposition, (12); (13); (14); (23); (24); (34), and three from pairs of transpositions: (12)(34); (13)(24); (14)(23). 3.1.6* Define ' : R× ! {±1g by letting '(x) be x divided by the absolute value of x. Describe the fibers of ' and prove that ' is a homomorphism. The fibers of ' are '−1(1) = (0; 1) = fall positive realsg and '−1(−1) = (−∞; 0) = fall negative realsg. 3.1.7* Define π : R2 ! R by π((x; y)) = x + y. Prove that π is a surjective homomorphism and describe the kernel and fibers of π geometrically. The map π is surjective because e.g. π((x; 0)) = x. The kernel of π is the line y = −x through the origin.
    [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]
  • Discrete Topological Transformations for Image Processing Michel Couprie, Gilles Bertrand
    Discrete Topological Transformations for Image Processing Michel Couprie, Gilles Bertrand To cite this version: Michel Couprie, Gilles Bertrand. Discrete Topological Transformations for Image Processing. Brimkov, Valentin E. and Barneva, Reneta P. Digital Geometry Algorithms, 2, Springer, pp.73-107, 2012, Lecture Notes in Computational Vision and Biomechanics, 978-94-007-4174-4. 10.1007/978-94- 007-4174-4_3. hal-00727377 HAL Id: hal-00727377 https://hal-upec-upem.archives-ouvertes.fr/hal-00727377 Submitted on 3 Sep 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Chapter 3 Discrete Topological Transformations for Image Processing Michel Couprie and Gilles Bertrand Abstract Topology-based image processing operators usually aim at trans- forming an image while preserving its topological characteristics. This chap- ter reviews some approaches which lead to efficient and exact algorithms for topological transformations in 2D, 3D and grayscale images. Some transfor- mations which modify topology in a controlled manner are also described. Finally, based on the framework of critical kernels, we show how to design a topologically sound parallel thinning algorithm guided by a priority function. 3.1 Introduction Topology-preserving operators, such as homotopic thinning and skeletoniza- tion, are used in many applications of image analysis to transform an object while leaving unchanged its topological characteristics.
    [Show full text]
  • Kernel Methodsmethods Simple Idea of Data Fitting
    KernelKernel MethodsMethods Simple Idea of Data Fitting Given ( xi,y i) i=1,…,n xi is of dimension d Find the best linear function w (hyperplane) that fits the data Two scenarios y: real, regression y: {-1,1}, classification Two cases n>d, regression, least square n<d, ridge regression New sample: x, < x,w> : best fit (regression), best decision (classification) 2 Primary and Dual There are two ways to formulate the problem: Primary Dual Both provide deep insight into the problem Primary is more traditional Dual leads to newer techniques in SVM and kernel methods 3 Regression 2 w = arg min ∑(yi − wo − ∑ xij w j ) W i j w = arg min (y − Xw )T (y − Xw ) W d(y − Xw )T (y − Xw ) = 0 dw ⇒ XT (y − Xw ) = 0 w = [w , w ,L, w ]T , ⇒ T T o 1 d X Xw = X y L T x = ,1[ x1, , xd ] , T −1 T ⇒ w = (X X) X y y = [y , y ,L, y ]T ) 1 2 n T −1 T xT y =< x (, X X) X y > 1 xT X = 2 M xT 4 n n×xd Graphical Interpretation ) y = Xw = Hy = X(XT X)−1 XT y = X(XT X)−1 XT y d X= n FICA Income X is a n (sample size) by d (dimension of data) matrix w combines the columns of X to best approximate y Combine features (FICA, income, etc.) to decisions (loan) H projects y onto the space spanned by columns of X Simplify the decisions to fit the features 5 Problem #1 n=d, exact solution n>d, least square, (most likely scenarios) When n < d, there are not enough constraints to determine coefficients w uniquely d X= n W 6 Problem #2 If different attributes are highly correlated (income and FICA) The columns become dependent Coefficients
    [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]
  • Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1
    Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1: A directed set I is a set with a partial order ≤ such that for every i; j 2 I there is k 2 I such that i ≤ k and j ≤ k. Let R be a ring. A directed system of R-modules indexed by I is a collection of R modules fMi j i 2 Ig with a R module homomorphisms µi;j : Mi ! Mj for each pair i; j 2 I where i ≤ j, such that (i) for any i 2 I, µi;i = IdMi and (ii) for any i ≤ j ≤ k in I, µi;j ◦ µj;k = µi;k. We shall denote a directed system by a tuple (Mi; µi;j). The direct limit of a directed system is defined using a universal property. It exists and is unique up to a unique isomorphism. Theorem 2 (Direct limits). Let fMi j i 2 Ig be a directed system of R modules then there exists an R module M with the following properties: (i) There are R module homomorphisms µi : Mi ! M for each i 2 I, satisfying µi = µj ◦ µi;j whenever i < j. (ii) If there is an R module N such that there are R module homomorphisms νi : Mi ! N for each i and νi = νj ◦µi;j whenever i < j; then there exists a unique R module homomorphism ν : M ! N, such that νi = ν ◦ µi. The module M is unique in the sense that if there is any other R module M 0 satisfying properties (i) and (ii) then there is a unique R module isomorphism µ0 : M ! M 0.
    [Show full text]
  • LECTURE 12: LIE GROUPS and THEIR LIE ALGEBRAS 1. Lie
    LECTURE 12: LIE GROUPS AND THEIR LIE ALGEBRAS 1. Lie groups Definition 1.1. A Lie group G is a smooth manifold equipped with a group structure so that the group multiplication µ : G × G ! G; (g1; g2) 7! g1 · g2 is a smooth map. Example. Here are some basic examples: • Rn, considered as a group under addition. • R∗ = R − f0g, considered as a group under multiplication. • S1, Considered as a group under multiplication. • Linear Lie groups GL(n; R), SL(n; R), O(n) etc. • If M and N are Lie groups, so is their product M × N. Remarks. (1) (Hilbert's 5th problem, [Gleason and Montgomery-Zippin, 1950's]) Any topological group whose underlying space is a topological manifold is a Lie group. (2) Not every smooth manifold admits a Lie group structure. For example, the only spheres that admit a Lie group structure are S0, S1 and S3; among all the compact 2 dimensional surfaces the only one that admits a Lie group structure is T 2 = S1 × S1. (3) Here are two simple topological constraints for a manifold to be a Lie group: • If G is a Lie group, then TG is a trivial bundle. n { Proof: We identify TeG = R . The vector bundle isomorphism is given by φ : G × TeG ! T G; φ(x; ξ) = (x; dLx(ξ)) • If G is a Lie group, then π1(G) is an abelian group. { Proof: Suppose α1, α2 2 π1(G). Define α : [0; 1] × [0; 1] ! G by α(t1; t2) = α1(t1) · α2(t2). Then along the bottom edge followed by the right edge we have the composition α1 ◦ α2, where ◦ is the product of loops in the fundamental group, while along the left edge followed by the top edge we get α2 ◦ α1.
    [Show full text]