Group Theory I Lecture Notes for MTH 912 F10. Ulrich Meierfrankenfeld
|
|
- Μενέλαος Ζωγράφου
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Group Theory I Lecture Notes for MTH 912 F10 Ulrich Meierfrankenfeld December 8, 2010
2 2
3 Contents 1 Group Actions Groups acting on sets Complements Frobenius Groups Imprimitive action Wreath products Multi-transitive action Hypercentral Groups The Frattini subgroup Finite p-groups with cyclic maximal subgroups Hypoabelian groups The Theorem of Schur-Zassenhaus Varieties π-separable groups Join of Subnormal Subgroups Near-components Subnormal subgroups A Set Theory 83 A.1 Ordinals
4 4 CONTENTS
5 Chapter 1 Group Actions 1.1 Groups acting on sets Definition An action of a groups G on set Ω is a function such that (i) ω 1 = ω for all ω Ω. : Ω G Ω (ω, g) ω g (ii) (ω x ) y = ω xy for all ω Ω, x, y G. A G-set is a set Ω together with an action of G on Ω. Example Let G be a group, H a subgroup of G and Ω a set. Each of the following are actions. (a) (b) RM: G G G (a, b) ab LM: G G G (a, b)) b 1 a ( action by right multiplication) ( action by left multiplication) (c) Conj: G G G (a, b) b 1 ab ( action by left conjugation) 5
6 6 CHAPTER 1. GROUP ACTIONS (d) RM: G/H G G (Ha, b) Hab ( action by right multiplication) (e) Nat: Ω Sym(Ω) Ω (ω, π) ωπ ( natural action ) Definition Let be an action of the group G on the set Ω. Let g G, ω Ω, H G and H. (a) g := {ω g ω }. (b) ω H = {ω h h H}. (c) C H ( ) := {h H ωh = ωfor allω }. (d) C H (w) = {h H ωh = ω. (So C H (ω) = C H( ({ω}. We will often write H ω for C G (ω). (e) N H ( ) := {h H h = }. (f) is called H-invariant if = h for all h H. (g) H is called transitive on Ω if for all a, b Ω there exists h H with a h = b. Note that map (, g) g defines an action for G on the set of subsets of Ω. If H G and is an H-invariant subgroup of G, then H acts in via (ω, h) ω h for all ω, h H. If there is no doubt about the action, we will often omit the superscript in C H (ω), N H ( ) and so on. Lemma Let be an action of the group G on the set Ω, g G, H G and Ω. (a) If H G, then C H ( ) N H ( ) H. (b) C H ( ) g = C H g( g ). (c) Define φ g : Ω Ω, ω ω g and G Ω = {φ g g G}. Then the map φ : G Sym(Ω), g φ g is a well-defined homomorphism of groups with ker φ = C G (Ω) and Im φ = G Ω. In particular, C G (Ω) is a normal subgroup of G, G Ω is a subgroup of Sym(Ω) and G/C G (Ω) = G Ω.
7 1.1. GROUPS ACTING ON SETS 7 Proof. Readily verified. As an example we prove (b). Let h H and ω. Then h C H (ω) ω h = ω ω hg = ω g ω gg 1 hg = ω g (ω g ) hg = ω g h g C H g(ω g ) Hence C H (ω) g = C H g(ω g ). Intersecting over all ω gives (b). Definition Let G be a group and let Ω 1 and Ω 2 be G-sets. Let α : Ω 1 Ω 2 be a function. (a) α is called G-equivariant if ω γ α = ωα g for all ω Ω and g G. (b) α is called a G-isomorphism if α is G-equivariant bijection. (c) Ω 1 and Ω 2 are called G-isomorphic if there exists a G-isomorphism from Ω 1 to Ω 2. Definition Let G be a group acting on a set Ω. (a) We say that G acts transitively on Ω if for all a, b Ω there exists g G with a g = b. (b) We say that G acts regularly on Ω if for all a, b G there exists exactly one g G with a g = b. (c) We say that G acts semi-regularly on Ω if for all a, b G there exists at most one g G with a g = b. Lemma Suppose that the group G acts transitively on the set Ω and let ω Ω. View G/G ω as a G-set via right multiplication. Then the map φ : G/G ω Ω G ω g ω g is a well defined G-isomorphism. In particular, Ω = G/G ω.
8 8 CHAPTER 1. GROUP ACTIONS Proof. Let g, h G. Then the following statements are equivalent: ω g = ω h ω gh 1 = ω gh 1 G ω G ω g = G ω h The forward direction shows that φ is 1-1 and the backward direction shows that φ is well-defined. Since G is transitive on Ω, φ is onto. Note that and so φ is G-equivariant. ((G ω g)h)φ = (G ω (gh)φ = ω gh = (ω g ) h = ((G ω g)φ) g Proposition (Frattini Argument). Let G be a group acting on a set Ω, H a subgroup of G and ω Ω. (a) If H acts transitively on Ω, then G = G ω H. (b) If H acts semi-regularly on Ω, then G ω H = 1. (c) If H acts regularly on Ω, then H is a complement to G ω in G, that is G = G ω H and G ω H = 1. Proof. (a) Let g G. Since H acts transitively on Ω, ω g = ω h for some h G. Hence gh 1 G ω and g = (gh 1 )h G ω H. (b) Let h G ω H. Then ω h = ω = ω 1 and so h = 1 by definition of semi-regular. (c) Since H acts transitively and semi-regularly on Ω, this follows from (a) and (b). Definition Let G be group acting on a set Ω (a) ω Ω and H G. Then ω H := {ω h h H}. ω G is called an orbit for G in Ω. Ω/G denotes the set of orbits of G on Ω. (b) Let a, b G. We say that a is G-equivalent to b if b = a g for some g G, that is if b a G. Lemma Let G be a group acting on set Ω. (a) G equivalence is an equivalence relation. The equivalence classes are the orbits of G on Ω. (b) Let be a set of representatives for the orbits of G on Ω, (that is O = 1 for each orbit O of G on Ω. Then Ω and ω G/G ω are isomorphic G-sets. In particular, Ω = ω G/G ω (Orbit equation)
9 1.1. GROUPS ACTING ON SETS 9 Proof. (a) Since ω = ω 1, the relation is reflexive. If a, b Ω with a g = b, then b g 1 = a and the relation is symmetric. If a g = b and b h = c, then a gh = c and the relation is transitive. ω G is the set of elements if G in relation with ω and so is an equivalence class. (b) Since each elements of ω lies in exactly on orbits of G on Ω and since each orbit contains exactly one element of we have Ω = ω ω G Observe that G acts transitively on ω G and so by ω G = G/G ω as a G-set. So (b) holds. Lemma Let G be a group acting on a set non-empty set Ω. (a) G acts regularly on Ω if and only if it acts transitively and semi-regularly. (b) G acts semi-regularly on Ω if and only if G a = 1 for all a Ω. (c) G acts transitively on Ω if and only if there exists a Ω such that for all b Ω there exists g G with a g = b. (d) G acts transitively on G if and only if there exists a Ω such that for all b Ω there exists a unique g G with a g = b. Proof. (a): Follows immediately from the definitions. (b) Note that G a = 1 if and only if and only if the exists a unique element g G with a g = 1 (namely g = 1). So if G acts semiregularly on Ω, then G a = 1 for all a Ω. Suppose now that G a = 1 for all a Ω. Let a, b G and g, h G with a g = b = a h. Then a gh 1 = a, gh 1 G a and g = h. So G acts regularly on Ω. (c) The forward direction is obvious. If a G = Ω, then Ω is an orbit for G on Ω. Thus any two elements of Ω are -equivalent and so G act transitively on Ω. (d) The forward direction is obvious. Suppose now a Ω and for each b there exists a unique g G with a g = b. For b = a we see that G a = 1. Thus G b = G a g = G g a = 1. (c) and (b) now show that G acts transitively and semiregularly on Ω. So by (a), G acts regularly on Ω. Lemma Let G be a group acting on a set Ω. Then the map Ω G/C G (Ω) Ω, (ω, C G (Ω)g) ω g is a well-defined, faithful action of G/C G (Ω) on Ω. Proof. Readily verified. Lemma Let G be a group. The the following are equivalent: (a) All subgroups of G are normal in G. (b) Whenever G acts transitively on a set Ω,then G/C G (Ω) acts regularly on Ω.
10 10 CHAPTER 1. GROUP ACTIONS Proof. Let Ω be a set on which G acts transitively and put G = G/C G (Ω). Note that G ω = G ω for all ω Ω. Then G acts regularly on Ω iff G ω = 1 G and so iff G ω = C G (Ω) for all ω in Ω. (a) = (b): Suppose all subgroups of G are normal in G. Then G ω = G g ω = G ω g. Since G acts transitively on G this gives G ω = G µ for all µ Ω and so G ω = C G (Ω). Thus G act regualrly on G. (b) = (a): Suppose G/C G (Ω) acts regularly on Ω for all transitive G-sets Ω. Let H G and put Ω = G/H. Let ω = H and note that ω Ω and G ω = H. Thus H = C G (Ω) and since C G (Ω) is a normal subgroup of G, H is normal in G. Definition Let G and H be groups. An actions of G on H is an action of G on the set H such that for all a, b H and g G. (ab) g = a g b g If G acts on the group H and g G, then the map φ g : H H, h h g is an automorphism of H. Hence we obtain an homomorphism φ : G Aut(H), g φ g and G H is isomorphic to a subgroup of Aut(H). Conversely every homomorphism from G to Aut(G) gives rise to an action of G on H. Example Let G be a group and N a normal subgroup of G. (a) N G N, (n, g) g 1 ng is an action of G on the group N. (b) G G G, (h, g) hg is not an action of G on the group G (unless G = 1). (c) G Aut(G) G, (g, α) gα is an action of Aut(G) on the group G. Lemma (Modular Law). Let G be a group and A, B, and U subsets of G. UB 1 U, then U AB = (A U)B. If Proof. Let u U AB. Then u = ab for some a A and b B. Since UB 1 U, a = ub 1 U. Thus a A U and so U AB = (A U)B. Definition Let K be a groups and G and H subgroups of G. (a) G is called a complement to H in K if K = GH and G H = 1. (b) K is called the internal semidirect product of H by G if H is normal in G and G is a complement of H in G. Lemma Let G be a group, H G and K 1 and K 2 complements to H in G. (a) G = HK 1.
11 1.1. GROUPS ACTING ON SETS 11 (b) If K 1 K 2, then K 1 = K 2. (c) K 1 and K 2 are conjugate under G if and only if they are conjugate under H. Proof. (a) Let g G. Then g 1 = kh for some k K and h H. Thus g = (g 1 ) 1 = (kh) 1 = h 1 k 1 HK 1. (b) Since K 1 K 2 and G = K 1 H, Dedekind implies K 2 = K 1 (K 2 H). As K 2 H = 1 we infer that K 1 = K 2. (c) Let g G with K g 1 = K 2. Then g = k 1 h with k 1 K 1 and so K 2 = K g 1 = Kkh 1 = K1 h. Suppose that K is the internal direct product of H be G. Then G acts on H by conjugation and every element in K can be uniquely written as gh with g G and h in H. Moreover (g 1 h 1 )(g 2 h 2 ) = g 1 g 2 g2 1 h 1g 2 h 2 = (g 1 g 2 )(h g 2 1 )h 2 This leads to the following definition. Definition Let G be a group acting on the group H. Then G H is the set G H together with the binary operation (G H) (G H) (G H) (g 1, h 1 ), (g 2, h 2 (g 1 g 2, h g 2 1 h 2) Lemma Let G be a group acting on the group H and put G = {(g, 1) g G} and H = {(1, h) h H}. (a) G H is a group. (b) The map G G H, g (g, 1) is an injective homomorphism with image G. (c) The map H G H, h (1, h) is an injective homomorphism with image H. (d) (1, h) (g,1) = (1, h g ) for all g G, h H. (e) G H is the internal semidirect product of H by G. Proof. (a) Clearly (1, 1) is an identity. We have ((g 1, h 1 )(g 2, h 2 ))(g 3, h 3 ) = (g 1 g 2, h g 2 1 h 1)(g 3, h 3 ) = (g 1 g 2 g 3, (h g 2 1 h 2)) g 3 h 3 ) = (g 1 g 2 g 3, (h g 2 1 )g 3 h g 3 2 h 3) = (g 1 g 2 g 3, h g 2g 3 1 h g 3 2 h 1) = (g 1, h 1 )(g 2 g 3, h g 3 2 h 3) = (h 1, g 1 )((h 2, g 2 )(h 3, g 3 )) and so the multiplication is associative. We have (g, h)(x, y) = (1, 1) iff gx = 1 and h x y = 1 iff x = g 1 and y = (h x ) 1 = h 1 ) x and so iff x = g 1 and y = (h 1 )g 1. Thus the inverse of (g, h) is (g 1, h 1 ) g 1.
12 12 CHAPTER 1. GROUP ACTIONS (b) Since for any g G, the map H H, h h g is a homomorphism, we have 1 g = 1. Thus (g 1, 1)(g 2, 1) = (g 1 g 2, 1 g 2 1) = (g 1 g 2, 1). (c) (1, h 1 )(1, h 2 ) = (1, h 1 1 h 2) = (1, h 1 h 2 ). (d) (1, h) (g,1) = (g 1, 1)(1, h)(g, 1) = (g 1, h)(g, 1) = (g 1 g, h g 1) = (1, h g ). (e) Clearly G H = 1. Since (g, 1)(1, h) = (g, h), G H = G H and so G is a complement to H in G H. By (d), G normalizes H and so H is normal in G H = G H. As an example consider H = C 2 C 2 and G = Aut(H). Note that G = Sym(3). We claim that G H is isomorphic to Sym(4). Sym(4) has H := {1, (12)(34), (13)(24), (14)(23)} has a normal subgroup and H = C 2 C 2. Observe that H acts regularly on Ω = {1, 2, 3, 4} and so by 1.1.8, G := Sym(4) 4 is a complement to H in Sym(4). Also G = Sym(3) = Aut(H ) and C G (H ) = 1. It is now not to difficult to verify that G H = G H = Sym(4). Lemma Let G be a group, and K, H G with G = KH. G. Let U G with K U. Then (a) U = K(H U). In particular, if H is a complement to K in G, then (H U) is a complement to K in U. (b) The map α : G/U H/H U, X X H is a well defined bijection with inverse β : H/H U G/U, Y KY. (c) Let T H. Then T is a transversal to H U in H if and only if T is a transversal to U in G. Proof. (a) By since UK 1 = K, U = U G = U KH = K(U H). Also if K H = 1 we get (U H) K = U (H K) = 1. (b) Let X be a coset of U in G. Then K 1 X UX = X and so by , X = X KH = K(X H). In particular, there exists h X H and so X H = Uh H = (U H)h. Hence X H is indeed a coset of X H and α is well defined. Moreover, X = K(X H) means that α β is the identity on G/U. Now let Y = (U H)y H/U H. Then KY = K(U H)u = Uy and so KY is a coset of U in G and β is well defined. Moreover, since Hy 1 = H, gives KY H = Uy H = (U H)y = Y and so β α is the identity on H/H U. (c) T is a transversal to U in G if and only if T X = 1 for all X G/U. Since T H, this holds if and only if T (X H) = 1 for all X G/U. By (b), the latter is equivalent to T Y = 1 for all Y H/H U and so equivalent to T being a transversal to H U in U. 1.2 Complements Lemma Let G be a group, K G and U K such that K/U is Abelian and G/K is finite. Let S be the set of transversals to K in G. (A transversal to K in G is a subset
13 1.2. COMPLEMENTS 13 T of G such T C = 1 for all C G/K.). For R, S S define Then for all R, S, T S, R S := (r,s) R S Kr=Ks rs 1 U (a) R S is an elements of K/U and independent of the order of multiplication. (b) (R S) 1 = S R. (c) R S)(S T ) = R T. (d) The relation on S defined by R S if R S = U = 1 K/U is an equivalence relation. (e) G acts on S be right multiplication. (f) N G (K) op acts on S by left multiplication. (g) Let x N G (K) N G (U). Then xr xs = x(r S)x 1. In particular, is N G (K) N G (U)-invariant with respect to the action by left multiplication. (h) Put m = G/K. Then kr S = k m (R S). Proof. (a) If Kr = Ks, then rs 1 K and so R S K/U. Since K/U is abelian, the product is independent of the order of multiplication. (b) Follows from (rs 1 ) 1 = sr 1. (c) Follows from (rs 1 )(st 1 ) = rt 1. (d) Since rr 1 = 1, R R = 1U = U and so is reflexive. If R S = 1 K/U, then by (b), S R = (R S) 1 = 1 1 K/U = 1 K/U. So is symmetric. If R S and S T, then by (c), R T = (R S)(S T ) = 1 K/U 1 K/U = 1 K/U and so is transitive. (e) Let g G and C G/K. Then Sg C = S Cg 1 = 1 and so Sg S. (f) Let g N G (K) and C = Kh G/K. Then gs Kh = S g 1 Kh = S Kg 1 h = 1 and so gs S. (g) Let r R, s S and x N G (K) N G (U). Then Kr = Ks iff xkr = xks and iff K(xr) = K(xr). Thus xr xs = (r,s) R S Kxr=Kxs (xr)(xs) 1 U = x = x (r,s) R S Kr=Ks rs 1 (r,s) R S Kr=Ks rs 1 x 1 U Ux 1 = x(r S)x 1
14 14 CHAPTER 1. GROUP ACTIONS (h) Let k K. Then Kkr = Kr and so Kr = Ks if and only if K(kr) = Ks. Thus kr S = (r,s) R S Kkr=Ks = k m (kr)s 1 U = (r,s) R S Kr=Ks rs 1 (r,s) R S Kr=Ks krs 1 U U = km (R S) Theorem (Schur-Zassenhaus). Let G be a group and K an Abelian normal subgroup of G. Suppose that m := G/K is finite and that one of the following holds: 2 K is finite and gcd K G/K = 1. 2 The map α : K K, k k m is a bijection. Then there exists a complement to K in G and any two such complements are conjugate under K. Proof. Suppose that (?) holds. Observe that α is a homomorphism. Also if k K with k m = 1, then k divides K and m and so k = 1 and k = 1. Thus α is injective. Since K is finite we conclude that α is a bijection. So (?) implies (?) and we may assume that (?) holds. We know apply with U = 1. Since K G, we have G = N G (K) = N G (K) N G (U). Thus by 1.2.1(f),g, G op acts on S/ via left multiplication. Let R, S S and k K. Then [kr] = S (kr) S = 1 k m (R S) = 1 k m = (R S) 1 Since α is a bijection, for any R, S S there exists a unique such k K. Thus K acts regularly on S/ and so by the Frattini argument, G [R] is a complement to K. Now let H be any complements of K in G. Then H is a transversal in K in G and so H S. Since hh = H for all h H we conclude that H G [H]. Now both H and G [H] are complements to K in G and (b) implies that H = G [H]. Thus the map [S] G [S] is a G-isomorphism from S/ to the set of complements to K in G. Since K acts transitively on S/ it also acts transitively on the set of complements to K in G. Theorem (Gaschütz). Let G be a group, K an Abelian normal subgroup of G and K U G. Suppose that m := G/U is finite and that one of the following holds: 2 K is finite and gcd K G/U = 1. 2 The map α : K K, k k m is a bijection.
15 1.2. COMPLEMENTS 15 Then (a) There exists a complement to K in G if and only if there exists a complement to K in G. (b) Let H 1 and H 2 be complements of K in G. Then H 1 and H 2 are conjugate in G of and only if H 1 U and H 2 U are conjugate in U. Proof. (a) = : Let H be a complement to K in G. Then by , H U is a complement to K in U (b) = : Suppose H 1 and H 2 are conjugate in G. Then by (c), H 2 = H1 k for some k K. Since k U we get (H 1 U) k = H1 k U k = H 2 U and so H 1 U and H 2 U are conjugate in U. (a) =: Let B be the set of left transversals to U in G and fix S 0 in B Suppose that there exists a complement A to K in U. Let g G. We claim that 1. There exists uniquely determined s g S 0, k h K and a g A with g = s g k g a g. Indeed since S 0 is a left transversal to U there exists uniquely determined s g S 0 and u g U with g = s g u g. Since A is a complement to K in U, there exists uniquely determined k g K and a g A with u g = k g a g. 2. Put g 0 = s g k g. Then g 0 is the unique element of S 0 K with ga = g 0 A. If g 1 S 0 K with ga = g 1 A, then g 1 = s 1 k 1 and g = g 1 a 1 for some s 1 S 0, k 1 K and a 1 A. Then g = g 1 k 1 a 1 and so g 1 = g 0 by (1 ). Define S = {T B T S 0 K}. For T G put T 0 := {t 0 t T } 3. If L B, then L 0 is the unique element of S with LA = L 0 A. Since l 0 A = la we have lu = lu and so L 0 is a left transversal to U. Moreover, L 0 A = LA and so L 0 S. Now suppose L 1 S with LA = L 1 A. Then for each l L there exists l 1 L 1 with la = l 1 A. Since l 1 L 1 S 0 K we conclude that l 1 = l 0. Thus L 0 L 1 and since L 0 and L 1 are both transversals to U we conclude that L 0 = L 1. Let x G and T G define x T := (xt ) Let L B. Then x L S and x L = x L 0. Since xl is a left transversal to U in G, (2 ) implies that x L S. Now (x L)A = (xl) 0 A = xla = x(la) = x(l 0 A) = (xl 0 )A = (xl 0 ) 0 A = (x L 0 )A Since both x and x L 0 are contained in S, the uniqueness statement in (3 ) shows that x L = x L S G S, (L, x) x L is an action of G op on S.
16 16 CHAPTER 1. GROUP ACTIONS By (4 ), x L S. Since L = L 0 for all L S we have 1 L = (1L) 0 = L 0 = L. Let x, y G. Then x (y L) = x (yl) 0 (4 ) = x yl = (x(yl)) 0 = ((xy)l) 0 = xy L and so is indeed an action. For R, S S define R S := (r,s) R S ru=su Since RK = S 0 K = SK for each r R there exists s S with rk = sk. Then also ru = su. Since K is normal in H, Kr = Ks and rs 1 K. Hence R S K and since K is Abelian, the definition of R S does not depend on the chosen order of multiplication. Define the relation in S by R S if R S = 1. As in is an equivalence relation on S. Next we show 7. k S = ks for all k K, S S. Indeed rs 1 ksk = ks 0 K = kks 0 = KS 0 = S 0 K and so ks S. As ksa = ksa, the definition of (ks) 0 implies (ks) 0 = ks and so (7 ) holds. 8. x R x S = x(r S)x 1 for all x G and R, S S. Let r R. Since R, S S we have RK = S 0 K = SK and so r = sk for some s S and K. Then s is the unique element of S with ru = su/ Note that xr = xsk and xru = xsu. We have xs = xsk = (s xs k xs a ks k = s ks (k xs k a 1 ks )a ks and so a rs = a ks. Also (xr) 0 = s xr k xr = (xr)a 1 xr = (xr)a 1 xs, (xs) 0 = (xs)a 1 xs and (xr) 0 U = xru = xsu = (xs) 0 U. Thus x R x S = ( r, s) ((xr) 0,(xS) 0 ) r s 1 = ru= su = (r,s) (R,S) ru=su (xra 1 xs )(xsa 1 (r,s) (R,S) ru=su xs ) 1 = (r,s) (R,S) ru=su (xr) 0 (xs) 1 0 xra 1 xs a xs s 1 x 1 ( ) = x (r,s) (R,S) rs 1 x 1 = x(r S)x 1 ru=su 9. is G-invariant and K acts regularly on S/modsim.
17 1.3. FROBENIUS GROUPS 17 In view of (7 ) and (8 ) this follows as in the proof of From (9 ) and we conclude that there exists a complement to K in G. (b) = : Let H 0 and H 1 be complements to K in G such that H 0 U is conjugate to H 1 U in U. Then H 1 U = (H 0 U) u = H u 0 U for some u U. If H 1 is conjugate to H u 0 in G, then H 1 is also conjugate to H 0 in G. So it suffices to show that H 1 and H u 0 are conjugate in G and replacing H 0 by H 1 we may assume that H 1 U = H 0 U. Put A = H 0 U. Then A is a complement to K in U. 10. Let T H i. Then T is a left transversal to A in H i if and only if T is a left transversal to U in G. This follows from (c). Let S 0 be a left transversal to A in H 0. Then by (10 ), S 0 is left transversal to U in G and we can use it to define the set S. Let s S 0. Since G = H 1 K, s = hk for some h H 1 and k K. Then sk 1 = h H 1. Put l s = k 1 and note that sk s H 1. Put S 1 = {sk s s S 0. Since k s U and S 0 is a left transversal to U in G, also S 1 is a left transversal to U in G. So by (10 ), S 1 is a left transversal to A in H 1. Moreover, S 1 S 0 K and so S 1 S. 11. Let L i be a left transversal to A in H i. Then (L i ) 0 = S i We have L i A = H i = S i A and so S i = (L i ) 0 by (3 ). Let x H i. Then xs i is a left transversal to A in H i and so by (11 ), x S i = (xs i ) 0 = S i. Thus H i G [Si ] and hence by (b), H i = G [Si ]. Since K acts transitively on S// there exists k K with [k S 0 ] = [S 1 ]. Then H k 0 = Gk [S 0 ] = G [k S 0 ] = G [S0 ] = H 1 and so H 0 and H 1 are conjugate in G. In the proof of the Gaschütz Theorem we used a complement A to K in U to find a complement H to K in G. Then of course H U is a complement to U in K. But these operation are not inverse to each other, that is H U can be different from A and might not even be conjugate to A in U. In fact, there are examples where there does not exist any complement H to K in G with A = U H. Suppose now that we start with a complement H to K in G, then the proof of (b) = shows that the complement to U in G constructed from the complement H U to K in U, is conjugate to H, as long as one choose the left transversal S 0 to be contained in H. 1.3 Frobenius Groups Lemma Let G be a group acting on a set Ω and N a normal subgroup of G acting regularly on Ω. Fix a Ω and for b Ω, let n b be the unique element of N with a n b = b. Then for all b Ω and g G a (n b ) g = n b g Thus the action of G a on Ω is isomorphic to the action of G a on N, and the action of G a on Ω \ {a} is isomorphic to the action of G a on N.
18 18 CHAPTER 1. GROUP ACTIONS Proof. Since g G a, also g 1 G a and so a g 1 = a. Thus a ng b = a g 1 n b g = a n bg = b g and so n g b = n b g. Definition Let G be a group acting on a set Ω. We say that G is a Frobenius group on Ω if (a) G acts faithfully and transitively on Ω. (b) G does no act regularly on Ω. (c) For all a Ω, G a acts semi-regularly on Ω \ {a}. K G (Ω) consists of all the g G such that g acts semi-regularly on Ω. Lemma Let G be a group, H G and put Ω = G/H. equivalent: Then the following are (a) G is a Frobenius group on Ω. (b) 1 H G and H H g = 1 for all g G \ H. In this case K G (Ω) = {g G C Ω (g) = } = G \ H G = Proof. (a) = (b): If H = 1, then G acts regularly on Ω, contrary to the definition of a Frobenius group on Ω. So H 1 and in particular, G 1. If G = H, then G acts trivially and so not faithfully on Ω. Thus H G. Let g G \ H. Then H Hg. Since H = G H acts semiregularly on Ω \ {H} we conclude that H H g = G H G Hg = 1. (a) = (b): H 1, G does not act regularly on Ω. Since H G, there exists g G \ H. Hence C G (Ω) G H G Hg = H H g = 1 and G acts faithfully on Ω. Let Ha, Hb Ω with Ha Hb. Then ab 1 / H and so G Ha G Hb = H a H b = (H ab 1 H) b = 1 b = 1. Thus G Ha acts semiregulary on Ω\Ha and so G is a Frobenius group on G. Suppose now that (a) and let 1 g K Ω (G). Since g acts semiregulary on Ω, g G ω = 1 for all ω Ω and so g / G ω and ω / C Ω (g). Thus K G (Ω)subseteq{g G C Ω (g) = }. Let g G with C Ω (g) = and let l G. Then Hl / C Ω (g) and so g / G Hl = H l. Thus {g G C Ω (g) = } = G \ H G. Let g G \ H G. Since 1 H, g 1. Let ω Ω. Since G ω H G we have g / G ω. Hence ω ω g and so G ω G g ω = 1. Since g normalizes every subgroup of g. g G ω = ( g G ω ) g G ω g and so g G ω = 1. Thus g acts semiregularly on Ω and g K G (Ω).
19 1.3. FROBENIUS GROUPS 19 Definition Let G be group and H a subgroup of G. Put K G (H) = G \ H G. We say that G is a Frobenius group with Frobenius complement H and Frobenius kernel K G (H) if (a) 1 H G. (b) H H g = 1 for all g G. Theorem (Frobenius). Let G be a finite Frobenius group with complement H and kernel K. Then G is the internal semidirect product of K by H. We will proof this theorem only in the case that H has even order. Currently all the proves available for Frobenius Theorem use character theory. Lemma Let G be a finite Frobenius group with complement H and kernel K. Put Ω = G/H. (a) Let g G \ K. Then g has a unique fixed point on Ω (b) Ω = G/H = K and K 1 mod H. (c) G / \ K G 2 > G 2. Proof. (a) Since g / K, g 1 and g H l for some l G. Thus g fixes Hl. Since G Hl acts semiregulary on Ω \ Hl, Hl is the only fix-point of g on Ω. (b) Clearly Ω = G/H. Since H acts semiregularly on Ω \ {H}, all orbits of H on Ω \ {H} are regular and so have length H. Thus Ω 1 mod H. From H H g = 1 for all g G \ H we conclude that N G (H) = H and so H G = G/N G (H) = G/H. Moreover,H g H l = 1 for all g, l G with H g H l and so H G is the disjoint union of H g, g G. There are G/H such conjugates and each conjugate as H 1 elements. Thus H G = G/H ) H 1 = G G/H. Since K = G \ H G this gives K = G/H. (c) Since H 1, H 2 and so K = G/H G 2. This implies (c). Lemma Let G be a finite Frobenius group with complement H and kernel K. (a) Let U G. Then one of the following holds: 1. H U = U H. 3. U is Frobenius groups with complement U H and kernel U K. (b) Let H 0 be any Frobenius complement of G. Then there exists g G with H H g 0 or H 0 H g.
20 20 CHAPTER 1. GROUP ACTIONS Proof. (a) We may assume that H U 1 and H U. Then H U U. If g U \(U H), then g / H and so (U H) (U H) g H H g = 1. Thus U is a Frobenius group with complement U H and kernel (say) K. Note that (U K) (U H) g K H g = 1 for all g U and so U K K. Let u U \ (U K). Then u H g for some g U. Since u 1 we have U H g 1. Suppose that U H g, then 1 U H H g and so H = H g and U H, a contradiction. Hence U H g and as seen above U H g is a Frobenius complement of U. From 1.3.6(c) applied to the Frobenius complements U H and U H g of U, (U H) U + (U # H g ) U > U 2 + U 2 = U Thus the two subsets (U H) U and (U H g ) U of U cannot be disjoint and there exists u 1, u 2 U with (U H) u 1 (U H g ) u2. Thus H u 1 H gu2 1. It follows that H u 1 = H gu 2 and so H g = H u 1u 1 2 H U. Thus u (U U) U and u / K. We proved that U K \ K and (U \ K) U \ K. Thus U K = K and (a) holds. (b) We may assume that H 0 H g for all g G. If H 0 H g 1 for some g G then (a) shows that H 0 K is a Frobenius kernel for H 0 and so H 0 K 1. If H 0 H g = 1 for all g G, then H 0 K. So in any case H 0 K 1. Put m = H 0 K. Then m is a positive integer. Let g G. If g H 0, then (H 0 K) g = H 0 K and if g / H 0, then (H ) K) (H 0 K) g H 0 H g 0 = 1. Thus (H 0 K)G is the disjoint union of G/H 0 sets, each of size H 0 K = m. Thus and (H 0 K)G = m G/H 0 G/H = K (H 0 K) G m G/H G/H 0 Hence H < H 0. So if H 0 H g for all g G, then H < H 0. By symmetry, if H H g 0 for all g G, then H 0 < H. This proves (b). Theorem Let G be a finite Frobenius group with complement H and kernel K. If H is even, G is the internal semidirect product of K by H. Proof. Since H has even order there exists t H with t = 2. We will first show that 1. tt g K for all g G. Since g / H. H H g = 1 and so t g t 1. Thus a := tt g 1. Observe that both t and t g invert a. Suppose for a contradiction that a H x for some x G. Then a = (a t ) 1 H xt and similarly a H xtg. Thus a H x H xt H xtg and so H x = H xtg and both t and t g are contained in H x. So t H H x and t g H g H x. It follows that H = H x = H g, a contradiction to g / H. This completes the proof of (1 ).
21 1.3. FROBENIUS GROUPS 21 Let S be a transversal to H in G with 1 S. Let r, s S with tt r = tt s, then t s = t r H r H s. Thus H r = H s, H rs 1 = H, rs 1 H and Hr = Hs. Since S is a tranversal, r = s. It follows that tt S = S = G/H = K. Since tt 1 = 1 K and s / H for all s S \ 1, (1 ) shows that tt K. Hence tt S = K. Since K = K 1 we get K = (tt S ) 1 = t S t. Let k 1, k 2 K. Then k 1 = t s 1 t and k 2 = tt s 2 for some s 1, s 2 S. Thus k 1 k 2 = (t s 1 ttt s 2 = t s 1 t s 2 = (tt s 2s 1 1 ) s 1 Note that either s 2 = s 1 or s 2 s1 1 / H. Thus by (1 ), tt s 2s 1 1 K. Since K is invariant under conjugation, we conclude that k 1 k 2 K. Thus K is closed under multiplication. Clearly K is closed under inverses and under conjugation by elements of G. Hence K is a normal subgroup of G. Since K H = 1 and K H = G/H H = G we get G = HK and so G is the internal semidirect product of K by H. Lemma Let G be the internal semidirect products of K by H. Suppose that K 1 and H 1. Put Ω = G/H. Then (a) K acts regularly in Ω. (b) K G (H) = {hk h H, k K \ {[h, l] l K}. In particular, K K G(H) and K = K G (H) if and only if for all h H, K = {[h, l] l K}. (c) h H acts fixed-point freely on Ω \ {H} if and only if C K (h) = 1. In particular, H is a Frobenius complement in G if and only if C K (h) = 1 for all h H. (d) If G is finite, H is a Frobenius complement if and only if K = K G (H). (e) K G (H) is a subgroup of G if and only if K = K G (H). Proof. (a) Since K is normal in G and K H = 1 we have K H g = 1 for all g G and so K acts regularly on Ω. Since G = HK, K acts transitively on Ω and so (a) holds. (b) Let g G. Then g K G (H) if and only if g a r for all a H and r G. Since G = HK and H K = 1 there exists uniquely determined k, l K and h, b H with g = hk and r = bl. Then a r = a bl = (a b ) l = a b (a b ) 1 l = a b [a b, l] Thus g = a r if and only if h = a b and k = [a b, l] = [h, l]. So hk / K G (H) if and only if k = [h, l] for some l K. Hence (b) holds. (c) By (a) K acts regularly on Ω. So by 1.3.1, the action of H on Ω \ {H} is isomorphic to the action of H on K. This implies (c). (d) Let h H. Then the map K/C K (h) {[h, l l L}, C K (h)l [k, l] is a welldefined bijection. Hence C K (h) = 1 if and only if K/C K (h) = K and if and only if {[h, l] l L} = K. So (d) holds. (e) Suppose that K G (H) is a subgroup of G. Since K K G (H) and G = HK we have K G (H) = (K G (H) H)K = 1K = K.
22 22 CHAPTER 1. GROUP ACTIONS Example (a) Let K be a non-trivial Abelian group with no elements of order 2. Let t Aut(A) defined by a t = a 1 for all a A. Let H = t and let G be the semidirect product of K by H. Then G is a Frobenius group with complement H. K G (H) is a subgroup of G if and only if K = {k 2 k K}. In particular, the infinte dihedral group is an example of a Frobenius group, where the kernel is not a subgroup. (b) Let K be a field, K = (K, +) and H = (K, ). Then H acts on K via right multiplication and H K is a Frobenius group with complement H. Proof. (a) We have a t = a iff a 1 = a iff a 2 = 1 iff a = 1. Thus C K (t) = 1 and so H is a Frobenius complement in G. Since [t, l] = (l 1 ) t 1 l = ll = l 2, K = K G (H) if and only if K = {l 2 l L. If K = (Z, +), then G is the infinite dihedral group. Since 2Z Z we conclude that K G (H) is not a subgroup of G. (b) If h H and k K, then 0 k and 0 h 1. Thus hk h and so C K (h) = 0. Moreover [h, k] = ( k)(h 1 ) + k = k(1 h 1 ). Since 1 h 1 0, we conclude that every element of K is of the form [h, k] with k K and so K = K G (H). 1.4 Imprimitive action Definition Let G be a group acting on set Ω. (a) A system of imprimitivity for G on Ω is a G-invariant set B of non-empty subsets of Ω with A = B. (b) A set of imprimitivity for G on Ω is a subset B of Ω such that B = B g or B B g = for all g G. (c). A system of imprimitivity B for G on Ω is called proper if B = {Ω} and B {{ω} ω Ω}. (d) A set of imprimitivity B is called proper if B 2 and B Ω. (e) G acts primitively on G if there does not exit a proper set of imprimitivity for G on Ω Lemma Let G be a group acting on a set Ω. (a) Let B be a set of imprimitivity for G on Ω and B B. Then B is a set of imprimitivity. B is proper if and only of B contains a proper set of imprimitivity. (b) Let B be set of imprimitivity for G on Ω. Define B = B G if B G = Ω and B = B G {Ω \ B G otherwise. Then B is system of imprimitivity for G on Ω. B is proper if and only if either B is proper or Ω \ B G 2.. (c) G acts primitively on Ω if and only if there does not exit a proper set of imprimitivity for G on Ω,
23 1.4. IMPRIMITIVE ACTION 23 Proof. (a) Let g G. Then B, B g both are contained in B and so either B = B g or B B g =. Thus B is a set of imprimitivity. Observe B Ω iff an only if B Ω for all B B and iff B Ω for some B B. Also B {{ω} ω Ω if and only if B contains an element B with B 1. Thus B is prober if and only if it contains an element B with B 2 and B Ω. (b) Clearly B is G invariant. Since B = B g or B B g = for all g G we have Ω = B. B is proper iff if contains a proper set of imprimitivity, iff B is proper or Ω \ B G is proper and iff B is proper or Ω \ B G 2. (c) Suppose G is not imprimitive on Ω iff there exists a proper system of imprimitivity for G on Ω. By (a) and (b) this is the case if and only if the exists a proper set of imprimitivity for G on Ω. Lemma Suppose G acts primitively on a set Ω. Then either G acts transitively on Ω or Ω = 2 and G acts trivially on Ω. Proof. Suppose that G does not act transitively on Ω. Let O be an orbit for G on Ω. Then {O, Ω\O} is system of imprimitivity for G on Ω. Since G acts primitively, O = 1 = Ω\O. Thus Ω = 2 and G acts trivially on Ω. Lemma Let G be a group acting transitively on Ω and let ω Ω. Then the map H ω H is a bijection between the subgroups of G containing G ω and the sets of imprimitivity containing ω. The inverse of this bijection is given by N G ( ) Moreover, ω H is a proper, if and only if G ω H G. Proof. Let G ω H G. We will first show that ω H is indeed a set of imprimitivity. For this let g G with ω H ω Hg. Then ω h 1 = ω h2g for some h 1, h 2 Ω. Hence h 2 gh 1 1 G ω H and so ω Hg = ω H. Now let be a set of imprimitivity with ω. Since ω = ω g g for all g G ω we get = g and so G ω N G ( ). We showed that both of our maps are well-defined. Next we show that they are inverse to each other. Clearly H N G (ω H ). Since N G (ω H ) acts on ω H and H acts transitively on ω H, the Frattini argument gives N G (ω H ) G ω H = H. Clearly ω NG( ). Let µ. Since G acts transitively on G, µ = ω g for some g G. Then µ = ω g and so = g and g N G ( ) and µ ω NG( ). Hence ω NG( ) =. We proved that the two maps are inverse to each other and so are bijection. The non-proper sets of imprimitivity containing ω are {ω} and Ω. Since N G ({ω}) = G ω and N G (Ω) = G we conclude that ω H is proper if and only if H G ω and H G.
24 24 CHAPTER 1. GROUP ACTIONS Corollary Suppose G acts transitively on Ω and let ω Ω. Then G cats primitively on Ω iff G ω is a maximal subgroup of G. Proof. Since G acts transitively on Ω there exists a proper set of imprimitivity for G on Ω iff ther exists a proper set of imprimitivity containing ω. Thus G acts primitively on G if and only if {ω} and Ω are the only sets of imprimitivity containing ω. By 1.4.4, this holds iff G ω and G are the only subgroups of G containing G ω and so iff G ω is a maximal subgroup of G. Lemma Let G be a group and N a normal subgroup of G. The the orbits of N on G form a system of imprimitivity for G on Ω. This system is proper unless N acts transitively on Ω or trivially on Ω. Proof. Let ω N be an orbit for N on G and g G. Then omega Ng = ω gn is also an orbit for N on Ω. Thus the set of orbits of N on G is G- invariant. Ω is the disjoint union of these orbits and so the orbits indeed form a system of imprimitivity. The system is proper unless one of the orbits is equal to Ω or all orbits have size 1. So unless N acts transitively on Ω or acts trivially on Ω. Corollary Let G be a group acting faithfully and primitively on a set Ω. Then all non-trivial normal subgroups of G act transitively on Ω. Proof. Since G acts faithfully on G, a non-trivial subgroup cannot act transitively on Ω. Thus the Corollary follows from Wreath products Lemma Let G be a group acting on set Ω and H a group. Then G acts on the group H Ω via f g (ω) = f(ω g 1 ) for all f H Ω, ω Ω. Proof. Readily verified. Definition Let G be a group acting on set Ω and H a group. The G Ω H denotes the semidirect product of H Ω by G with respect to the action defined in Lemma Let G be a group and H a subgroups of G. Let S be a transversal to H in G and for a G/H let τ(a) be the unique element of a S. Put Ω = G/H. Then the map ρ S : G G Ω H g (g, f g ) where f g H Ω is defined by f g (a) = τ(ag 1 )gτ(a) 1 is a well defined monomorphism. Moreover, if T is a another transversal to H in G, then there exists b G Ω H with ρ(t )(g) = ρ S (g) b for all g G.
25 1.5. WREATH PRODUCTS 25 Proof. Observe first that G Ω H is a subgroup of G Ω G. For g G, define c g ω : G G Ω, ω g. Then c b a = c a for all a, b G and so the map c : G G Ω G, g (g, c g ) is a monomorphism. Note that the function τ : a τ(g) is an element of G Ω and so (1, τ) is an element of G Ω G. Let g G. Then (1, τ)(g, c g )(1, τ) 1 = (g, τ g c g )(1, τ 1 ) = (g, τ g c g τ 1 ) and τ g c g τ 1 )(a) = τ(ag 1 gτ(g) 1 = f g (a). Thus ρ S is the composition of the monomorphism c and the inner automorphism of G Ω G induced by τ 1. So ρ S is a monomorphism. Note that Hτ(ag 1 )g = H(ag 1 )g = Ha = Hτ(a). Hence f g (a) H and so ρ S (G) G Ω H. Now let T be another transversal. Write τ S and τ T for the function from Ω to G corresponding to S and T, respectively. Since Hτ S (a) = Ha = Hτ T (a), τ S τ 1 T is an element of H Ω. Choosing b = (1, τ S τ 1 T ) G Ω H we see that the lemma holds. Lemma Let G be a group acting on a group H and let Ω be a set such that G and H act on Ω. Suppose that for all g G, h H and ω in Ω, Then G H acts on Ω via ω (g,h) = (ω g ) h. ((ω g 1 ) h ) g = ω hg Proof. Let ω Ω, g, g G and h, h H. We will write ω abc... for (((ω a ) b ) c ).... We have and ω (1,1) = (ω 1 ) 1 = ω ω (g,h)( g, h) = ω gh g h = ω g g( g 1 h g) h = ω g gh gh = ω (g g,h g h) = ω ((g,h)( g, h)) and so the lemma is proved. Lemma Let G be a group acting on set A and H a group acting on a set B. Then (a) G A H acts on A B via (a, b) (g,f) = (a g, b f(ag). (b) {a B a A} is a system of imprimitivity for G +AH and for G on A B. Proof. (a) Clearly G acts on A B via (a, b) g = (a g, b) and H A acts on Ω via (a, b) f = (a, b f (a)). Also (a, b) g 1 fg = (a g 1, b) fg = (a g 1, b f(ag 1 ) ) g = (a, b f(ag 1 ) ) = (a, b f g (b) ) = (a, b) f g Hence by G A H = G H Ω acts on A B via
26 26 CHAPTER 1. GROUP ACTIONS (a, b) (g,f) = (a, b) gf = (a g, b) f = (a g, b f(ag) ) Clearly A B = a A a B Moreover for g G, (a B) g = a g B and for f H Ω, (a, B) f = a B. So {a B a A} is G A H-invariant. Lemma Let G be a group and H a subgroup of G. Suppose H acts on set B and put A = G/H. Let S be transversal to H in G and let ρ S and f g be as in (a) G acts in A B via (a, b) g = (a, b) ρ S(g) = (ag, b fg(ag) ). (b) {a B a A} is a system of imprimitivity for G on A B. (c) B := {(H, b) b B} is an set of imprimitivity for G on A B, N G ( B) = H and B is H-isomorphic to B. Proof. Since ρ S is a homomorphism, (a) and (b) follow from Note that B g = B iff Hg = H and so iff g H. Thus (a) holds. Lemma Let G be a group acting on a set Ω, B a set of imprimitivity for G on Ω, H = N G (B), A = G/H and let S be a transversal to H in G. Define τ and ρ = ρ S as in Also define an action of G A H on A B as Define ɛ : A B Ω, (a, b) b τ(a) Then ɛ is injective G-equivariant map with image B G and ɛ({(h, b), b B}) = B. Proof. Suppose that b τ(a) = b τã. Note that this element of Ω lies in B τ(a) and B τ(ã) and since B is set of imprimitivity, B τ(a) = B τ( b). Thus τ(a)τ(ã) 1 H and so a = Hτ(a) = Hτ(ã) = ã. Hence also b = b and ɛ is injective. If g G, then B g = B Hg = B τ(hg) and so the image of ɛ is B G. Let f g be as Thenf g (ag) = τ(agg 1 )gτ(ag) 1 = τ(a)gτ(ag) 1. We compute ɛ((a, b) g )) = ɛ((a, b) ρ(g) ) = ɛ((a, b) (g,fg) ) = ɛ((ag, b fg(ag) ) = b τ(a)gτ(ag) 1 τ(ag) ) = b τ (a)g = ɛ(a, b) g 1.6 Multi-transitive action Definition (a) Let Ω be a set and n N. Then Ω n = {(ω 1, ω 2,..., ω n ) Ω n ω i ω j for all 1 i < j n}. (b) Let G be a group acting on a set Ω and n N with n Ω. We say that G acts n-transitive on Ω if G acts transitively on Ω n. (Note here that G acts on Ωn via (ω 1, ω 2,..., ω n ) g = (ω g 1,..., ωg n) and Ω n is an G-invariant subset of Ω n.
27 1.6. MULTI-TRANSITIVE ACTION 27 (c) Let Ω be a set, n N and ω = (ω 1,..., ω n ) Ω n. Then ω = {ω 1, ω 2,..., ω n }. Lemma Let G be a group acting on a finite set Ω. Then G acts Ω -transitive on Ω if and only of G...Ω = Sym(Ω). Proof. Let ω, µ Ω n. Then there exists exactly one element π Sym(Ω) with ωπ = µ. So Sym(Ω) acts Ω -transitive. Conversely suppose G acts Ω -transitive on Ω and let π Sym(Ω). Then there exists g G with ω g = ωπ and so the image of g in Sym(Ω) is π. Thus G...Ω = Sym(Ω). Example Let K be a field and V a non-zero vector space over K. Let GL K (V ) be the group of K-linear automorphism of V. (a) GL K (V ) acts transitively on V. (b) If K = 2 and dim K V 2, then GL K (V ) acts 2-transitive on V. (c) If K = 2 and dim K V = 2 then GL K (V ) acts 3-transitive on V. (d) If K = 3 and dim K V = 3, then GL K (V ) acts 3-transitive on V. (e) If dim K (V ) 2, then GL K (V ) acts 2-transitive on the set of 1-dimensional subspace of V. Lemma Let G group acting n-transitive on a set Ω. (a) G acts m-transitively on Ω for all 1 m n. (b) Let m Z + with n + m Ω and ω Ω n. Then G acts n + m-transitive on Ω if and only if G ω acts m-transitively on Ω \ ω Proof. (a) is obvious. (b) = : Suppose that G acts n + m-transitive on Ω and let α, β (Ω \ ω) m. The (ω, α) and (ω, β) both are contained in Ω n+m. Thus there exists g G. With ωg = ω and α g = β. So g G ω and G ω acts m-transitive on Ω \ ω. =:. Suppose that G ω acts m-transitive on Ω \ ω and let α, β Ω n+m. Let γ {α, β}. Pick γ 1 Ω n and γ 2 (Ω \ γ 1 ) m with γ = (γ 1, γ 2 ). Since G acts n-transitive on Ω there exists g γ G with γ gγ 1 = ω and so γ gγ 2 (Ω \ ω) m. Since G ω acts m-transitive on Ω \ ω there exists h G ω with (α gα 2 )h = β g β 2. Put g = g αhg 1. Then and α g 1 = αgαhg 1 β 1 = ω hg 1 β = ω g 1 β = β 1 β α g 2 = αgαhg 1 β 2 = β 2 Thus α g = β and G acts n + m-transitive on Ω.
28 28 CHAPTER 1. GROUP ACTIONS Lemma Let G be the internal semidirect product of K by H. Put Ω = G/H. (a) K acts regularly on Ω. (b) Let n Z + with n < Ω. Then G acts n + 1 transitive on Ω if and only if H acts n-transitive on K. Proof. (a) Since K H g = (K g 1 H) g = 1 for all g G, K acts semiregularly on Ω. Since G = HK, K acts transitively on Ω. (b) By G acts n + 1-transitive on Ω if and only if H acts n-transitive on Ω \ {H}. By 1.3.1, the action of H on Ω \ {H} is isomorphic to the action of H on K. So (b) holds. Example Let K be a field and V a non-zero vector space over K. Let G be the external semidirect product of V by GL K (V ) and let Ω = G/H {1}. Then (a) G acts 2-transitive on Ω. (b) If K = 2, then G acts 3-transitive on Ω. (c) If K = 2 and dim K V = 2, then G acts 4-transitive on Ω. (d) If K = 3 and dim K V = 1, then G acts 3-transitive on Ω. Proof. This follows from and Note that in 1.6.6(c), Ω = V = 4. Since G acts 4-transitive on Ω we conclude from that G = Sym(4). So Sym(4) is isomorphic to the external semidirect product of F 2 2 by GL F2 (F 2 2 ). Lemma Let n Z + and G a group acting n-transitive on a finite set Ω. Suppose there exists a normal subgroup N of G acting regularly on Ω. Then n 4 and one of the following holds. 1. n = n = 2 and N is an elementary abelian p-group for some prime p. 3. n = 3 and either N is an elementary abelian 2-group or N = 3 = Ω and G Ω = Sym(Ω). 4. n = 3, N is elementary abelian of order 4, Ω = 4 and G Ω = Sym(Ω). Proof. We may assume that n 2. Let ω Ω. Then G is the internal semidirect product of N by G ω and so by 1.6.5, G ω acts n 1-transitive on N. Let p be a prime divisor of N. Since G ω acts transitively on N and N has an element of order p, all non-trivial elements of N have order p. Thus N is a p-group and so Z(N) 1. Since Z(N) is invariant under G ω we conclude that N = Z(N) and so N is an elementary abelian p-group. If n = 2 we conclude that (2) holds and if n = 3 and p = 2, (3) holds. So it remains to consider the cases n 3 and p is odd and n 4 and p is even.
29 1.7. HYPERCENTRAL GROUPS 29 Suppose n 3 and p is odd. Then C Gω (x) acts transitively on N \ {x}. Since x 1 N \{x} and C Gω (x) fixes x 1 we get N \{x} = {x 1 }. Thus N = {1, x, x 1 }, Ω = N = 3 and n = 3. By 1.6.2, G Ω = Sym(Ω) and (3) holds. Suppose next that n 4 and p = 2. Let y N \ x. Then xy N \ {x, y} and C GΩ ({x, y}) acts transitively on N \ {x, y}. Since C GΩ ({x, y}) fixes xy, this implies that N \ {x, y} = {xy}. Thus Ω = N = 4. So also n = 4 and by 1.6.2, G Ω = Sym(Ω). Hence (4) holds in this case. 1.7 Hypercentral Groups Lemma Let G be a group and a, b, c in G. Then (a) [a, b] = a 1 a b, a b = a[a, b] and ab = ba[a, b] (b) [a, bc] = [a, c][a, b] c. (c) [ab, c] = [a, c] b [b, c] (d) [b, a] = [a, b] 1 = [a 1, b] a = [a, b 1 ] b. (e) [a, b 1, c] b [b, c 1, a] c [c, a 1, b] a = 1 Proof. (a) follows immediately from [a, b] = a 1 b 1 ab and a b = b 1 ab. (b) [a, c][a, b] c = (a 1 c 1 ac)c 1 (a 1 b 1 ab)c = a 1 c 1 b 1 abc = [a, bc] (c) [a, c] b [b, c] = b 1 (a 1 c 1 ac)b(b 1 c 1 bc) = b 1 a 1 c 1 abc = [ab, c]. (d) a 1, b] a = a 1 (ab 1 a 1 b)a = b 1 a 1 ba = [b, a], and (e) [b, a] = b 1 a 1 ba = (a 1 b 1 ab) 1 = [a, b] 1, [a, b 1 ] b = (a 1 bab 1 ) b = b 1 a 1 ba = [b, a] [a, b 1, c] b = [a 1 bab 1, c] b = (ba 1 b 1 ac 1 a 1 bab 1 c) b = ( a 1 b 1 ac 1 a 1) ( bab 1 cb ) = (aca 1 ba) 1 (bab 1 cb) Put x = aca 1 ba, y = bab 1 cb and z = bab 1 cb. Then [a, b 1, c] b = x 1 y Cyclicly permuting a, b and c gives [b, c 1, a] c = y 1 z
30 30 CHAPTER 1. GROUP ACTIONS and Since (x 1 y)(y 1 z)(z 1 x) = 1, (e) holds. [c, a 1, b] a = z 1 x Lemma Let G be a group and A and B subsets of G. (a) [A, B] = [B, A]. (b) If 1 B, then A B = A, [A, B]. (c) If A is a subgroup of G and 1 B, then [A, B] A B and A B = A[A, B] (d) If A and B are subgroups of G, then B normalizes A if and only if [A, B] A. (e) [ A, B] = [A, B] <A. (f) [ A, B ] = [A, B] A B. (g) If A and B are A-invariant, then [ A, B] = [A, B]. (h) If a G with B a = B, then [a, B] = [ a, B]. (i) [A, G] = [ A G, G]. Proof. Let a A and b, c B. (a) Follows from [a, b] 1 = [b, a]. (b) Then a b = a[a, b] A, [A, B]. So A B A, [A, B]. Since 1 B we have a = a 1 A B and so also [a, b] = a 1 a b A B. Thus A, [A, B] A, B and (a) holds. (c) Let d A. By 1.7.1(d), [ad, b] = [a, b] d [d, b] and so [a, b] d = [ad, b][d, b] 1 [A, B]. Thus A normalizes [A, B]. Since also [A, B] normalizes [A, B], (b) implies that [A, B] A B. Hence A B = A, [A, B] = A[A, B]. (d) B normalizes A iff A = A B iff A = A, [A, B] and iff [A, B] A. (e) Put H = [A, B] <A. Since [A, B] [ A, B] and A normalizes [ A, B] we conclude that H [ A, B]. Define D := {d A [d, B] H}. We will show that D is a subgroup of G. Let d, e D and b in D. Observe that H is an A invariant subgroup of G. Thus [de, b] = [d, b] e [e, b] H and [d 1, b] = ([d, b] 1 ) d 1 H Hence de D and d 1 D. Thus D is a subgroup of G. Since A D A, this gives D = A and so [ A, B] H. (f) By (e) [ A, B ] = [ A, B] B = [A, B] A B = [A, B] A B (g) If A and B are A-invariant, then A, B and [A, B] are A -invariant. Thus (g) follows from (e).
31 1.7. HYPERCENTRAL GROUPS 31 (h) Follows from (g) applied to A = {a}. (f) By (d), G normalizes [A, G]. Thus [A, G] = [A G, G]. Since G and A G are A-invariant, (g) gives [A G, G] = [ A G, G]. Definition Let G be a group and A G. Then Z(G, A) = {g G [G, g] A. Note that by 1.7.2(f), Z(G, A) is a normal subgroup of G. Lemma Let G be a group and A G. Put B = A G. Then and Z(G, A) = {g G Agh = Ahg for allh G} Z(G, A)/B = Z(G/B) Proof. By 1.7.2(h), [G, g] = [G, g ] = [G, g 1 ]. Hence g Z(G, A) iff [G, g] A, iff [G, g 1 ] A iff [h 1, g 1 ] A for all h G, iff hgh 1 g 1 A for all h G, and iff Ahg = Agh for all h G. Since [G, g] is a normal subgroup of G, [G, g] A iff [G, g] B and iff Bg Z(G/B). Lemma Let G be a group and A B G. (a) Z(G, A) Z(G, B). (b) Z(G, A) N G (A). (c) If A G, then Z(G, B)/A = Z(G/A, B/A) Proof. (a): [Z(G, A), G] A B. (b) [Z(G, A), A] [Z(G, A), G] A. (c) [g, h] A if and only if [gn, hn]n A/N. Definition Let G be a group and α an ordinal. Define the groups Z α (G) and L α (G) inductively via and 1 if α = 0 Z α (G) = Z(G, Z β (G)) if α = β + 1 for some ordinal β β<α Z β(g) if β is a limit ordinal G if α = 0 L α (G) = [L β (G), G] if α = β + 1 for some ordinal β β<α L β(g) if β is a limit ordinal Let z G be the smallest ordinal α with Z α (G) = Z α+1 (G) and l G be smallest ordinal α with L α (G) = L α+1 (G). Put Z (G) = Z zg (G) and L (G) = L lg (G). G is called hypercentral of class z G if G = Z (G) and G is called hypocentral of class l G if G = L (G). Z (G) is called the hypercenter of G and L (G) the hypocenter of G.
32 32 CHAPTER 1. GROUP ACTIONS Example The hypercenter and hypocenter of D 2. Let C p k be a cyclic group of order p k and view C p k has a subgroup of C p k+1. Put C p = k=0 C p k. (C p is called the Prüfer group for the prime p. Let t Aut(C p ) be defined by x t = x 1 for all x C p. Let D p = t C p. Observe that for k N {infty}, C p k is a normal subgroup of D p. If k is finite, D p /C p k = D p. Also D p /C p = C2. We will now compute Z α (D 2 ). Since C 2 is Abelian and t does not centralize C 2 we have C D2 (C ) = C 2. Thus Z(D 2 ) C 2 and Z(D 2 ) = C C2 (t). x C 2 is centralized by t if and only if x t = x 1 = x and so iff x 2 = 1. Thus Z(C 2 ) = C 2. Let k N and suppose inductively that Z k (C 2 ) = C 2 k. Since D 2 /C 2 k = D 2 we get Z(D 2 /C 2 k) = C 2 k+1/c 2 k and so Z k+1 (C 2 ) = C 2 k+1. Let ω be the first infinite ordinal. Then Z ω (D 2 ) = Z k (D 2 ) = C 2 k = C 2 k<ω Since D 2 /C 2 is isomorphic to C 2 and so is Abelian, we conclude that Z ω+1 (D 2 = D 2 and so D 2 is hypercentral of class ω + 1. Since D 2 /C 2 is abelian, L 1 (D 2 ) C 2. Let x C 2. Then [x, t] = x 1 x t = x 2. Since each element if C 2 k is the square of an element in C 2 k+1 we conclude that C 2 = [C 2, t] = [C 2, D 2 ] L 1 (D 2 ). Thus L 1 (D 2 ) = C 2 and k<ω L 2 (D 2 ) = [C 2, D 2 ] = C 2 = L 1 (D 2 ) So C 2 is the hypocenter of D 2 and D 2 is not hypocentral. Lemma Let G be a group and H a subgroup of G with H Z (G). Let α be the first ordinal with Z α (G) H. Then Z α (G) Z(G, H). In particular, Z(G, H) H and H N G (H). Proof. Since Z 0 (G) = 1 H, α 0. If α is a limit ordinal, then Z α (G) = β<α Z β(g) H, a contradiction. Thus α = β + 1 for some ordinal β. Then Z β (G) H by minimality of α and so [Z α (G) = Z(G, Z β (G)) Z(G, H) Lemma Let G be a group and N a non-trivial normal subgroup of G with N Z (G). Then N Z(G) 1.
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Reminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
EE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Every set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S.
Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. Proof. ( ) Since α is 1-1, β : S S such that β α = id S. Since β α = id S is onto,
Congruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Finite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Chapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Fractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
The Small World Theorem
The Small World Theorem Ulrich Meierfrankenfeld, Bernd Stellmacher June 10, 2002 Assume M(S) 2 and Q!. We investigate the Structure of E/O p (E). For L L define L = L O p (L). In this section we assume
Lecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Example Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Lecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
A Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
DIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS
GANIT J. Bangladesh Math. oc. IN 606-694) 0) -7 DIRECT PRODUCT AND WREATH PRODUCT OF TRANFORMATION EMIGROUP ubrata Majumdar, * Kalyan Kumar Dey and Mohd. Altab Hossain Department of Mathematics University
ST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Matrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Tridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Cyclic or elementary abelian Covers of K 4
Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06 Outline 1 Question 2 Main results 3
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Homework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Affine Weyl Groups. Gabriele Nebe. Summerschool GRK 1632, September Lehrstuhl D für Mathematik
Affine Weyl Groups Gabriele Nebe Lehrstuhl D für Mathematik Summerschool GRK 1632, September 2015 Crystallographic root systems. Definition A crystallographic root system Φ is a finite set of non zero
3.2 Simple Roots and Weyl Group
44 CHAPTER 3. ROOT SYSTEMS 3.2 Simple Roots and Weyl Group In this section, we fix a root system Φ of rank l in a euclidean space E, with Weyl group W. 3.2.1 Bases and Weyl chambers Def. A subset of Φ
Partial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
C.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Uniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
w o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
CRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
James Lee Crowder Math 430 Dr. Songhao Li Spring 2016 HOMEWORK 5 SOLUTIONS
HOMEWORK 5 SOLUTIONS James Lee Crowder Math 430 Dr. Songhao Li Spring 2016 1. Let S G, where G is a group. Define the centralizer of S to be C G (S) = {g G gs = sg s S} and the normalizer of S to be N
1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Other Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Chapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
UNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition
UNIT - I LINEAR ALGEBRA Definition Vector Space : A non-empty set V is said to be vector space over the field F. If V is an abelian group under addition and if for every α, β F, ν, ν 2 V, such that αν
Section 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Lecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
de Rham Theorem May 10, 2016
de Rham Theorem May 10, 2016 Stokes formula and the integration morphism: Let M = σ Σ σ be a smooth triangulated manifold. Fact: Stokes formula σ ω = σ dω holds, e.g. for simplices. It can be used to define
Some new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.
Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary
THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS. Daniel A. Romano
235 Kragujevac J. Math. 30 (2007) 235 242. THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS Daniel A. Romano Department of Mathematics and Informatics, Banja Luka University, Mladena Stojanovića
Units and the Unit Conjecture
Units and the Unit Conjecture Joint with Peter Pappas David A. Craven University of Oxford London Algebra Colloquium, 4th November, 2010 David A. Craven (University of Oxford) The Unit Conjecture 4th November,
Problem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
12. Radon-Nikodym Theorem
Tutorial 12: Radon-Nikodym Theorem 1 12. Radon-Nikodym Theorem In the following, (Ω, F) is an arbitrary measurable space. Definition 96 Let μ and ν be two (possibly complex) measures on (Ω, F). We say
Chapter 2. Ordinals, well-founded relations.
Chapter 2. Ordinals, well-founded relations. 2.1. Well-founded Relations. We start with some definitions and rapidly reach the notion of a well-ordered set. Definition. For any X and any binary relation
Second Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Homomorphism of Intuitionistic Fuzzy Groups
International Mathematical Forum, Vol. 6, 20, no. 64, 369-378 Homomorphism o Intuitionistic Fuzz Groups P. K. Sharma Department o Mathematics, D..V. College Jalandhar Cit, Punjab, India pksharma@davjalandhar.com
Intuitionistic Fuzzy Ideals of Near Rings
International Mathematical Forum, Vol. 7, 202, no. 6, 769-776 Intuitionistic Fuzzy Ideals of Near Rings P. K. Sharma P.G. Department of Mathematics D.A.V. College Jalandhar city, Punjab, India pksharma@davjalandhar.com
Statistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
New bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
F A S C I C U L I M A T H E M A T I C I
F A S C I C U L I M A T H E M A T I C I Nr 46 2011 C. Carpintero, N. Rajesh and E. Rosas ON A CLASS OF (γ, γ )-PREOPEN SETS IN A TOPOLOGICAL SPACE Abstract. In this paper we have introduced the concept
Quadratic Expressions
Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots
Areas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Concrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Homomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Generating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
SOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Homework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Solutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Areas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
SOLVING CUBICS AND QUARTICS BY RADICALS
SOLVING CUBICS AND QUARTICS BY RADICALS The purpose of this handout is to record the classical formulas expressing the roots of degree three and degree four polynomials in terms of radicals. We begin with
On density of old sets in Prikry type extensions.
On density of old sets in Prikry type extensions. Moti Gitik December 31, 2015 Abstract Every set of ordinals of cardinality κ in a Prikry extension with a measure over κ contains an old set of arbitrary
The Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Parametrized Surfaces
Parametrized Surfaces Recall from our unit on vector-valued functions at the beginning of the semester that an R 3 -valued function c(t) in one parameter is a mapping of the form c : I R 3 where I is some
Srednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
On the Galois Group of Linear Difference-Differential Equations
On the Galois Group of Linear Difference-Differential Equations Ruyong Feng KLMM, Chinese Academy of Sciences, China Ruyong Feng (KLMM, CAS) Galois Group 1 / 19 Contents 1 Basic Notations and Concepts
( ) 2 and compare to M.
Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8
Cardinals. Y = n Y n. Define h: X Y by f(x) if x X n X n+1 and n is even h(x) = g
Cardinals 1. Introduction to Cardinals We work in the base theory ZF. The definitions and many (but not all) of the basic theorems do not require AC; we will indicate explicitly when we are using choice.
Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
dim(u) = n 1 and {v j } j i
SOLUTIONS Math B4900 Homework 1 2/7/2018 Unless otherwise specified, U, V, and W denote vector spaces over a common field F ; ϕ and ψ denote linear transformations; A, B, and C denote bases; A, B, and
TMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Sequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008
Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical
HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
On a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Lecture 10 - Representation Theory III: Theory of Weights
Lecture 10 - Representation Theory III: Theory of Weights February 18, 2012 1 Terminology One assumes a base = {α i } i has been chosen. Then a weight Λ with non-negative integral Dynkin coefficients Λ
Section 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Chapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Approximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Commutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
( y) Partial Differential Equations
Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate
Trigonometric Formula Sheet
Trigonometric Formula Sheet Definition of the Trig Functions Right Triangle Definition Assume that: 0 < θ < or 0 < θ < 90 Unit Circle Definition Assume θ can be any angle. y x, y hypotenuse opposite θ
ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Lecture 21: Properties and robustness of LSE
Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem
Bounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
derivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action