Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Exercise 4.1.7(Primitive groups of permutations)
Exercise 4.1.7(Primitive groups of permutations)
Let be a transitive permutation group on the finite set . A block is a nonempty subset of such that for all either or (here is the set ).
- (a)
- Prove that if is a block containing the element of , then the set defined by is a subgroup of containing .
- (b)
- Show that if is a block and are all the distinct images of under the elements of , then these form a partition of .
- (c)
- A (transitive) group on a set is said to be primitive if the only blocks in are the trivial ones: the sets of size and itself. Show that is primitive on . Show that is not primitive as a permutation group on the four vertices of a square.
- (d)
- Prove that the transitive group is primitive on if and only if for each , the only subgroups of containing are and (i.e., is a maximal subgroup of , (i.e., is a maximal subgroup of , cf. Exercise 16, Section 2.4). [Use part (a).]
Answers
To give an example of blocks, consider the group , where and :
Then and , so is a block. Similarly and , so is another block.
(Example 14.2.1 of David Cox, where is the Galois group of over .)
Another interesting example (found in Dixon Mortimer “Permutation Groups” p.11) is the group of rotations of a cube (with vertices numbered : the pairs of opposite vertices form a partition of blocks of size , and the two tetrahedrons of the Stella Octangula of Kepler give two blocks of size (see the article “Stellated octahedron” on Wikipedia :
https://en.wikipedia.org/wiki/Stellated_octahedron
Proof. Let be a transitive permutation group on the finite set .
- (a)
-
Let
, and let
be a block containing
. We define
- By definition, , and , thus , so and .
- If and , then , thus , so .
- If , then , therefore , so .
This shows that is a subgroup of . Moreover, since , if , then , so . By definition of a block, , so . This shows that .
If is a block containing the element of , then is a subgroup of containing .
- (b)
-
Let
be a block for
. We show that
is a partition of
.
Suppose that , where . Then . Since and is a block,
Therefore :
if , then , in contradiction with (1). So
It remains to prove that .
Since , consider a fixed element . Let be any element in . Since acts transitively on , there exists some such that , so for for some . Therefore
Then (2) and (3) prove that all the distinct images of under the elements of form a partition of .
Note that all the classes of this partition are blocks: consider a class , where . For any , If , then , so . Since is a block, this shows that . Therefore : if , then , which is impossible. So , for every such that . This shows that is a block.
- (c)
-
We show that
is primitive on
. Let
be a non trivial block. Then
or
.
-
If , then , where . Let be the complementary set of in , so that , where are distinct. Consider the permutation
Then and . So is not a block.
-
If , then where are distinct. Let be the complementary set of in , and consider the permutation
Then , and . So is not a block.
Since a block cannot have or elements, is a trivial block. This shows that is primitive on .
Now we show that is not primitive as a permutation group on the four vertices of a square, numbered as in the figure p.24. Then
Consider the two generators and of . If , then , so and . Since , for every permutation , or . Therefore is a non trivial block (and also ). This shows that is not primitive as a permutation group on the four vertices of a square.
-
- (d)
-
Suppose that for each
,
is a maximal subgroup of
. Assume for the sake of contradiction that there is some non trivial block
. By part (b), there is a block
which contains
. Since
,
is not a trivial block. By part (a),
Since is a maximal subgroup of by hypothesis, or .
- If , then for all , . Since is not a trivial block, , so there is some such that . Since acts transitively on , there is some such that . Therefore . This is a contradiction, which proves that .
-
Therefore . Since , there is some such that , and since is transitive, there is some such that , so . This shows that . Since is a block , and since , we obtain : this is a contradiction, which proves that there is no nontrivial block. So is primitive on .
Conversely, assume that is primitive on , so that the only blocks in are the trivial ones. Let and assume for the sake of contradiction that is not a maximal subgroup. Since is transitive, , and is not maximal, so there is some subgroup of such that
Consider
We show that is a block. Let be any permutation of .
-
If , then the map defined by is a bijection, therefore
-
If , then :
if there is some such that , then for some , and for some . Then
Therefore , so , thus , so , and , in contradiction with . This shows
By (4) and (5), is a block.
By hypothesis, , so there exists some permutation . Since , , and , so . Since is primitive, this implies
Since , there is some permutation . Then , and by (6), for some . Hence , thus , which gives . Since , this is a contradiction, which proves that is a maximal subgroup of .
-
In conclusion, is primitive on if and only if for each , is a maximal subgroup of .