DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3. Contents


 Robert Osborne
 3 years ago
 Views:
Transcription
1 DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions  basics 5 5. Group actions  three major examples 7 6. When a prime p divides the order of a group 8 7. Sylow theorems Cayley s Theorem Now we give a converse to the observation that we made just before defining a group. We show below that any group G can be realized as a subgroup of the group of bijections on the set G. [3.1.1] [Cayley s Theorem] If G is a group, then G is isomorphic to the subgroup {L a : a G} of S G, where L a : G G is the left multiplication L a (x) = ax. Proof. We know already that L a S G. Clearly L e = Id G and L ab = L a L b. Also note that if a b, then L a L b since L a (e) = a b = L b (e). Hence the map a L a from G to S X is an injective homomorphism, and therefore G is isomorphic to the subgroup {L a : a G} of S G. Remark: For a G, let R a : G G be the right multiplication, R a (x) = xa. The map a R a from G to S G is not a homomorphism in general since R a R b = R ba. If G is a finite group with G = n, then S G may be identified with S n, the permutation group on n symbols. Therefore, we obtain a corollary of [3.1.1] in the following form. [3.1.2] [Cayley s Theorem for finite groups] If G is a finite group with G = n, then G is isomorphic to a subgroup of S n. Remark: Thus, to understand all finite groups, it is enough to study S n s and their subgroups. Remark: We also mention here a functional interpretation of a group homomorphism in terms of the left multiplication. Let G, G be groups and let f : G G be a map. Then f is a homomorphism iff f(ab) = f(a)f(b) for every a, b G iff f L a = L f(a) f for every a G. 1
2 2 T.K.SUBRAHMONIAN MOOTHATHU 2. The permutation group S n Notation and definitions: If 2 k n and if x 1,..., x k {1,..., n} are distinct, the notation (x 1,..., x k ) stands for the permutation α S n given by α(x j ) = x j+1 for 1 j < k, α(x k ) = x 1 and α(y) = y for every y {1,..., n} \ {x 1,..., x k }; and we say α is a kcycle. A 2cycle α S n is called a transposition. Note that the inverse of a transposition is itself. Cycles α = (x 1 x k ) and β = (y 1 y m ) in S n are disjoint if {x 1,..., x k } {y 1,..., y m } =. Example: If α = (1 2 4) S 6, then α is a 3cycle with values α(1) = 2, α(2) = 4, α(3) = 3, α(4) = 1, α(5) = 5, α(6) = 6, and α is disjoint with the transposition β = (3 5) S n. Remark: While dealing with permutations, product means composition, and αβ stands for α β. [3.2.1] (i) Every α S n can be expressed as a product of finitely many disjoint cycles in S n. (ii) Every cycle β S n of length k can be written as a product of k 1 transpositions. (iii) Every α S n can be expressed as a product of finitely many transpositions. (iv) If α = δ 1 δ m and α = γ 1 γ k are two representations of α S n as a product of transpositions, then m k is even (i.e, m is odd iff k is odd). Proof. (i) Since S n = n! <, we have order(α) <. Let x {1,..., n} and let k N be the smallest such that α k (x) = x. This gives a kcycle β 1 = (x 0 x 1 x k 1 ) S n, where x j = α j (x). By induction, the restriction of α to the remaining n k elements can be written as a product β 2 β m of finitely many disjoint cycles. Hence α = β 1 β m. (ii) (x 1 x k ) = (x 1 x 2 )(x 2 x 3 ) (x k 1 x k ) = (x 1 x k )(x 1 x k 1 ) (x 1 x 3 )(x 1 x 2 ). (iii) This follows from parts (i) and (ii). (iv) Define f α (x 1,..., x n ) = f(x α(1),..., x α(n) ) if f is a polynomial in n variables, and α S n. Note that f αβ = (f α ) β. Now suppose f = 1 i<j n (x j x i ). It may be checked that f δ = f if δ S n is a transposition. Hence if α is as given in the hypothesis, then ( 1) k f = f α = ( 1) m f, and therefore m k is even. Definition: Suppose α S n is written as a finite product of transpositions as α = δ 1 δ m. We say α is an even permutation or an odd permutation depending upon whether m is even or odd respectively. This definition makes sense because of [3.2.1](iv). Examples: (i) The identity permutation is an even permutation. If n 2, then Id = (1 2)(1 2) S n. (ii) α = ( ) S 6 is an odd permutation since α = (1 2)(2 3)(3 4). Remark: Let α, β S n. (i) If both of α, β are even or both are odd, then αβ is an even. (ii) If one of α, β is odd and the other is even, then αβ is odd. (iii) β 1 is even iff β is even. Definition: The nth alternating group A n is defined as A n = {α S n : α is an even permutation}. That it is indeed a group is proved below. [3.2.2] A n S n for every n N, and [S n : A n ] = 2 for n 2.
3 DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3 3 Proof. Let α, β A n, then α, β are even permutations, hence αβ 1 is even. That is, αβ 1 A n, and this shows that A n is a subgroup. If n = 1, then A n = S n. Now suppose n 2 so that A n S n. If δ, γ S n are odd, then δ 1 γ is even, hence δ 1 γ A n, or δa n = γa n. So A n has exactly two disjoint left cosets, A n and δa n, implying [S n : A n ] = 2. Consequently, A n S n (this can be seen directly also). Remark: It can be shown with some effort that if n 5, then A n has no proper normal subgroup, and that the only proper normal subgroup of S n is A n. Essentially because of this fact, polynomials of degree 5 are in general hard to solve. More of this can be learned from Galois Theory. [3.2.3] (i) For n 2, S n is generated by {(1 k) : 2 k n}. (ii) For n 2, S n is generated by {(k, k + 1) : 1 k < n}. (iii) For n 3, S n is not abelian (hence not cyclic), but S n can be generated by the two element set {(1 2), (1 2 n)}. (iv) If p 3 is a prime and 1 a < b p, then S p is generated by {(a b), (1 2 p)} [This fact is important in Galois Theory]. (v) For n 3, A n is generated by 3cycles. (vi) For n 3, A n is generated by {(1 2 k) : 3 k n}. Proof. In the proofs below we will use the observation that (a b) = (a c)(b c)(a c) when ab, c {1,..., n} are distinct. Also the integers appearing below are to be considered modulo n (or p) and are to be identified with the corresponding number in {1,..., n}. (i) Note that (a b) = (1 a)(1 b)(1 a) and use [3.2.1](iii). (ii) Suppose H = {(k, k + 1) : 1 k < n}. To prove (a, b) H for a < b, we use induction on b a. Let m 1, and assume that H contains all transpositions of the form (k, k + j) for j m. Then by induction hypothesis we get (k, k + m + 1) = (k, k + m)(k + m, k + m + 1)(k, k + m) H. (iii) (1 2)(2 3) = (1 2 3) (1 3 2) = (2 3)(1 3), and so S n is not abelian. Let α = (1 2) and β = (1 2 n). To see S n = α, β, observe that (k + 1, k + 2) = β k αβ k for k 0 and use part (ii). (iv) Let H = α, β, where α = (a b), β = (1 2 n). Put r = b a and note that (a + k, b + k) = β k αβ k H. Hence (i, i + r) H for every i. Next, (i, i + 2r) = (i, i + r)(i + r, i + 2r)(i, i + r) H, and inductively (i, i + qr) H for every i, q. Since p is prime and r Z U p, there is q such that qr = 1 in Z U p. Hence (i, i + 1) H for every i and in particular (1 2) H. Now use (iii). (v) (a b)(b c) = (a b c); and (a b)(c d) = (a b)(b c)(b c)(c d) = (a b c)(b c d) if a, b, c, d are distinct. (vi) Let H = {(1 2 k) : 3 k n}. Clearly (1 k 2) = (1 2 k) 2 H. Now consider distinct k, m > 2. Then (1 m)(1 k) = (1 k m). Therefore, in view of part (i), it suffices to show that (1 k m) H. And (1 k m) = (1 k 2)(1 m 2)(1 2 k) H. [3.2.4] Any two transpositions in S n are conjugate to each other, i.e., if α, β S n are transpositions, then there is δ S n such that β = δαδ 1.
4 4 T.K.SUBRAHMONIAN MOOTHATHU Proof. We assume α β, and let α = (a b), β = (c d). First suppose a, b, c, d are distinct. After a relabeling, we may assume α = (1 3), β = (2 4). Then take δ = (1 2 n) and note that β = δαδ 1. If b = c, then after a relabeling assume α = (1 2), β = (2 3). Then also β = δαδ 1. Remark: If G is a group generated by k elements, and if H is a subgroup of G, then it may not be possible to generate H by k elements (later we will see that it is possible if G is abelian). In fact H may not even be finitely generated (an example is: let G be the free group generated by two elements a, b and let H be the subgroup generated by {a n ba n : n N}  we skip the details). 3. Center of a group, and centralizers Definition: The center Z(G) of a group G is Z(G) = {a G : ax = xa for every x G}. Remark: We have Z(G) = G iff G is abelian. If Z(G) is very small, then it means G is highly nonabelian. Also note that Z(G) = {a G : axa 1 = x for every x G} = {a G : xax 1 = a for every x G}. The following is easy. [3.3.1] If G is a group, then Z(G) is an abelian, normal subgroup of G. Remark: For n 5, it can be shown (with some effort) that A n has no proper normal subgroups and hence Z(A n ) = {e} by the above result. Definition: If G is a group and x G, the centralizer of x in G is C G (x) = {a G : ax = xa} = {a G : axa 1 = x}. [3.3.2] Let G be a group and x G. Then C G (x) is a subgroup of G (may not be abelian or normal  see the example below), and Z(G) = x G C G(x). [3.3.3] Let n 3, G = S n, and δ = (1 2) G. Then, (i) Z(G) = {e}. (ii) C G (δ) = {β G : β({1, 2}) = {1, 2}}. (iii) C G (δ) is not normal in S n. (iv) If n 5, then C G (δ) is not abelian. Proof. (i) If α G \ {e}, there are a b such that α(a) = b. Let c {1,..., n} \ {a, b} and β = (b c) G. Then αβ(a) = b c = βα(a). (ii) The inclusion is clear. If β S n is not a member of RHS, then there is a > 2 such that b = β(a) {1, 2}. Now δβ(a) = δ(b) b = βδ(a). Thus β / C G (δ). This proves. (iii) (2 3)(1 2)(2 3) = (1 3) / C G (δ). (iv) Use part (ii) and the fact that S {3,4,5} is nonabelian. [3.3.4] Let n 3 and G = D n be the nth dihedral group generated by α, β with the relations α n = e = β 2 and βα = α 1 β = α n 1 β. (i) If n is odd, then Z(G) = {e}. (ii) If n is even, then Z(G) = {e, α n/2 }.
5 DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3 5 Proof. If α i β Z(G), then (α i β)α = α(α i β), or α i 1 β = α i+1 β, or e = α 2, a contradiction since order(α) = n 3. Hence α i β / Z(G) for any i. Next note that for 1 i < n, we have α i Z(G) iff α i (α j β k ) = (α j β k )α i for every j, k iff α i+j β k = α j i β k for every j, k iff α 2i = e. ( ) 1 a [3.3.5] Let G = GL(2, R), H = SL(2, R), and A =, where a R \ {0}. Then, 0 1 (i) Z(G) = {bi ( : b R \ ) {0}} and Z(H) = { I, I}, where I is the ( 2 2 ) identity matrix. p q p q (ii) C G (A) = { : p R \ {0}, q R}, and C H (A) = { : p = ±1, q R}. 0 p 0 p ( ) ( ) b 0 c1 c 2 Proof. Consider matrices B = and C =, and assume B, C GL(2, R) (so 0 b c 3 c 4 that b, b 0 for instance). Statement (i) can be deduced from the following two observations: if b = b, then BC = CB; if b b and at least one of c 2, c 3 is nonzero, then BC CB. Similar arguments will establish (ii). Remark: If G is a group and H is a subgroup, then C H (x) = C G (x) H for any x H. The following fact will be used later. [3.3.6] Let G be a group. If G/Z(G) is cyclic, then G is abelian and hence Z(G) = G. Proof. Let a G be such that G/Z(G) is generated by az(g). Consider x, y G. Then there are b, c Z(G) and integers i, j such that x = a i b, y = a j c. Since each of b, c commutes with every element of G, we have xy = a i ba j c = a i+j bc = a i+j cb = a j ca i b = yx. 4. Group actions  basics In Cayley s Theorem [3.1.1], we saw that if G is a group, then G is isomorphic to a subgroup of S G, i.e., there is an injective homomorphism π : G S G. Now, given a group G, there may exist many sets X such that there is a homomorphism π : G S X (here π may not be injective). This abstract concept is quite useful. So we formalize it. Definition: Let G be a group and X be a nonempty set. An action of G on X is a homomorphism π : G S X. Sometimes we will write π a for the map π(a) S X for a G. Note that by definition π a : X X is a bijection for each a G even if π is not injective. Definition: Let π be the action of a group G on a nonempty set X. (i) The action is said to be faithful if π is injective, equivalently if ker(π) = {e} (for example, by Cayley s Theorem every group has a faithful action on itself). (ii) F ix(g) = {x X : π a (x) = x for every a G} X. (iii) If x X, the orbit and stabilizer of x are defined respectively as O G (x) = {π a (x) : a G} X, Stab(x) = {a G : π a (x) = x} G. It may be checked that Stab(x) is a subgroup of G for every x X. Also, ker(π) = x X Stab(x).
6 6 T.K.SUBRAHMONIAN MOOTHATHU [3.4.1] Let π be the action of a group G on a nonempty set X. Define a relation R on X by the condition that (x, y) R iff there is a G such that π a (x) = y. Then R is an equivalence relation on X, and the equivalence classes are precisely the distinct Gorbits. Thus X gets partitioned into distinct Gorbits. Definition: Let π be the action of a group G on a nonempty set X. The action π is said to be transitive if for every x, y X, there is a G such that π a (x) = y. In view of [3.4.1], we may note that π is transitive O G (x) = X for some x X O G (x) = X for every x X. It may also be noted that if the cardinality of G is strictly less than the cardinality of X, then π cannot be transitive since the cardinality of O G (x) cannot exceed that of G. Some examples of group actions: (i) [Action of (Z, +) on R] Let π : Z S R be π m (x) = x + m for m Z and x R. Then ker(π) = {0} (so the action is faithful) and F ix(z) = {x R : x + m = x for every m Z} =. If x R, then O G (x) = x + Z R (so the action is not transitive) and Stab(x) = {0}. More generally, if we fix t R \ {0}, then π : Z S R given by π m (x) = x + tm is an action of Z on R. We have ker(π) = {0}, F ix(z) =, O G (x) = x + tz and Stab(x) = {0}. On the other hand, the attempts π m (x) = mx and π m (x) = 2x + m do not define actions of (Z, +) on R (why?). (ii) [Action of (R, +) on [0, 1)] Let π : R S [0,1) be π a (x) = x + a (mod 1) for a R and x [0, 1). Then ker(π) = Z (so the action is not faithful) and F ix(r) =. If x [0, 1), then O G (x) = [0, 1) (so the action is transitive) and Stab(x) = Z. (iii) [Action of S 3 on N 3 ] Let G = S 3, X = N 3 and π : G S X be π σ (n 1, n 2, n 3 ) = (n σ(1), n σ(2), n σ(3) ). Then ker(π) = {e} (so the action is faithful) and F ix(s 3 ) = {(n 1, n 2, n k ) N 3 : n 1 = n 2 = n 3 }. Since S 3 is a finite group and N 3 is an infinite set, the action cannot be transitive. If x = (5, 7, 5) N 3, then O G (x) = {(5, 5, 7), (5, 7, 5), (7, 5, 5)} and Stab(x) = {e, (1 3)} S 3, and in particular, we note that O G (x) Stab(x) = 3 2 = 6 = G. [3.4.2] [OrbitStabilizer Theorem] Let π be the action of a finite group G on a nonempty set X. Then G = O G (x) Stab(x) for every x X. Proof. Fix x X and let H = Stab(x). Since G / H = [G : H] = G/H, it suffices to produce a bijection between G/H and O G (x). Define ψ : G/H O G (x) as ψ(ah) = π a (x). For a, b G, we have ah = bh iff a 1 b H iff x = π a 1 b(x) = πa 1 (π b (x)) iff π a (x) = π b (x). Therefore ψ is welldefined and injective. Clearly ψ is surjective also. [3.4.3] [Corollary] Let p be a prime and let G be a finite group with G = p n acting on a nonempty set X. Then for each x X, there is k {0, 1,..., n} such that O G (x) = p k. [3.4.4] Let π be the action of a group G on a set X. If x, y X and a G are such that π a (x) = y, then Stab(y) = a Stab(x) a 1. In particular, if the action is transitive, then Stab(x) and Stab(y) are conjugate subgroups for any two x, y X.
7 DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3 7 Proof. b Stab(x) π b (x) = x π b (π a 1(y)) = π a 1(y) π aba 1(y) = y aba 1 Stab(y). 5. Group actions  three major examples Definition: If G is a group, the conjugacy relation R given by (x, y) R iff there is a G such that axa 1 = y is an equivalence relation on G and the equivalence classes are called conjugacy classes. We denote the conjugacy class of x G as [x]. Note that [x] = {x} iff x Z(G). [3.5.1] [Major Example1: conjugacy action of a group on itself] Let G be a group and X = G. Let π : G S G be π a (x) = axa 1 for a, x G. Easy to verify that π is indeed a welldefined homomorphism. We have ker(π) = {a G : π a = Id G } = {a G : axa 1 = x for every x G} = Z(G) (so in general π is not faithful), F ix(g) = {x G : [x] = {x}} = Z(G), O G (x) = [x], and Stab(x) = {a G : axa 1 = x} = {a G : ax = xa} = C G (x). Since O G (e) = {e}, the conjugacy action is transitive iff G = {e}. [3.5.2] Let G be a finite group and x G. Then, [x] = [G : C G (x)]. In particular [x] divides G. Proof. Consider the conjugacy action of G on G. Then O G (x) = [x] and Stab(x) = C G (x). Hence by the OrbitStabilizer Theorem, G = [x] C G (x) and so the result follows. [3.5.3] Let G be a finite (nonabelian) group and suppose [x 1 ],..., [x k ] is a listing of distinct conjugacy classes in G having more than one element. Then, (i) [Class equation] G = Z(G) + k i=1 [G : C G(x i )]. (ii) 1 < [G : C G (x i )] < G (equivalently, G > C G (x i ) > 1) for 1 i k. Proof. We know that G = Z(G) [x 1 ] [x k ] is a disjoint union, and [x i ] = [G : C G (x i )]. This gives (i). We have [x i ] > 1 by hypothesis; and [x i ] < G since e / [x i ]. This gives (ii). The class equation is useful in getting some insight into the structure of a finite nonabelian group (if the group is abelian, then Z(G) = G, so the class equation becomes trivial and does not give any new information). We will discuss this in the next section. Project topic: Study about conjugacy classes in the groups S n, A n and D n. [3.5.4] [Major Example2: conjugacy action of a group on its subgroups] Let G be a group, let X be the collection of all subgroups of G, and π : G S X be π a (H) = aha 1 for a G and any subgroup H of G. It may be checked that π is a welldefined homomorphism. Note that F ix(g) = {all normal subgroups of G}, O G (H) = {all subgroups of G conjugate to H}, and Stab(H) = {a G : aha 1 = H} is the largest subgroup of G containing H in which H is normal. Therefore, for this particular group action, Stab(H) is called the normalizer of the subgroup H in G, and is denoted as N G (H). If N G (H) is small in G and not much bigger than H, then it means H is highly nonnormal in G. Remark: Suppose G = S 3, H = {e, (1 2)} and H = {e, (1 2 3), (1 3 2)}. Since N G (H) {2, 6} and since H is not normal, N G (H) = G. Since [G : H ] = 2, we have H G and so N G (H ) = H.
8 8 T.K.SUBRAHMONIAN MOOTHATHU [3.5.5] [Major Example3: the action of SL(2, R) on the upper halfplane] This is a group action that is important in advanced Analysis. Let X = {(x + iy) ( C : y > ) 0} be the upper halfplane a b and let G = SL(2, R). Define π : G S X as follows: if A = G, then π A : X X is c d given by π A (z) = (az + b)/(cz + d). (i) How do we know π A (z) X? First note by direct calculation that the imaginary part of π A (i) is 1/(c 2 + d 2 ) > 0 and hence π A (i) X. This observation together with some facts from Complex Analysis (which you will study later) will imply that π A (z) X for every z X. (ii) It can be checked that π AB = π A π B, and in particular π A π A 1 = π I = Id X = π A 1π A. So indeed π A S X, and π is a homomorphism. (iii) A ker(π) (az + b)/(cz + d) = z for every z X cz 2 + (d a)z + b = 0 for every z X c = d a = b = 0. Since we also have det[a] = 1, we conclude that ker(π) = {±I}. ( ) 2 0 (iv) Consider A = G. If π A (z) = z, then 4z = z or z = 0 / X. Hence F ix(g) =. 0 1/2 ( y ) x/ y (v) If z = x + iy X, then A = 0 1/ G and π A (i) = z. So O G (i) = X and hence the y action is transitive (and O G (z) = X for every z X). ( ) a b (iv) If (ai + b)/(ci + d) = i, then a = d and c = b. Therefore, Stab(i) = { : a, b b a R, a 2 + b 2 = 1}. Since the action is transitive, Stab(z) = C Stab(i) C 1 if C G is such that π C (i) = z. 6. When a prime p divides the order of a group The converse of Lagrange s theorem is not true: if G is a finite group and if d is a natural number dividing G, then G may not have a subgroup of order d. This is illustrated by the following example. [3.6.1] We show that A 4 has no subgroups of order 6 even though 6 divides A 4 = 12. Let if possible, H A 4 be a subgroup with H = 6. Consider a 3cycle σ A 4 (note that a 3cycle is an even permutation since (a b c) = (a b)(b c)). Then at least two of the cosets H, σh, σ 2 H must coincide since [A 4 : H] = 2; and in each case, it is not difficult to see that σ H (or use [2.4.3] to see that σ = σ 4 = (σ 2 ) 2 H). Thus H contains all 3cycles in A 4. Three distinct elements can be chosen from 1,2,3,4 in 4 ways, and if σ is a 3cycle, then σ 2 is also a 3cycle. Hence the number of 3cycles in A 4 is 4 2 = 8. This implies H 8, a contradiction. However, the converse of Lagrange s theorem is true in certain special cases. Suppose G is a finite group and d divides G. Then we can say that G has a subgroup of order d if at least one of the following holds: (i) G is abelian.
9 (ii) d is a prime power. DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3 9 The converse of Lagrange s theorem with G abelian we may not prove in our course. We remark that it follows essentially from the (nontrivial) fact that any finite abelian group is isomorphic to a product C 1 C k of cyclic groups where each C i = p r i i not be distinct). for some prime p i (here p i s need The converse of Lagrange s theorem with the second assumption (i.e., when d is a prime power) is Sylow s first theorem that we will prove in the last section. In this section, we consider some results which can be considered as stepping stones to Sylow s theorems. Definition: Let p be a prime. A finite group G is said to be a pgroup if G = p n for some n N. [3.6.2] Let p be a prime and G be a pgroup. Then, Z(G) > 1. Proof. In the class equation G = Z(G) + k i=1 [G : C G(x i )], we note that p divides [G : C G (x i )] for 1 i k by [3.4.3]. So p divides Z(G). [3.6.3] Let p be a prime and G be a group of order p 2. Then G is abelian. Moreover, G is isomorphic to either Z p 2 or Z p Z p. Proof. We have Z(G) = p or p 2 by [3.6.2]. Hence G/Z(G) = p or 1, and thus G/Z(G) is cyclic. So G is abelian by [3.3.6] (thus Z(G) = G and the case Z(G) = p really does not arise). If G is cyclic, then G = Z p 2. Next suppose G is not cyclic. Then order(x) = p for every x G \ {e}. Let a G \ {e}, H = a, b G \ H and let K = b. Clearly H K = {e}. The map f : H K G given by f(x, y) = xy is a homomorphism since G is abelian. Also kerf = {(e, e)} since H, K are subgroups with H K = {e}. Thus f is injective. Since H K = p 2 = G, we conclude that f is also surjective, and thus f is an isomorphism. So G = H K = Z p Z p. (Another argument is the following: note that HK is greater than p and divides G = p 2, so HK = p 2 and hence HK = G; now use [2.5.4].) [3.6.4] If a prime p divides G for a finite abelian group G, then G has an element of order p. Proof. Let G = np and use induction on n, where the case n = 1 is trivial (since G becomes cyclic in this case). In the general case, let H G be a maximal proper subgroup. If p divides H, we are done by induction. If p H, let a G \ H and K = a. Then HK is a subgroup of G since G is abelian, and hence HK = G by the maximality of H. The map f : H K G given by f(x, y) = xy is a surjective homomorphism with kerf = {(x, x 1 ) : x H K}. Therefore, as a consequence of the first isomorphism theorem, G = H K / kerf = H K / H K, and this implies that p divides K. Then, the element a K /p K G has order p. We may drop the abelian hypothesis from the above. The following can be considered as a baby converse of Lagrange s theorem.
10 10 T.K.SUBRAHMONIAN MOOTHATHU [3.6.5] [Cauchy s theorem] If G is a finite group and if a prime p divides G, then G has an element of order p (and hence a subgroup of order p). Proof. Suppose G = np and as before we use induction on n. The case n = 1 is easy. Now assume the result for values up to n 1 and consider G with G = np. We may assume G is nonabelian since the abelian case was already done in [3.6.4]. Suppose the class equation is G = Z(G) + k i=1 [G : C G(x i )]. Note that C G (x i ) < G for 1 i k. Case1 : p divides C G (x i ) for some i. Then C G (x i ) = mp for some m < n and hence there is an element y C G (x i ) G of order p by induction hypothesis. Case2 : p does not divide C G (x i ) for 1 i k. Then p divides G / C G (x i ) = [G : C G (x i )] for 1 i k and hence p divides Z(G) by the class equation. We have Z(G) G since G is assumed to be nonabelian. Consequently, Z(G) = mp for some m < p and hence there is an element y Z(G) G of order p by induction hypothesis. When G is a pgroup, the converse of Lagrange s theorem is true. In fact, we have: [3.6.6] Let p be a prime and G be a pgroup with G = p n. Then there is a finite sequence {e} = H 0 H 1 H n 1 H n = G of normal subgroups of G such that H i = p i for 0 i n (hence H i /H i 1 is cyclic of order p for 1 i n). Proof. We use induction on n. The case n = 1 is trivial. Now assume the result for values up to n 1 and consider G with G = p n. We have Z(G) > 1 by [3.6.2], hence Z(G) = p k for some k {1,..., n}, and therefore there is y Z(G) of order p by Cauchy s theorem. Let H = y and note that H G since H Z(G). Since G/H = p n 1, by the induction hypothesis applied to G/H, we can find a finite sequence {H} = K 0 K 1 K n 1 = G/H of normal subgroups of G/H such that K i = p i for 0 i n 1. Take H 0 = {e} and H i = q 1 (K i 1 ) for 1 i n, where q : G G/H is the quotient map. 7. Sylow theorems Sylow theorems are very powerful since they give us information (sometimes complete information) about the structure of a finite group G just based on a single number, namely G. Definition: Let p be a prime and G be a finite group with G = p n m, where n, m N and p does not divide m. Then any subgroup of order p n of G is called a Sylow psubgroup of G. Moreover, any subgroup of order p k of G (where k n), will be referred to as a psubgroup of G. Here is the promised converse to Lagrange s theorem in a special case: [3.7.1] [Sylow s first theorem] Let p be a prime and G be a finite group with G = p n m, where n, m N and p does not divide m. Then G has a subgroup of order p k for each k {1,..., n}.
11 DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY  PART 3/3 11 Proof. It suffices to show that G has a subgroup H with H = p n, for then we may apply [3.6.6] to H. We use induction on G. In the initial case G = p, we have nothing to prove. Now assume that we have covered all groups of order < G, and consider G. Case1 : G has a proper subgroup K such that p does not divide [G : K]. Then K = p n m for some m < m. Since K < G, there is a subgroup H of order p n for K, and hence for G, by induction hypothesis. Case2 : p divides [G : K] for any proper subgroup K of G. If G is abelian, then Z(G) = G and so p divides Z(G). If G is nonabelian, then using the class equation G = Z(G) + k i=1 [G : C G(x i )] and the assumption of case2, we conclude that p divides Z(G). Let y Z(G) be an element of order p ( Cauchy s theorem), let H = y, and as before note that H G since H Z(G). By induction hypothesis, G/H has a subgroup H of order p n 1. If K = q 1 (H ), where q : G G/H is the quotient map, then K is a subgroup of G with K = p n. The first theorem of Sylow establishes the existence of Sylow psubgroups. The next two theorems of Sylow will give information about the nature and number of Sylow psubgroups. We essentially follow Artin s approach for the proofs. [3.7.2] [Sylow s second theorem] Let p be a prime and G be a finite group with G = p n m, where n, m N and p does not divide m. Then, (i) Any psubgroup of G is contained in a Sylow psubgroup of G. (ii) Any two Sylow psubgroups of G are conjugate. Proof. Let K G be a psubgroup and H G be a Sylow psubgroup of G. We claim that there is x G such that K xhx 1. If this claim is proved, then (i) and (ii) follow easily. In order to prove the claim, as a first step, we will consider a group action and will realize K xhx 1 as the stabilizer of some element. Let X = G/H, the space of left cosets of H, and consider the action of K on X by left multiplication. That is, π : K S X is given by π a (xh) = axh. If xh X, then Stab(xH) = {a K : axh = xh} = {a K : x 1 ax H} = {a K : a xhx 1 } = K xhx 1. Hence, to prove the claim, it is enough to show that there is x G such that Stab(xH) = K. In view of the Orbitstabilizer theorem, it now suffices to show there is x G such that O K (xh) = 1. For any x G, O K (xh) must divide K ( Orbitstabilizer theorem), so O K (xh) = p j for some j 0 since K is a psubgroup. On the other hand, X = G/H = m is not divisible by p. Since X gets partitioned into distinct orbits under the action of K, there is at least one orbit whose cardinality is not divisible by p. That is, there is x G such that O K (xh) = p 0 = 1, and we are done. Remark: A corollary of [3.7.2](ii) is that if the Sylow psubgroup is unique, then it is normal.
12 12 T.K.SUBRAHMONIAN MOOTHATHU [3.7.3] [Sylow s third theorem] Let p be a prime and G be a finite group with G = p n m, where n, m N and p does not divide m. If k is the number of Sylow psubgroups of G, then k divides m and k 1 (mod p). Proof. Let H G be a Sylow psubgroup and consider its normalizer N = N G (H) = {a G : aha 1 = H}. Observe that an = bn a 1 b N a 1 bhb 1 a = H bhb 1 = aha 1. Therefore, the number of left cosets of N in G is equal to the number of conjugate subgroups of H. But the second number is k since any two Sylow psubgroups are conjugate. Thus [G : N] = k. Since H N G and [G : H] = m, we conclude that k divides m by the product rule [2.4.4]. Let H 1,..., H k G be the Sylow psubgroups and let N i be the normalizer of H i in G. Also write H = H 1. Let X = {H 1,..., H k } and let H act on X by conjugation. That is, π : H S X is given by π a (H i ) = ah i a 1. Consider i {1,..., k}. Since O H (H i ) must divide H = p n, we have either O H (H i ) = 1, or p divides O H (H i ). Moreover, O H (H i ) = 1 iff ah i a 1 = H i for every a H iff H N i. If H N i, then both H and H i are Sylow psubgroups of N i, and this implies H = H i since H i N i and since Sylow psubgroups must be conjugate by [3.7.2]. That is, O H (H i ) = 1 iff H i = H = H 1. Since X gets partitioned into distinct orbits, we conclude that k = X is congruent to 1 (mod p). [3.7.4] [Corollary] Let n = pq, where p < q are primes and p does not divide q 1. Then any group of order n is cyclic. All such n with n 100 are n = 15, 33, 35, 51, 65, 69, 77, 85, 87, 91, 95. Proof. Consider a group G with G = pq. Let k be the number of Sylow qsubgroups of G. Using [3.7.3], we have that k p, and k 1 (mod q). Since p < q and p is prime, we immediately get k = 1. Next, let j be the number of Sylow psubgroups of G. By [3.7.3] we have j q, and j 1 (mod p). Since q is prime and p does not divide q 1, we conclude that j = 1. Let H be the unique Sylow psubgroup of G and K be the unique Sylow qsubgroup of G. By [3.7.2], H, K are normal subgroups of G. We have H K = {e} since p, q are distinct primes. Using the proof of [2.5.4], note that xy = yx for every (x, y) H K. Hence f : H K G defined as f(x, y) = xy is a homomorphism, and f is injective since H K = {e}. Since H K = pq = G, f is surjective and thus an isomorphism. So G = H K = Z p Z q = Zn since p and q are distinct primes. (Another argument is: note that H K = p + q 1 < pq, so there exists x G \ H K, and the order of x is necessarily pq, implying G is cyclic.) Topic for selfstudy: Classification of finite groups of low orders. *****
Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A nonempty set ( G,*)
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 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 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 informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationExamples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are
Cosets Let H be a subset of the group G. (Usually, H is chosen to be a subgroup of G.) If a G, then we denote by ah the subset {ah h H}, the left coset of H containing a. Similarly, Ha = {ha h H} is the
More informationMA441: 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 informationA. (Groups of order 8.) (a) Which of the five groups G (as specified in the question) have the following property: G has a normal subgroup N such that
MATH 402A  Solutions for the suggested problems. A. (Groups of order 8. (a Which of the five groups G (as specified in the question have the following property: G has a normal subgroup N such that N =
More informationCourse 311: Abstract Algebra Academic year
Course 311: Abstract Algebra Academic year 200708 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................
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 informationENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.
ENTRY GROUP THEORY [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld Group theory [Group theory] is studies algebraic objects called groups.
More informationCONSEQUENCES 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 information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationNormal Subgroups and Factor Groups
Normal Subgroups and Factor Groups Subject: Mathematics Course Developer: Harshdeep Singh Department/ College: Assistant Professor, Department of Mathematics, Sri Venkateswara College, University of Delhi
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 informationIIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet1
IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet1 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 noncollinear points, then
More informationAlgebra. Travis Dirle. December 4, 2016
Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................
More information2) 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 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 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 informationMath 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 informationGROUP ACTIONS EMMANUEL KOWALSKI
GROUP ACTIONS EMMANUEL KOWALSKI Definition 1. Let G be a group and T a set. An action of G on T is a map a: G T T, that we denote a(g, t) = g t, such that (1) For all t T, we have e G t = t. (2) For all
More informationThe Outer Automorphism of S 6
Meena Jagadeesan 1 Karthik Karnik 2 Mentor: Akhil Mathew 1 Phillips Exeter Academy 2 Massachusetts Academy of Math and Science PRIMES Conference, May 2016 What is a Group? A group G is a set of elements
More informationSUMMARY OF GROUPS AND RINGS GROUPS AND RINGS III Week 1 Lecture 1 Tuesday 3 March.
SUMMARY OF GROUPS AND RINGS GROUPS AND RINGS III 2009 Week 1 Lecture 1 Tuesday 3 March. 1. Introduction (Background from Algebra II) 1.1. Groups and Subgroups. Definition 1.1. A binary operation on a set
More informationMath 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 informationLECTURES 1113: CAUCHY S THEOREM AND THE SYLOW THEOREMS
LECTURES 1113: CAUCHY S THEOREM AND THE SYLOW THEOREMS Recall Lagrange s theorem says that for any finite group G, if H G, then H divides G. In these lectures we will be interested in establishing certain
More informationCHAPTER 9. Normal Subgroups and Factor Groups. Normal Subgroups
Normal Subgroups CHAPTER 9 Normal Subgroups and Factor Groups If H apple G, we have seen situations where ah 6= Ha 8 a 2 G. Definition (Normal Subgroup). A subgroup H of a group G is a normal subgroup
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc email: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationPROBLEMS FROM GROUP THEORY
PROBLEMS FROM GROUP THEORY Page 1 of 12 In the problems below, G, H, K, and N generally denote groups. We use p to stand for a positive prime integer. Aut( G ) denotes the group of automorphisms of G.
More informationMath 210A: Algebra, Homework 5
Math 210A: Algebra, Homework 5 Ian Coley November 5, 2013 Problem 1. Prove that two elements σ and τ in S n are conjugate if and only if type σ = type τ. Suppose first that σ and τ are cycles. Suppose
More informationits image and kernel. A subgroup of a group G is a nonempty 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 information3. G. Groups, as men, will be known by their actions.  Guillermo Moreno
3.1. The denition. 3. G Groups, as men, will be known by their actions.  Guillermo Moreno D 3.1. An action of a group G on a set X is a function from : G X! X such that the following hold for all g, h
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
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 informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
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 informationTHE SYLOW THEOREMS AND THEIR APPLICATIONS
THE SYLOW THEOREMS AND THEIR APPLICATIONS AMIN IDELHAJ Abstract. This paper begins with an introduction into the concept of group actions, along with the associated notions of orbits and stabilizers, culminating
More informationStab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.
1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group
More informationIntroduction to Groups
Introduction to Groups HongJian 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 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 informationSchool of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and ReActivation
MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and ReActivation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationAlgebraI, Fall Solutions to Midterm #1
AlgebraI, Fall 2018. Solutions to Midterm #1 1. Let G be a group, H, K subgroups of G and a, b G. (a) (6 pts) Suppose that ah = bk. Prove that H = K. Solution: (a) Multiplying both sides by b 1 on the
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 information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationSolutions of exercise sheet 4
DMATH 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 informationModern Algebra (MA 521) Synopsis of lectures JulyNov 2015 semester, IIT Guwahati
Modern Algebra (MA 521) Synopsis of lectures JulyNov 2015 semester, IIT Guwahati Shyamashree Upadhyay Contents 1 Lecture 1 4 1.1 Properties of Integers....................... 4 1.2 Sets, relations and
More informationAlgebra I. Randall R. Holmes Auburn University
Algebra I Randall R. Holmes Auburn University Copyright c 2008 by Randall R. Holmes Last revision: June 8, 2009 Contents 0 Introduction 2 1 Definition of group and examples 4 1.1 Definition.............................
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, pgroups have nontrivial
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 informationABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY
ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY John A. Beachy Northern Illinois University 2000 ii J.A.Beachy This is a supplement to Abstract Algebra, Second Edition by John A. Beachy and
More informationMath 120: Homework 6 Solutions
Math 120: Homewor 6 Solutions November 18, 2018 Problem 4.4 # 2. Prove that if G is an abelian group of order pq, where p and q are distinct primes then G is cyclic. Solution. By Cauchy s theorem, G has
More informationCSIR  Algebra Problems
CSIR  Algebra Problems N. Annamalai DST  INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli 620024 Email: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationSF2729 GROUPS AND RINGS LECTURE NOTES
SF2729 GROUPS AND RINGS LECTURE NOTES 20110301 MATS BOIJ 6. THE SIXTH LECTURE  GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking
More informationDefinition 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 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 informationFirst Semester Abstract Algebra for Undergraduates
First Semester Abstract Algebra for Undergraduates Lecture notes by: Khim R Shrestha, Ph. D. Assistant Professor of Mathematics University of Great Falls Great Falls, Montana Contents 1 Introduction to
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
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 informationNOTES 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 informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationS11MTH 3175 Group Theory (Prof.Todorov) Quiz 6 (PracticeSolutions) Name: 1. Let G and H be two groups and G H the external direct product of G and H.
Some of the problems are very easy, some are harder. 1. Let G and H be two groups and G H the external direct product of G and H. (a) Prove that the map f : G H H G defined as f(g, h) = (h, g) is a group
More informationDEPARTMENT 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 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 informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:0010:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:0010:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationGROUP ACTIONS RYAN C. SPIELER
GROUP ACTIONS RYAN C. SPIELER Abstract. In this paper, we examine group actions. Groups, the simplest objects in Algebra, are sets with a single operation. We will begin by defining them more carefully
More informationNotes 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 informationAlgebraic structures I
MTH5100 Assignment 110 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
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 informationPh.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018
Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The
More informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
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 informationChapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups  groups of permutations
Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups  groups of permutations (bijections). Definition A bijection from a set A to itself is also
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 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 informationAlgebra Qualifying Exam Solutions. Thomas Goller
Algebra Qualifying Exam Solutions Thomas Goller September 4, 2 Contents Spring 2 2 2 Fall 2 8 3 Spring 2 3 4 Fall 29 7 5 Spring 29 2 6 Fall 28 25 Chapter Spring 2. The claim as stated is false. The identity
More informationChapter 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 informationBlock Introduction. Some self study examples and proof of the theorems are left to the readers to check their progress.
Abstract Algebra The word Algebra is derived from the Arabic word aljabr. Classically, algebra involves the study of equations and a number of problems that devoted out of the theory of equations. Then
More informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
More informationCOURSE SUMMARY FOR MATH 504, FALL QUARTER : MODERN ALGEBRA
COURSE SUMMARY FOR MATH 504, FALL QUARTER 20178: 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 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 informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM  FALL SESSION ADVANCED ALGEBRA I.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM  FALL SESSION 2006 110.401  ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationMAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems.
MAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems. Problem 1 Find all homomorphisms a) Z 6 Z 6 ; b) Z 6 Z 18 ; c) Z 18 Z 6 ; d) Z 12 Z 15 ; e) Z 6 Z 25 Proof. a)ψ(1)
More information( ) 3 = ab 3 a!1. ( ) 3 = aba!1 a ( ) = 4 " 5 3 " 4 = ( )! 2 3 ( ) =! 5 4. Math 546 Problem Set 15
Math 546 Problem Set 15 1. Let G be a finite group. (a). Suppose that H is a subgroup of G and o(h) = 4. Suppose that K is a subgroup of G and o(k) = 5. What is H! K (and why)? Solution: H! K = {e} since
More information1 Finite abelian groups
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room
More informationAlgebra 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 informationHomework #5 Solutions
Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will
More informationSolutions of exercise sheet 8
DMATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra
More informationDMATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
DMATH 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 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 nonzero polynomials in [x], no two
More informationMath 450 Fall 2000 Solutions to selected problems. Proof. Let i mod n = k and j mod n = l. Then we need to show that. i = qn + k and j = sn + l.
Math 450 Fall 2000 Solutions to selected problems Page 21. 14. Suppose that n is a fixed positive integer, greater than 1. For any integers i and j show that i mod n + j mod n =(i + j) mod n. Proof. Let
More information1.5 Applications Of The Sylow Theorems
14 CHAPTER1. GROUP THEORY 8. The Sylow theorems are about subgroups whose order is a power of a prime p. Here is a result about subgroups of index p. Let H be a subgroup of the finite group G, and assume
More informationABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston
ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston Undergraduate abstract algebra is usually focused on three topics: Group Theory, Ring Theory, and Field Theory. Of the myriad
More informationAlgebra Exercises in group theory
Algebra 3 2010 Exercises in group theory February 2010 Exercise 1*: Discuss the Exercises in the sections 1.11.3 in Chapter I of the notes. Exercise 2: Show that an infinite group G has to contain a nontrivial
More informationMath 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 informationSolutions of Assignment 10 Basic Algebra I
Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,
More informationWritten Homework # 2 Solution
Math 516 Fall 2006 Radford Written Homework # 2 Solution 10/09/06 Let G be a nonempty set with binary operation. For nonempty subsets S, T G we define the product of the sets S and T by If S = {s} is
More informationAnswers 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