Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Structure (mathematical logic) wikipedia , lookup
Birkhoff's representation theorem wikipedia , lookup
Covering space wikipedia , lookup
Tensor product of modules wikipedia , lookup
Deligne–Lusztig theory wikipedia , lookup
Oscillator representation wikipedia , lookup
Fundamental theorem of algebra wikipedia , lookup
Fundamental group wikipedia , lookup
Group action wikipedia , lookup
Point groups in three dimensions wikipedia , lookup
Advanced Algebra I Week 1, Sep. 14,17, 2009 1. Group Theory The concept of groups is a very fundamental one in Mathematics. It arise as automorphism of certain sets. For example, some geometry can be described as the groups acting on the geometric objects. In the first section, we are going to recall some definition and basic properties of groups in general. In the second section, we introduce the acting of groups. The groups action can find many applications in geometry, algebra, and the theory of groups itself. In the third section, we are would like to take care of various aspects of reducing or factoring groups into simple ones. 1.1. Basic group theory. Definition 1.1.1. A group G is a set together with a binary operation ◦ : G × G → G satisfying: (1) there is an e ∈ G such that e ◦ g = g ◦ e = g for all g ∈ G. (2) for all g ∈ G, there is an g −1 ∈ G such that g ◦g −1 = g −1 ◦g = e (3) for all g1 , g2 , g3 ∈ G, we have (g1 ◦ g2 ) ◦ g3 = g1 ◦ (g2 ◦ g3 ). A group is said to be abelian if x ◦ y = y ◦ x for all x, y ∈ G. For simplicity, we will denote xy for x ◦ y. A subset H ⊂ G is a subgroup if H is a group by using the binary operation of G, denoted H < G. Example 1.1.2. Let G = (R, +). The subset S = R − {0} ⊂ G is a group under multiplication. But it is not a subgroup of G because the operation on S is different from the one on G. Let K = Z. Then K is a subgroup of G. The following property is useful. Proposition 1.1.3. Let H be a subset of a group G. Then H is a subgroup of G if the following holds (1) a−1 ∈ H for any a ∈ H. (2) ab ∈ H for any a, b ∈ H. A group homomorphism f : G → H is a function between groups that respects the structure of groups. That is, a function satisfying f (xy) = f (x)f (y). The kernel of f , denote ker(f ), is defined to be {x ∈ G|f (x) = eH }. Definition 1.1.4. A subgroup H < G is said to be normal if gHg −1 = H for all g ∈ G, denoted H C G. 1 2 Proposition 1.1.5. Let H < G be a subgroup. The following are equivalent: (1) H is a normal subgroup, i.e. gHg −1 = H for all g ∈ G. (2) gH = Hg for all g ∈ G. (3) for any g ∈ G, gH = Hg 0 for some g 0 ∈ G. Given a subgroup H < G, we note G/H the set of left cosets, i.e. G/H = {gH|g ∈ G}. When H C G is normal, then G/H has induced group structure given by xH ◦ yH := xyH. This is called the quotient group. We remark that a subgroup is normal if and only if it is the kernel of some homomorphism. The following lemma is useful Lemma 1.1.6. Let f : G → H be a group homomorphism. Let N be a normal subgroup of G contained in ker(f ), then there is an induced homomorphism f¯ : G/N → H. Proof. Define f¯ : G/N → H by f¯(gN ) = f (g). Then it’s routine to verify it’s well-defined and it’s a group homomorphism. ¤ Regarding group homomorphisms, there are some useful facts: Theorem 1.1.7 (First isomorphism theorem). Let f : G → H be a group homomorphism, then there is an induced isomorphism f¯ : G/ ker(f ) ∼ = im(f ). In particular, if f is surjective, then f¯ : G/ ker(f ) ∼ = H. Proof. Define f¯ : G/ ker(f ) → H by f¯(g ker(f )) = f (g). Then it’s routine to verify it’s well-defined and it’s a injective group homomorphism. ¤ Example 1.1.8. Let G be the set of all maps Ta,b : R → R such that Ta,b (x) = ax + b with a 6= 0. Then G is a group under composition. There are two natural subgroups: A := {Ta,0 } ∼ = R∗ , the multiplication group. N := {T1,b } ∼ = R, the translation group. There is a group homomorphism f : G → R∗ by f (Ta,b ) = a. Its kernel is N , which is a normal subgroup of G. So we have G/N ∼ = A. Moreover, G = N A = AN and N ∩ A = {e}. So in fact G is the semidirect product of A and N . Theorem 1.1.9 (Second isomorphism theorem). Let H, K be subgroups of G. Then we have group isomorphism H/(H ∩ K) ∼ = HK/K, when 1. H < NG (K) or especially, 2. K C G. 3 Sketch. Recall that NG (K) := {x ∈ G|xKx−1 = K} denotes the normalizer of K in G. It is the maximal subgroup of G in which K is normal. In particular K CNG (K). So K CG if and only if G = NG (K). Also one can check that if H < NG (K), then HK = KH < NG (K) is a subgroup of G. Moreover, K C HK. On the other hand, if H < NG (K), then H ∩ K C H. Thus both sides are groups. Finally, we consider f : H → HK/K by f (h) = hK. It’s easy to check that f is surjective with kernel H ∩ K. By first isomorphism theorem, we proved (1). And (2) is just a special case of (1). ¤ Given a surjective homomorphism f : G → H, by First isomorphism theorem, H ∼ = G/N where N = ker(f ) is a normal subgroup. It’s natural to study the group structures between them. It’s easy to see that there is a map f −1 {K < G/N } → {L < G|N < L}. In fact, this map is bijective. Moreover, it sends normal subgroups to normal subgroups. Theorem 1.1.10 (Third isomorphism theorem). Given N C G and K C G containing N . Then K/N C G/N . Moreover, (G/N )/(K/N ) ∼ = G/K. Sketch. It’s easy to check that K/N C G/N by definition. In fact, we consider f : G → G/K. Since N C G and N is contained in ker(F ) = K, by Lemma 1.1.6, we have an induced map f¯ : G/N → G/K which is clearly surjective. One checks that ker(ḡ) = K/N and we are done by Themreom 1.1.7. ¤ 1.2. direct product and semidirect product. One of the most natural way to construct examples of groups out of given groups is the direct product and direct sum. Q Let {Gi }i∈I be a set of groups. We can consider G := i∈I Gi , where an element x ∈ G is of the form (xi )i∈I with xi ∈ Gi . Given x = (xi )i∈I and y = (yi )i∈I , we define an binary operation x ◦ y := (xi yi )i∈I . It’s easy to verify that G is a group, which is called the direct product of Gi . Inside G, we consider a subset H := {(xi )i∈I |xi ∈ Gi , xi = eGi for all but finitely many i}. It’s easy to verify that H < G is L a subgroup. This subgroup H is called the direct sum of Gi , denoted i∈I Gi . Q L We would like to remark that if I is finite, then i∈I Gi = i∈I Gi . 4 Another construction close to direct product is the semidirect product, which we now describe. Let G, H be two groups. Suppose that there is a group homomorphism θ : H → AutG. We consider G ×θ H = {(g, h)|g ∈ G, h ∈ H, (g, h) ◦ (g 0 , h0 ) = (gθ(h)g 0 , hh0 )}. Example 1.2.1. Let G =< x > be a cyclic group of order n and H = Z2 . We have an automorphism of order 2 that ı : G → G by ı(xi ) = x−i . Note that ı2 = 1G . Let θ : H → Aut(G) be a map given by θ(0) = 1G and θ(1) = ı. It’s easy to see that θ is a homomorphism. One can see that G ×θ H ∼ = Dn . Remark 1.2.2. Let G be a group. The map ı : G → G by ı(x) 7→ x−1 is an automorphism if and only if G is abelian. Example 1.2.3. Let G be a cyclic group of order 7 and H be a cyclic group of order 3. There are 3 different homomorphism from H to the automorphism group AutG, called θ0 , θ1 , θ2 . Let θ0 be the one maps to the identity automorphism. Then G ×θ0 H = G × H. One can see that G ×θ1 H ∼ = G ×θ2 H. What can you say in general?