DOCSLIB.ORG

21 Homomorphisms and Normal Subgroups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 21 Homomorphisms and Normal Subgroups Recall that an isomorphism is a function θ : G ¡! H such that θ is one-to-one, onto and such that θ(ab) = θ(a)θ(b) for all a; b 2 G: We shall see that an isomor- phism is simply a special type of function called a group homomorphism. We will also see a relationship between group homomorphisms and normal subgroups. Definition 21.1 A function θ from a group G to a group H is said to be a homomorphism provided that for all a; b 2 G we have that θ(ab) = θ(a)θ(b): If θ : G ¡! H is a one-to-one homomorphism, we call θ a monomorphism and if θ : G ¡! H is an onto homomorphism, then we call θ an epimorphism. Of course, a bijective homomorphism is an isomorphism. Example 21.1 Define θ : ZZ ¡! ZZn by θ(a) = [a]: Then θ(a + b) = [a + b] = [a] © [b] = θ(a) © θ(b); so that θ is a homomorphism. Note that θ(n) = θ(2n) with n 6= 2n so that θ is not one-to-one. However, θ is onto. Example 21.2 Define θ : ZZ ¡! ZZby θ(a) = 2a: Then θ(a + b) = 2(a + b) = 2a + 2b = θ(a) + θ(b); so that θ is a homomorphism. Note that θ is not onto since there is no integer n that satisfies θ(n) = 3: However, θ is one-to-one since θ(n) = θ(m) implies 2n = 2m and this in turn implies that n = m. We have seen that the range of a homomorphism is a subgroup of the codomain. (Theorem 18.2(iv)). The following subset determines a subgroup of the domain of a homomorphism. Definition 21.2 Let θ : G ¡! H be a group homomorphism. Then the kernel of θ is the set Ker θ = fg 2 G : θ(g) = eH g: 1 Example 21.3 In Example 21.1, a 2 Ker θ iff [a] = θ(a) = [0], i.e iff a = nq for some q 2 ZZ > Thus,Ker θ = fnq : q 2 ZZg. In Example 21.2, a 2 Ker θ iff 2a = θ(a) = 0; i.e. iff a = 0: Hence, Ker θ = f0g: As point it out earlier the kernel is a subgroup of the domain. Theorem 21.1 Let θ : G ¡! H be a homomorphism. Then (i) Ker θ is a subgroup of G: (ii) For any x 2 Ker θ and g 2 G we have gxg¡1 2 Ker θ. Proof. (i) By Theorem 18.2(i), θ(eG) = eH so that eG 2 Ker θ. Hence, Ker θ 6= ;: Now, let x; y 2 Ker θ: Then ¡1 ¡1 ¡1 ¡1 θ(xy ) = θ(x)θ(y ) = θ(x)(θ(y)) = eH eH = eH : Thus, xy¡1 2 Ker θ: By Theorem 7.5, Ker θ is a subgroup of G: (ii) Let x 2 Ker θ and g 2 G. Then ¡1 ¡1 ¡1 θ(gxg¡1) = θ(g)θ(x)θ(g ) = θ(g)eH (θ(g)) = θ(g)(θ(g)) = eH : Thus, gxg¡1 2 Ker θ: Theorem 21.1(ii) is one of the common properties that kernels share: They are all normals in the sense of the following definition. Definition 21.3 Let H be a subgroup of a group G: Then H is normal iff ghg¡1 2 H for all g 2 G and h 2 H: We write H / G: Example 21.4 Let H be any subgroup of an Abelian group G: Since hg = gh for all g 2 G and all h 2 H then ghg¡1 = h 2 H for all g 2 G and h 2 H: That is, H / G: Example 21.5 ¡1 Let G = S3 and H =< (12) >= f(1); (12)g: Since (123)(12)(123) = (23) 62 H then H is not a normal subgroup of G: Lemma 21.1 The following statements are equivalent: (i) gng¡1 2 N for all n 2 N and g 2 G; (ii) g¡1ng 2 N for all n 2 N and g 2 G; 2 Proof. (i) ! (ii): Suppose that gng¡1 2 N for all n 2 N and g 2 G: In particular, g¡1n(g¡1)¡1 2 N since g¡1 2 G: But (g¡1)¡1 = g so that g¡1ng 2 N: (ii) ! (i): Suppose that g¡1ng 2 N for all n 2 N and g 2 G: Since (g¡1)¡1 = g then gng¡1 = (g¡1)¡1ng¡1 2 N: The following lemma shows that the homomorphic image of a normal subgroup is normal for onto maps. Lemma 21.2 Let θ : G ! H be an epimorphism and N / G: Then θ(N) / H: Proof. From Theorem 18.2 (iv), we know that θ(N) is a subgroup of H: Let y 2 θ(N) and h 2 H: Then y = θ(x) 2 θ(N) for some x 2 N and h = θ(g) for some g 2 G (since θ is onto). But N/G so that gxg¡1 2 N: Thus, θ(gxg¡1) 2 θ(N): But θ(gxg¡1) = θ(g)θ(x)θ(g¡1) = hyh¡1 2 θ(N): Hence, θ(N) / H: The following theorem describes a commonly used way for testing whether a homomorphism is one-to-one or not. Theorem 21.2 Let θ : G ¡! H be a homomorphism. Then θ is one-to-one if and only if Ker θ = feGg: Proof. Suppose first that θ is one-to-one. Let x 2 Ker θ: Then θ(x) = eH = θ(eG): Hence, x = eG: Thus, Ker θ ⊆ feGg: Since θ(eG) = eH then feGg ⊆ Ker θ: It follows that Ker θ = feGg: Conversely, suppose that Ker θ = feGg: Suppose ¡1 ¡1 ¡1 that θ(x) = θ(y): Then eH = θ(x)(θ(y)) = θ(x)θ(y ) = θ(xy ): Thus, ¡1 ¡1 xy 2 Ker θ. But then xy = eG so that x = y: Review Problems Exercise 21.1 Define θ : ZZ6 ! ZZ3 by θ([a]6) = [a]3: (a) Prove that θ is well-defined. (b) Prove that θ is a homomorphism. (c) Find Ker θ: Exercise 21.2 (a) Prove that θ : ZZ3 ! ZZ3 defined by θ([a]3) = [a]6 is not well-defined. (b) For which pairs m; n is ¯ : ZZn ! ZZm, given by ¯([a]n) = [a]m, well-defined? Exercise 21.3 (a) Prove that every homomorphic image of an Abelian group is Abelian. (b) Prove that every homomorphic image of a cyclic group is cyclic. 3 Exercise 21.4 Let G denote the subgroup f1; ¡1; i; ¡ig of complex numbers (operation multi- plication). Define θ : ZZ ! G by θ(n) = in: Show that θ is a homomorphism and determine Ker θ: Exercise 21.5 There is a unique homomorphism θ : ZZ6 ! S3 such that θ([1]) = (123): Deter- mine θ([k]) for each [k] 2 ZZ6: Which elements are in Ker θ? Exercise 21.6 Prove that N/G if and only if gN = Ng for all g 2 G: Exercise 21.7 Prove that if N is a subgroup of G such that [G : N] = 2 then N / G: Exercise 21.8 Prove that An /Sn for all n ¸ 2: Exercise 21.9 Consider the subgroup H = A3 = f(1); (123); (132)g of S3: Let x = (12) and h = (123): Show that xh 6= hx and xH = Hx: This shows that the equality xH = Hx does not mean that xh = hx for all x 2 G and h 2 H: Exercise 21.10 Prove that if C denote the collection of all normal subgroups of a group G: prove that N = \H2CH is also a normal subgroup of G: Exercise 21.11 Prove that if N/G then for any subgroup H of G, we have H \ N / H: Exercise 21.12 Find all normal subgroups of S3: Exercise 21.13 Let H be a subgroup of G and K/G. (a) Prove that HK is a subgroup of G; where HK = fhk : h 2 H and k 2 Kg: (b) Prove that HK = KH: (c) Prove that K / HK: Exercise 21.14 Prove that if H and K are normal subgroups of G then HK is a normal subgroup of G: Exercise 21.15 Prove that if H and K are normal subgroups of G such that H \ K = feGg then hk = kh for all h 2 H and k 2 K: 4 Exercise 21.16 The center of the group G is defined by Z(G) = fg 2 G : xg = gx8x 2 Gg: Prove that Z(G) / G: Exercise 21.17 Let G and H be groups. Prove that G £ feH g is a normal subgroup of G £ H: Exercise 21.18 Let N be a normal subgroup of G; and let a; b; c; d 2 G: prove that if aN = cN and bN = dN then abN = cdN: Exercise 21.19 Let G be a non-abelian group of order 8. Prove that G has at least one element of order 4. Hence prove that G has a normal cyclic subgroup of order 4. Exercise 21.20 Suppose that θ : G ! H is a homomorphism. Let K = Ker θ and a 2 G: Prove that aK = fx 2 G : θ(x) = θ(a)g: Exercise 21.21 Let S be any set, and let B be any proper subset of S: Let H = fθ 2 Sym(S): θ(B) = Bg: Prove that H is a subgroup of Sym(S) that is not normal.
Recommended publications
  • On Abelian Subgroups of Finitely Generated Metabelian

    On Abelian Subgroups of Finitely Generated Metabelian

    J. Group Theory 16 (2013), 695–705 DOI 10.1515/jgt-2013-0011 © de Gruyter 2013 On abelian subgroups of finitely generated metabelian groups Vahagn H. Mikaelian and Alexander Y. Olshanskii Communicated by John S. Wilson To Professor Gilbert Baumslag to his 80th birthday Abstract. In this note we introduce the class of H-groups (or Hall groups) related to the class of B-groups defined by P. Hall in the 1950s. Establishing some basic properties of Hall groups we use them to obtain results concerning embeddings of abelian groups. In particular, we give an explicit classification of all abelian groups that can occur as subgroups in finitely generated metabelian groups. Hall groups allow us to give a negative answer to G. Baumslag’s conjecture of 1990 on the cardinality of the set of isomorphism classes for abelian subgroups in finitely generated metabelian groups. 1 Introduction The subject of our note goes back to the paper of P. Hall [7], which established the properties of abelian normal subgroups in finitely generated metabelian and abelian-by-polycyclic groups. Let B be the class of all abelian groups B, where B is an abelian normal subgroup of some finitely generated group G with polycyclic quotient G=B. It is proved in [7, Lemmas 8 and 5.2] that B H, where the class H of countable abelian groups can be defined as follows (in the present paper, we will call the groups from H Hall groups). By definition, H H if 2 (1) H is a (finite or) countable abelian group, (2) H T K; where T is a bounded torsion group (i.e., the orders of all ele- D ˚ ments in T are bounded), K is torsion-free, (3) K has a free abelian subgroup F such that K=F is a torsion group with trivial p-subgroups for all primes except for the members of a finite set .K/.
  • On Finite Groups Whose Every Proper Normal Subgroup Is a Union

    On Finite Groups Whose Every Proper Normal Subgroup Is a Union

    Proc. Indian Acad. Sci. (Math. Sci.) Vol. 114, No. 3, August 2004, pp. 217–224. © Printed in India On finite groups whose every proper normal subgroup is a union of a given number of conjugacy classes ALI REZA ASHRAFI and GEETHA VENKATARAMAN∗ Department of Mathematics, University of Kashan, Kashan, Iran ∗Department of Mathematics and Mathematical Sciences Foundation, St. Stephen’s College, Delhi 110 007, India E-mail: ashrafi@kashanu.ac.ir; geetha [email protected] MS received 19 June 2002; revised 26 March 2004 Abstract. Let G be a finite group and A be a normal subgroup of G. We denote by ncc.A/ the number of G-conjugacy classes of A and A is called n-decomposable, if ncc.A/ = n. Set KG ={ncc.A/|A CG}. Let X be a non-empty subset of positive integers. A group G is called X-decomposable, if KG = X. Ashrafi and his co-authors [1–5] have characterized the X-decomposable non-perfect finite groups for X ={1;n} and n ≤ 10. In this paper, we continue this problem and investigate the structure of X-decomposable non-perfect finite groups, for X = {1; 2; 3}. We prove that such a group is isomorphic to Z6;D8;Q8;S4, SmallGroup(20, 3), SmallGroup(24, 3), where SmallGroup.m; n/ denotes the mth group of order n in the small group library of GAP [11]. Keywords. Finite group; n-decomposable subgroup; conjugacy class; X-decompo- sable group. 1. Introduction and preliminaries Let G be a finite group and let NG be the set of proper normal subgroups of G.
  • Group Homomorphisms

    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.
  • Categories of Sets with a Group Action

    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.
  • Mathematics 310 Examination 1 Answers 1. (10 Points) Let G Be A

    Mathematics 310 Examination 1 Answers 1. (10 Points) Let G Be A

    Mathematics 310 Examination 1 Answers 1. (10 points) Let G be a group, and let x be an element of G. Finish the following definition: The order of x is ... Answer: . the smallest positive integer n so that xn = e. 2. (10 points) State Lagrange’s Theorem. Answer: If G is a finite group, and H is a subgroup of G, then o(H)|o(G). 3. (10 points) Let ( a 0! ) H = : a, b ∈ Z, ab 6= 0 . 0 b Is H a group with the binary operation of matrix multiplication? Be sure to explain your answer fully. 2 0! 1/2 0 ! Answer: This is not a group. The inverse of the matrix is , which is not 0 2 0 1/2 in H. 4. (20 points) Suppose that G1 and G2 are groups, and φ : G1 → G2 is a homomorphism. (a) Recall that we defined φ(G1) = {φ(g1): g1 ∈ G1}. Show that φ(G1) is a subgroup of G2. −1 (b) Suppose that H2 is a subgroup of G2. Recall that we defined φ (H2) = {g1 ∈ G1 : −1 φ(g1) ∈ H2}. Prove that φ (H2) is a subgroup of G1. Answer:(a) Pick x, y ∈ φ(G1). Then we can write x = φ(a) and y = φ(b), with a, b ∈ G1. Because G1 is closed under the group operation, we know that ab ∈ G1. Because φ is a homomorphism, we know that xy = φ(a)φ(b) = φ(ab), and therefore xy ∈ φ(G1). That shows that φ(G1) is closed under the group operation.
  • The General Linear Group

    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.
  • Math 412. Simple Groups

    Math 412. Simple Groups

    Math 412. Simple Groups DEFINITION: A group G is simple if its only normal subgroups are feg and G. Simple groups are rare among all groups in the same way that prime numbers are rare among all integers. The smallest non-abelian group is A5, which has order 60. THEOREM 8.25: A abelian group is simple if and only if it is finite of prime order. THEOREM: The Alternating Groups An where n ≥ 5 are simple. The simple groups are the building blocks of all groups, in a sense similar to how all integers are built from the prime numbers. One of the greatest mathematical achievements of the Twentieth Century was a classification of all the finite simple groups. These are recorded in the Atlas of Simple Groups. The mathematician who discovered the last-to-be-discovered finite simple group is right here in our own department: Professor Bob Greiss. This simple group is called the monster group because its order is so big—approximately 8 × 1053. Because we have classified all the finite simple groups, and we know how to put them together to form arbitrary groups, we essentially understand the structure of every finite group. It is difficult, in general, to tell whether a given group G is simple or not. Just like determining whether a given (large) integer is prime, there is an algorithm to check but it may take an unreasonable amount of time to run. A. WARM UP. Find proper non-trivial normal subgroups of the following groups: Z, Z35, GL5(Q), S17, D100.
  • Självständiga Arbeten I Matematik

    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 .
  • Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L

    Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L

    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 96, Number 2, February 1986 NORMAL SUBGROUPS OF THE GENERAL LINEAR GROUPS OVER VON NEUMANN REGULAR RINGS L. N. VASERSTEIN1 ABSTRACT. Let A be a von Neumann regular ring or, more generally, let A be an associative ring with 1 whose reduction modulo its Jacobson radical is von Neumann regular. We obtain a complete description of all subgroups of GLn A, n > 3, which are normalized by elementary matrices. 1. Introduction. For any associative ring A with 1 and any natural number n, let GLn A be the group of invertible n by n matrices over A and EnA the subgroup generated by all elementary matrices x1'3, where 1 < i / j < n and x E A. In this paper we describe all subgroups of GLn A normalized by EnA for any von Neumann regular A, provided n > 3. Our description is standard (see Bass [1] and Vaserstein [14, 16]): a subgroup H of GL„ A is normalized by EnA if and only if H is of level B for an ideal B of A, i.e. E„(A, B) C H C Gn(A, B). Here Gn(A, B) is the inverse image of the center of GL„(,4/S) (when n > 2, this center consists of scalar invertible matrices over the center of the ring A/B) under the canonical homomorphism GL„ A —►GLn(A/B) and En(A, B) is the normal subgroup of EnA generated by all elementary matrices in Gn(A, B) (when n > 3, the group En(A, B) is generated by matrices of the form (—y)J'lx1'Jy:i''1 with x € B,y £ A,l < i ^ j < n, see [14]).
  • Variational Problems on Flows of Diffeomorphisms for Image Matching

    Variational Problems on Flows of Diffeomorphisms for Image Matching

    QUARTERLY OF APPLIED MATHEMATICS VOLUME LVI, NUMBER 3 SEPTEMBER 1998, PAGES 587-600 VARIATIONAL PROBLEMS ON FLOWS OF DIFFEOMORPHISMS FOR IMAGE MATCHING By PAUL DUPUIS (LCDS, Division of Applied Mathematics, Brown University, Providence, RI), ULF GRENANDER (Division of Applied Mathematics, Brown University, Providence, Rl), AND MICHAEL I. MILLER (Dept. of Electrical Engineering, Washington University, St. Louis, MO) Abstract. This paper studies a variational formulation of the image matching prob- lem. We consider a scenario in which a canonical representative image T is to be carried via a smooth change of variable into an image that is intended to provide a good fit to the observed data. The images are all defined on an open bounded set GcR3, The changes of variable are determined as solutions of the nonlinear Eulerian transport equation ==v(rj(s;x),s), r)(t;x)=x, (0.1) with the location 77(0;x) in the canonical image carried to the location x in the deformed image. The variational problem then takes the form arg mm ;||2 + [ |Tor?(0;a;) - D(x)\2dx (0.2) JG where ||v|| is an appropriate norm on the velocity field v(-, •), and the second term at- tempts to enforce fidelity to the data. In this paper we derive conditions under which the variational problem described above is well posed. The key issue is the choice of the norm. Conditions are formulated under which the regularity of v(-, ■) imposed by finiteness of the norm guarantees that the associated flow is supported on a space of diffeomorphisms. The problem (0.2) can Received March 15, 1996.
  • LECTURE 12: LIE GROUPS and THEIR LIE ALGEBRAS 1. Lie

    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.
  • Solutions to Exercises for Mathematics 205A

    Solutions to Exercises for Mathematics 205A

    SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A | Part 6 Fall 2008 APPENDICES Appendix A : Topological groups (Munkres, Supplementary exercises following $ 22; see also course notes, Appendix D) Problems from Munkres, x 30, pp. 194 − 195 Munkres, x 26, pp. 170{172: 12, 13 Munkres, x 30, pp. 194{195: 18 Munkres, x 31, pp. 199{200: 8 Munkres, x 33, pp. 212{214: 10 Solutions for these problems will not be given. Additional exercises Notation. Let F be the real or complex numbers. Within the matrix group GL(n; F) there are certain subgroups of particular importance. One such subgroup is the special linear group SL(n; F) of all matrices of determinant 1. 0. Prove that the group SL(2; C) has no nontrivial proper normal subgroups except for the subgroup { Ig. [Hint: If N is a normal subgroup, show first that if A 2 N then N contains all matrices that are similar to A. Therefore the proof reduces to considering normal subgroups containing a Jordan form matrix of one of the following two types: α 0 " 1 ; 0 α−1 0 " Here α is a complex number not equal to 0 or 1 and " = 1. The idea is to show that if N contains one of these Jordan forms then it contains all such forms, and this is done by computing sufficiently many matrix products. Trial and error is a good way to approach this aspect of the problem.] SOLUTION. We shall follow the steps indicated in the hint. If N is a normal subgroup of SL(2; C) and A 2 N then N contains all matrices that are similar to A.