Skip to Content
MathematicsMathematics
  • Article
  • Open Access

1 July 2026

18 Pages

Implications on the Index of a Fixed Point Subgroup 2

1
Department of Mathematics, Cankaya University, 06815 Ankara, Turkey
2
Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey

Abstract

Let G be a finite group and A be a subgroup of Aut(G). In this work, we study the influence of the index of the fixed-point subgroup of A in G on the structure of G. When A is cyclic, we prove that G is solvable if the index of the centralizer of each x in H-G is square-free, where H denotes the semidirect product of G by A.
MSC:
20D45; 20D10

1. Introduction

In the present paper, all the groups considered are finite. Solvability of a group is used in determining the algebraic solvability of polynomial equations, advancing cryptography, and solving geometric and topological problems. When we model a real-life problem in which we need solvable groups, we obtain some information about the group but not the complete group. This information may be related to order, conjugacy classes, fixed points of automorphisms, etc. of the group. This allows us to deduce information about the structure of the group by means of some restricted information such as the number of conjugacy classes, the length of conjugacy classes, the number of automorphisms, and the number of fixed points of automorphisms. This makes the problem of finding solvability conditions by means of some given information about the group important. Furthermore, solvability conditions can be converted to conditions for supersolvability and nilpotency, etc., of groups after some more restrictions.
In the literature, there are several types of such solvability criteria. Many of them use arithmetical restrictions on groups. We may separate these kinds of problems into three types: arithmetical conditions on conjugacy classes, arithmetical conditions on the set of fixed points of automorphisms, and the others.
There are several papers using arithmetical conditions on the set of conjugacy classes to determine the solvability of groups. These types of works are categorized and mentioned chronologically in [1]. Also, there are many new results in this area, one of which is [2]. The premises used in these types of problems can be adapted as restrictions on fixed-point subgroups of a group to obtain new criteria for the solvability of groups.
There are several papers using arithmetical conditions on the fixed-point subgroup of automorphisms of a group to classify the structure of the group. Generally, authors consider the influence of the fixed-point subgroup of an automorphism group when it is trivial or small. Examples of such works include [3,4,5]. Also, there are a few results concerning the structure of G when the number of fixed points of an automorphism group is large.
There is an obvious relation between conjugacy classes of a group and fixed-point subgroups of inner automorphisms of the group. This makes us consider arithmetical conditions on the fixed-point subgroups of automorphisms similar to the arithmetical conditions on conjugacy classes considered in the papers related to the problems of the first type. One important result in these types of problems is [6]. Kazarin proved the solvability of [ G , α ] where G is a group, α is an automorphism of G whose fixed-point subgroup contains p a elements for some prime p.
Our aim is to find information about the structure of a group under some chosen arithmetical conditions related to the indices of fixed-point subgroups of automorphisms of the group. In this paper, we consider the influence of fixed-point subgroups of automorphisms with square-free order on the solvability of a group.

2. Preliminaries

Let α be an automorphism of G. We define the semidirect product group G ⋊ α by α − 1 . x . α = α ( x ) for every x ∈ G and denote it simply by G α , and elements of this semidirect product are denoted by g . α k for g ∈ G and k ∈ Z . By means of this semidirect product, we may view the fixed-point subgroup of α as the centralizer G G ( α ) of α in G and we may denote its index by I n d G ( α ) , similar to the notation used in [7].
In [7], we proved the following theorem for an automorphism whose order is coprime to the order of the group.
Theorem 1
([7], Theorem 1.3). Let G be a finite group and α be an automorphism of G such that | G | , | α | = 1 . If I n d G ( α ) is square-free, then G , α is solvable.
We can see that the conclusion of Theorem 1 is not necessarily valid in the case of a noncoprime action, as demonstrated by the following example.
Example 1.
When G = A 5 with α = τ ( 1 2 ) ∈ A u t ( G ) \ I n n ( G ) we have I n d G ( α ) = 10 , but [ A 5 , ( 1 2 ) ] = A 5 is simple.
By supposing some extra conditions on the elements of G ⟨ α ⟩ \ G , we consider the following problem:
Let G be a finite group and α ∈ A u t ( G ) . If I n d G ( x ) is square-free for each x ∈ H \ G where H = G ⟨ α ⟩ , then G is solvable.
In Section 3, we give a proof of the above question and in Section 4, we two nontrivial examples illustrating the above hypothesis.
In order to simplify the proof of the main theorem we present some lemmata and a theorem.
Some of the following lemmata may be obvious results, but we prove them to familiarize the reader with the notation used in this paper. The lemmas presented with proofs are adapted from the author’s thesis work [8], extending arithmetical conditions on conjugacy classes to the fixed-point subgroups of automorphisms.
Lemma 1.
Let G be a group and α ∈ A u t ( G ) . For a nontrivial α-invariant proper normal subgroup N of G, if x ∈ N α \ N then I n d N ( x ) is a divisor of I n d G ( x ) .
Proof. 
Let x ∈ N α \ N where N is a nontrivial α -invariant proper normal subgroup of G. Then
I n d N ( x ) = N : C N ( x ) = N : N ∩ C G ( x ) = C G ( x ) N : C G ( x )
Since N is a normal subgroup of G, we have C G ( x ) N is a subgroup of G and so
I n d G ( x ) = G : C G ( x ) = G : C G ( x ) N . C G ( x ) N : C G ( x )
Therefore, I n d N ( x ) is a divisor of I n d G ( x ) . □
Let G be a group and α ∈ A u t ( G ) . For an α -invariant proper normal subgroup N of G, α induces the automorphism α ¯ : G / N → G / N defined for every x N ∈ G / N by α ¯ ( x N ) = α ( x ) N .
The map
ϕ : G α / N → G / N α ¯
given by
ϕ ( x . α k N ) = ( x N ) . α ¯ k
for x ∈ G and k ∈ Z is an isomorphism.
Lemma 2.
Let G be a group and α ∈ A u t ( G ) . For a nontrivial α-invariant proper normal subgroup N of G, if y ∈ G / N α ¯ \ G / N then I n d G / N ( y ) is a divisor of I n d G ( x . α k ) where x ∈ G and k ∈ Z so that y = ( x N ) . α ¯ k .
Proof. 
Let y ∈ G / N α ¯ \ G / N where N is a nontrivial α -invariant proper normal subgroup of G. Then there are x ∈ G and k ∈ Z so that y = ( x N ) . α ¯ k . It follows that
I n d G / N ( y ) = I n d G / N ( x N ) . α ¯ k = G / N : C G / N ( ( x N ) . α ¯ k )
is a divisor of
G / N : C G ( x . α k ) N / N = G : C G ( x . α k ) N
Since N is a normal subgroup of G, we have C G ( x . α k ) N is a subgroup of G and so
I n d G ( x . α k ) = G : C G ( x . α k ) = G : C G ( x . α k ) N . C G ( x . α k ) N : C G ( x )
Therefore, I n d G / N ( y ) is a divisor of I n d G ( x . α k ) . □
Lemma 3.
Let G be a group and g ∈ G . If x ∈ G τ g \ G where τ g is the inner automorphism of G induced by g defined by τ g ( a ) = g − 1 a g for all a ∈ G . Then C G ( x g k ) = C G ( x . τ g k ) for all x ∈ G and k ∈ Z .
Proof. 
Let x ∈ G and k ∈ Z .
Since
b x . τ g k = τ g − k . x − 1 b x . τ g k = g − k x − 1 b x g k = b x g k
we observe that
C G ( x g k ) = C G ( x . τ g k )
□
Lemma 4.
For n ≥ 5 for an involution ρ ∈ S n \ A n , I n d A n ( x . τ ρ ) is divisible by 4 for some x ∈ A n .
Proof. 
Let δ ∈ S n \ A n be an involution. Then τ δ is an inner automorphism of S n induced by δ . By Lemma 3, for every h ∈ S n we have
C S n ( h δ ) = C S n ( h . τ δ )
Let ρ = ( 1 2 ) .
If n is odd, let h be an ( n − 2 ) -cycle fixing 1 and 2. Then h ∈ A n and h ρ is a { 2 , n − 2 } -cycle and C S n ( h ρ ) = 2 ( n − 2 ) . Since ρ ∈ C S n ( h ρ ) we get
C A n ( h . τ ρ ) = C A n ( h ρ ) = ( n − 2 ) .
It follows that I n d A n ( h . τ ρ ) = n ! 2 ( n − 2 ) is divisible by 4.
If n is even, let h be an ( n − 3 ) -cycle fixing 1 and 2. Then h ∈ A n and h ρ is a { 2 , n − 3 } -cycle and C S n ( h ρ ) = 2 ( n − 3 ) . Since ρ ∈ C S n ( h ρ ) we get
C A n ( h . τ ρ ) = C A n ( h ρ ) = ( n − 3 ) .
It follows that I n d A n ( h . τ ρ ) = n ! 2 ( n − 3 ) is divisible by 4.
Let σ ∈ S n \ A n be an arbitrary involution. Then ρ σ − 1 ∈ A n . It follows that for the chosen h ∈ A n above we have
C S n ( h . τ ρ ) = C S n ( h ρ ) = C S n ( h ρ σ − 1 σ ) = C S n ( h ρ σ − 1 . τ σ )
So, x = h ρ σ − 1 ∈ A n and I n d A n ( x . τ σ ) = I n d A n ( h . τ ρ ) is divisible by 4.
Therefore, for an involution σ ∈ S n \ A n , there is x ∈ A n so that I n d A n ( x . τ σ ) is divisible by 4. □
Lemma 5.
Let G be a group and x and y be two commuting elements of G such that ( x , y ) = 1 . Then C G ( x y ) = C G ( x ) ∩ C G ( y ) .
Proof. 
Trivially, C G ( x ) ∩ C G ( y ) ≤ C G ( x y ) .
If x = m and y = n . Since ( m , n ) = 1 , there exist integers r , s such that r m + s n = 1 . As [ x , y ] = 1 , we have
( x y ) r m = x r m y r m = y 1 − s n = y
and
( x y ) s n = x s n y s n = x 1 − r m = x .
If a ∈ C G ( x y ) , then
1 = [ a , ( x y ) r m ] = [ a , y ]
and
1 = [ a , ( x y ) s n ] = [ a , x ] .
It follows that a ∈ C G ( x ) and a ∈ C G ( y ) . Therefore,
C G ( x y ) = C G ( x ) ∩ C G ( y )
as desired. □
Lemma 6
([9], Lemma 6). If G is simple, then 4 divides the length of a conjugacy class of G.
Lemma 7
([10], Lemma 1, Corollary 1). Let G be a finite group.
1. 
If for some prime number p, any p ′ -element has p ′ -index in G, then G has a unique Sylow p-subgroup which is a direct factor.
2. 
If for some prime number p, p ∤ C for any C ∈ C o n ( G ) then G has a unique Sylow p-subgroup which is an abelian direct factor.
Theorem 2
([11], Theorem B). Let G be a finite simple non-abelian group and let p be an odd prime dividing the order of G. Let A = A u t ( G ) and let S be a Sylow p-subgroup of A. Identifying G with I n n ( G ) , set P = S ∩ G . Then C S ( P ) = Z ( P ) .

3. Main Theorem

We prove the following theorem as a result in my thesis work ([8], Theorem 3):
Theorem 3.
Let G be a finite group and α ∈ A u t ( G ) . If I n d G ( x ) is square-free for each x ∈ H \ G where H = G ⟨ α ⟩ , then G is solvable.
Proof. 
The proof of the theorem is based on obtaining a contradiction over a series of steps by induction on the order of the semidirect product group H. Let G be a group and α be an automorphism of G and H = G ⟨ α ⟩ be an ordered triple such that H is of the smallest order among such triples satisfying premises of the theorem but G is not solvable.
  • G has no nontrivial proper normal α -invariant subgroup. In particular, G = [ G , α ] .
Assume that N is a nontrivial α -invariant proper normal subgroup of G.
Let x ∈ N α \ N . Then x ∈ H \ G and so I n d G ( x ) is square-free. Since I n d N ( x ) is a divisor of I n d G ( x ) by Lemma 1, we obtain I n d N ( x ) is also square-free. As N α < H , N is solvable by induction assumption.
Let y ∈ G / N α \ G / N . Then y = ( x N ) α k for some x ∈ G and for some integer k. It follows by Lemma 2 that, I n d G / N ( y ) is a divisor of I n d G ( x α k ) . Since x α k ∈ H \ G , we have I n d G ( x α k ) is square-free. Hence, I n d G / N ( y ) is also square-free. Hence, by the induction hypothesis, G / N is solvable as G / N α < H . This forces G to be solvable, which contradicts our assumption.
Therefore, G cannot have a nontrivial proper normal α -invariant subgroup.
In particular, since [ G , α ] is an α -invariant subgroup of G, we obtain [ G , α ] = G .
2.
The order of α is a prime p, and p divides G .
Let α = k p for some prime p and a positive integer k. Then the order of α k is p. Let x ∈ G α k \ G . It follows that I n d G ( x ) is square-free as x ∈ H \ G . As G α k < H , by induction assumption we get G is solvable. This contradicts our assumption if k > 1 . Hence, the order of α is the prime number p. Theorem 1 implies that p divides G since [ G , α ] = G .
3.
G is simple.
G is characteristically simple by Step 1. That is,
G = E 1 × … × E s
where each E i , i = 1 , … , s , is a nonabelian simple group isomorphic to E 1 . Suppose s > 1 . Let { E 1 , E 1 α , … , E 1 α n } be the orbit containing E 1 under the action of α on the subgroups of G. Since the order of α is the prime number p, the length n ≠ 1 of the orbit is a divisor of p. So n = p . Then
C = E 1 × E 1 α × … × E 1 α n
is an α -invariant normal subgroup of G and hence G = C by Step 1. Now, C G ( α ) = E 1 and we have I n d G ( α ) = E 1 s − 1 is square-free. This is impossible as 4 divides E 1 by Lemma 6. Therefore s = 1 , i.e., G is a nonabelian simple group.
4.
α is not an inner automorphism.
Suppose that α is an inner automorphism. Then there is g ∈ G so that α = τ g . Since G is simple by step 3, there is a ∈ G so that I n d G ( a ) is a multiple of 4 by Lemma 6. It follows by Lemma 3 that,
C G ( a ) = C G ( a g − 1 g ) = C G ( a g − 1 . τ g ) .
Hence, I n d G ( a g − 1 . τ g ) = I n d G ( a ) is divisible by 4 and since a g − 1 ∈ G and α = τ g , we have a g − 1 . τ g ∈ H \ G . This contradicts our assumption.
Therefore, α cannot be an inner automorphism.
5.
G is not an alternating group:
Suppose that G is an alternating group. Since G is simple, we have G = A n where n ≥ 5 . We can divide the proof of this step into two parts.
Let n ≠ 6 . We know that Aut ( A n ) ≅ S n and every automorphism of A n is the restriction of an inner automorphism τ ρ of S n to A n for some ρ ∈ S n . Since α is not an inner automorphism and is of prime order, it must be an automorphism of order 2, which is the restriction of τ ρ to A n for some involution ρ ∈ S n \ A n . By Lemma 4, there is an element x ∈ A n so that I n d A n ( x . τ ρ ) is divisible by 4, which contradicts our assumption.
Let n = 6 . Since α is an automorphism of A 6 which is not an inner automorphism and is of prime order, it is induced by either an inner automorphism of S 6 or an outer automorphism of S 6 sending 3-cycles to { 3 , 3 } -cycles and { 3 , 3 } -cycles to 3-cycles ([12], Section 2.4). The former case is not possible by Lemma 4. So α is induced by an outer automorphism of S n . Any 3-element of G is either a 3-cycle or a { 3 , 3 } -cycle. If 3 divides C G ( α ) , then there will be a 3-cyle or a { 3 , 3 } -cyle which is fixed by α which contradicts the definition of α . Thus, I n d G ( α ) is divisible by 9, which is not the case.
Therefore, G is not an alternating group.
6.
G is not a sporadic group.
By using the Atlas of Finite Groups [13], only
M 12 , M 22 , J 2 , J 3 , F i 22 , F i 24 , H S , M c L , H e , S u z , O ′ N , H N
have noninner automorphism.
If G is one of these groups, since Aut ( G ) : Inn ( G ) = 2 and α is a noninner automorphism of G of prime order, then order of α should be 2 and G α ≅ Aut ( G ) . Then, from character table, we see that some conjugacy classes of Aut ( G ) \ G have length divisible by 4.
Therefore, G is not a sporadic group. As a conclusion G is a simple group of Lie Type.
7.
I n d G ( α ) is divisible by p when p is odd.
Assume that p is odd. If p does not divide I n d G ( α ) , then α centralizes a Sylow p-subgroup P of G. It follows from Theorem 9 that α is induced by an element of Z ( P ) , which is impossible by Step 4.
8.
We may assume that p = 2 .
Suppose that p is odd. Then by step 7, p divides I n d G ( α ) . If y is a p ′ -element of C G ( α ) , then by Lemma 5, we have
C C G ( α ) ( y ) = C G ( α ) ∩ C G ( y ) = C G ( y α ) ⊆ C G ( α )
Now,
I n d G ( y α ) = G : C G ( y α ) = G : C G ( α ) C G ( α ) : C C G ( α ) ( y ) = I n d G ( α ) C G ( α ) : C C G ( α ) ( y )
is square-free and hence p ∤ C G ( α ) : C C G ( α ) ( y ) .
It follows by Lemma 7 (1) that, C G ( α ) has a unique Sylow p-subgroup P which is a direct factor, i.e., C G ( α ) = P × A where A is a p ′ -group. Let a ∈ A . Now, C C G ( α ) ( a ) = P × C A ( a ) and also C C G ( α ) ( a ) = C G ( α ) ∩ C G ( a ) = C G ( a α ) ⊆ C G ( α ) by Lemma 5. So C G ( α ) : C C G ( α ) ( a ) = P × A : P × C A ( a ) = A : C A ( a ) = I n d A ( a ) is a divisor of I n d G ( a α ) and hence I n d A ( a ) is square-free.
If b ∈ A is an involution, then for any x ∈ A ⟨ τ b ⟩ \ A , there exists c ∈ A such that x = c τ b and hence C A ( c b ) = C A ( x ) by Lemma 3. Therefore, I n d A ( x ) is square-free. As p is odd, we have A ⟨ τ b ⟩ < H . It follows by induction that A is solvable. This forces the solvability of C G ( α ) if it contains a p ′ -element. In case C G ( α ) is a p-group, it is already solvable.
When G is a simple group of Lie type and α is a noninner automorphism of odd prime order, then C G ( α ) has a nonabelian simple subgroup by [14], Theorem 4.2.2 when α is an inner-diagonal or graph automorphism when p is coprime to characteristic r of the base field, and by [14], Proposition 4.9.1 when α is a field automorphism, and by [14], Proposition 4.9.2 when p = 3 , α is a graph automorphism of a simple group of Lie type over a field with characteristic 3. This contradicts the solvability of C G ( α ) .
Therefore, we may assume that p = 2 .
9.
Final Contradiction.
We consider three cases:
By [15] Chapter 17, Lemma 7.2, if G is a simple group of Lie Type over a field of odd characteristic, then every involution α ∈ A u t ( G ) \ I n n ( G ) maps into O u t d i a g ( G ) or Φ i.e., α is either an inner-diagonal or a graph or a field or a graph-field automorphism. We consider inner-diagonal and graph automorphisms for such groups in case 1. In case 2, we study field and graph-field automorphisms where there is no restriction on the characteristic r of the base field. In characteristic 2, there is no nontrivial diagonal automorphism. So α is either a graph or a field or a graph-field automorphism since both α is of order 2 and field automorphisms commute with graph automorphisms. Since field and graph-field automorphisms are considered for every characteristic in case 3, we studied the remaining automorphisms, i.e., graph automorphisms of simple groups of Lie type over a field of characteristic 2.
Let the largest normal subgroup of C G ( α ) with r ′ index in C G ( α ) be denoted by O r ′ ( C G ( α ) ) . If | C G ( α ) | = r a b , then r a is also a divisor of order of O r ′ ( C G ( α ) ) since O r ′ ( C G ( α ) ) contains a Sylow r-subgroup of C G ( α ) , because C G ( α ) : O r ′ ( C G ( α ) ) is an r ′ number. Hence, the power of r in the prime decomposition of both I n d G α and G : O r ′ ( C G ( α ) ) are the same. Let | n | r denote the r-power part of the prime decomposition of the positive integer n.
Case 1. α is an inner-diagonal or graph automorphism where q is odd.
Tables 4.5.1, 4.5.2, and 4.5.3 in [14] give all possible inner-diagonal or graph automorphisms of simple groups of Lie type over a field of odd characteristic and the largest normal r ′ -indexed subgroup structure of their fixed-point subgroups.
We consider all the families of simple groups of Lie type and calculated
| I n d G ( α ) | r = G : O r ′ ( C G ( α ) ) r = | G | r O r ′ ( C G ( α ) ) r
for each case.
(i)    
G = A m ε ( q ) for m ≥ 2 , ε = ± 1 .
From Table 4.5.2 in [14], all the possible structures of O r ′ ( C G ( α ) ) are:
P 1 = A m − 1 ε ( q ) ,
P 2 = A i − 1 ε ( q ) A m − i ε ( q ) and 2 ≤ i ≤ m 2 ,
P 3 = A m − 1 2 ε ( q ) 2 and m is odd,
P 4 = A m − 1 2 ε ( q 2 ) and m is odd,
P 5 = C m + 1 2 ( q ) and m is odd,
P 6 = B m 2 ( q ) and m is even,
P 7 = D m + 1 2 ( q ) and m is odd,
P 8 = 2 D m + 1 2 ( q ) and m is odd.
We have
G : P 1 r = q m ( m + 1 ) 2 q ( m − 1 ) m 2 = q m
G : P 2 r = q m ( m + 1 ) 2 q ( i − 1 ) i 2 q ( m − i ) ( m − i + 1 ) 2 = q m i − i 2
G : P 3 r = q m ( m + 1 ) 2 q 2 m − 1 2 m + 1 2 2 = q ( m + 1 ) 2 4
G : P 4 r = q m ( m + 1 ) 2 q 2 m − 1 2 m + 1 2 2 = q ( m + 1 ) 2 4
G : P 5 r = q m ( m + 1 ) 2 q ( m + 1 2 ) 2 = q m 2 − 1 4
G : P 6 r = q m ( m + 1 ) 2 q ( m 2 ) 2 = q m 2 + 2 m 4
G : P 7 r = q m ( m + 1 ) 2 q m + 1 2 m − 1 2 = q ( m + 1 ) 2 4
G : P 8 r = q m ( m + 1 ) 2 q m + 1 2 m − 1 2 = q ( m + 1 ) 2 4
Since m ≥ 2 , in each case r 2 is a divisor of I n d G ( α ) .
(ii)   
G = B m ( q ) for m ≥ 2 .
From Table 4.5.2 in [14], all the possible structures of O r ′ ( C G ( α ) ) are:
Q 1 = B m − 1 ( q ) ,
Q 2 = B m − 1 ( q ) ,
Q 3 = D i ( q ) B m − i ( q ) and 2 ≤ i < m ,
Q 4 = 2 D i ( q ) B m − i ( q ) and 2 ≤ i < m ,
Q 5 = D m ( q ) ,
Q 6 = 2 D m ( q ) .
We have
G : Q 1 r = q m 2 q ( m − 1 ) 2 = q 2 m − 1
G : Q 2 r = q m 2 q ( m − 1 ) 2 = q 2 m − 1
G : Q 3 r = q m 2 q i ( i − 1 ) q ( m − i ) 2 = q 2 m i + i − 2 i 2
G : Q 4 r = q m 2 q i ( i − 1 ) q ( m − i ) 2 = q 2 m i + i − 2 i 2
G : Q 5 r = q m 2 q m ( m − 1 ) = q m
G : Q 6 r = q m 2 q m ( m − 1 ) = q m
Since m ≥ 2 , in each case r 2 is a divisor of I n d G ( α ) .
(iii)  
G = C m ( q ) for m ≥ 2 .
From Table 4.5.2 in [14], all the possible structures of O r ′ ( C G ( α ) ) are:
R 1 = C i ( q ) C m − i ( q ) and 1 ≤ i < m 2 ,
R 2 = C m 2 ( q ) 2 and m is even,
R 3 = C m 2 ( q 2 ) and m is even,
R 4 = A m − 1 ( q ) ,
R 5 = 2 A m − 1 ( q ) .
We have
G : R 1 r = q m 2 q i 2 q ( m − i ) 2 = q 2 m i − 2 i 2
G : R 2 r = q m 2 q 2 ( m 2 ) 2 = q m 2 2
G : R 3 r = q m 2 q 2 ( m 2 ) 2 = q m 2 2
G : R 4 r = q m 2 q m ( m − 1 ) 2 = q m 2 + m 2
G : R 5 r = q m 2 q m ( m − 1 ) 2 = q m 2 + m 2
Since m ≥ 2 , in each case r 2 is a divisor of I n d G ( α ) .
(iv)  
G = D m ε ( q ) for m ≥ 4 , ε = ± 1 .
From Tables 4.5.2 and 4.5.3 in [14], all the possible structures of O r ′ ( C G ( α ) ) are:
S 1 = D m − 1 ε ( q ) ,
S 2 = D m − 1 − ε ( q ) ,
S 3 = D i ( q ) D m − i ε ( q ) and 2 ≤ i < m 2 ,
S 4 = 2 D i ( q ) D m − i − ε ( q ) and 2 ≤ i < m 2 ,
S 5 = D m 2 ( q ) 2 and G = D 2 k + ( q ) ,
S 6 = 2 D m 2 ( q ) 2 and G = D 2 k + ( q ) ,
S 7 = A m − 1 ( q ) and G = D 2 k + ( q ) ,
S 8 = 2 A m − 1 ( q ) and G = D 2 k + ( q ) ,
S 9 = 2 D m 2 ( q ) D m 2 ( q ) and G = D 2 k − ( q ) ,
S 10 = 2 D m 2 ( q 2 ) and G = D 2 k − ( q ) ,
S 11 = A m − 1 ε ( q ) and G = D 2 k + 1 ε ( q ) ,
S 12 = B m − 1 ( q ) ,
S 13 = B i − 1 ( q ) B m − i ( q ) and 2 ≤ i ≤ m 2 ,
S 14 = B m − 1 2 ( q ) 2 and G = D 2 k + 1 ε ( q ) ,
S 15 = B m − 1 2 ( q 2 ) and G = D 2 k + 1 ε ( q ) ,
S 16 = B 3 ( q ) and G = D 4 + ( q ) ,
S 17 = A 1 ( q ) B 2 ( q ) and G = D 4 + ( q ) .
We have
G : S 1 r = q m ( m − 1 ) q ( m − 1 ) ( m − 2 ) = q 2 m − 2
G : S 2 r = q m ( m − 1 ) q ( m − 1 ) ( m − 2 ) = q 2 m − 2
G : S 3 r = q m ( m − 1 ) q i ( i − 1 ) q ( m − i ) ( m − i − 1 ) = q 2 m i − 2 i 2
G : S 4 r = q m ( m − 1 ) q i ( i − 1 ) q ( m − i ) ( m − i − 1 ) = q 2 m i − 2 i 2
G : S 5 r = q m ( m − 1 ) q 2 m 2 m − 2 2 = q m 2 − 2 m + 2 2
G : S 6 r = q m ( m − 1 ) q 2 m 2 m − 2 2 = q m 2 − 2 m + 2 2
G : S 7 r = q m ( m − 1 ) q m ( m − 1 ) 2 = q m 2 − m 2
G : S 8 r = q m ( m − 1 ) q m ( m − 1 ) 2 = q m 2 − m 2
G : S 9 r = q m ( m − 1 ) q 2 m 2 m − 2 2 = q m 2 − 2 m + 2 2
G : S 10 r = q m ( m − 1 ) q 2 m 2 m − 2 2 = q m 2 − 2 m + 2 2
G : S 11 r = q m ( m − 1 ) q m ( m − 1 ) 2 = q m 2 − m 2
G : S 12 r = q m ( m − 1 ) q ( m − 1 ) 2 = q m − 1
G : S 13 r = q m ( m − 1 ) q ( i − 1 ) 2 q ( m − i ) 2 = q 2 m i − i 2 + 2 i − m − 1
G : S 14 r = q m ( m − 1 ) q 2 ( m − 1 2 ) 2 = q m 2 − 1 2
G : S 15 r = q m ( m − 1 ) q 2 ( m − 1 2 ) 2 = q m 2 − 1 2
G : S 16 r = q 4.3 q 9 = q 3
G : S 17 r = q 4.3 q 5 = q 7
Since m ≥ 4 , in each case r 4 is a divisor of I n d G ( α ) .
(v)   
G = E 6 ε ( q ) for ε = ± 1 .
From Table 4.5.2 in [14], all the possible structures of O r ′ ( C G ( α ) ) are:
T 1 = D 5 ε ( q ) ,
T 2 = A 1 ( q ) A 5 ε ( q ) ,
T 3 = F 4 ( q ) ,
T 4 = C 4 ( q ) .
We have
G : T 1 r = q 36 q 20 = q 16
G : T 2 r = q 36 q 16 = q 20
G : T 3 r = q 36 q 24 = q 12
T : P 4 r = q 36 q 16 = q 20
In each case r 2 is a divisor of I n d G ( α ) .
(vi)  
G = E 7 ( q ) .
From Table 4.5.2 in [14], all the possible structures of O r ′ ( C G ( α ) ) are:
U 1 = A 1 ( q ) D 6 ( q ) ,
U 2 = A 7 ( q ) ,
U 3 = 2 A 7 ( q ) ,
U 4 = E 6 ( q ) ,
U 5 = 2 E 6 ( q ) .
We have,
G : U 1 r = q 63 q 31 = q 32
G : U 2 r = q 63 q 28 = q 35
T : U 3 r = q 63 q 28 = q 35
G : U 4 r = q 63 q 36 = q 27
G : U 5 r = q 63 q 36 = q 27
In each case r 2 is a divisor of I n d G ( α ) .
(vii) 
G = 3 4 D ( q )
From Table 4.5.1 in [14], only possible structure of O r ′ ( C G ( α ) ) is V = A 1 ( q ) A 1 ( q 3 ) .
We have
G : V r = q 12 q 4 = q 8
It is divisible by r 2 .
(viii)
G = G 2 ( q )
From Table 4.5.1 in [14], only possible structure of O r ′ ( C G ( α ) ) is W = A 1 ( q 2 ) .
We have
G : W r = q 6 q 2 = q 4
It is divisible by r 2 .
(ix)  
G = 2 G 2 ( q )
From Table 4.5.1 in [14], only possible structure of O r ′ ( C G ( α ) ) is Y = A 1 ( q 2 ) .
We have
G : Y r = q 3 q 2 = q = 3 2 n + 1
It is divisible by r 2 .
(x)   
F 4 ( q )
From Table 4.5.1 in [14], two possible structures of O r ′ ( C G ( α ) ) are
Z 1 = A 1 ( q ) C 3 ( q ) ,
Z 2 = B 4 ( q ) .
We have
G : Z 1 r = q 24 q 10 = q 14
G : Z 2 r = q 24 q 16 = q 8
Both are divisible by r 2 .
(xi)  
E 8 ( q )
From Table 4.5.1 in [14], two possible structures of O r ′ ( C G ( α ) ) are
H 1 = D 8 ( q ) ,
H 2 = A 1 ( q ) E 7 ( q ) .
We have
G : H 1 r = q 120 q 56 = q 64
G : H 2 r = q 120 q 63 = q 57
Both are divisible by r 2 .
Therefore, in each subcase, r 2 divides I n d G ( α ) .
Case 2: α is a field automorphism or a graph-field automorphism.
By Proposition 4.9.1 in [14], if q = r 2 s for some integer s and G = L ( q ) , then C G ( α ) ≅ L ( r s ) .
We consider I n d G ( α ) r for each family of simple groups of Lie type.
(i)    
If G ≅ A m ( r 2 s ) for m ≥ 2 then
C G ( α ) ≅ A m ( r s ) or 2 A m ( r s )
So we have
I n d G ( α ) r = r s m ( m + 1 ) 2 .
(ii)   
If G ≅ B m ( r 2 s ) for m ≥ 2 then
C G ( α ) ≅ B m ( r s )
So we have
I n d G ( α ) r = r s m 2
(iii)  
If G ≅ C m ( q 2 s ) for m ≥ 3 then
C G ( α ) ≅ C m ( r s )
So we have
I n d G ( α ) r = r s m 2
(iv)  
If G ≅ D m ( q 2 s ) for m ≥ 4 then
C G ( α ) ≅ D m ( r s ) or 2 D m ( r s ) or 3 D 4 ( r s )
So we have
I n d G ( α ) r = r s m ( m − 1 ) or r 12 s
(v)   
If G ≅ E 6 ( q 2 s ) then
C G ( α ) ≅ E 6 ( r s ) or 2 E 6 ( r s )
So we have
I n d G ( α ) r = r 36 s
(vi)  
If G ≅ E 7 ( q 2 s ) then
C G ( α ) ≅ E 7 ( r s )
So we have
I n d G ( α ) r = r 63 s
(vii) 
If G ≅ E 8 ( q 2 s ) then
C G ( α ) ≅ E 8 ( r s )
So we have
I n d G ( α ) r = r 120 s
(viii)
If G ≅ F 4 ( q 2 s ) then
C G ( α ) ≅ F 4 ( r s ) or 2 F 4 ( r s )
So we have
I n d G ( α ) r = r 24 s or r 36 s
(ix)  
If G ≅ G 2 ( q 2 s ) then
C G ( α ) ≅ G 2 ( r s ) or 2 G 2 ( r s )
So we have
I n d G ( α ) r = r 6 s or r 9 s
(x)   
If G ≅ 2 A m ( r 2 s ) for m ≥ 2 then
C G ( α ) ≅ 2 A m ( r s )
So we have
I n d G ( α ) r = r s m ( m + 1 ) 2
(xi)  
If G ≅ 2 D m ( q 2 s ) for m ≥ 4 then
C G ( α ) ≅ 2 D m ( r s )
So we have
I n d G ( α ) r = r s m ( m − 1 )
(xii) 
If G ≅ 2 E 6 ( q 2 s ) then
C G ( α ) ≅ 2 E 6 ( r s )
So we have
I n d G ( α ) r = r 36 s
(xiii)
G ≅ 3 D 4 ( q 2 s ) , then
C G ( α ) ≅ 3 D 4 ( r s )
So we have
I n d G ( α ) r = r 12 s
In each subcase, I n d G ( α ) is divisible by r 2 .
Case 3: α is a graph automorphism and r = 2 .
By Proposition 4.9.2 in [14], all possibilities for fixed-point subgroups of graph automorphisms of simple groups of Lie type over fields of characteristic 2 are:
(i)  
If G ≅ A 2 m + 1 ± ( q ) for m ≥ 1 , then C G ( α ) ≅ C m ( q ) and we have
I n d G ( α ) r = q m 2 + m
(ii) 
If G ≅ A 2 m ± ( q ) for m ≥ 1 , then C G ( α ) ≅ C m ( q ) and we have
I n d G ( α ) r = q m 2 − m
(iii)
If G ≅ D m ± ( q ) for m ≥ 4 , then C G ( α ) ≅ B m − 1 ( q ) and we have
I n d G ( α ) r = q m − 1
(iv)
If G ≅ E 6 ± ( q ) , then C G ( α ) ≅ F 4 ( q ) and we have
I n d G ( α ) r = q 12
In each case, q 2 is a divisor of I n d G ( α ) .
This leads to a contradiction as α ∈ G α \ G and I n d G ( α ) is not square-free.
This final contradiction completes the proof. Therefore, if I n d G ( x ) is square-free for each x ∈ H \ G where H = G ⟨ α ⟩ , then G is solvable. □

4. Examples

In this Section, we give two examples satisfying Theorem 10. It is known that a group is solvable if its order is odd [16] or of the form p a q b for prime numbers p and q [17]. We consider groups of orders 300 and 1764 in order not to be able to use the above results. To distinguish it from conjugacy class length type of problems, we choose an automorphism α of G which is not an inner automorphism.
Example 2.
Let G be the group S m a l l G r o u p ( 300 , 18 ) in the library of [18].
Now, G is a group of order 300 = 2 2 3 1 5 2 . By means of the [18] code at the end of the example, we obtain the following properties of the group G:
G = a , b , c , d , e | R
where R is the set of relations
R = { d = a 2 , a b = b a , a c = c a , a d = d a , a e 2 = e a , b 5 = 1 ,
b c = c b , b d = d b , b e = e b , c 5 = 1 , c d = d c , c e = e c ,
d 2 = 1 , d e = e d , e 3 = 1 }
We choose the noninner automorphism α : G → G defined on the generators of G by
α ( a ) = a d
α ( b ) = b 4 c
α ( c ) = c
α ( d ) = d
α ( e ) = e
Now, order of α is 2. We define the semidirect product group S = G α and consider the set of centralizers of every element in S \ G . The set of indices of these elements forms the set i n d i c e s = { 10 , 30 } .
Therefore, for every x ∈ G α \ G we have either I n d G ( x ) = 10 or I n d G ( x ) = 30 which satisfies the premises of Theorem 10.
When we check the solvability of G by [18], we see G is solvable.
Therefore, the group G and the automorphism α form a nontrivial pair that satisfies the theorem.
We use the following sequence of codes in [18] to find the example explained above:
  • G:=SmallGroup(300,18);
  • A:=AutomorphismGroup(G);
  • H:=Elements(A);
  • I:=InnerAutomorphismGroup(G);
  • Order(I);
  • J:=Difference(A,I);
  • Order(J[2760]);
  • alpha:=J[2760]^3;
  • alpha in I;
  • K:=Group(alpha);
  • S:=SemidirectProduct(K,G);
  • B:=GeneratorsOfGroup(S);
  • C:=Group(b[2],b[3],b[4],b[5],b[6]);
  • Order(C);
  • IsomorphismGroups(C,G);
  • U:=Difference(S,C);
  • indices:=[];
  • for i in U do
  • cen:=Centralizer(S,i);
  • int:=Intersection(C,cen);
  • fix:=Size(int);
  • ind:=Order(G)/fix;
  • Add(indices,ind);
  • od;
  • indices;
  • IsSolvableGroup(G);
Example 3.
Let G be the group S m a l l G r o u p ( 1764 , 23 ) in the library of [18].
Now, G is a group of order 1764 = 2 2 3 3 7 2 . By means of the [18] code at the end of the example, we obtain the following properties of the group G:
G = a , b , c , d , e , f | R
where R is the set of relations
R = { c = a 2 , a b = b a , a c = c a , a d = d a , a e 2 = e a , a f 2 = f a , d = b 7 ,
b c = c b , b d = d b , b e = e b , b f = f b , c 2 = 1 , c d = d c , c e = e c ,
c f = f c , d 7 = 1 , d e = e d , d f = f d , e 3 = 1 , e f = f e , f 3 = 1 }
We choose the noninner automorphism α : G → G defined on the generators of G by
α ( a ) = a c e 2 f 2
α ( b ) = b
α ( c ) = c
α ( d ) = d
α ( e ) = e 2 f
α ( f ) = f
Now, order of α is 2. We define the semidirect product group S = G α and consider the set of centralizers of every element in S \ G . The set of indices of these elements forms the set i n d i c e s = { 6 } .
Therefore, for every x ∈ G α \ G we have I n d G ( x ) = 6 which satisfies the premises of Theorem 10.
When we check the solvability of G by [18] we see G is solvable.
Therefore, the group G and the automorphism α form a nontrivial pair that satisfies the theorem.
We use the following sequence of codes in [18] to find the example explained above:
  • G:=SmallGroup(1764,23);
  • iso:=IsomorphismFpGroup(G);
  • F:=Image(iso);
  • rels:=RelatorsOfFpGroup(F);
  • A:=AutomorphismGroup(G);
  • H:=Elements(A);
  • I:=InnerAutomorphismGroup(G);
  • Order(I);
  • J:=Difference(A,I);
  • Order(J[457]);
  • alpha:=J[457]^21;
  • alpha in I;
  • K:=Group(alpha);
  • S:=SemidirectProduct(K,G);
  • B:=GeneratorsOfGroup(S);
  • C:=Group(B[2],B[3],B[4],B[5],B[6],B[7]);
  • Order(C);
  • IsomorphismGroups(C,G);
  • U:=Difference(S,C);
  • indices:=[];
  • for i in U do
  • cen:=Centralizer(S,i);
  • int:=Intersection(C,cen);
  • fix:=Size(int);
  • ind:=Order(G)/fix;
  • Add(indices,ind);
  • od;
  • indices;
  • IsSolvableGroup(G);

5. Conclusions

As we mentioned in the introduction, the main theorem of this paper is the joining of two types of problems in the area of obtaining information about the structure of a group using arithmetical conditions on the lengths of conjugacy classes and the orders or indices of fixed-point subgroups of automorphisms.
Let G be a group and α be an automorphism of G. In the case of obtaining information on the structure of G using arithmetical conditions on the lengths of conjugacy classes, two important steps are a group with a conjugacy class of length p a for some prime number p [6] and all conjugacy class sizes are square-free [19]. These results are used to obtain further results. As we mention in the introduction, solvability of [ G , α ] is proved when I n d G ( α ) = p a in [6] and when g c d ( | G | , | α | ) = 1 and I n d G ( α ) is square-free in [7]. Theorem 10 proves the latter case by using further restrictions to remove the relatively prime condition. We may consider the statement of Theorem 10 from another point of view as follows:
H = G α is a group and G is a normal subgroup of H. If the lengths of all conjugacy classes in H \ G are square-free, then G is solvable.
This leads us to consider whether we can obtain information about the structure of a normal subgroup by means of arithmetical conditions on the conjugacy classes outside the normal subgroup.
As future work, one may consider the structure of a group H and a normal subgroup G of H when some arithmetical conditions on the lengths of conjugacy classes of H \ G are given.

Funding

This research received no external funding.

Data Availability Statement

The data presented in this study are openly available in [Middle East Technical University Library] at [http://etd.lib.metu.edu.tr/upload/12613522/index.pdf] (accessed on 10 June 2026).

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Camina, A.R.; Camina, R.D. The influence of conjugacy class sizes on the structure of finite groups: A survey. Asian-Eur. J. Math. 2011, 4, 559–588. [Google Scholar] [CrossRef] [Scilit]
  2. Camina, A.R.; Camina, R.D. Restrictions on the set of conjugacy class sizes in arithmetic progression. Int. J. Group Theory 2023, 12, 27–34. [Google Scholar]
  3. Higman, G. Groups and rings having automorphisms without non-trivial fixed elements. J. Lond. Math. Soc. 1957, 32, 321–334. [Google Scholar] [CrossRef] [Scilit]
  4. Ercan, G. On finite groups admitting a special noncoprime action. Proc. Am. Math. Soc. 2005, 133, 2543–2547. [Google Scholar] [CrossRef] [Scilit]
  5. Khukhro, E. On a problem of B. Hartley about a small centralizer in finite and locally finite groups. Bull. Lond. Math. Soc. 2026, 58, e70206. [Google Scholar] [CrossRef] [Scilit]
  6. Kazarin, L.S. Burnside’s pα Lemma. (Russ.) Math. Zametki 1990, 48, 45–48. [Google Scholar]
  7. Türkan, E.M. Implications of the index of a fixed-point subgroup. Rend. Semin. Mat. Univ. Padova 2019, 142, 1–7. [Google Scholar]
  8. Türkan, E.M. On the Index of Fixed Point Subgroup. Ph.D. Thesis, Middle East Technical University, Ankara, Türkiye, 2011. [Google Scholar]
  9. Camina, A.R.; Camina, R.D. Implications of the conjugacy class size. J. Group Theory 1998, 1, 257–269. [Google Scholar] [CrossRef] [Scilit]
  10. Camina, A.R. Arithmetical conditions on the conjugacy class numbers of a finite group. J. Lond. Math. Soc. 1972, 5, 127–132. [Google Scholar] [CrossRef] [Scilit]
  11. Gross, F. Automorphisms which centralize a Sylow p-subgroup. J. Algebra 1982, 77, 202–233. [Google Scholar] [CrossRef] [Scilit]
  12. Wilson, R.A. The Finite Simple Groups; Springer: London, UK, 2009; pp. 18–19. [Google Scholar]
  13. Conway, J.H.; Curtis, R.T.; Norton, S.P.; Parker, R.A.; Wilson, R.A. Atlas of Finite Groups; Clarendon Press: Oxford, UK, 1985; pp. 18–234. [Google Scholar]
  14. Gorenstein, D.; Lyons, R.; Solomon, R. The Classification of the Finite Simple Groups; Number 3; American Mathematical Society: Providence, RI, USA, 1994; pp. 53–63+143–249. [Google Scholar]
  15. Gorenstein, D.; Lyons, R.; Solomon, R. The Classification of the Finite Simple Groups; Number 8; American Mathematical Society: Providence, RI, USA, 2018; p. 406. [Google Scholar]
  16. Feit, W.; Thompson, J.G. Solvability of groups of odd order. Pac. J. Math. 1963, 13, 755–1029. [Google Scholar] [CrossRef] [Scilit]
  17. Burnside, W. On groups of order paqb. Proc. Lond. Math. Soc. 1904, 2, 388–391. [Google Scholar]
  18. The GAP Group. GAP—Groups, Algorithms, and Programming, Version 4.16.0. 2026. Available online: https://www.gap-system.org (accessed on 10 May 2026).
  19. Chillag, D.; Herzog, M. On the length of conjugacy classes of finite groups. J. Algebra 1990, 131, 110–125. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.