UNIVERSITY OF MALTA UNIVERSITY OF MALTA

FACULTY OF SCIENCE

Department of Mathematics

B.Sc. 2nd Year

May Session 1998


MA112 Groups (1.5 credits) May 1998

Time allowed: 2hours


Answer THREE questions

RESIT STUDENT (1 CREDIT): Answer TWO questions. Time: 1.5hrs


1. (a) Let G be a finite group, H £ G and X the set of left cosets of H in G. Show that there is an action of G on X such that the kernel of this action is contained in H.

Suppose G is a group of order 70 and suppose also that G contains a subgroup of order 14. Show that G cannot be simple.


(b) State carefully the three Sylow Theorems.

Prove that a group of order 992 cannot be simple.



2. Let G be a finite group acting on a finite set X. For x Î X let G(x) and Gx denote, respectively, the orbit and the stabiliser of x. Prove that

|G| = |G(x)|·|Gx|.

Now suppose |X| £ 90 and suppose G is a 7-group acting on X and having exactly one fixed point. Suppose also that H is an 11-group acting on X and that the action of H has no fixed points. Find |X|.



3. Let G be a finite group acting on a finite set X. For each g Î G, let F(g) denote the set {x Î X: [^(g)](x) = x}, where [^(g)] denotes the permutation of X corresponding to g under the action.

Prove that the number of orbits in X under this action is given by

1
|G|

å
g Î G 
|F(g)|.
[The Orbit-Stabiliser Theorem may be assumed without proof.]


A necklace is to be made from 9 beads strung on a circular wire; 6 of these beads are to be coloured white and 3 beads are to be coloured black. Ignoring the positioning of the fastening, how many essentially different necklaces can be made this way?



4. (a) Let Sn be the group of all permutations of the set {1,2,...,n}. For a Î Sn, let c(a) denote the number of cycles of a when it is written as a product of disjoint cycles. Let b Î Sn be a transposition. Give, without proof, the possible values of c(ba) in terms of c(a). Deduce from this that if a is written as a product of transpositions then the number of transpositions is always either odd or even.


(b) Let G be a subgroup of Sn, and let H be the subgroup of G consisting of all the even permutations in G. Show that either H = G or else |H| = |G|/2. (Hint: Define a suitable homomorphism from G to {1,-1}.)

Deduce that An, the group of all even permutations in Sn, has order equal to |Sn|/2.


(c) In the sequel you may assume that A5 is simple.

Let G be a non-trivial normal subgroup of S5, and let H be the subgroup of G consisting of all even permutations in G, that is, H = GÇA5.


File translated from TEX by TTH, version 2.00.
On 23 Dec 1999, 14:25.