Review: Review: 'pgq imgp'q th P H h 'pgq for some g P Gu H; kerp'q tg P G 'pgq 1 H u G.
|
|
- Shawn Bryan
- 5 years ago
- Views:
Transcription
1 Review: A homomorphism is a map ' : G Ñ H between groups satisfying 'pg 1 g 2 q 'pg 1 q'pg 2 q for all g 1,g 2 P G. Anisomorphism is homomorphism that is also a bijection. We showed that for any homomorphism ' : G Ñ H, the image and the kernel of the map are subgroups of H and G, respectively: 'pgq imgp'q th P H h 'pgq for some g P Gu H; kerp'q tg P G 'pgq 1 H u G. To check if H Ñ G is a subgroup, (1) check that H contains at least one element; and (2) show that for any x, y P H, you also have that xy 1 P H. (Subgroup criterion) Review: Let A be a non-empty subset of G (not nec. subgroup). The centralizer of A in G is C G paq tg P G gag 1 a for all a P Au. Since gag 1 a Ø ga ag this is the set of elements which commute with all a in A. If A tau, wewritec G ptauq C G paq. Theorem For any non-empty A Ñ G, C A pgq is a subgroup of G. The center of a group G, denoted ZpGq, is the set of elements which commute with everything in G, i.e.zpgq C G pgq. So ZpGq is a subgroup of G of C G paq for all A Ñ G.
2 More special subgroups Let A Ñ G, andfixg P G. Thendefine ga th P G h ga for some a P Au, Ag th P G h ag for some a P Au, and gag 1 th P G h gag 1 for some a P Au. The normalizer of A in G is the set N G paq tg P G gag 1 Au tg P G ga Agu. Think: The centralizer is the set of g P G that point-wise fixes A by conjugation, whereas the normalizer is the set of g P G that set-wise fixes A by conjugation. Theorem. For any A Ñ G, thenormalizern G paq is a subgroup of G. Moreover, ZpGq C G paq N G paq G.
3 From last time, conjugation in D 6 looks like y Ñ xyx 1 1 r r 2 s sr sr r r 2 s sr sr 2 Ò x Ó r 1 r r 2 sr sr 2 s r 2 1 r r 2 sr 2 s sr s 1 r 2 r s sr 2 sr sr 1 r 2 r sr 2 sr s sr 2 1 r 2 r sr s sr 2
4 Conjugation in D 8 looks like y Ñ xyx 1 1 r r 2 r 3 s sr sr 2 sr r r 2 r 3 s sr sr 2 sr 3 r 1 r r 2 r 3 sr 2 sr 3 s sr Ò x Ó r 2 1 r r 2 r 3 s sr sr 2 sr 3 r 3 1 r r 2 r 3 sr 2 sr 3 s sr s 1 r 3 r 2 r s sr 3 sr 2 sr sr 1 r 3 r 2 r sr 2 sr s sr 3 sr 2 1 r 3 r 2 r s sr 3 sr 2 sr sr 3 1 r 3 r 2 r sr 2 sr s sr 3
5 Computing C G paq, ZpGq, and N G paq C G paq tg P G ga ag for all a P Au. ZpGq tg P G gh hg for all h P gu. C G paq tg P G ga Agu. Shortcut: If g commutes with everything in a subset A ta 1,a 2,...,a m u Ñ G, theng commutes with any word a 1 i a 1 1 i a 1 2, where a ij P A. i` So C G paq C G pxayq and N G paq N G pxayq. For example, if S generates G, thenc G psq ZpGq. Conversely, if g 1,g 2,...,g` are all contained in C G paq, ZpGq, or N G paq, thensoeverywordinxg 1,g 2,...,g`y. Example: C D2n pr 2 q, for n 3. First, rpr 2 q pr 2 qr, so xry Ñ C D2n pr 2 q. On the other hand, sr 2 r 2 s r n 2 s, which is r 2 s if and only if n 4. So we have one of the following: 1. If n 4, thens, r P C D8 pr 2 q. So xs, ry C D8 pr 2 q. But xs, ry D 8. So D 8 C D8 pr 2 q. 2. If n 4, thens R C r 2pD 2n q, Moreover, psr m qr 2 r 2 psr m q r n 2 psr m q r 2 psr m q. Since every element of D 2n can be written as r m or sr m for some 0 m n 1, wehave C D2n pr 2 q xry t1,r,r 2,...,r n 1 u.
6 Example: ZpD 2n q, n 3. Relevant facts are (1) the dihedral group D 2n is generated by ts, ru, and (2) every element of D 2n can be written as r m or sr m for some 0 m n 1. So we need to compute for which m do we have piq pr m qs spr m q and rpr m q pr m qr, and for which m do we have piiq psr m qs spsr m q and rpsr m q psr m qr. Both in (i) are satisfied exactly when r m r m ( r n m ), i.e. when m n m, sothatm n{2. For (ii), the second condition always fails, since rpsr m q sr m 1 and n 3. So ZpD 2n q # t1u t1,r n{2 u if n is odd, if n is even.
7 More examples (1) If G is abelian, then ZpGq G, C G paq G, N G paq G, for all A Ñ G. (2) We saw in G D 8, ZpGq t1,r 2 u,andfora t1,r,r 2,r 3 u, C G paq A and N G paq G. (3) Claim: in G S n,ifa tpijq 1 1 j nu, then C G paq 1 and N G paq G. Tips for computing 1 : Fact 1: If pa 1 a 2 a m q is a cycle in S n,then pa 1 a 2 a m q 1 p pa 1 q pa 2 q pa m qq. Fact 2: If has cycle decomposition c 1 c 2 c r,then 1 p c 1 1 qp c 1 2 q p c 1 r q. Definition: the cycle type of a permutation is the list (in increasing order) of the cycle lengths in the cycle decomposition of. (More later in Section 4.3) For example, in S 7, the cycle type of p152qp34q is 1, 1, 2, 3.
8 Mathematical aside: morphisms in general In general in math, a (homo)morphism is just a map from one mathematical object to another of its own kind, which obeys the same rules ( structure-preserving ). (Look up category theory if you ever want to feel like you re doing all math, ever, all at once) Examples: 1. We just defined homomorphisms of groups 2. Linear transformations are morphisms of vector spaces 3. Any map from one set to another is a morphism of sets (no rules!) HompX, Y q t' : X Ñ Y ' is structure-preservingu Endomorphisms are morphisms from something to itself. EndpXq HompX, Xq t' : X Ñ Xu Isomorphisms are bijective morphisms. Automorphisms are bijective endomorphisms. AutpXq t' : X Ø Xu Group actions Goal: Build automorphisms of sets (permutations) by using groups. Fact: AutpAq S A for a set A. Examples we already know: 1. The dihedral group permutes the set of symmetric states a regular n-gon can occupy. 2. The symmetric group S X permutes the objects of X. 3. The invertible matrices permute vectors in a vector space. 4. The symmetric group S n can also move vectors in R n around via permutation matrices. (Recall representations) Basically, if A is the set we re permuting, then the goal is to find homomorphisms from G into S A.
9 Group actions: new language, same idea. A group action of a group G on a set A is a map from G ˆ A pg, aq Ñ A fiñ g a that satisfies g ph aq pghq a and 1 a a (structure preserving) for all g, h P G, a P A. We say G acts on A, denoted G ü A.
10 Two dihedral examples: (1) The dihedral group D 8 acts on r4s t1, 2, 3, 4u as follows: Label the vertices of the square. For g P D 8,let g be the permutation given by g piq is the vertex appearing in i s place after applying the symmetry g r p1234q 2 1 r 2 p13qp24q 3 2 r 3 p1432q s p12qp34q 4 1 rs p13q 1 2 r 2 s p14qp23q 2 3 r 3 s p24q (2) Now consider the induced action on size two subsets of r4s. t1, 2u t1, 3u t1, 4u t2, 3u t2, 4u t3, 4u 1 t1, 2u t1, 3u t1, 4u t2, 3u t2, 4u t3, 4u r t2, 3u t2, 4u t1, 2u t3, 4u t1, 3u t1.4u r 2 t3, 4u t1, 3u t2, 3u t1, 4u t2, 4u t1, 2u r 3 t1, 4u t2, 4u t3, 4u t1, 2u t1, 3u t2, 3u s t1, 2u t2, 4u t2, 3u t1, 4u t1, 3u t3, 4u sr t1, 4u t1, 3u t1, 2u t3, 4u t2, 4u t2, 3u sr 2 t3, 4u t2, 4u t1, 4u t2, 3u t1, 3u t1, 2u sr 3 t2, 3u t1, 3u t3, 4u t1, 2u t2, 4u t1, 4u
11 New vocabulary for old examples: 1. The dihedral group acts on the set of symmetric states a regular n-gon can occupy by rotations and flips. 2. The symmetric group S X acts on X by permutation. 3. The invertible matrices act on vector spaces. 4. The symmetric group S n also acts on R n by permutation matrices. More examples: 1. Rˆ acts on R n by scaling: x pv 1,v 2,...,v n q pxv 1,xv 2,...,xv n q. 2. Any group G acts on itself (let A G) inseveralways: left regular action: g a ga right multiplication: g a ag 1 conjugation: g a gag 1 Note: The way we ve been writing the action (g a) iscalleda left action. Sometimes it can be better to write a g means g is acting from the right. The right regular action is a g ag. (Di erent from the left action of right multiplication!)
For example, p12q p2x 1 x 2 ` 5x 2 x 2 3 q 2x 2 x 1 ` 5x 1 x 2 3. (a) Let p 12x 5 1x 7 2x 4 18x 6 2x 3 ` 11x 1 x 2 x 3 x 4,
SOLUTIONS Math A4900 Homework 5 10/4/2017 1. (DF 2.2.12(a)-(d)+) Symmetric polynomials. The group S n acts on the set tx 1, x 2,..., x n u by σ x i x σpiq. That action extends to a function S n ˆ A Ñ A,
More information(Think: three copies of C) i j = k = j i, j k = i = k j, k i = j = i k.
Warm-up: The quaternion group, denoted Q 8, is the set {1, 1, i, i, j, j, k, k} with product given by 1 a = a 1 = a a Q 8, ( 1) ( 1) = 1, i 2 = j 2 = k 2 = 1, ( 1) a = a ( 1) = a a Q 8, (Think: three copies
More informationLecture 6 Special Subgroups
Lecture 6 Special Subgroups Review: Recall, for any homomorphism ϕ : G H, the kernel of ϕ is and the image of ϕ is ker(ϕ) = {g G ϕ(g) = e H } G img(ϕ) = {h H ϕ(g) = h for some g G} H. (They are subgroups
More informationLast time: Recall that the fibers of a map ϕ : X Ñ Y are the sets in ϕ 1 pyq Ď X which all map to the same element y P Y.
Last time: Recall that the fibers of a map ϕ : X Ñ Y are the sets in ϕ 1 pyq Ď X which all map to the same element y P Y. Last time: Recall that the fibers of a map ϕ : X Ñ Y are the sets in ϕ 1 pyq Ď
More informationwe can assume without loss of generality that x and y are of the form x pabcq and y pbcdq,
1. Symmetric and alternating groups. SOLUTIONS Math A4900 Homework 9 11/1/2017 (a) In class we showed that S n is generated by T tpi jq 1 ď i ă j ď nu, the set of transpositions in S n. Show by induction
More informationLast time: Cyclic groups. Proposition
Warmup Recall, a group H is cyclic if H can be generated by a single element. In other words, there is some element x P H for which Multiplicative notation: H tx` ` P Zu xxy, Additive notation: H t`x `
More informationProblem Set #7. Exercise 1 : In GLpn, Cq and SLpn, Cq define the subgroups of scalar matrices
Dr. Marques Sophie Algebra Spring Semester 207 Office 59 marques@cims.nyu.edu Problem Set #7 In the following, denotes a isomorphism of groups. Exercise 0 : Let G be a finite abelian group with G n, we
More informationHOMEWORK 4 MATH B4900 DUE: 2/28/ Annihilators. Let R be a ring with 1, and let M be an R-module. The annihilator of M in R is
HOMEWORK 4 MATH B4900 DUE: 2/28/2018 SOLUTIONS Math B4900 Homework 4 2/28/2018 1. Annihilators. Let R be a ring with 1, and let M be an R-module. The annihilator of M in R is (a) Show that AnnpMq is an
More informationLecture 7 Cyclic groups and subgroups
Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:
More informationLecture 24 Properties of deals
Lecture 24 Properties of deals Aside: Representation theory of finite groups Let G be a finite group, and let R C, R, or Q (any commutative ring). Aside: Representation theory of finite groups Let G be
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationExam 1 Solutions. Solution: The 16 contributes 5 to the total and contributes 2. All totaled, there are 5 ˆ 2 10 abelian groups.
Math 5372 Spring 2014 Exam 1 Solutions 1. (15 points) How many abelian groups are there of order: (a) 16 For any prime p, there are as many groups of order p k as there are partitions of k. The number
More informationLecture 3. Theorem 1: D 6
Lecture 3 This week we have a longer section on homomorphisms and isomorphisms and start formally working with subgroups even though we have been using them in Chapter 1. First, let s finish what was claimed
More informationIIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1
IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1 Let Σ be the set of all symmetries of the plane Π. 1. Give examples of s, t Σ such that st ts. 2. If s, t Σ agree on three non-collinear points, then
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #3. Fill in the blanks as we finish our first pass on prerequisites of group theory.
MATH 101: ALGEBRA I WORKSHEET, DAY #3 Fill in the blanks as we finish our first pass on prerequisites of group theory 1 Subgroups, cosets Let G be a group Recall that a subgroup H G is a subset that is
More informationJohns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm
Johns Hopkins University, Department of Mathematics 110.401 Abstract Algebra - Spring 2009 Midterm Instructions: This exam has 8 pages. No calculators, books or notes allowed. You must answer the first
More informationSolutions to Assignment 4
1. Let G be a finite, abelian group written additively. Let x = g G g, and let G 2 be the subgroup of G defined by G 2 = {g G 2g = 0}. (a) Show that x = g G 2 g. (b) Show that x = 0 if G 2 = 2. If G 2
More informationMath 3140 Fall 2012 Assignment #4
Math 3140 Fall 2012 Assignment #4 Due Fri., Sept. 28. Remember to cite your sources, including the people you talk to. In this problem set, we use the notation gcd {a, b} for the greatest common divisor
More informationMath 210B:Algebra, Homework 2
Math 210B:Algebra, Homework 2 Ian Coley January 21, 2014 Problem 1. Is f = 2X 5 6X + 6 irreducible in Z[X], (S 1 Z)[X], for S = {2 n, n 0}, Q[X], R[X], C[X]? To begin, note that 2 divides all coefficients
More informationSUPPLEMENT ON THE SYMMETRIC GROUP
SUPPLEMENT ON THE SYMMETRIC GROUP RUSS WOODROOFE I presented a couple of aspects of the theory of the symmetric group S n differently than what is in Herstein. These notes will sketch this material. You
More informationWarmup Recall, a group H is cyclic if H can be generated by a single element. In other words, there is some element x P H for which Multiplicative
Warmup Recall, a group H is cyclic if H can be generated by a single element. In other words, there is some element x P H for which Multiplicative notation: H tx l l P Zu xxy, Additive notation: H tlx
More informationYale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions
Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope
More informationProblem 1.1. Classify all groups of order 385 up to isomorphism.
Math 504: Modern Algebra, Fall Quarter 2017 Jarod Alper Midterm Solutions Problem 1.1. Classify all groups of order 385 up to isomorphism. Solution: Let G be a group of order 385. Factor 385 as 385 = 5
More informationProposition (D& F, Thm )
Proposition (D& F, Thm 10.5.33) Let Q be an R-module. The following are equivalent. (1) If 0 ãñ A ' Ñ B Ñ C Ñ 0 is exact, then so is 0 ãñ Hom R pc, Qq Ñ '1 1 Hom R pb,qq Ñ Hom R pa, Qq Ñ0. (2) For any
More information1. Linear algebra is fussy but super useful. 2. Instead of studying an algebra A all at once, study its representations/modules!
BIG LESSONS SO FAR 1. Linear algebra is fuss but super useful. 2. Instead of studing an algebra A all at once, stud its representations/modules! (If ou re luck, A is semisimple, and is thus the direct
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationPRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.
PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.
More informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationAlgebra homework 6 Homomorphisms, isomorphisms
MATH-UA.343.005 T.A. Louis Guigo Algebra homework 6 Homomorphisms, isomorphisms Exercise 1. Show that the following maps are group homomorphisms and compute their kernels. (a f : (R, (GL 2 (R, given by
More informationGroup Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying:
Group Actions 8-26-202 Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: (a) θ(g,θ(g 2,x)) = θ(g g 2,x) for all g,g 2 G and x X. (b) θ(,x) =
More informationMath 594. Solutions 5
Math 594. Solutions 5 Book problems 6.1: 7. Prove that subgroups and quotient groups of nilpotent groups are nilpotent (your proof should work for infinite groups). Give an example of a group G which possesses
More informationReview++ of linear algebra continues
Review++ of linear algebra continues Recall a matrix A P M m,n pf q is an array 1 1 2 1 1 n A p j i q 1 2 2 2 2 n...... 1 m n m This encodes a map ' P HompF n,f m q via the images of basis vectors of F
More information1 Chapter 6 - Exercise 1.8.cf
1 CHAPTER 6 - EXERCISE 1.8.CF 1 1 Chapter 6 - Exercise 1.8.cf Determine 1 The Class Equation of the dihedral group D 5. Note first that D 5 = 10 = 5 2. Hence every conjugacy class will have order 1, 2
More informationMath 451, 01, Exam #2 Answer Key
Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement
More informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationMATH 436 Notes: Cyclic groups and Invariant Subgroups.
MATH 436 Notes: Cyclic groups and Invariant Subgroups. Jonathan Pakianathan September 30, 2003 1 Cyclic Groups Now that we have enough basic tools, let us go back and study the structure of cyclic groups.
More informationCosets, factor groups, direct products, homomorphisms, isomorphisms
Cosets, factor groups, direct products, homomorphisms, isomorphisms Sergei Silvestrov Spring term 2011, Lecture 11 Contents of the lecture Cosets and the theorem of Lagrange. Direct products and finitely
More informationElements of solution for Homework 5
Elements of solution for Homework 5 General remarks How to use the First Isomorphism Theorem A standard way to prove statements of the form G/H is isomorphic to Γ is to construct a homomorphism ϕ : G Γ
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationBASIC GROUP THEORY : G G G,
BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e
More informationMath 3140 Fall 2012 Assignment #3
Math 3140 Fall 2012 Assignment #3 Due Fri., Sept. 21. Remember to cite your sources, including the people you talk to. My solutions will repeatedly use the following proposition from class: Proposition
More informationbook 2005/1/23 20:41 page 132 #146
book 2005/1/23 20:41 page 132 #146 132 2. BASIC THEORY OF GROUPS Definition 2.6.16. Let a and b be elements of a group G. We say that b is conjugate to a if there is a g G such that b = gag 1. You are
More informationHodge Structures. October 8, A few examples of symmetric spaces
Hodge Structures October 8, 2013 1 A few examples of symmetric spaces The upper half-plane H is the quotient of SL 2 (R) by its maximal compact subgroup SO(2). More generally, Siegel upper-half space H
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More information1. Examples. We did most of the following in class in passing. Now compile all that data.
SOLUTIONS Math A4900 Homework 12 11/22/2017 1. Examples. We did most of the following in class in passing. Now compile all that data. (a) Favorite examples: Let R tr, Z, Z{3Z, Z{6Z, M 2 prq, Rrxs, Zrxs,
More informationLast time: isomorphism theorems. Let G be a group. 1. If ϕ : G Ñ H is a homomorphism of groups, then kerpϕq IJ G and
Last time: isomorphism theorems Let G be a group. 1. If ϕ : G Ñ H is a homomorphism of groups, then kerpϕq IJ G and G{kerpϕq ϕpgq. Last time: isomorphism theorems Let G be a group. 1. If ϕ : G Ñ H is a
More informationExample. The sequence defined by the function. a : Z 0 Ñ Q defined by n fiñ 1{n
Sequences A sequence is a function a from a subset of the set of integers (usually Z 0 or Z 0 )toasets, a : Z 0 Ñ S or a : Z 0 Ñ S. We write a n apnq, andcalla n the nth term of the sequence. Example The
More informationMath 120: Homework 2 Solutions
Math 120: Homework 2 Solutions October 12, 2018 Problem 1.2 # 9. Let G be the group of rigid motions of the tetrahedron. Show that G = 12. Solution. Let us label the vertices of the tetrahedron 1, 2, 3,
More information17 More Groups, Lagrange s Theorem and Direct Products
7 More Groups, Lagrange s Theorem and Direct Products We consider several ways to produce groups. 7. The Dihedral Group The dihedral group D n is a nonabelian group. This is the set of symmetries of a
More informationNESTED SYMMETRIC REPRESENTATION OF ELEMENTS OF THE SUZUKI CHAIN GROUPS
IJMMS 2003:62, 3931 3948 PII. S0161171203212023 http://ijmms.hindawi.com Hindawi Publishing Corp. NESTED SYMMETRIC REPRESENTATION OF ELEMENTS OF THE SUZUKI CHAIN GROUPS MOHAMED SAYED Received 2 December
More informationφ(a + b) = φ(a) + φ(b) φ(a b) = φ(a) φ(b),
16. Ring Homomorphisms and Ideals efinition 16.1. Let φ: R S be a function between two rings. We say that φ is a ring homomorphism if for every a and b R, and in addition φ(1) = 1. φ(a + b) = φ(a) + φ(b)
More informationMath 581 Problem Set 7 Solutions
Math 581 Problem Set 7 Solutions 1. Let f(x) Q[x] be a polynomial. A ring isomorphism φ : R R is called an automorphism. (a) Let φ : C C be a ring homomorphism so that φ(a) = a for all a Q. Prove that
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationAPPROXIMATE HOMOMORPHISMS BETWEEN THE BOOLEAN CUBE AND GROUPS OF PRIME ORDER
APPROXIMATE HOMOMORPHISMS BETWEEN THE BOOLEAN CUBE AND GROUPS OF PRIME ORDER TOM SANDERS The purpose of this note is to highlight a question raised by Shachar Lovett [Lov], and to offer some motivation
More informationLecture 15: The Hidden Subgroup Problem
CS 880: Quantum Information Processing 10/7/2010 Lecture 15: The Hidden Subgroup Problem Instructor: Dieter van Melkebeek Scribe: Hesam Dashti The Hidden Subgroup Problem is a particular type of symmetry
More informationIntroduction to Groups
Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)
More informationFunctions. Ex. f : R 0 Ñ R 0 defined by x fiñ x 2.
Functions Let f : X Ñ Y be a function. Recall, the image of f is fpxq ty P Y fpxq y for some x P Xu. Further, f is... injective if at most one x P X maps to each y P Y,i.e. if fpx q fpx q then x x. Ex.
More informationAlgebra Qualifying Exam Solutions January 18, 2008 Nick Gurski 0 A B C 0
1. Show that if B, C are flat and Algebra Qualifying Exam Solutions January 18, 2008 Nick Gurski 0 A B C 0 is exact, then A is flat as well. Show that the same holds for projectivity, but not for injectivity.
More informationGroup Theory
Group Theory 2014 2015 Solutions to the exam of 4 November 2014 13 November 2014 Question 1 (a) For every number n in the set {1, 2,..., 2013} there is exactly one transposition (n n + 1) in σ, so σ is
More informationTheorems and Definitions in Group Theory
Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3
More informationMath 3140 Fall 2012 Assignment #2
Math 3140 Fall 2012 Assignment #2 Due Fri., Sept. 14. sources. Remember to cite your Exercise 2. [Fra, 4, #9]. Let U be the set of complex numbers of absolute value 1. (a) Show that U is a group under
More informationTeddy Einstein Math 4320
Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective
More informationGroups. Chapter 1. If ab = ba for all a, b G we call the group commutative.
Chapter 1 Groups A group G is a set of objects { a, b, c, } (not necessarily countable) together with a binary operation which associates with any ordered pair of elements a, b in G a third element ab
More informationFix(g). Orb(x) i=1. O i G. i=1. O i. i=1 x O i. = n G
Math 761 Fall 2015 Homework 4 Drew Armstrong Problem 1 Burnside s Lemma Let X be a G-set and for all g G define the set Fix(g : {x X : g(x x} X (a If G and X are finite, prove that Fix(g Stab(x g G x X
More informationQuiz 2 Practice Problems
Quiz 2 Practice Problems Math 332, Spring 2010 Isomorphisms and Automorphisms 1. Let C be the group of complex numbers under the operation of addition, and define a function ϕ: C C by ϕ(a + bi) = a bi.
More informationSolutions I.N. Herstein- Second Edition
Solutions I.N. Herstein- Second Edition Sadiah Zahoor 25, July 2016 Please email me if any corrections at sadiahzahoor@cantab.net. Problem 0.1. In the following determine whether the systems described
More informationMATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4
MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts
More informationMath 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I.
Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I. 24. We basically know already that groups of order p 2 are abelian. Indeed, p-groups have non-trivial
More informationAssigment 1. 1 a b. 0 1 c A B = (A B) (B A). 3. In each case, determine whether G is a group with the given operation.
1. Show that the set G = multiplication. Assigment 1 1 a b 0 1 c a, b, c R 0 0 1 is a group under matrix 2. Let U be a set and G = {A A U}. Show that G ia an abelian group under the operation defined by
More informationGROUPS AND THEIR REPRESENTATIONS. 1. introduction
GROUPS AND THEIR REPRESENTATIONS KAREN E. SMITH 1. introduction Representation theory is the study of the concrete ways in which abstract groups can be realized as groups of rigid transformations of R
More information(d) Since we can think of isometries of a regular 2n-gon as invertible linear operators on R 2, we get a 2-dimensional representation of G for
Solutions to Homework #7 0. Prove that [S n, S n ] = A n for every n 2 (where A n is the alternating group). Solution: Since [f, g] = f 1 g 1 fg is an even permutation for all f, g S n and since A n is
More informationExercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups
Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). Plans until Eastern vacations: In the book the group theory included in the curriculum
More informationCOURSE SUMMARY FOR MATH 504, FALL QUARTER : MODERN ALGEBRA
COURSE SUMMARY FOR MATH 504, FALL QUARTER 2017-8: MODERN ALGEBRA JAROD ALPER Week 1, Sept 27, 29: Introduction to Groups Lecture 1: Introduction to groups. Defined a group and discussed basic properties
More informationFall /29/18 Time Limit: 75 Minutes
Math 411: Abstract Algebra Fall 2018 Midterm 10/29/18 Time Limit: 75 Minutes Name (Print): Solutions JHU-ID: This exam contains 8 pages (including this cover page) and 6 problems. Check to see if any pages
More information1.1 Definition. A monoid is a set M together with a map. 1.3 Definition. A monoid is commutative if x y = y x for all x, y M.
1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M M M, (x, y) x y such that (i) (x y) z = x (y z) x, y, z M (associativity); (ii) e M such that x e = e x = x for all x M (e
More informationREU 2007 Discrete Math Lecture 2
REU 2007 Discrete Math Lecture 2 Instructor: László Babai Scribe: Shawn Drenning June 19, 2007. Proofread by instructor. Last updated June 20, 1 a.m. Exercise 2.0.1. Let G be an abelian group and A G be
More informationRepresentations and Linear Actions
Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category
More informationProblem Set Mash 1. a2 b 2 0 c 2. and. a1 a
Problem Set Mash 1 Section 1.2 15. Find a set of generators and relations for Z/nZ. h 1 1 n 0i Z/nZ. Section 1.4 a b 10. Let G 0 c a, b, c 2 R,a6 0,c6 0. a1 b (a) Compute the product of 1 a2 b and 2 0
More informationMath 120A: Extra Questions for Midterm
Math 120A: Extra Questions for Midterm Definitions Complete the following sentences. 1. The direct product of groups G and H is the set under the group operation 2. The symmetric group on n-letters S n
More informationThe symmetric group R + :1! 2! 3! 1. R :1! 3! 2! 1.
Chapter 2 The symmetric group Consider the equilateral triangle. 3 1 2 We want to describe all the symmetries, which are the motions (both rotations and flips) which takes the triangle to itself. First
More informationABSTRACT ALGEBRA 1, LECTURE NOTES 5: HOMOMORPHISMS, ISOMORPHISMS, SUBGROUPS, QUOTIENT ( FACTOR ) GROUPS. ANDREW SALCH
ABSTRACT ALGEBRA 1, LECTURE NOTES 5: HOMOMORPHISMS, ISOMORPHISMS, SUBGROUPS, QUOTIENT ( FACTOR ) GROUPS. ANDREW SALCH 1. Homomorphisms and isomorphisms between groups. Definition 1.1. Let G, H be groups.
More informationChapter 2 Linear Transformations
Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more
More informationGroup Theory (Math 113), Summer 2014
Group Theory (Math 113), Summer 2014 George Melvin University of California, Berkeley (July 8, 2014 corrected version) Abstract These are notes for the first half of the upper division course Abstract
More informationSchool of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation
MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and Re-Activation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 4.1 Exercise 1. Let G act on the set A. Prove that if a, b A b = ga for some g G, then G b = gg
More informationTHE EULER CHARACTERISTIC OF A LIE GROUP
THE EULER CHARACTERISTIC OF A LIE GROUP JAY TAYLOR 1 Examples of Lie Groups The following is adapted from [2] We begin with the basic definition and some core examples Definition A Lie group is a smooth
More information1 r r 2 r 3 r 4 r 5. s rs r 2 s r 3 s r 4 s r 5 s
r r r r r s rs r s r s r s r s Warmup: Draw the symmetries for the triangle. () How many symmetries are there? () If we call the move rotate clockwise r, what is the order of r? Is there a way to write
More informationClassification of Root Systems
U.U.D.M. Project Report 2018:30 Classification of Root Systems Filip Koerfer Examensarbete i matematik, 15 hp Handledare: Jakob Zimmermann Examinator: Martin Herschend Juni 2018 Department of Mathematics
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More informationDIHEDRAL GROUPS II KEITH CONRAD
DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite
More informationCosets and Normal Subgroups
Cosets and Normal Subgroups (Last Updated: November 3, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from
More informationMath 581 Problem Set 8 Solutions
Math 581 Problem Set 8 Solutions 1. Prove that a group G is abelian if and only if the function ϕ : G G given by ϕ(g) g 1 is a homomorphism of groups. In this case show that ϕ is an isomorphism. Proof:
More informationFigure 1. Symmetries of an equilateral triangle
1. Groups Suppose that we take an equilateral triangle and look at its symmetry group. There are two obvious sets of symmetries. First one can rotate the triangle through 120. Suppose that we choose clockwise
More informationCrypto math II. Alin Tomescu May 27, Abstract A quick overview on group theory from Ron Rivest s course in Spring 2015.
Crypto math II Alin Tomescu alinush@mit.edu May 7, 015 Abstract A quick overview on group theory from Ron Rivest s 6.857 course in Spring 015. 1 Overview Group theory review Diffie-Hellman (DH) key exchange
More information