Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 4.3.26 (Fixed point free elements)

Exercise 4.3.26 (Fixed point free elements)

Let G be a transitive permutation group on the finite set A with | A | > 1 . Show that there is some σ G such that σ ( a ) a for all a A (such an element σ is called fixed point free).

Answers

Proof. Let a be any element of A . Since | A | > 1 , there is some b A such that b a .

If G a = G , then for all σ G , σ ( a ) = a , so there is no σ G such that σ ( a ) = b . This contradicts the hypothesis, which affirms that the action of G on A is transitive. Therefore, for all a G ,

G a G .

Assume for the sake of contradiction that there is no σ G such that σ ( a ) a for all a A . Equivalently, for all σ G , there is some a A such that σ ( a ) = a . In other words, if σ G , then σ G a for some a A , so

G = a A G a .

Pick some element x A . Since the action of G on A is transitive, there is some σ G such that σ ( x ) = a . Then

G a = σ G x σ 1 :

indeed, for all τ G ,

τ σ G x σ 1 σ 1 𝜏𝜎 G x ( σ 1 𝜏𝜎 ) ( x ) = x τ ( σ ( x ) ) = σ ( x ) τ ( a ) = a τ G a .

Hence

G = σ G σ G x σ 1 . (1)

(Indeed, if τ G , then τ G a for some a A , so τ σ G x σ 1 for some σ G .)

Since G x is a proper subgroup of G , Exercise 24 shows that (1) is impossible: G is not the union of the conjugates of any proper subgroup. This contradiction shows that there is some fixed point free σ G .

If G is a transitive permutation group on a finite set A with | A | > 1 , then

σ G , a A , σ ( a ) a .

User profile picture
2026-02-11 09:10
Comments