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 G be a transitive permutation group on the finite set A . A block is a nonempty subset B of A such that for all σ G either σ ( B ) = B or σ ( B ) B = (here σ ( B ) is the set { σ ( b ) b B } ).

(a)
Prove that if B is a block containing the element a of A , then the set G B defined by G B = { σ G σ ( B ) = B } is a subgroup of G containing G a .
(b)
Show that if B is a block and σ 1 ( B ) , σ 2 ( B ) , , σ n ( B ) are all the distinct images of B under the elements of G , then these form a partition of A .
(c)
A (transitive) group G on a set A is said to be primitive if the only blocks in A are the trivial ones: the sets of size 1 and A itself. Show that S 4 is primitive on A = { 1 , 2 , 3 , 4 } . Show that D 8 is not primitive as a permutation group on the four vertices of a square.
(d)
Prove that the transitive group G is primitive on A if and only if for each a A , the only subgroups of G containing G a are G a and G (i.e., G a is a maximal subgroup of G , (i.e., G a is a maximal subgroup of G , cf. Exercise 16, Section 2.4). [Use part (a).]

Answers

To give an example of blocks, consider the group G = σ , τ , where σ = ( 1 3 2 4 ) and τ = ( 3 4 ) :

G = ( 1 3 2 4 ) , ( 3 4 ) = { ( ) , ( 3 4 ) , ( 1 3 2 4 ) , ( 1 2 ) ( 3 4 ) , ( 1 4 ) ( 2 3 ) , ( 1 4 2 3 ) , ( 1 2 ) }

Then σ ( { 1 , 2 } ) = { 3 , 4 } and τ ( { 1 , 2 } ) = { 1 , 2 } , so { 1 , 2 } is a block. Similarly σ ( { 3 , 4 } ) = { 1 , 2 } and τ ( { 3 , 4 } ) = { 3 , 4 } , so { 3 , 4 } = σ ( { 1 , 2 } ) is another block.

(Example 14.2.1 of David Cox, where G is the Galois group of x 4 2 over .)

Another interesting example (found in Dixon Mortimer “Permutation Groups” p.11) is the group of rotations of a cube (with vertices numbered 1 , 2 , , 8 : the pairs of opposite vertices form a partition of 4 blocks of size 2 , and the two tetrahedrons of the Stella Octangula of Kepler give two blocks of size 4 (see the article “Stellated octahedron” on Wikipedia :

https://en.wikipedia.org/wiki/Stellated_octahedron

Proof. Let G be a transitive permutation group on the finite set A .

(a)
Let a G , and let B be a block containing a . We define G B = { σ G σ ( B ) = B } .

  • By definition, G B G , and 1 G ( B ) = B , thus 1 B G B , so 1 G G B and G B .
  • If σ G B and τ G B , then σ ( B ) = B , τ ( B ) = B , thus ( 𝜎𝜏 ) ( B ) = σ ( τ ( B ) ) = σ ( B ) = B , so 𝜎𝜏 G B .
  • If σ G B , then σ ( B ) = B , therefore B = σ 1 ( σ ( B ) ) = σ 1 ( B ) , so σ 1 G B .

This shows that G B is a subgroup of G . Moreover, since a B , if σ G a , then a = σ ( a ) B σ ( B ) , so B σ ( B ) . By definition of a block, σ ( B ) = B , so σ G B . This shows that G a G B .

If B is a block containing the element a of A , then G B is a subgroup of G containing G a .

(b)
Let B be a block for G = { σ 1 , σ 2 , , σ n } . We show that { σ 1 ( B ) , σ 2 ( B ) , , σ n ( B ) } is a partition of G .

Suppose that σ i ( B ) σ j ( B ) , where i , j [ [ 1 , n ] ] . Then ( σ j 1 σ i ) ( B ) B . Since σ j 1 σ i G and B is a block,

( σ j 1 σ i ) ( B ) B = . (1)

Therefore σ i ( B ) σ j ( B ) = :

if γ σ i ( B ) σ j ( B ) , then σ j 1 ( γ ) ( σ j 1 σ i ) ( B ) B , in contradiction with (1). So

σ i ( B ) σ j ( B ) σ i ( B ) σ j ( B ) = ( i , j [ [ 1 , n ] ] ) . (2)

It remains to prove that 1 i n σ i ( B ) = A .

Since B , consider a fixed element a B A . Let b be any element in A . Since G acts transitively on A , there exists some σ i G such that σ i ( a ) = b , so b σ i ( G ) for for some i [ [ 1 , n ] ] . Therefore

1 i n σ i ( B ) = A (3)

Then (2) and (3) prove that all the distinct images of B under the elements of G form a partition of A .

Note that all the classes of this partition are blocks: consider a class C = σ i ( B ) , where σ i G . For any σ G , If σ ( C ) C , then ( σ σ i ) ( B ) σ i ( B ) , so ( σ i 1 σ σ i ) ( B ) B . Since B is a block, this shows that ( σ i 1 σ σ i ) ( B ) B = . Therefore ( σ σ i ) ( B ) σ i ( B ) = : if x ( σ σ i ) ( B ) σ i ( B ) , then σ i 1 ( x ) ( σ i 1 σ σ i ) ( B ) B = , which is impossible. So σ ( C ) C = , for every σ G such that σ ( C ) C . This shows that C = σ i ( C ) is a block.

(c)
We show that S 4 is primitive on A = { 1 , 2 , 3 , 4 } . Let B be a non trivial block. Then | B | = 2 or | B | = 3 .
  • If | B | = 2 , then B = { a , b } , where a b . Let { c , d } be the complementary set of B in A , so that { a , b , c , d } = { 1 , 2 , 3 , 4 } = A , where a , b , c , d are distinct. Consider the permutation

    σ = ( a b c d a c b d )

    Then σ ( B ) = σ ( { a , b } ) = { a , c } B and σ ( B ) B = { a , c } { a , b } = { a } . So B is not a block.

  • If | B | = 3 , then B = { a , b , c } where a , b , c are distinct. Let { d } be the complementary set of B in A , and consider the permutation

    τ = ( a b c d a b d c )

    Then τ ( B ) = { a , b , d } B , and τ ( B ) B = { a , b , d } { a , b , c } = { a , b } . So B is not a block.

Since a block B cannot have 2 or 3 elements, B is a trivial block. This shows that S 4 is primitive on A = { 1 , 2 , 3 , 4 } .

Now we show that D 8 is not primitive as a permutation group on the four vertices of a square, numbered 1 , 2 , 3 , 4 as in the figure p.24. Then

D 8 = ( 1 2 3 4 ) , ( 1 3 ) = { ( ) , ( 1 3 ) , ( 1 2 3 4 ) , ( 1 3 ) ( 2 4 ) , ( 1 2 ) ( 3 4 ) , ( 1 4 ) ( 2 3 ) , ( 1 4 3 2 ) , ( 2 4 ) } .

Consider the two generators σ = ( 1 2 3 4 ) and τ = ( 1 3 ) of D 8 . If B = { 1 , 3 } , then σ ( B ) = { 2 , 4 } , so σ ( B ) B = and τ ( B ) = B . Since D 8 = σ , τ , for every permutation λ D 8 , λ ( B ) = B or λ ( B ) B = . Therefore { 1 , 3 } is a non trivial block (and also { 2 , 4 } = σ ( B ) ). This shows that D 8 is not primitive as a permutation group on the four vertices of a square.

(d)
Suppose that for each a A , G a is a maximal subgroup of G . Assume for the sake of contradiction that there is some non trivial block B 0 . By part (b), there is a block B = σ i ( B 0 ) which contains a . Since | B | = | B 0 | , B is not a trivial block. By part (a), G a G B G .

Since G a is a maximal subgroup of G by hypothesis, G B = G or G a = G B .

  • If G B = G , then for all σ G , σ ( B ) = B . Since B is not a trivial block, B A , so there is some b A such that b B . Since G acts transitively on A , there is some σ 0 G such that σ 0 ( a ) = b . Therefore b σ 0 ( B ) = B . This is a contradiction, which proves that G B B .
  • Therefore G a = G B . Since | B | > 1 , there is some c B such that c a , and since G is transitive, there is some σ G such that σ ( a ) = c , so c B σ ( B ) . This shows that B σ ( B ) . Since B is a block σ ( B ) = B , and since G a = G B , we obtain c = σ ( a ) = a : this is a contradiction, which proves that there is no nontrivial block. So G is primitive on A .

    Conversely, assume that G is primitive on A , so that the only blocks in A are the trivial ones. Let a A and assume for the sake of contradiction that G a is not a maximal subgroup. Since G is transitive, G a G , and G a is not maximal, so there is some subgroup H of G such that

    G a < H < G .

    Consider

    B = { τ ( a ) τ H } .

    We show that B is a block. Let σ be any permutation of G .

    • If σ H , then the map φ : H H defined by φ ( σ ) = 𝜎𝜏 is a bijection, therefore

      σ ( B ) = { ( 𝜎𝜏 ) ( a ) τ H } = { τ ( a ) τ H } = B . (4)
    • If σ G H , then B σ ( B ) = :

      if there is some x such that x B σ ( B ) , then x = τ ( a ) for some τ H , and x = ( 𝜎𝜆 ) ( a ) for some λ H . Then

      τ ( a ) = ( 𝜎𝜆 ) ( a ) .

      Therefore ( λ 1 σ 1 τ ) ( a ) = a , so λ σ 1 τ G a , thus σ 1 λ G a τ 1 H , so σ 1 H , and σ H , in contradiction with σ G H . This shows

      B σ ( B ) = (5)

    By (4) and (5), B is a block.

    By hypothesis, H G a , so there exists some permutation τ 0 H G a . Since τ 0 G a , τ ( a ) a , and { a , τ ( a ) } B , so | B | 2 . Since G is primitive, this implies

    A = B = { τ ( a ) τ H } . (6)

    Since G H , there is some permutation ξ G H . Then ξ ( a ) A , and by (6), ξ ( a ) = τ ( a ) for some τ H . Hence τ 1 ξ G a , thus ξ τ G a H , which gives ξ H . Since ξ G H , this is a contradiction, which proves that G a is a maximal subgroup of G .

In conclusion, G is primitive on A if and only if for each a A , G a is a maximal subgroup of G .

User profile picture
2026-01-15 10:49
Comments