2. normal subgroup and quotient group We begin by stating a couple of elementary lemmas Lemma. Let A and B be sets and f : A B be an onto

Size: px
Start display at page:

Download "2. normal subgroup and quotient group We begin by stating a couple of elementary lemmas Lemma. Let A and B be sets and f : A B be an onto"

Transcription

1 2. normal subgroup and quotient group We begin by stating a couple of elementary lemmas Lemma. Let A and B be sets and f : A B be an onto function. For b B, recall that f 1 (b) ={a A: f(a) =b}. LetF = {f 1 (b): b B}. ThenF is a partition of A and there is a natural one to one correspondence between B and F given by b f 1 (b) Lemma. Let A and B be subsets of a group G. If g, h G, theng(ha) =(gh)a. If A B and g G, thenga gb. The proofs of the two lemmas above will be left as exercises. We often use easy results like these without mentioning explicitly Lemma. Let φ : G H be a group homomorphism and let N = ker(φ). Then φ 1 (φ(g)) = gn = Ng for all g G. Proof. Take g G. Letx φ 1 (φ(g)) or in other words, φ(x) =φ(g). Then φ(g 1 x)=φ(g) 1 φ(x) =φ(g) 1 φ(g) =e H, so g 1 x N, or in other words x gn. Thus φ 1 (φ(g)) gn. Conversely, if x gn, then x = gn for some n N, soφ(x) =φ(g)φ(n) =φ(g)e H = φ(g), so x φ 1 (φ(g)). Thus gn φ 1 (φ(g)). This proves φ 1 (φ(g)) = gn. A similar argument shows that φ 1 (φ(g)) = Ng (Exercise: Write out this argument) Definition. Let G be a group. A subgroup N of G is called a normal subgroup if gn = Ng for all g G. In this case we need not distinguish between left and right cosets. So we simply talk of cosets of N Lemma. Let G be a group and N be a subgroup of G. Thefollowingareequivalent. (a) gn = Ng for all g G. (b) gng 1 = N for all g G. (c) If g G and n N, thengng 1 N. Proof. Suppose (a) holds. Then gng 1 =(gn)g 1 =(Ng)g 1 = N(gg 1 )=N. Thus (a) implies (b). Clearly (b) implies (c). Assume (c). Let x gn. Thenx gn for some n N. So x = gng 1 g Ng since gng 1 N by our assumption. Thus gn Ng. Similarly show that Ng gn. SogN = Ng. Thus (c) implies (a). 2.6 (Motivating the construction of a quotient). Lemma 2.3 says that kernels of homomorphisms are normal subgroups. Conversely, we shall see that all normal subgroups appear as kernels of homomorphisms. Let G be a group and let N be a normal subgroup of G. We shall construct a onto group homomorphism π : G Q such that ker(π) =N. This group Q will be called the quotient of G by the normal subgroup N and will be denoted by Q = G/N. To motivate the construction, suppose we have an onto group homomorphism π : G Q and let ker(π) =N. Let q Q. Since π is onto, we can pick an element g G such that π(g) =q. Then Then lemma 2.3 gives us π 1 (q) =gn. In words, this says that the preimages of elements of Q are just the cosets of N. So the elements of Q are in one to one correspondence with the set of cosets of N in G. Also verify that if q 1 and q 2 are two elements of Q such that π 1 (q 1 )=g 1 N and π 1 (q 2 )=g 2 N,thenπ 1 (q 1 q 2 )=g 1 g 2 N (Exercise: verify this). This suggests the definition that follows. 3

2 2.7. Definition. Let G be a group and N be a normal subgroup. Let G/N denote the set of cosets of N in G. LetC and D be two cosets of N in G. We say that an element c G is a representative of the coset C if c C. Choose a representatitve c of the coset C and a representative d of the coset D. Claim: The coset cdn only depends on the cosets C and D and does not depend on the choice of the representatives c and d. Proof. Let c 1 be another representative of C and d 1 be another representative of D. Then c 1 c 1 N and d 1 d 1 N. Since N is normal, c(d 1 d 1 )c 1 N as well. So (c 1 d 1 )(cd) 1 = c 1 d 1 d 1 c 1 =(c 1 c 1 )c(d 1 d 1 )c 1 N. So c 1 d 1 Ncd = cdn. Soc 1 d 1 N = cdn. Define a binary operation on G/N as follows: Given two cosets C and D, wechoosecoset representatives c and d of C and D respectively and let let (C.D) tobethecosetcdn. The claim we just proved imply that this procedure gives a well defined binary operation on G/N. Let us reiterate the definition of the binary operation in slightly different words. If c C and d D, thenc = cn and D = dn. So our definition says (cn).(dn) =cdn. Let us also reiterate that we have already argued this is a well defined operation on G/N and this argument required the fact that N is a normal subgroup. Next one verifies that G/N with the binary operation just defined becomes a group where the identity is the coset N and inverse of gn is g 1 N. This group G/N is called the quotient of G by N. There is a canonical onto function from π : G G/N given by π(g) =gn. Verify that π is a homomorphism and ker(π) = N Example. Verify that Z n = Z/nZ. 3. Constructing homomorphisms 3.1. Lemma. Let G be a group and a G. Then there exists a homomorphism φ : Z G given by φ(n) =a n for all n Z. This φ is the unique homomorphism from Z to G such that φ(1) = a. sketch of proof. Define φ(n) =a n for all n Z. Verify that φ : Z G is a homomorphism such that φ(1) = a. Let φ : Z G be any homomorphisms such that φ (1) = a. Then φ (n) =a n = φ(n) for all n Z. Soφ = φ. The above lemma says that constructing homomorphisms from Z to any group is easy. You can send 1 to anything you want and the homomorphism is completely determined once you decide where 1 goes Corollary. The map φ(k) =k mod n is the unique homomorphism φ : Z Z n such that φ(1) = 1 mod n. The kernel of this homomorphism is nz Lemma. Let φ 1 : G H 1 and φ 2 : G H 2 be two homomorphisms. Then there is a homomorphism φ : G H 1 H 2 given by φ(g) =(φ 1 (G),φ 2 (G)). 4

3 3.4. Theorem. Let A, B, C be three groups and let f : A B and g : A C be two homomorphisms. (i) if there exists a homomorphism h : B C such that h f = g, thenker(f) ker(g). (ii) Suppose f is onto and ker(f) ker(g). (a) Then there exists a unique homomorphism h : B C such that h f = g. (b) If g is onto, then so is h. (c) If ker(g) =ker(f), thenh is one to one. (d) If g is onto and ker(g) =ker(f), thenh is an isomorphism. Proof. (i) Exercise. (ii) (a) Uniqueness: Suppose h, h be two homomorphisms such that h f = g = h f. Pick b B. Since f is onto there exists a A such that f(a) =b. then h(b) =h(f(a)) = g(a) =h (f(a)) = h (b). Fix b B. Supposea, a A such that f(a) =f(a )=b, soh = h. Thus there can be atmost one h with the given properties. Existence: Let b B. Supposea, a A such that f(a) =f(a )=b. Thenf(a a )=0, so (a a ) ker(f), so (a a ) ker(g), so g(a a )=0,sog(a) =g(a ). Thus we observe that g takes the same value on all the elements of A that map to b. Given b B, wecan pick a A such that f(a) =b (since f is onto) and then define h(b) =g(a). Because of our observation, this procedure gives us a well defined function h : B C. Verify that h is a homomorphism. Now suppose a A. Let b = f(a). So a is an element of A such that f(a) =b. Soh(b) =g(a), or h(f(a)) = g(a). So h f = g. This proves part (a). (b) Now suppose g is onto. Let c C. Then there exists a A such that g(a) =c. It follows that h(f(a)) = c, soh is onto. This proves part (b). (c) Now suppose g is onto and ker(f) =ker(g). To show h is one to one, it is enough to verify that ker(h) =e B.Letb ker(h), that is, h(b) =e C. Pick a A such that f(a) =b. Then g(a) =h(f(a)) = h(b) =e C,soa ker(g) =ker(f), so b = f(a) =e B.Soker(h) =e B. This proves part (c). Part (d) follows from part (b) and (c) Corollary. Let m, n be positive integers. Then there exists a unique homomorphism h : Z mn Z m such that h(1 mod mn) =1modm. sketch of proof. Let f : Z Z mn and g : Z Z m be the homomorphisms f(k) =k mod mn and g(k) =k mod m. Then ker(f) =mnz mz =ker(g). Now apply the above theorem. It is convenient to represent the statement of theorem 3.4 in a diagrammatic language. Let us denote an onto homomorphism f : A B by a double headed arrow f : A B. The theorem 3.4 says that A g f B with ker(f) ker(g), there exists a unique h : B C such that the following diagram commutes: g A C 7 (2) 7 f 7 7 h B 5 C

4 Saying that the diagram in 2 commutes is a pictorial way of saying that g = h f. 6

5 3.6. Theorem (The first isomorphism theorem). Let ψ : G H be a group homomorphism. Let K =ker(ψ). Let φ : G G/K be the natural quotient homomorphism: φ(g) =gk. Then there is a unique isomorphism η : G/K ψ(g) such that ψ = η φ. Proof. Recall that kernels of homomorphisms are normal subgropus, so K is normal in G. From given data, we get the following diagram of homomorphisms G ψ ψ(g) φ G/K Note that the horizontal arrow is simply the given map ψ, but we consider it as a map to the subgroup ψ(g) ofh. Soψ : G ψ(g) is an onto homomorphism. From the definition of the quotient map, we have ker(φ) =K =ker(ψ). So by theorem 3.4(d), we get an isomorphism η : G/K ψ(g), such that the following diagram commutes: ψ G ψ(g) φ η G/K Saying that the above diagram commutes is just a pictorial way of saying ψ = η φ. Let G be a group and N be a normal subgroup. The quotient homomorpshim G G/N collapses the normal subgroup N to the identity in G/N. In this way, considering the quotient group G/N lets us forget the structure inside N. Thecorrespondencetheorem below says that taking quotient by N retains the subgroup structure in G above N. So passing to the quotient group G/N lets us disregard what was happening inside N and focus solely on what happens above N. Thus, the quotient construction becomes an important simplifying tool Theorem (the correspondence theorem). Let N be a normal subgroup of G. Thenthere is a natural inclusion preserving bijection between {set of subgroups of G containing N } {set of subgroups of G/N} Under this bijection, a subgroup H of G such that H N corresponds to the subgroup H/N of G/N. Undertheabovecorrespondence,normalsubgroupsontheleft hand side correspond to normal subgroups on the right hand side. The proof of the correspondence theorem is left as a routine exercise. We want to move on to the second and the third isomorphism theorems. These theorems let us compare the subgroup structures in groups with subgroup structures in various quotients. Before stating them we need a lemma. The proof of the lemma is left as an exercise Lemma. Let H and K be two subgroups of a group G. ThenHK is a subgroup of G if and only if HK = KH Theorem (The second isomorphism theorem). Let N be a normal subgroup of G. Let H be a subgroup of G. ThenHN is a subgroup of G and H N is a normal subgroup of H and H/H N HN/N. 7

6 sketch of proof. Since N is normal in G, wehavgn = Ng for all g G. SoHN = NH.By lemma 3.8, it follows that HN is a subgroup of G. Verifying H N is a normal subgroup of H is left as a routine exercise. Now let ψ be the composition of homomorphisms: H inclusion HN quotient map HN/N. So ψ : H HN/N is given by ψ(h) =hn. Note that ψ is a homomorphism since both the inclusion and the quotient map are homomorphisms. Now verify that ψ is onto and ker(ψ) = H N. Then the second isomorphism theorem follows from the first isomorphism theorem Theorem (The third isomorphism theorem). Let H and N be normal subgroups of G with N H G. Thenthereisanaturalisomorphism G/N H/N G H. Proof. Consider the following diagram of homomorphisms: G φ H G/H φ N G/N where both the arrows φ N and φ H are the natural quotient homomorphisms. Note that ker(φ N ) = N H = ker(φ H ). So by theorem 3.4(c), we have a onto homomorphism ψ : G/N G/H such that the following diagram commutes: φ H G G/H φ N ψ G/N If g G, thenonehasψ(gn) =ψ φ N (g) =φ H (g) =gh. Now verify that ker(ψ) =H/N and apply the first isomorphism theorem. Let G 1 and G 2 be two groups. Let us consider the product group G 1 G 2.Theproduct comes with natural projection maps π 1 : G 1 G 2 G 1 and π 2 : G 1 G 2 G 2 given by π 1 (g 1,g 2 )=g 1 and π 2 (g 1,g 2 )=g 2. It is easy to verify that π 1 and π 2 are onto homomorphisms. The next theorem tells us how to construct homomorphism to a product Theorem. Let G 1,G 2,G be groups. Given homomorpshims f 1 : G G 1 and f 2 : G G 2,thereexistsauniquehomomorphismf : G G 1 G 2 such that π 1 f = f 1 and π 2 f = f 2 (where π 1 and π 2 are the natural projections. sketch of proof. Define f : G G 1 G 2 by f(g) =(f 1 (g),f 2 (g)) and verify that f is a homomorphism and that π 1 f = f 1 and π 2 f = f Theorem. Let H, K be two normal subgroups of a group G such that H K = {e}. Then show that G is isomorphic to a subgroup of G/H G/K. sketch of proof. Let φ H : G G/H and φ K : G G/K be the natural quotient homomorphisms. By 3.11, we get a homomorphism φ : G G/H G/K, given by φ(g) =(φ H (g),φ K (g)) = (gh, gk). 8

7 Let g Ker(φ). Then (gh, gk) is the identity in G/H G/K. This means gh is the identity in G/H and gk is the identity in G/K. TosaygH is the identity in G/H, means gh = H, sog H. Similarly, we get g K. So g H K = {e}. So ker(φ) ={e} and hence φ is a one to one homomorpshim. So φ : G G/H G/K gives an isomorphism φ : G φ(g) andφ(g) is a subgroup of G/H G/K Theorem. Let H and K be two subgroups of a finite group G such that K is normal in G, H K = {e} and HK = G. Thenshowthat G = H K. Proof. By the second isomorphism theorem, we know that HK is a subgroup of G and H K is a normal subgroup of H and that H/H K HK/K. Now since H K = {e} and HK = G, weget H H/{e} = H/H K HK/K G/K. So H = G/K = G / K. Infact, given the hypothesis of 3.13, it follows that G H K (Exercise: show this). In this situation, one says that G is the internal direct product of H and K Theorem. Let H, K be two normal subgroups of a finite group G such that H K = {e} and HK = G. ThenshowthatG is isomorphic to G/H G/K. Proof. By 3.12, we have an one to one homomorphism φ : G G/H G/K given by φ(g) = (gh, gk). By 3.13 we have G = K H. So G/H = G / H = K and G/K = G / K = H. So G/H G/K = G/H G/K = K H = G. By 3.12, we have an one to one homomorphism φ : G G/H G/K given by φ(g) = (gh, gk). Since G and G/H G/K have the same size, the map φ must be onto as well. So φ : G G/H G/K is an isomorphism. The following result, known as the Chinese remainder theorem is a special case of the above considerations, but we find it convenient to say it directly Corollary. Let m, n be two nonzero integers. If m and n are relatively prime, then Z mn Z m Z n. Proof. By 3.5, we have a natural homomorphisms Z mn Z m and Z mn Z n given by taking (k mod mn) to(k mod m) andto(k mod n) respectively. By 3.11, this gives a homomorphism f : Z mn Z m Z n given by f(k mod mn) =(k mod m, k mod n) Let k Z such that (k mod mn) ker(f), then (k mod m, k mod n) =(0modm, 0modn). In other words m and n divide k. Since m and n are relatively prime, this means mn divides k, sok mod mn is the identity of Z mn. So ker(f) is just the identity of Z mn,hence f : Z mn Z m Z n is one to one. Since Z mn = mn = Z m Z n = Z m Z n,themapf must be onto as well. So f is an isomorphism Corollary. Let m and n be relatively prime non-zero integers. Then (a) U(mn) U(m) U(n). 9

8 (b) For a positive integer n let φ(n) be the Euler Totient function defined as the number of integers k such that 1 k<nand k is relatively prime to n. Forexampleφ(p) =(p 1) if p is a prime number. One has φ(mn) =φ(m)φ(n). (c) Let n be a positive integer. Let n = p e 1 1 p er r be the prime factorization of n. Then φ(n) =n(1 p 1 1 ) (1 p 1 r ). sketch of proof. Consider the isomorphism f : Z mn Z m Z n given in Since f is onto, given any (α, β) U(m) U(n), there exists k Z such that f(k mod mn) =(α, β). This means (k mod m) =α and (k mod n) =β are relatiely prime to m and n respectively, so k is relatively prime to mn, that is, (k mod mn) U(mn). Conversely, if (k mod mn) U(mn), then f(k mod mn) =(k mod m, k mod n) U(m) U(n). So the restriction of f to U(mn) gives an onto map f : U(mn) U(m) U(n). Since f is one to one, so is the restriction. Finally verify that f is also a homomorphism for the multiplicative groups U(mn) to U(m) U(n). This proves part (a). Part (b) follows immediately, since U(n) = φ(n). Part (c) follows from part (b) and the easy observation that φ(p r )=p r (1 p 1 ) for a prime number p. 10

Cosets and Normal Subgroups

Cosets 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 information

Lecture Note of Week 2

Lecture Note of Week 2 Lecture Note of Week 2 2. Homomorphisms and Subgroups (2.1) Let G and H be groups. A map f : G H is a homomorphism if for all x, y G, f(xy) = f(x)f(y). f is an isomorphism if it is bijective. If f : G

More information

Kevin James. Quotient Groups and Homomorphisms: Definitions and Examp

Kevin James. Quotient Groups and Homomorphisms: Definitions and Examp Quotient Groups and Homomorphisms: Definitions and Examples Definition If φ : G H is a homomorphism of groups, the kernel of φ is the set ker(φ){g G φ(g) = 1 H }. Definition If φ : G H is a homomorphism

More information

Introduction to Groups

Introduction 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 information

Equivalence Relations and Partitions, Normal Subgroups, Quotient Groups, and Homomorphisms

Equivalence Relations and Partitions, Normal Subgroups, Quotient Groups, and Homomorphisms Equivalence Relations and Partitions, Normal Subgroups, Quotient Groups, and Homomorphisms Math 356 Abstract We sum up the main features of our last three class sessions, which list of topics are given

More information

2MA105 Algebraic Structures I

2MA105 Algebraic Structures I 2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 7 Cosets once again Factor Groups Some Properties of Factor Groups Homomorphisms November 28, 2011

More information

1.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.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 information

MATH 436 Notes: Homomorphisms.

MATH 436 Notes: Homomorphisms. MATH 436 Notes: Homomorphisms. Jonathan Pakianathan September 23, 2003 1 Homomorphisms Definition 1.1. Given monoids M 1 and M 2, we say that f : M 1 M 2 is a homomorphism if (A) f(ab) = f(a)f(b) for all

More information

Solutions of exercise sheet 4

Solutions of exercise sheet 4 D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 4 The content of the marked exercises (*) should be known for the exam. 1. Prove the following two properties of groups: 1. Every

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,

More information

23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time.

23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. 23. Quotient groups II 23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. Theorem (FTH). Let G, H be groups and ϕ : G H a homomorphism.

More information

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a. Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

More information

Groups. Groups. 1.Introduction. 1.Introduction. TS.NguyễnViết Đông. 1. Introduction 2.Normal subgroups, quotien groups. 3. Homomorphism.

Groups. Groups. 1.Introduction. 1.Introduction. TS.NguyễnViết Đông. 1. Introduction 2.Normal subgroups, quotien groups. 3. Homomorphism. Groups Groups 1. Introduction 2.Normal sub, quotien. 3. Homomorphism. TS.NguyễnViết Đông 1 2 1.1. Binary Operations 1.2.Definition of Groups 1.3.Examples of Groups 1.4.Sub 1.1. Binary Operations 1.2.Definition

More information

Quizzes for Math 401

Quizzes for Math 401 Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that

More information

6. The Homomorphism Theorems In this section, we investigate maps between groups which preserve the groupoperations.

6. The Homomorphism Theorems In this section, we investigate maps between groups which preserve the groupoperations. 6. The Homomorphism Theorems In this section, we investigate maps between groups which preserve the groupoperations. Definition. Let G and H be groups and let ϕ : G H be a mapping from G to H. Then ϕ is

More information

23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time.

23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. 23. Quotient groups II 23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. Theorem (FTH). Let G, Q be groups and ϕ : G Q a homomorphism.

More information

7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup

More information

Your Name MATH 435, EXAM #1

Your Name MATH 435, EXAM #1 MATH 435, EXAM #1 Your Name You have 50 minutes to do this exam. No calculators! No notes! For proofs/justifications, please use complete sentences and make sure to explain any steps which are questionable.

More information

Supplementary Notes: Simple Groups and Composition Series

Supplementary Notes: Simple Groups and Composition Series 18.704 Supplementary Notes: Simple Groups and Composition Series Genevieve Hanlon and Rachel Lee February 23-25, 2005 Simple Groups Definition: A simple group is a group with no proper normal subgroup.

More information

Section III.15. Factor-Group Computations and Simple Groups

Section III.15. Factor-Group Computations and Simple Groups III.15 Factor-Group Computations 1 Section III.15. Factor-Group Computations and Simple Groups Note. In this section, we try to extract information about a group G by considering properties of the factor

More information

Answers to Final Exam

Answers to Final Exam Answers to Final Exam MA441: Algebraic Structures I 20 December 2003 1) Definitions (20 points) 1. Given a subgroup H G, define the quotient group G/H. (Describe the set and the group operation.) The quotient

More information

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION PAVEL RŮŽIČKA 9.1. Congruence modulo n. Let us have a closer look at a particular example of a congruence relation on

More information

MATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018

MATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018 MATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018 Here are a few practice problems on groups. You should first work through these WITHOUT LOOKING at the solutions! After you write your

More information

I216e Discrete Math (for Review)

I216e Discrete Math (for Review) I216e Discrete Math (for Review) Nov 22nd, 2017 To check your understanding. Proofs of do not appear in the exam. 1 Monoid Let (G, ) be a monoid. Proposition 1 Uniquness of Identity An idenity e is unique,

More information

Lecture 7.3: Ring homomorphisms

Lecture 7.3: Ring homomorphisms Lecture 7.3: Ring homomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 7.3:

More information

Section 15 Factor-group computation and simple groups

Section 15 Factor-group computation and simple groups Section 15 Factor-group computation and simple groups Instructor: Yifan Yang Fall 2006 Outline Factor-group computation Simple groups The problem Problem Given a factor group G/H, find an isomorphic group

More information

EXAM 3 MAT 423 Modern Algebra I Fall c d a + c (b + d) d c ad + bc ac bd

EXAM 3 MAT 423 Modern Algebra I Fall c d a + c (b + d) d c ad + bc ac bd EXAM 3 MAT 23 Modern Algebra I Fall 201 Name: Section: I All answers must include either supporting work or an explanation of your reasoning. MPORTANT: These elements are considered main part of the answer

More information

MATH3711 Lecture Notes

MATH3711 Lecture Notes MATH3711 Lecture Notes typed by Charles Qin June 2006 1 How Mathematicians Study Symmetry Example 1.1. Consider an equilateral triangle with six symmetries. Rotations about O through angles 0, 2π 3, 4π

More information

Two subgroups and semi-direct products

Two subgroups and semi-direct products Two subgroups and semi-direct products 1 First remarks Throughout, we shall keep the following notation: G is a group, written multiplicatively, and H and K are two subgroups of G. We define the subset

More information

Visual Abstract Algebra. Marcus Pivato

Visual Abstract Algebra. Marcus Pivato Visual Abstract Algebra Marcus Pivato March 25, 2003 2 Contents I Groups 1 1 Homomorphisms 3 1.1 Cosets and Coset Spaces............................... 3 1.2 Lagrange s Theorem.................................

More information

S11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES

S11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES S11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES 1 Some Definitions For your convenience, we recall some of the definitions: A group G is called simple if it has

More information

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC SIDDHI PATHAK Abstract. This note gives a simple proof of a famous theorem of Burnside, namely, all groups of order n are cyclic

More information

Algebra I: Final 2018 June 20, 2018

Algebra I: Final 2018 June 20, 2018 1 Algebra I: Final 2018 June 20, 2018 ID#: Quote the following when necessary. A. Subgroup H of a group G: Name: H G = H G, xy H and x 1 H for all x, y H. B. Order of an Element: Let g be an element of

More information

D-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 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 information

a = mq + r where 0 r m 1.

a = mq + r where 0 r m 1. 8. Euler ϕ-function We have already seen that Z m, the set of equivalence classes of the integers modulo m, is naturally a ring. Now we will start to derive some interesting consequences in number theory.

More information

Cosets, factor groups, direct products, homomorphisms, isomorphisms

Cosets, 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 information

Math 546, Exam 2 Information.

Math 546, Exam 2 Information. Math 546, Exam 2 Information. 10/21/09, LC 303B, 10:10-11:00. Exam 2 will be based on: Sections 3.2, 3.3, 3.4, 3.5; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/546fa09/546.html)

More information

Fibers, Surjective Functions, and Quotient Groups

Fibers, Surjective Functions, and Quotient Groups Fibers, Surjective Functions, and Quotient Groups 11/01/06 Radford Let f : X Y be a function. For a subset Z of X the subset f(z) = {f(z) z Z} of Y is the image of Z under f. For a subset W of Y the subset

More information

INTRODUCTION GROUP THEORY

INTRODUCTION GROUP THEORY MATH10021 Algebra INTRODUCTION TO GROUP THEORY Michael Wemyss 2012/13 1 2 Dr. Michael Wemyss Office 5602 m.wemyss@ed.ac.uk Throughout the term, all course information (including exercise sheets, workshop

More information

Algebra homework 6 Homomorphisms, isomorphisms

Algebra 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 information

Theorems and Definitions in Group Theory

Theorems 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 information

book 2005/1/23 20:41 page 132 #146

book 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 information

(5.11) (Second Isomorphism Theorem) If K G and N G, then K/(N K) = NK/N. PF: Verify N HK. Find a homomorphism f : K HK/N with ker(f) = (N K).

(5.11) (Second Isomorphism Theorem) If K G and N G, then K/(N K) = NK/N. PF: Verify N HK. Find a homomorphism f : K HK/N with ker(f) = (N K). Lecture Note of Week 3 6. Normality, Quotients and Homomorphisms (5.7) A subgroup N satisfying any one properties of (5.6) is called a normal subgroup of G. Denote this fact by N G. The homomorphism π

More information

Extra exercises for algebra

Extra exercises for algebra Extra exercises for algebra These are extra exercises for the course algebra. They are meant for those students who tend to have already solved all the exercises at the beginning of the exercise session

More information

Abstract Algebra II Groups ( )

Abstract Algebra II Groups ( ) Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition

More information

CONSEQUENCES OF THE SYLOW THEOREMS

CONSEQUENCES OF THE SYLOW THEOREMS CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.

More information

Homomorphisms. The kernel of the homomorphism ϕ:g G, denoted Ker(ϕ), is the set of elements in G that are mapped to the identity in G.

Homomorphisms. The kernel of the homomorphism ϕ:g G, denoted Ker(ϕ), is the set of elements in G that are mapped to the identity in G. 10. Homomorphisms 1 Homomorphisms Isomorphisms are important in the study of groups because, being bijections, they ensure that the domain and codomain groups are of the same order, and being operation-preserving,

More information

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4

MATH 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 information

FROM GROUPS TO GALOIS Amin Witno

FROM GROUPS TO GALOIS Amin Witno WON Series in Discrete Mathematics and Modern Algebra Volume 6 FROM GROUPS TO GALOIS Amin Witno These notes 1 have been prepared for the students at Philadelphia University (Jordan) who are taking the

More information

Math Introduction to Modern Algebra

Math Introduction to Modern Algebra Math 343 - Introduction to Modern Algebra Notes Rings and Special Kinds of Rings Let R be a (nonempty) set. R is a ring if there are two binary operations + and such that (A) (R, +) is an abelian group.

More information

Algebra I: Final 2015 June 24, 2015

Algebra I: Final 2015 June 24, 2015 1 Algebra I: Final 2015 June 24, 2015 ID#: Quote the following when necessary. A. Subgroup H of a group G: Name: H G = H G, xy H and x 1 H for all x, y H. B. Order of an Element: Let g be an element of

More information

ABSTRACT 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 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 information

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

More information

Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 5. Modular arithmetic. 5.1 The modular ring Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence

More information

3.2 Modules of Fractions

3.2 Modules of Fractions 3.2 Modules of Fractions Let A be a ring, S a multiplicatively closed subset of A, and M an A-module. Define a relation on M S = { (m, s) m M, s S } by, for m,m M, s,s S, 556 (m,s) (m,s ) iff ( t S) t(sm

More information

Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati

Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati Shyamashree Upadhyay Contents 1 Lecture 1 4 1.1 Properties of Integers....................... 4 1.2 Sets, relations and

More information

Section 10: Counting the Elements of a Finite Group

Section 10: Counting the Elements of a Finite Group Section 10: Counting the Elements of a Finite Group Let G be a group and H a subgroup. Because the right cosets are the family of equivalence classes with respect to an equivalence relation on G, it follows

More information

Factorization in Polynomial Rings

Factorization in Polynomial Rings Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,

More information

Notes on Group Theory. by Avinash Sathaye, Professor of Mathematics November 5, 2013

Notes on Group Theory. by Avinash Sathaye, Professor of Mathematics November 5, 2013 Notes on Group Theory by Avinash Sathaye, Professor of Mathematics November 5, 2013 Contents 1 Preparation. 2 2 Group axioms and definitions. 2 Shortcuts................................. 2 2.1 Cyclic groups............................

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC Term 2 Weeks 1 13 Lecture Notes Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

More information

Lecture 7 Cyclic groups and subgroups

Lecture 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 information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

Lectures - XXIII and XXIV Coproducts and Pushouts

Lectures - XXIII and XXIV Coproducts and Pushouts Lectures - XXIII and XXIV Coproducts and Pushouts We now discuss further categorical constructions that are essential for the formulation of the Seifert Van Kampen theorem. We first discuss the notion

More information

INTRODUCTION TO THE GROUP THEORY

INTRODUCTION TO THE GROUP THEORY Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher

More information

its image and kernel. A subgroup of a group G is a non-empty subset K of G such that k 1 k 1

its image and kernel. A subgroup of a group G is a non-empty subset K of G such that k 1 k 1 10 Chapter 1 Groups 1.1 Isomorphism theorems Throughout the chapter, we ll be studying the category of groups. Let G, H be groups. Recall that a homomorphism f : G H means a function such that f(g 1 g

More information

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

More information

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.

More information

MATH RING ISOMORPHISM THEOREMS

MATH RING ISOMORPHISM THEOREMS MATH 371 - RING ISOMORPHISM THEOREMS DR. ZACHARY SCHERR 1. Theory In this note we prove all four isomorphism theorems for rings, and provide several examples on how they get used to describe quotient rings.

More information

Algebra I Notes. Clayton J. Lungstrum. July 18, Based on the textbook Algebra by Serge Lang

Algebra I Notes. Clayton J. Lungstrum. July 18, Based on the textbook Algebra by Serge Lang Algebra I Notes Based on the textbook Algebra by Serge Lang Clayton J. Lungstrum July 18, 2013 Contents Contents 1 1 Group Theory 2 1.1 Basic Definitions and Examples......................... 2 1.2 Subgroups.....................................

More information

LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS

LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS 1. The Chinese Remainder Theorem We now seek to analyse the solubility of congruences by reinterpreting their solutions modulo a composite

More information

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6

More information

Automorphism Groups Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G.

Automorphism Groups Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G. Automorphism Groups 9-9-2012 Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G. Example. The identity map id : G G is an automorphism. Example.

More information

Background Material in Algebra and Number Theory. Groups

Background Material in Algebra and Number Theory. Groups PRELIMINARY READING FOR ALGEBRAIC NUMBER THEORY. HT 2016/17. Section 0. Background Material in Algebra and Number Theory The following gives a summary of the main ideas you need to know as prerequisites

More information

MA441: Algebraic Structures I. Lecture 26

MA441: Algebraic Structures I. Lecture 26 MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order

More information

ISOMORPHISMS KEITH CONRAD

ISOMORPHISMS KEITH CONRAD ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition

More information

Math 4400, Spring 08, Sample problems Final Exam.

Math 4400, Spring 08, Sample problems Final Exam. Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that

More information

Group Theory, Lattice Geometry, and Minkowski s Theorem

Group Theory, Lattice Geometry, and Minkowski s Theorem Group Theory, Lattice Geometry, and Minkowski s Theorem Jason Payne Physics and mathematics have always been inextricably interwoven- one s development and progress often hinges upon the other s. It is

More information

Group Theory. Hwan Yup Jung. Department of Mathematics Education, Chungbuk National University

Group Theory. Hwan Yup Jung. Department of Mathematics Education, Chungbuk National University Group Theory Hwan Yup Jung Department of Mathematics Education, Chungbuk National University Hwan Yup Jung (CBNU) Group Theory March 1, 2013 1 / 111 Groups Definition A group is a set G with a binary operation

More information

Equivalence Relations

Equivalence Relations Equivalence Relations Definition 1. Let X be a non-empty set. A subset E X X is called an equivalence relation on X if it satisfies the following three properties: 1. Reflexive: For all x X, (x, x) E.

More information

6 More on simple groups Lecture 20: Group actions and simplicity Lecture 21: Simplicity of some group actions...

6 More on simple groups Lecture 20: Group actions and simplicity Lecture 21: Simplicity of some group actions... 510A Lecture Notes 2 Contents I Group theory 5 1 Groups 7 1.1 Lecture 1: Basic notions............................................... 8 1.2 Lecture 2: Symmetries and group actions......................................

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. 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 information

Some practice problems for midterm 2

Some practice problems for midterm 2 Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is

More information

Problem 1. Let I and J be ideals in a ring commutative ring R with 1 R. Recall

Problem 1. Let I and J be ideals in a ring commutative ring R with 1 R. Recall I. Take-Home Portion: Math 350 Final Exam Due by 5:00pm on Tues. 5/12/15 No resources/devices other than our class textbook and class notes/handouts may be used. You must work alone. Choose any 5 problems

More information

Groups and Symmetries

Groups 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 information

NOTES IN COMMUTATIVE ALGEBRA: PART 2

NOTES IN COMMUTATIVE ALGEBRA: PART 2 NOTES IN COMMUTATIVE ALGEBRA: PART 2 KELLER VANDEBOGERT 1. Completion of a Ring/Module Here we shall consider two seemingly different constructions for the completion of a module and show that indeed they

More information

Homework 2 /Solutions

Homework 2 /Solutions MTH 912 Group Theory 1 F18 Homework 2 /Solutions #1. Let G be a Frobenius group with complement H and kernel K. Then K is a subgroup of G if and only if each coset of H in G contains at most one element

More information

Algebraic Structures II

Algebraic Structures II MAS 305 Algebraic Structures II Notes 9 Autumn 2006 Composition series soluble groups Definition A normal subgroup N of a group G is called a maximal normal subgroup of G if (a) N G; (b) whenever N M G

More information

ALGEBRA AND NUMBER THEORY II: Solutions 3 (Michaelmas term 2008)

ALGEBRA AND NUMBER THEORY II: Solutions 3 (Michaelmas term 2008) ALGEBRA AND NUMBER THEORY II: Solutions 3 Michaelmas term 28 A A C B B D 61 i If ϕ : R R is the indicated map, then ϕf + g = f + ga = fa + ga = ϕf + ϕg, and ϕfg = f ga = faga = ϕfϕg. ii Clearly g lies

More information

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

More information

Solutions to Some Review Problems for Exam 3. by properties of determinants and exponents. Therefore, ϕ is a group homomorphism.

Solutions to Some Review Problems for Exam 3. by properties of determinants and exponents. Therefore, ϕ is a group homomorphism. Solutions to Some Review Problems for Exam 3 Recall that R, the set of nonzero real numbers, is a group under multiplication, as is the set R + of all positive real numbers. 1. Prove that the set N of

More information

38 Irreducibility criteria in rings of polynomials

38 Irreducibility criteria in rings of polynomials 38 Irreducibility criteria in rings of polynomials 38.1 Theorem. Let p(x), q(x) R[x] be polynomials such that p(x) = a 0 + a 1 x +... + a n x n, q(x) = b 0 + b 1 x +... + b m x m and a n, b m 0. If b m

More information

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

More information

DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY

DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both

More information

MATH 1530 ABSTRACT ALGEBRA Selected solutions to problems. a + b = a + b,

MATH 1530 ABSTRACT ALGEBRA Selected solutions to problems. a + b = a + b, MATH 1530 ABSTRACT ALGEBRA Selected solutions to problems Problem Set 2 2. Define a relation on R given by a b if a b Z. (a) Prove that is an equivalence relation. (b) Let R/Z denote the set of equivalence

More information

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3... Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2

More information

A Little Beyond: Linear Algebra

A 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 information

Algebra I: Final 2012 June 22, 2012

Algebra I: Final 2012 June 22, 2012 1 Algebra I: Final 2012 June 22, 2012 Quote the following when necessary. A. Subgroup H of a group G: H G = H G, xy H and x 1 H for all x, y H. B. Order of an Element: Let g be an element of a group G.

More information

Solutions for Assignment 4 Math 402

Solutions for Assignment 4 Math 402 Solutions for Assignment 4 Math 402 Page 74, problem 6. Assume that φ : G G is a group homomorphism. Let H = φ(g). We will prove that H is a subgroup of G. Let e and e denote the identity elements of G

More information

1. Let ϕ be a homomorphism from G to H and let K be the kernel of ϕ. Claim the set of subsets of the form ak forms a group.

1. Let ϕ be a homomorphism from G to H and let K be the kernel of ϕ. Claim the set of subsets of the form ak forms a group. Math 541 Day 24 1. Let ϕ be a homomorphism from G to H and let K be the kernel of ϕ. Claim the set of subsets of the form ak forms a group. What is the operation? Suppose we want to multiply ak and bk.

More information

Name: Solutions - AI FINAL EXAM

Name: Solutions - AI FINAL EXAM 1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from

More information