Exercise 14.3.19

Let G S n be transitive, and let G i be the isotropy subgroup of i { 1 , , n } . Thus G i = { σ G σ ( i ) = i } .

(a)
Prove that G is doubly transitive if and only if G i acts transitively on { 1 , , n } { i } .
(b)
More generally, let k 2 . Prove that G is k -transitive if and only if G i acts ( k 1 ) -transitively on { 1 , , n } { i } .

Answers

Proof. (a) Suppose that G is doubly transitive. If j , k { 1 , , n } { i } , as i j , i k , there exists σ G such that σ ( i ) = i , σ ( j ) = k , so that σ G i and σ ( j ) = k . This proves that G i acts transitively on { 1 , , n } { i } .

Conversely, suppose that G i acts transitively on { 1 , , n } { i } for some i { 1 , , n } . We first show that G i acts also transitively on { 1 , , n } { i } for all i { 1 , , n } .

First, since G is transitive, there is some τ G such that τ ( i ) = i .

Let j , k { 1 , , n } { i } , and define j = τ 1 ( j ) , k = τ 1 ( k ) . Then j i , k i , otherwise j = i or k = i . Then the hypothesis gives σ G i such that σ ( j ) = k , that is σ ( τ 1 ( j ) ) = τ 1 ( k ) .

Therefore

( τσ τ 1 ) ( i ) = i ( τσ τ 1 ) ( j ) = k ,

which shows that σ = τσ τ 1 G i satisfies σ ( j ) = k , thus G i acts transitively on { 1 , , n } { i } , and this is true for all i .

Now we prove that G is doubly transitive. Let ( r , s ) , ( r , s ) , r s , r s be pairs of distinct elements of { 1 , , n } . Since G r acts transitively on { 1 , , n } { r } , and r s , there exists σ 1 G r such that σ 1 ( r ) = r , σ 1 ( s ) = s . Note that r s , otherwise σ 1 ( r ) = σ 1 ( s ) , r s , which is impossible since σ 1 is a permutation. Thus there exists σ 2 G s such that σ 2 ( r ) = r , σ 2 ( s ) = s , where r s . Then σ = σ 2 σ 1 satisfies σ ( r ) = r , σ ( s ) = s . This proves that G is doubly transitive. (b) Suppose first that G is k transitive, and let ( i 1 , , i k 1 ) , ( j 1 , , j k 1 ) be any ( k 1 ) -tuples of distinct elements of { 1 , , n } { i } . Then ( i , i 1 , , i k 1 ) , ( i , j 1 , , j k 1 ) are k -tuples of distinct elements of { 1 , , n } , thus there is some σ G such that σ ( i , i 1 , , i k 1 ) = ( i , j 1 , , j k 1 ) , so that σ G i and σ ( i 1 ) = j 1 , , σ ( i k 1 ) = j k 1 . This proves that G i acts ( k 1 ) -transitively on { 1 , , n } { i } .

Conversely, suppose that G i acts ( k 1 ) -transitively on { 1 , , n } { i } for some i { 1 , , n } . As in part (a), we first show that G i acts ( k 1 ) -transitively on { 1 , , n } { i } for all i { 1 , , n } , using a permutation τ G satisfying τ ( i ) = i . Take ( i 1 , , i k 1 ) , ( j 1 , , j k 1 ) two ( k 1 ) -tuples of distinct elements in { 1 , , n } { i } . We define i l = τ 1 ( i l ) , j l = τ 1 ( j l ) , l = 1 , , k 1 . Since τ 1 is a permutation, ( i , i 1 , , i k 1 ) and ( i , j 1 , , j k 1 ) are k -tuples of distinct elements. The hypothesis gives σ G i such that σ ( i l ) = j l , l = 1 , , k 1 . Then σ = τσ τ 1 satisfies

( τσ τ 1 ) ( i l ) = j l , l = 1 , , k 1 ,  and  σ ( i ) = i .

Therefore G i acts ( k 1 ) -transitively on { 1 , , n } { i } , for all i { 1 , , n } .

Now let ( r 1 , , r k ) , ( s 1 , , s k ) be any k -tuples of distinct elements. There exists σ 1 G r k such that

σ 1 ( r 1 , , r k 1 , r k ) = ( s 1 , , s k 1 , r k ) ,

where s 1 , , s k 1 , r k are distinct, since r k = s i for some i k implies σ 1 1 ( r k ) = σ 1 1 ( s i ) , that is r k = r i , which is false. Thus there exists σ 2 G s 1 such that

σ 2 ( s 1 , s 2 , , s k 1 , r k ) = ( s 1 , s 2 , , s k 1 , s k ) .

Then σ = σ 2 σ 1 satisfies σ ( r 1 , , r k ) = ( s 1 , , s k ) . This proves that G is k -transitive. □

User profile picture
2022-07-19 00:00
Comments