Next Article in Journal
New Zero-Density Results for Automorphic L-Functions of GL(n)
Next Article in Special Issue
A Compendium of Infinite Group Theory: Part 1—Countable Recognizability
Previous Article in Journal
Fixed Point Theorems for Nonexpansive Mappings under Binary Relations
Previous Article in Special Issue
Conjugacy Problem in the Fundamental Groups of High-Dimensional Graph Manifolds
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Lengths of Certain Real Conjugacy Classes and the Related Prime Graph

School of Mathematical Science, Guizhou Normal University, Huaxi District, GuiYang 550000, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2021, 9(17), 2060; https://doi.org/10.3390/math9172060
Submission received: 22 June 2021 / Revised: 17 August 2021 / Accepted: 19 August 2021 / Published: 26 August 2021
(This article belongs to the Special Issue Group Theory and Related Topics)

Abstract

:
Let G be a finite group. In this paper, we study how certain arithmetical conditions on the conjugacy class lengths of real elements of G influence the structure of G. In particular, a new type of prime graph is introduced and studied. We obtain a series of theorems which generalize some existed results.

1. Notation and Introduction

Throughout this paper, the terminology is as follows. All groups are finite and G refers to a group. By a primary element x and a primary p -element y for a prime number p, we mean that | x | = r n for an arbitrary prime r and | y | = q n for some prime q p . Recall that an element g of G is said to be r e a l in G if g and g 1 are conjugate in G, i.e., there is an x G such that g 1 = g x , and as usual the conjugacy class of the real element g, { g x | x G } , is called a real class of g. We denote by x G , | x G | , Re ( G ) , and Rp ( G ) the conjugacy class of x G , the length of x G , the set of real elements of G, and the set of real primary elements of G, respectively. We denote by n ( Σ ) the number of connected components of a graph Σ . Define the set Re ( G ) = { x | x Re ( G ) and π ( | x | ) { 2 , p } , where p is an arbitrary prime number}. That is, Re ( G ) is the set of real primary elements and real biprimary even order elements of G. Let con ( G ) , con r ( G ) and con r ( G ) denote the set of conjugacy classes, the set of real conjugacy classes, the set of conjugacy classes { g G } , where g Re ( G ) , of G, respectively. We denote by cs ( G ) , cs r ( G ) , and cs r ( G ) the set { | C | : C con ( G ) } , { | C | : C con r ( G ) } , and { | C | : C con r ( G ) } , respectively. Other notation will be explained in due time.
The prime graphs are useful tools for intuitively reflecting the structure of groups, and the investigation of them are still underway. The prime graph related to con ( G ) , denoted by Γ ( G ) (introduced by Alfandary in [1] as Γ ( G ) ), is a simple graph with vertex set V ( G ) the set of primes dividing the length of some C con ( G ) and there is an edge between two vertices p and q if and only if the product p q divides the length of some C con ( G ) . Prime graphs related to a subset of classes of a group is constructed in the same way. Let Γ r ( G ) be the prime graph related to con r ( G ) ( introduced by Dolfi in [2] as Γ ( G ) ).
The influence of conjugacy class lengths on the structure of groups has been extensively studied in the past two decades (see [3,4,5,6]). In particular, the problems of recognizing the solvability of G and the existence of normal (or abelian) p-complements of G in this context have been widely investigated, which are also the major themes of our discussion here. Recently, some authors do their research by placing conditions on only real classes of G. Fruitful achievements are obtained in this line of study, and it turns out that the lengths of these classes are closely related to some fundamental properties of G, see, for instance, [2,7,8]. The new techniques developed in those papers are valuable and some analogue methods are employed in this article.
Now, we mention several notable findings related to real classes. In ([8], Theorem 4.2), Tong-Viet proved that, if the class length of every real primary 2 -element of G is either a 2-power or not divisible by 4, then G is solvable. It was shown in ([2], Theorem 6.1) that 2 is not a vertex of Γ r ( G ) if and only if G has a normal Sylow 2-subgrpup S (i.e., G is 2-closed) and Re ( S ) Z ( S ) . For odd primes, the outcomes are not that satisfactory. Furthermore, it follows from ([9], Theorem B) that, if the prime graph Γ r ( G ) of G is disconnected, then 2 must be a vertex of Γ r ( G ) . These facts confirm repeatedly the importance and the special position of the prime 2 in the study of real classes in groups.
Based on the above observations, in this article, we consider the set Re ( G ) for G, which are defined earlier, and introduce the prime graph Γ r ( G ) related to the classes of elements of Re ( G ) , i.e., con r ( G ) . Precisely, Γ r ( G ) is the graph with vertex set V r ( G ) = { q : q π ( G ) , q | | C | for some C con r ( G ) } , and edge set E r ( G ) = { { p , q } : p q , p q | | C | for some C con r ( G ) } .
We pay the majority of attention to class lengths of elements of Re ( G ) in Section 3 and of Rp ( G ) in Section 4, respectively, and characterize G of which these lengths have some arithmetical properties. In Section 5, the properties of the prime graph Γ r ( G ) that we defined and the relation to the structure of G are examined. In this paper, we obtain improvements and variations of some existed results.

2. Preliminaries

We will need some results on conjugacy classes, and in particular, on real classes.
Lemma 1.
Let N G . Then, | x N | | | x G | for all x N , and | ( x N ) G / N | | | x G | for all x N G / N .
Lemma 1 is well known, and we will use it without further reference.
Lemma 2
([9], Lemma 2.1). (a) If x Re ( G ) and | x G | is odd, then x 2 = 1 .
(b) If x Re ( G ) , then every power of x is a real element of G.
(c) If x Re ( G ) , then x t = x 1 for some 2-element t G .
(d) If N G and | G / N | is odd, then Re ( G ) = Re ( N ) .
Lemma 3
([10], Lemma 2.5). Let x , y G be such that x y = y x .
(a) Assume G = C G ( x ) C G ( y ) . Then, ( x y ) G = x G · y G . If in addition x and y are in Re ( G ) , then x y Re ( G ) .
(b) If ( | x | , | y | ) = 1 , or if x and y are normal in G and have trivial intersection, then C G ( x y ) = C G ( x ) C G ( y ) , and therefore π ( | x G | ) π ( | y G | ) π ( | x y G | ) .
Lemma 4
([10], Proposition 2.8). Let A be a group of odd order that acts faithfully on a nontrivial elementary abelian 2-group V of order 2 n . Assume that C V ( A ) = 1 . Then, the following conditions are equivalent:
(a) For every nontrivial x V , | A : C A ( x ) | is a prime number.
(b) There exists a prime p such that, for every nontrivial x V , | A : C A ( x ) | = p .
Lemma 5
([2], Proposition 6.4). The following are equivalent:
(a) Every nontrivial element in Re ( G ) has even order;
(b) Every element in Re ( G ) is a 2-element;
(c) G has a normal Sylow 2-subgroup.
Lemma 6
([10], Lemma 3.3). Let x be a nontrivial real odd order element of G. If | x G | has prime length q, then q = 2 and x G . Furthermore, for every nontrivial y x , we have C G ( y ) = C G ( x ) .
The next Lemma gives a neat description of the structure of G when cs r ( G ) = { 1 , 2 , p } .
Lemma 7
([10], Theorem 3.4). Let p be an odd prime. Then, cs r ( G ) = { 1 , 2 , p } if and only if G = H × O , where H is a dihedral group of order 2 p and cs r ( O ) = { 1 } .
Lemma 8 and 9 are for inductive purposes.
Lemma 8
([7], Lemma 2.2). Suppose that N is a normal subgroup of G and x N Re ( G / N ) . If | N | or the order of x N in G / N is odd, then x N = y N for some real element y of G (of odd order if the order of x N is odd).
Lemma 9.
Let π be a set of some primes and N a normal subgroup of G.
(a) ([11], Lemma 2.3) If x ¯ = x N is a π-element, then there exists a π-element x 1 of G such that x ¯ = x 1 ¯ .
(b) If | N | or the order of x N in G / N is odd, and x ¯ = x N is a real π-element, then there exists a real π-element x 1 of G such that x ¯ = x 1 ¯ .
Proof. 
(b) By Lemma 8, there exists a real element y of G such that x N = y N . Clearly, we can write y = y 1 y 2 , where y 1 is a π -element and y 2 is a π -element. As the order of y N is the product of the orders of y 1 N and y 2 N , we have y 2 N ; therefore, y N = y 1 N . Since y 1 is some power of y, by Lemma 2(b), y 1 is real in G. Choose y 1 = x 1 will meet the conclusion. □
Lemma 10 and Lemma 11 are used in Section 4 and Section 5, respectively.
Lemma 10.
Let p be a prime and K G such that | G | p = | K | p . Then, | x K | p = | x G | p for all non-central x Re ( K ) .
Proof. 
Let x Re ( K ) be non-central and let S C Syl p ( C G ( x ) ) and S G Syl p ( G ) such that S C S G . Since | G | p = | K | p , then S C S G K . In particular, S G Syl p ( K ) . It follows that C K ( x ) = K C G ( x ) and S C K C G ( x ) . Therefore, S C C K ( x ) C G ( x ) and hence S C is also a Sylow p-subgroup of C K ( x ) . Thus, | C G ( x ) | p = | S C | = | C K ( x ) | p , and then | x G | p = | G : C G ( x ) | p = | S G : S C | = | K : C K ( x ) | p = | x K | p . □
Lemma 11.
Suppose that Γ r ( G ) has two connected components with vertex sets π 1 and π 2 , where 2 π 2 . Then, there exists an involution i G such that | i G | > 1 is a π 2 -number and C G ( i ) has a normal Sylow 2-subgroup.
Proof. 
Let p be a prime in π 2 . Then, p must divide | i G | for some i Re ( G ) . Clearly, every prime divisor of | i G | is adjacent to p π 2 ; this implies that | i G | is a nontrivial π 2 -number. Hence, | i G | > 1 is odd and so i 2 = 1 by Lemma 2(a) and thus i is an involution of G.
Assume that C G ( i ) has a nontrivial real element x of odd order. By Lemma 2(b), we can assume that | x | = q , where q is an odd prime. Then, x i = i x and | x G | is even, so | x G | is a π 1 -number and thus ( | x G | , | i G | ) = 1 . Lemma 3(a) implies that x i is a real element. Furthermore, since ( | x | , | i | ) = 1 , 2 p | | ( i x ) G | by Lemma 3(b). Since π ( | i x | ) { 2 , p } , i x Re ( G ) . Then, 2 π 1 and p π 2 are adjacent in Γ r ( G ) , and we get a contradiction. Therefore, C G ( i ) has no nontrivial real element of odd order and thus it has a normal Sylow 2-subgroup by Lemma 5. □
We close this section with the remark that trivial class is the only real class of G if and only if G has odd order ([10], Lemma 2.4(iii)), and therefore G has no nontrivial real primary elemnet if and only if G has odd order.

3. The Lengths of Real Classes

In ([10], Theorem A), Dolfi proved that G is solvable if all noncentral real classes of G have prime size, and, furthermore, cs r ( G ) is contained in a set of the kind { 1 , 2 } , { 1 , p } or { 1 , 2 , p } , where p is an odd prime. We show that similar conclusions are true under more general conditions.
We begin with Theorem 1, and a basic result of this section which is the reasoning behind several other results. It shows that the properties of certain real elements can determine those of all the real elements in some ways:
Theorem 1.
(1) Every g Re ( G ) is a 2-element if and only if every g Rp ( G ) is a 2-element.
(2) Let p be an odd prime, then cs r ( G ) = { 1 , p } if and only if cs r ( G ) = { 1 , p } .
(3) Let p be an odd prime, then cs r ( G ) = { 1 , 2 , p } if and only if cs r ( G ) = { 1 , 2 , p } .
Proof. 
(1) Necessity being clear. Assume that every primary real element of G is a 2-element, and let g Re ( G ) . We can factor g as g = g 1 g 2 g n , where each element g i has distinct prime power orders and commute pairwise. By Lemma 2(b), all g i ’s are real in G, and therefore, by hypothesis, they are all 2-elements. Thus, g is a 2-element, as required.
(2) First, assume that cs r ( G ) = { 1 , p } . Let g Re ( G ) Re ( G ) , then we can write g = g 1 g 2 g n where each element g i have distinct prime power orders and commute pairwise. If cs r ( G ) = { 1 } , then all the g i ’s are central in G, so g is central in G and | g G | = 1 . We conclude that cs r ( G ) = { 1 } , a contradiction. If cs r ( G ) = { p } , then, by Lemma 3(b), it is easy to get p | | g G | and so g Z ( G ) . Since g is arbitrary, we get cs r ( G ) = { p } , a contradiction too. Thus, cs r ( G ) = { 1 , p } .
Conversely, assume that cs r ( G ) = { 1 , p } . For every g Rp ( G ) , we have | g G | = 1 or p, in each case, by Lemma 2(a), we have | g | = 2 . Now, by (1), we see that every g Re ( G ) is a 2-element. By assumption | g G | = 1 or p, and therefore cs r ( G ) = { 1 , p } , the claim follows.
(3) Assume that cs r ( G ) = { 1 , 2 , p } , by Lemma 7 we get G = H × O where H is a dihedral group of order 2 p and cs r ( O ) = { 1 } . Notice that, for g = h o G = H × O , we have | g G | = | h H | · | o O | , and cs r ( H ) = { 1 , 2 , p } , and it follows that cs r ( G ) = { 1 , 2 , p } .
Conversely, assume that cs r ( G ) = { 1 , 2 , p } . If no nontrivial primary real element of G has an odd order, then it is easy to see that every real element has an even order. Lemma 5 yields that G has a normal Sylow 2-subgroup D, and Re ( G ) D by Lemma 2(d). That is, Re ( G ) Re ( G ) , and the claim follows. Therefore, we may assume that there exists a nontrivial primary real element x of G having odd order, and clearly | g G | = 2 .
Let M = C G ( x ) . By Lemma 6, for every 1 y x , C G ( y ) = M has index 2 in G. Choose element z Re ( G ) such that | z G | = p . Observe that z is an involution by Lemma 2(a). Now, if any 1 y x centralizes z, then, by Lemma 3, it is easy to see that y z Re ( G ) and | ( y z ) G | = 2 p . This is a contradiction by hypothesis. Therefore, C G ( z ) x = 1 . In particular, z M and hence z is a complement of M in G. Furthermore, as x C M ( z ) = 1 and | M : C M ( z ) | | | G : C G ( z ) | = p , it follows that M = x × C M ( z ) and that | x | = p . In other words, every nontrivial real primary element of G having an odd order must have order p.
Let g Re ( G ) , write g = g 1 g 2 g t , where all the g i ’s are real in G and commute pairwise; in addition, | g 1 | = 2 n 1 and for 2 i t , | g i | = p i n i where p i ’s are odd primes. By the preceding conclusion, we must have | g i | = p for 2 i t . It follows that g Re ( G ) , and therefore Re ( G ) = Re ( G ) . Thus, assertion cs r ( G ) = { 1 , 2 , p } follows. □
With Theorem 1 in mind, we found that some existed results can be restated in forms that are a little more general. For instance, considering Lemma 5 and 7, we have the following two corollaries. Corollary 1 describes the groups with all the real primary elements being 2-elements.
Corollary 1.
The following are equivalent:
(1) Every element in Rp ( G ) is a 2-element.
(2) G has no nontrivial real primary 2 -element.
(3) G has a normal Sylow 2-subgroup.
Corollary 2 characterizes the structure of G such that the lengths of classes g G for every noncentral g Re ( G ) is either 2 or p, where p is a fixed odd prime.
Corollary 2.
Let p be an odd prime. Then, cs r ( G ) = { 1 , 2 , p } if and only if G = H × O where H is a dihedral group of order 2 p and cs r ( O ) = { 1 } .
Theorem 6.1 in [2] states that all real classes of G have odd lengths if and only if G has a normal Sylow 2-subgroup P and Re ( P ) Z ( P ) . Here is a similar result.
Theorem 2.
Let P be a Sylow 2-subgroup of G. Then, all classes of elements of Rp ( G ) have odd lengths if and only if P G and Re ( P ) Z ( P ) .
Proof. 
By Theorem 6.1 in [2], we need only show that, if all classes of elements of Rp ( G ) have odd lengths, then so do the real classes of G. Let the class lengths of all x Rp ( G ) are odd numbers. We then have x 2 = 1 for all x Rp ( G ) , and it is easily seen that all the elements of Re ( G ) must be 2-elements. The claim follows by assumption. □
The next theorem is another basic result of Section 3, and arguments analogous to those of [10] are used in the proof.
Theorem 3.
Assume that | g G | is either a 2-power or an odd prime for every g Re ( G ) . Then, G is solvable, and there exists an odd prime p such that | g G | is either a 2-power or p for every g Re ( G ) .
Proof. 
By ([8], Theorem 4.2), we know that G is solvable.
Assume first that G has a normal Sylow 2-subgroup D, and set U = g Re ( G ) : | g G | is odd〉. Observe that, by Lemma 2(a), U is an elementary abelian 2-subgroup which is a subgroup of Z ( D ) . Moreover, we have U G . Let A = G / C G ( U ) . Then, | A | is odd and, by Fitting’s Lemma (see ([12], Theorem 4.34), U = V × C U ( A ) , where V = [ A , U ] . Note that A acts faithfully on V and that C V ( A ) = C U ( A ) V = 1 . Every nontrivial x V is an involution, so x Re ( G ) and | x G | = | G : C G ( x ) | = | A : C A ( x ) | is either a power of 2 or an odd prime by hypothesis. However, 2 | x G | since x Z ( D ) , we have | A : C A ( x ) | is an odd prime. Then, by Lemma 4, there exists an odd prime p such that | A : C A ( x ) | = p for every nontrivial x V . Now, if g Re ( G ) and | g G | is an odd prime, then g = x y for suitable elements x V and y C U ( A ) , and hence | g G | = | A : C A ( x ) | { 1 , p } . We see that, in this case, the theorem is proved.
We now assume that G does not have a normal Sylow 2-subgroup. Thus, by Lemma 5, there exists a nontrivial element x Re ( G ) of odd order. Observe that, by Lemma 2(b), we can assume | x | = p , where p is an odd prime. By Lemma 2(a), | x G | is even, and hence | x G | = | G : C G ( x ) | is a power of 2 by hypothesis. Now, let y Re ( G ) be such that | y G | = q is an odd prime. Applying again Lemma 2(a), we see that y is an involution.
If we assume q p , then C G ( y ) contains a Sylow p-subgroup of G; therefore (by a suitable choice of y), we can assume that C G ( y ) contains x. As C G ( x ) and C G ( y ) have a coprime index in G, by Lemma 3 we have x y Re ( G ) and | ( x y ) G | = | G : C G ( x ) C G ( y ) | = 2 n q , where n is a positive integer. Since π ( | x y | ) { 2 , p } , so x y Re ( G ) , by hypothesis, this is a contradiction. It follows again that | g G | is either a power of 2 or p for every g Re ( G ) . □
With minor changes in the preceding proof, we can prove the following corollary.
Corollary 3.
Assume that | g G | is a prime for every g Re ( G ) . Then, G is solvable, and there exists a prime p such that cs r ( G ) { 1 , 2 , p } .

4. The Class Lengths of Primary Real Elements

Recognizing p-nilpotency (i.e., has a normal p-complement or not) is clearly an important problem. In this section, we provide some evidence for a conjecture proposed in [8], which said that, if the lengths of all the nontrivial real classes in G have the same 2-part, then O 2 ( G ) is 2-nilpotent; in particular, G is solvable. In Theorem 4, we prove that, with only real classes of primary elements being considered, this conjecture is held under some condition on the Sylow 2-subgroups.
In ([13], Theorem 3.4), Navarro et al. showed that all real class lengths of G are powers of 2 if and only if G has a normal 2-complement K and Re ( G ) C G ( K ) . However, when p is an arbitrary prime, the situation for the existence of a normal p-complement is different. We also remark that, in ([14], Lemma 2.2), Chen and Zhao proved that, if | x G | is a p-number for every primary p -element x of G, then G is a solvable group with abelian p-complements. Here, we obtain Theorem 5 as an analogous result.
At the end of this section, a particular class of groups is concerned, namely, the P-groups. For every subgroup H of G, if H < P G ( H ) where P G ( H ) = x | x G , x H = H x , then G is said to satisfy the permutizer condition P, or to be a P-group. In [15], the authors proved that P-groups are solvable by making use of the Classification Theorem of Finite Simple Groups (CFSG), they also proved that every maximal subgroup of a P-group has index 4 or a prime. It is meaningful to consider how close such groups come to being supersolvable.
Theorem 4.
Suppose that | x G | 2 = 2 n for all non-central x Rp ( G ) . Assume further that G has a Sylow 2-subgroup S with Re ( S ) Z ( S ) . Then, G is solvable and O 2 ( G ) is 2-nilpotent.
Proof. 
We first prove that G is solvable. Let G be a counterexample of minimal order. Then, G is non-solvable and has no normal Sylow 2-subgroup. By Corollary 1, there exists a nontrivial real primary 2 -element z G . Clearly, z Z ( G ) and so | z G | is even. Thus, | z G | 2 = 2 n 2 . That is, | x G | 2 = 2 n 2 for all non-central x Rp ( G ) .
Now we claim that every nontrivial real 2-element of G / O 2 ( G ) lies in the center of G / O 2 ( G ) . Let x O 2 ( G ) be a nontrivial real 2-element of G / O 2 ( G ) . By Lemma 9(b), there exists a real 2-element y of G such that x O 2 ( G ) = y O 2 ( G ) . Considering y, we have y t = y 1 for some 2-element t G by Lemma 2(c). Write U = y , t . Since t normalizes y , U is a 2-subgroup of G. We have U g S for some g G by the Sylow theorem. We want to show that y U is a central involution of G. Notice that, if y g is a central involution of G, then so is y. Therefore, we may assume that U S . Since y Re ( U ) , then y Re ( S ) Z ( S ) , so it follows easily that y is an involution and | y G | is odd. However, by the first paragraph, | y G | is even if y is not central, and this forces y Z ( G ) . We conclude that y is a central involution of G, hence x O 2 ( G ) = y O 2 ( G ) is also a central involution of G / O 2 ( G ) , and the claim follows.
Since O 2 ( G / O 2 ( G ) ) = 1 , by ([16], the main theorem), the last term of the derived series of G / O 2 ( G ) is isomorphic to G 1 × G 2 × × G s , where each G i is isomorphic to either SL 2 ( q ) with odd number q > 5 , or 2 · A 7 , the perfect double cover of A 7 . We claim that, for some i, there exists a real element a of G i , and therefore of G / O 2 ( G ) , such that | a | = 2 m 4 . First, assume that G i 2 · A 7 for some i. Using [17], G i has a real element of order 4. Next, assume that G i SL 2 ( q ) with odd number q > 5 . As we know (see ([18], Theorem 2.8.3)), the Sylow 2-subgroup S of SL 2 ( q ) is a generalized quaternion group Q 2 k + 1 of order 2 k + 1 8 . From its presentation a , b : a 2 k 1 = b 2 , a 2 k = 1 , b 1 a b = a 1 , we obtain a real element a of SL 2 ( q ) of order 2 k 4 . Of course, a is also real in G / O 2 ( G ) as G i is a subgroup of G / O 2 ( G ) . The claim follows. a must lie in the center of G / O 2 ( G ) , which yields a Z ( G i ) . Notice that | Z ( G i | = 2 for all i 1 , and we get a contradiction. Therefore, G is solvable.
Suppose that G > O 2 ( G ) . Using Lemma 10 where we let p = 2 and K = O 2 ( G ) , we see that | x K | 2 = 2 n for all non-central x Rp ( K ) and by induction O 2 ( G ) is 2-nilpotent. Hence, we may assume that G = O 2 ( G ) . Let G ¯ = G / O 2 ( G ) and use bar as the customary. Let P ¯ = O 2 ( G ¯ ) . G ¯ has a Hall 2 -subgroup H ¯ since it is solvable. By the second paragraph, we see that every nontrivial real 2-element of G ¯ lies in Z ( G ¯ ) . This means that the conjugation action of H ¯ on P ¯ fixes all real elements of order 2 or 4, and then H ¯ centralizes P ¯ by ([19], Theorem B). By ([12], Theorem 3.21), we get H ¯ C G ¯ ( P ¯ ) P ¯ , which yields H ¯ = 1 . Hence, P ¯ = G ¯ is a 2-group and we conclude that G is 2-nilpotent. □
Theorem 5.
Let p be a prime, | x G | a power of p for every 2-element, and every p-element x of G, and also for every real primary p -element x of G. Then, G has a normal p-complement.
Proof. 
First, by ([8], Theorem 4.2), we see that G is a solvable group. Next, we show that G has a normal p-complement by induction on | G | . Let P Syl p ( G ) and M be a normal maximal subgroup of G. Then, | G / M | = q a prime. Note that Rp ( M ) Rp ( G ) and | x M | | | x G | for all x M , By induction, we know that M has a normal p-complement H. Hence, we may assume that q p .
Let G ¯ = G / H . We claim that G ¯ inherits the hypothesis on G. Let x ¯ be a p-element (2-element, resp. ) of G ¯ . By Lemma 9(a), there exists a p-element (2-element, resp. ) x 1 of G such that x ¯ = x 1 ¯ . Therefore, | x ¯ G ¯ | = | x 1 ¯ G ¯ | | | x 1 G | , which yields that | x ¯ G ¯ | is a p-power. Let y ¯ be a real primary p -element of G ¯ , and we can assume that | y ¯ | = r m for some prime r 2 , since otherwise, by hypothesis and Lemma 9(a), we easily get that | y ¯ G ¯ | is a power of p. By Lemma 9(b), there exists a real r-element y 1 of G such that y ¯ = y 1 ¯ . Hence, | y ¯ G ¯ | = | y 1 ¯ G ¯ | | | y 1 G | ; again, | y ¯ G ¯ | is also a power of p. The claim follows. Now, if H > 1 , then G / H has a normal p-complement by induction, and therefore G has a normal p-complement.
Based on the above, we may assume that H = 1 . In particular, M = P G . Now, let K be a Sylow q-subgroup of G. We have that K acts coprimely on P. We claim that every element of P is K-invariant. Let x P . Then, | G : C G ( x ) | is a p-power since x is a p-element of G. Therefore, there exists y P such that K y 1 C G ( x ) . Then, K C G ( x y ) , and we deduce that the conjugacy class x P = ( x y ) P is K-invariant. It follows that the action of K on P induces an action of K on the classes in P, and, for every class C in P, K fixes some element of C, say x C . Set J = x C | C con ( P ) . Clearly, K acts trivially on J. Since J contains an element from each class in P, we get P = v P J v . Hence, P = J and the action of K on P is trivial, which implies that G has a normal p-complement K. This completes the proof. □
Remark 1.
When p = 2 , Theorem 5 still holds of course.
By the inductive method and utilizing the properties of P-groups mentioned before, we give a sufficient condition for a P-group to be supersolvable. It seems that to date that there is no similar result of this kind.
Theorem 6.
Let G be aP-group. Suppose that 8 | x G | for every 2-element and every real primary element x G . Then, G is supersolvable.
Proof. 
Assume that the theorem is false and let G be a counterexample. Thus, G is not supersolvable.
If every maximal subgroup of G has index a prime, then G is supersolvable. Hence, G has a maximal subgroup M such that | G : M | = 4 . Therefore, | G | is even. Since G is a P-group, G is solvable by the preceding remarks. There exists a minimal normal subgroup N of G such that N is elementary abelian of order p n where p is a prime. Consider G ¯ = G / N . It can be shown that G ¯ is a P-group. We may suppose that n > 1 , since, otherwise, G is supersolvable as required. Let x ¯ be a real primary 2 -element of G ¯ , by Lemma 9(b), there exists a real primary 2 -element x 1 of G such that x ¯ = x 1 ¯ . We see that | x ¯ G ¯ | = | x 1 ¯ G ¯ | | | x 1 G | , which yields 8 | x ¯ G ¯ | . On the other hand, let y ¯ be a 2-element of G ¯ ; by Lemma 9(a), it is easy to deduce that 8 | y ¯ G ¯ | . This shows that G ¯ inherits our hypothesis and thus is supersolvable. Note that the class of finite supersolvable groups is a saturated formation, hence Φ ( G ) = 1 and N is the unique minimal normal subgroup of G. From these facts, we obtain a maximal subgroup M of G such that G = M N and M N = 1 . Since | G : M | is a prime or 4, we must have | N | = 4 , that is, p = n = 2 .
Consider the permutation representation of G on M. We see that G is isomorphic to a subgroup of S 4 . Hence, G S 4 or G A 4 since G is not supersolvable. Furthermore, it is easy to check that A 4 is not a P-group, so G S 4 . We remark that every element of S 4 is real. Now, for an element x of order 3, for example, permutation ( 123 ) , since | C G ( x ) | = 3 , we have | x G | = | G : C G ( x ) | = 8 , a contradiction to our hypothesis. Therefore, we conclude that G is supersolvable. □
Remark 2.
By Lemma 9(b), for real 2-elememts, the inductive method may not work out when applied to quotient groups; therefore, assumptions for (not real) 2-elements are needed in Theorems 5 and 6.

5. The Prime Graph

The implications of the class lengths of G on the structure of G can be studied via prime graphs. Interestingly, prime graphs related to different subsets of classes exhibit some similarities in their graphic features. For instance, it was shown that n ( Γ ( G ) ) 2 and n ( Γ r ( G ) ) 2 for any group G (see [1,2]). In addition, Γ p ( G ) 2 if G is a p-solvable group, where Γ p ( G ) is the prime graph related to the set of classes of p -elements of G (see [20]).
By the proof of Theorem 2, the condition that all the elements of Rp ( G ) have odd number class lengths is equivalent to saying that all the elements of Re ( G ) , and therefore of Re ( G ) , have odd number class lengths, hence Theorem 2 shows that 2 is not a vertex of Γ r ( G ) if and only if G has a normal Sylow 2-subgroup P and Re ( P ) Z ( P ) .
Our Theorem 7 determines the number of connected components of the prime graphs Γ r ( G ) , and the finding is consistent with those regarding Γ ( G ) and Γ r ( G ) . For convenience, let g Re ( G ) be a non-central element, and we denote by Δ G ( g ) the connected component of Γ r ( G ) that contains the set of vertices π ( | g G | ) , and Δ G ( q ) the connected component of Γ r ( G ) which q belongs to, where q is a prime.
Considering Γ r ( G ) , by ([9], Theorem 3.4), we have that G is solvable if Γ r ( G ) is disconnected. It is tempting to wonder wether the corresponding conclusion for Γ r ( G ) is valid or not. However, we are unable to prove or disprove this yet. Nevertheless, for a very restrictive case, we have Theorem 9, the proof of which is via a series of lemmas and theorems, in particular, Theorem 7 and 8 are employed.
Theorem 7.
For any group G, n ( Γ r ( G ) ) 2 .
Proof. 
Working by contradiction, let G be a group of minimal order such that n ( Γ r ( G ) 3 .
Assume first that there exists a nontrivial element of odd order x Re ( G ) . By taking a suitable power, we can assume that | x | = p with p an odd prime. By Lemma 2(a), we have Δ G ( x ) = Δ G ( 2 ) . Since n ( Γ r ( G ) ) 3 , there is a connected component Δ of Γ r ( G ) with Δ Δ G ( x ) and Δ Δ G ( p ) . Choose y Re ( G ) such that Δ = Δ G ( y ) . Because 2 Δ , y is an involution. Furthermore, as p Δ , y commutes with a Sylow p-subgroup of G and, up to conjugation, we can assume that x and y commute. Note that x y Re ( G ) , so, by Lemma 3, we get the contradiction Δ G ( x ) = Δ G ( x y ) = Δ G ( y ) .
We see that all elements of Re ( G ) are 2-elements, and so are all elements of Re ( G ) . Hence, by Lemma 5, G has a normal Sylow 2-subgroup P. In particular, G is solvable by the Feit–Thompson theorem. Let N be a maximal normal subgroup of G containing P. Then, [ G : N ] = q an odd prime and Re ( G ) = Re ( N ) by Lemma 2(d). If x Re ( G ) , then π ( | x N | ) π ( | x G | ) π ( | x N | ) { q } . By minimality, n ( Γ r ( N ) ) 2 , and this implies that a connected component of Γ r ( G ) must consist of the single prime q, and q V r ( N ) . Thus, if g Re ( G ) and q π ( | g G | ) , then | g G | is a q-power and g Z ( N ) . In addition, by Lemma 2(a), g is an involution.
Let Z = Z ( P ) G . Since P lies in the kernel of the action of N on Z, we have the decomposition Z = C Z ( N ) × [ Z , N ] , with C Z ( N ) , [ Z , N ] G . Let x Re ( G ) with Δ G ( x ) = { q } . Then, x Z C G ( N ) = C Z ( N ) . Observe that [ Z , N ] 1 , as otherwise every real class of elements of Re ( G ) that has an odd length would have q-power length and hence n ( Γ r ( G ) ) 2 . Let y [ Z , N ] be an involution. Then, from N C G ( x ) and N C G ( y ) , we obtain ( | x G | , | y G | ) = 1 , so, by Lemma 3(a), it follows x y Re ( G ) . Of course, x y Re ( G ) . Since x and y lie in normal subgroups of G which intersect trivially, we get C G ( x y ) = C G ( x ) C G ( y ) and therefore π ( | ( x y ) G | ) π ( | x G | ) π ( | y G | ) . This gives Δ G ( x ) = Δ G ( x y ) = Δ G ( y ) , a contradiction. □
If N G , by the fact that Re ( N ) Re ( G ) , we easily see that Γ r ( N ) is a subgraph of Γ r ( G ) . However, it may not be true that Γ r ( G / N ) is a subgraph of Γ r ( G ) . However, this is the case if | N | is odd.
Lemma 12.
Let N G with | N | odd. Then, Γ r ( G / N ) is a subgraph of Γ r ( G ) .
Proof. 
First, we argue that V r ( G / N ) V r ( G ) . Let p V r ( G / N ) and let x N Re ( G / N ) such that p | | ( x N ) G / N | . By Lemma 9(b), there exists an element y Re ( G ) such that x N = y N . Since | ( x N ) G / N | = | ( y N ) G / N | | | y G | , p | | y G | and p V r ( G ) .
With a similar argument, we can prove that, if there are two different vertices p , q V r ( G / N ) , adjacent in Γ r ( G / N ) , then p , q are adjacent in Γ r ( G ) by using Lemma 9(b) again. Thus, Γ r ( G / N ) is a subgraph of Γ r ( G ) . □
Let H be a subgroup or a quotient group of G. Assume that Γ r ( H ) is a subgraph of Γ r ( G ) , and Γ r ( G ) is also disconnected having two connected components with vertex sets π 1 and π 2 , respectively. To show that Γ r ( H ) is disconnected, it suffices to show that V r ( H ) π i for i = 1 , 2 , or, equivalently, there exists two elements u 1 , u 2 of Re ( H ) such that π ( | u i H | ) π i for i = 1 , 2 .
Theorem 8.
Suppose that, for a group G, Γ r ( G ) has two connected components with vertex sets π 1 and π 2 , where 2 π 2 . Then:
(1) If G is not 2-closed and M G with | G : M | odd, then Γ r ( M ) is disconnected.
(2) If N G with | N | odd and assuming further that G = O 2 ( G ) is not 2-nilpotent, then Γ r ( G / N ) is disconnected.
Proof. 
By Lemma 11, G has an involution i such that | i G | > 1 is a π 2 -number and C G ( i ) has a normal Sylow 2-subgroup S.
For (1), let M G with | G : M | being odd. We have V r ( M ) V r ( G ) = π 1 π 1 . Notice that, if M is 2-closed, then G is also 2-closed, hence we may assume that M is not 2-closed. By Theorem 2, 2 divides the class length of some element of Rp ( M ) and hence 2 V r ( M ) π 1 . Now, M contains every real element of G by Lemma 2(d); then, i M . If M C G ( i ) , then S M as | G : M | is odd, so M is 2-closed, a contradiction. Thus, | i M | > 1 and then V r ( M ) π 2 . As Γ r ( M ) is a subgraph of Γ r ( G ) and V r ( M ) π i for each i = 1 , 2 , we conclude that Γ r ( M ) is disconnected.
For (2), let N G with | N | being odd. By Lemma 12, Γ r ( G / N ) is a subgraph of Γ r ( G ) . In particular, V r ( G / N ) V r ( G ) = π 1 π 1 . If G / N is 2-closed, then S N G is of an odd index, thus G = S N since G = O 2 ( G ) . In other words, G is 2-nilpotent, by hypothesis, this is a contradiction. Hence, we may assume that G / N is not 2-closed.
The element i N G / N is clearly an involution. If i N Z ( G / N ) , we have G / N = C G / N ( i N ) = C G ( i ) N / N , where the latter equality follows from ([12], Lemma 7.7). Hence, S N / N is a normal Sylow 2-subgroup of G / N , a contradiction. Therefore, i N Z ( G / N ) and | ( i N ) G / N | > 1 , so V r ( G / N ) π 2 . On the other hand, as G / N is not 2-closed, by Theorem 2, again 2 V r ( G / N ) π 1 . We conclude that Γ r ( G / N ) is disconnected. □
Finally, recall that the famous Feit–Thompson Theorem from 1963 states that every group of odd order is solvable. Therefore, we know that G is solvable if | G | = 2 r where r is a prime by ([12], Theorem 1.35). This conclusion as well as some arguments similar to those in the proof of ([9], Theorem 3.4) are applied to get the following theorem.
Theorem 9.
Let | G | = 2 n r , where n 2 and r is an odd number; if Γ r ( G ) is disconnected, then G is solvable.
Proof. 
Let G be a counterexample with minimal order. Then, G is non-solvable and Γ r ( G ) is disconnected. By Theorem 7, we get that Γ r ( G ) has exactly two connected components with vertex sets π 1 and π 2 , respectively. We can assume that G has no normal Sylow 2-subgroup, since, otherwise, by the Feit–Thompson theorem, G is solvable. By Corollary 1, G has a nontrivial real primary 2 -element x. Then, | x G | is even and hence 2 V r ( G ) . We assume that 2 π 1 . Therefore, all vertices in π 2 are odd primes. We divide the remaining proof into three parts.
(1) G is not a non-abelian simple group.
By Lemma 11, there exists an involution i G such that | i G | > 1 is a π 2 -number and C G ( i ) has a normal Sylow 2-subgroup, say S. As | G : C G ( i ) | is odd, S is also a Sylow 2-subgroup of G. Notice that C G ( i ) is solvable. Now, for a real primary 2 -element x G , | x G | is even and so it is a π 1 number. Thus, ( | x G | , | i G | ) = 1 . It follows from ([21], Theorem 2) that G is not a non-abelian simple group:
(2) G = O 2 ( G ) and O 2 ( G ) = 1 .
Since G is not 2-closed, by Theorem 8(1), Γ r ( O 2 ( G ) ) is disconnected. If O 2 ( G ) < G , then O 2 ( G ) is solvable by the minimality of | G | . Therefore, G is solvable since G / O 2 ( G ) is solvable, a contradiction. Thus, G = O 2 ( G ) .
Since G is not solvable, G = O 2 ( G ) is not 2-nilpotent. Hence, by Theorem 8(2), Γ r ( G / O 2 ( G ) ) is disconnected. If O 2 ( G ) is nontrivial, then, by the minimality of | G | , we get G / O 2 ( G ) is solvable, and so is G. Thus, we must have O 2 ( G ) = 1 .
(3) The final contradiction.
Let M be a maximal normal subgroup of G. If | G / M | 2 = 2 , then, by hypothesis, | M | 2 = 2 and M must be solvable (see ([12], Theorem 1.35)), and so is G, a contradiction. The remaining cases where | G / M | 2 = 4 or 2 | G / M | both contradict (2). □

6. Conclusions

By mainly considering the lengths of a portion of real classes, and using the prime graph Γ r ( G ) in particular, we obtain some information about the structure of G. We show that even this small subset of the set cs r ( G ) , with other proper conditions in occasional cases, still encodes a lot of structural information on G. This served as a background to continue the investigation of the influence of real elements and also the lengths of certain real classes on the structure of groups.
On the other hand, many authors have been inspired by looking at connections between characters and conjugacy classes, and, of course, between real characters and real classes (see [2,22,23,24]). Our works may shed some light on this research.

Author Contributions

Investigation, writing original draft: S.Y.; supervision, review and editing: X.L. Both authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (Grant No. 11871360).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alfandary, G. On graphs related to conjugacy classes of groups. Israel J. Math. 1994, 86, 211–220. [Google Scholar] [CrossRef]
  2. Dolfi, S.; Navarro, G.; Tiep, P.H. Primes dividing the degrees of the real characters. Math. Zeit. 2008, 259, 755–774. [Google Scholar] [CrossRef]
  3. Beltrán, A.; Felipe, M.J. Some class size conditions implying solvability of finite groups. J. Group Theory 2006, 9, 787–797. [Google Scholar] [CrossRef]
  4. Guralnick, R.M.; Navarro, G. Squaring a conjugacy class and cosets of normal subgroups. Proc. Amer. Math. Soc. 2016, 144, 1939–1945. [Google Scholar] [CrossRef]
  5. Bianchi, M.; Brough, J.; Camina, R.D.; Pacifici, E. On vanishing class sizes in finite groups. J. Algebra 2017, 489, 446–459. [Google Scholar] [CrossRef] [Green Version]
  6. Felipe, M.J.; Martínez-Pastor, A.; Ortiz-Sotomayor, V.M. Square-free class sizes in products of groups. J. Algebra 2017, 491, 190–206. [Google Scholar] [CrossRef] [Green Version]
  7. Guralnick, R.M.; Navarro, G.; Tiep, P.H. Real class sizes and real character degrees. Math. Proc. Camb. Philos. Soc. 2011, 150, 47–71. [Google Scholar] [CrossRef]
  8. Tong-Viet, H.P. Groups with some arithmetic conditions on real class sizes. Acta Math. Hungar. 2013, 140, 105–116. [Google Scholar] [CrossRef] [Green Version]
  9. Tong-Viet, H.P. Real class sizes. Israel J. Math. 2018, 228, 753–769. [Google Scholar] [CrossRef]
  10. Dolfi, S.; Pacifici, E.; Sanus, L. Finite groups with real conjugacy classes of prime size. Israel J. Math. 2010, 175, 179–189. [Google Scholar] [CrossRef]
  11. Guo, X.; Zhao, X.; Shum, K.P. On p-regular G-conjugacy classes and the p-structure of normal subgroups. Comm. Algebra 2009, 37, 2052–2059. [Google Scholar] [CrossRef]
  12. Isaacs, I.M. Finite Group Theory; Graduate Studies in Mathematics; AMS: Providence, RI, USA, 2008; Volume 92. [Google Scholar]
  13. Navarro, G.; Sanus, L.; Tong-Viet, H.P. Real characters and degrees. Israel J. Math. 2009, 171, 157–173. [Google Scholar] [CrossRef]
  14. Chen, R.; Zhao, X. A criterion for a group to have nilpotent p-complements. Monatsh. Math. 2016, 179, 221–225. [Google Scholar] [CrossRef]
  15. Beidleman, J.C.; Robinson, D.J.S. On finite groups satisfying the permutizer condition. J. Algebra 1997, 191, 686–703. [Google Scholar] [CrossRef] [Green Version]
  16. Griess, R.L. Finite groups whose involutions lie in the center. Quart. J. Math. 1978, 29, 241–247. [Google Scholar] [CrossRef]
  17. Conway, J.H.; Curtis, R.T.; Norton, S.P.; Parper, R.A.; Wilson, R.A. Atlas of Finite Groups; Oxford University Press: Eynsham, UK, 1985. [Google Scholar]
  18. Gorentein, D. Finite Groups, 2nd ed.; Chelsea Publishing Company: New York, NY, USA, 1980. [Google Scholar]
  19. Isaacs, I.M.; Navarro, G. Normal p-complements and fixed elements. Arch. Math. 2010, 95, 207–211. [Google Scholar] [CrossRef]
  20. Lu, Z.; Zhang, J. On the diameter of a graph related to p-regular conjugacy classes of finite groups. J. Algebra 2000, 231, 705–712. [Google Scholar] [CrossRef] [Green Version]
  21. Fisman, E.; Arad, Z. A proof of Szep’s conjecture on nonsimplicity of certain finite groups. J. Algebra 1987, 108, 340–354. [Google Scholar] [CrossRef] [Green Version]
  22. Liu, X. On lengths of conjugacy classes and character degrees in finite groups. Comm. Algebra 2006, 34, 1443–1449. [Google Scholar] [CrossRef]
  23. Dan, R. Finite groups with three rational conjugacy classes. Arch. Math. 2007, 110, 1–10. [Google Scholar]
  24. Robati, S.M. Real-imaginary conjugacy classes and real-imaginary irreducible characters in finite groups. Math. Notes 2018, 103, 251–258. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yang, S.; Li, X. The Lengths of Certain Real Conjugacy Classes and the Related Prime Graph. Mathematics 2021, 9, 2060. https://doi.org/10.3390/math9172060

AMA Style

Yang S, Li X. The Lengths of Certain Real Conjugacy Classes and the Related Prime Graph. Mathematics. 2021; 9(17):2060. https://doi.org/10.3390/math9172060

Chicago/Turabian Style

Yang, Siqiang, and Xianhua Li. 2021. "The Lengths of Certain Real Conjugacy Classes and the Related Prime Graph" Mathematics 9, no. 17: 2060. https://doi.org/10.3390/math9172060

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop