This paper investigates the structure of groups formed by the product of two subgroups, focusing on elements of prime power order and their indices, extending known results in group theory.
Contribution
It characterizes the structure of factorized groups where prime power order elements have prime power indices, generalizing previous results for the case when the group equals one of its subgroups.
Findings
01
Identifies structural properties of groups with prime power index elements
02
Extends known results to broader classes of elements and group factorizations
03
Provides conditions under which the group structure is constrained by element indices
Abstract
Let the group G=AB be the product of the subgroups A and B. We determine some structural properties of G when the p-elements in A∪B have prime power indices in G, for some prime p. More generally, we also consider the case that all prime power order elements in A∪B have prime power indices in G. In particular, when G=A=B we obtain as a consequence some known results.
Equations4
G=G1×G2×⋯×Gr,
G=G1×G2×⋯×Gr,
CG(Op(G)∩X)/CG(Op(G))=Op(G)×H0⊴Op(G)×H=G,
CG(Op(G)∩X)/CG(Op(G))=Op(G)×H0⊴Op(G)×H=G,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Prime power indices in factorised groups
M. J. Felipe ⋅ A. Martínez-Pastor ⋅ V. M. Ortiz-Sotomayor
The first author is supported by Proyecto Prometeo II/2015/011, Generalitat Valenciana (Spain), and the second author is supported by Proyecto MTM2014-54707-C3-1-P, Ministerio de Economía, Industria y Competitividad (Spain). The results in this paper are part of the third author’s Ph.D. thesis, and he acknowledges the predoctoral grant ACIF/2016/170, Generalitat Valenciana (Spain).
Instituto Universitario de Matemática Pura y Aplicada (IUMPA), Universitat Politècnica de València, Camino de Vera, s/n, 46022, Valencia, Spain.
Let the group G=AB be the product of the subgroups A and B. We determine some structural properties of G when the p-elements in A∪B have prime power indices in G, for some prime p. More generally, we also consider the case that all prime power order elements in A∪B have prime power indices in G. In particular, when G=A=B we obtain as a consequence some known results.
Keywords Finite groups ⋅ Products of groups ⋅ Conjugacy classes ⋅ Sylow subgroups
2010 MSC 20D10 ⋅ 20D40 ⋅ 20E45 ⋅ 20D20
1 Introduction
Along this paper all groups considered are finite. Throughout the last decades, the impact of conjugacy class sizes (also called indices) over the structure of finite groups has been highly investigated. Simultaneously, several authors have studied groups factorised as the product of two subgroups, in particular when those factors verify certain relations of permutability (see [5] for a detailed account on this subject). In this setting a main problem is how to infer structural properties from the factors to the whole group. The purpose of this paper is to present new achievements in the study of finite groups which combine both current research lines. Although the literature in this context is sparse, a first approach can be found either in [4], [11], or [13], where square-free class sizes were analysed. In this line, our concrete goal here is to obtain some structural facts about a factorised group, provided that the indices of certain prime power order elements in the factors are also prime powers.
One of the usual troubles in the framework of conjugacy classes is that, a priori, it is not guaranteed that the indices of the elements in a subgroup divide the corresponding indices in the whole group. Surprisingly, under our hypotheses, we have been able to prove that this happens for the considered elements in the factors of a factorised group (see Proposition D). We also highlight that, in our development, we do not use any permutability property between the factors, in contrast to what occurs in the three above cited papers.
The origin of our research can be located in the manuscript of Baer [3], where the main result characterises all finite groups such that every prime power order element has prime power index. In 1990, Chillag and Herzog ([9]) analysed groups all of whose conjugacy classes have prime power size. Later on, these studies were enhanced by Camina and Camina in [7]. Instead of imposing the prime power index condition on all (prime power order) elements, they restricted focus only to those elements with order a p-number for a fixed prime p. Next, in 2005, Berkovich and Kazarin ([6]) addressed also several problems about prime power indices in finite groups. In particular, in both papers [6] and [7], two alternative shorter proofs of the aforementioned Baer’s characterisation are provided.
We will use the following terminology: for a group G and an element x∈G, we call iG(x) the index of x in G, that is, iG(x)=∣G:CG(x)∣ is the size of the conjugacy class xG. For a natural number n, we denote by π(n) the set of prime divisors of n. In particular, π(G) is the set of prime divisors of the order of G. If p is a prime, then the set of all Sylow p-subgroups of G is represented by Sylp(G), and Hallπ(G) denotes the set of all Hall π-subgroups of G for a set of primes π. A group such that G=Oπ(G)×Oπ′(G) is said to be π-decomposable. Given a group G=AB which is the product of the subgroups A and B, a subgroup S is called prefactorised (with respect to this factorisation) if S=(S∩A)(S∩B) (see [2]). The remainder notation and terminology is standard in this topic, and it is taken mainly from [10]. We also refer to this book for details about classes of groups.
According to the paper of Camina and Camina [7], given a group G and a prime p∈π(G), we call G a p-Baer group if every p-element has prime power index (hereafter, the natural number 1 is a power of every prime). Moreover, if each prime power order element has prime power index, G is called a Baer group. Inspired by those definitions, we introduce the following concepts for factorised groups:
Definition**.**
Let G=AB be the product of the subgroups A and B, and let p∈π(G). We say that:
∙
G=AB is a p-Baer factorisation if iG(x) is a prime power for every p-element x∈A∪B;
∙
G=AB is a Baer factorisation if iG(x) is a prime power for all prime power order elements x∈A∪B, i.e., if it is a p-Baer factorisation for all p.
Clearly, any central product of two (p-)Baer groups provides a (p-)Baer factorisation.
Our first outcome is to determine structural information of a finite group G which has a p-Baer factorisation:
Theorem A**.**
Let G=AB be a p-Baer factorisation, and let P∈Sylp(G). Then:
(1) G/CG(Op(G)) is p-decomposable.
(2) Both PF(G) and POp′(G) are normal in G. In particular, G is p-soluble of p-length 1.
(3) The Sylow p-subgroup of G/F(G) is abelian.
(4) P is abelian if and only if Op(G) so is.
(5) If P=(P∩A)(P∩B) and P∩XCG(Op(G)) for some X∈{A,B}, then P∩X centralises every Hall p′-subgroup of G.
(6) If the Sylow p-subgroups of A and B are non-abelian, then G is p-decomposable.
Besides, we get additional information based on the primes appearing as indices of the p-elements in the factors of a p-Baer factorisation:
Theorem B**.**
Let G=AB be a p-Baer factorisation, and let P∈Sylp(G). Then there exist unique primes q and r such that iG(x) is a q-number for every p-element x∈A, and iG(y) is an r-number for every p-element y∈B, respectively. (Eventually p∈{q,r} or q=r.)
Moreover, P⩽CG(O{q,r}′(F(G))), and POq(G)Or(G) is normal in G. Further:
(1) If q=r=p, then G is p-decomposable.
(2) If p∈/{q,r}, then P is abelian.
In the particular case when G=A=B in the above result and Theorem A (2), we partially recover [7, Theorem A] due to Camina and Camina (see Section 3, Corollary 3.8).
Afterwards, we impose the prime power index condition on all prime power order elements in the factors (that is, we consider groups with a Baer factorisation). We start proving the main theorem of Baer’s paper [3] from our results on p-Baer factorisations when G=A=B (see Theorem 4.1).
Then our first result for a non-trivial Baer factorisation is the next consequence of Theorem A:
Corollary C**.**
If G=AB is a Baer factorisation, then:
(1) G/F(G) is abelian.
(2) G has abelian Sylow subgroups (that is, G is an A-group) if and only if F(G) is abelian.
(3) Set σ:={p∈π(G)∣Ap∈Sylp(A) and Bp∈Sylp(B) are non-abelian}. Then G=Oσ(G)×Oσ′(G) with Oσ(G) nilpotent.
(4) If all Sylow subgroups of A and B are non-abelian, then G is nilpotent.
It is worthwhile to wonder whether the factors of a Baer factorisation are Baer groups. We have obtained that the answer is positive, in relation to the above comments on the divisibility of the indices:
Proposition D**.**
Let G=AB be a Baer factorisation. Let x∈X be a prime power order element, where X∈{A,B}. If iG(x) is a q-number for some prime q, then iX(x) is also a q-number. In particular, it follows that A and B are Baer groups.
Consequently, the structure of A and B in a Baer factorisation G=AB is well-known. Nevertheless, we cannot expect to get an analogous characterisation as Baer’s one for Baer factorisations, even for direct products G=A×B (see Example 2 (i)).
At best, some arithmetical and structural information about Baer factorisations arises locally, i.e., prime by prime:
Theorem E**.**
Let G=AB be a Baer factorisation. For a prime p, and given P∈Sylp(G):
(1) If P is not abelian, then ∣G:CG(P)∣ is a {p,q}-number, for a prime q. (Eventually, p=q.)
(2) If P is abelian, then ∣G:CG(P)∣ is a {q,r}-number, for some primes q and r, both distinct from p. (Eventually q=r.)
Further, G/CG(Op(G)) is p-decomposable with abelian p-complement, and the p-complement has order divisible by at most two primes.
Finally, we have attained a characterisation of Baer factorisations through the indices of the centralisers of the Sylow subgroups of the factors:
Theorem F**.**
Let G=AB be the product of the subgroups A and B. Then this is a Baer factorisation if and only if ∣G:CG(Ap)∣ and ∣G:CG(Bp)∣ are prime powers, for Ap∈Sylp(A) and Bp∈Sylp(B), and for every prime p.
In Section 3 we prove Theorems A and B, which refer to prime power indices of p-elements, for a fixed prime p. The remaining stated results, which consider prime power order elements (for all primes), are proved in Section 4. We illustrate the scope of our research with some examples.
2 Preliminary results
We will use the following elementary properties frequently, sometimes without further reference.
Lemma 2.1**.**
Let N be a normal subgroup of a group G, and let p be a prime. Then:
(a) iN(x) divides iG(x), for any x∈N.
(b) iG/N(xN) divides iG(x), for any x∈G.
(c) If xN is a p-element of G/N, then there exists a p-element x1∈G such that xN=x1N.
The next result about Sylow subgroups of factorised groups will be useful along the paper. It is a convenient reformulation of [2, 1.3.3].
Lemma 2.2**.**
[2, 1.3.3]*
Let G=AB be the product of the subgroups A and B. Then for each p∈π(G) there exists P∈Sylp(G) such that P=(P∩A)(P∩B), with P∩A∈Sylp(A) and P∩B∈Sylp(B).*
Remark 1**.**
We call attention to some facts on Sylow subgroups of factorised groups which will be used sometimes with no citation. Let G=AB be the product of the subgroups A and B, and let p be a prime.
(1) Consider a Sylow p-subgroup P=(P∩A)(P∩B) of G such that P∩A∈Sylp(A) and P∩B∈Sylp(B). Then imposing arithmetical conditions on the indices of the p-elements in A∪B is equivalent to impose them on the indices of the elements in (P∩A)∪(P∩B), because of the conjugacy of Sylow p-subgroups.
(2) There exist easy examples which show that not every prefactorised Sylow p-subgroup P=(P∩A)(P∩B) verifies that P∩A∈Sylp(A) and P∩B∈Sylp(B).
(3) In general, Op(G) does not need to be prefactorised. However, if P=(P∩A)(P∩B)∈Sylp(G) with either P∩A⩽F(G) or P∩B⩽F(G), then by the Dedekind law we get that in this case Op(G) is prefactorised.
The following result is due to Wielandt.
Lemma 2.3**.**
[3, Lemma 6]*
Let G be a finite group and p∈π(G). If x∈G is a p-element and iG(x) is a p-number, then x∈Op(G).*
In [7], Camina and Camina proved the next proposition, which extends the above lemma and a well-known result of Burnside about the non-simplicity of groups with a conjugacy class of prime power size.
Let G be a finite group, and let p be a prime. Suppose that the p-elements x,y∈G∖Z(G) are such that iG(x) and iG(y) are powers of distinct primes, and that iG(xy) is also a power of a prime. Then ⟨x,y⟩G⩽Op(G) and iG(xy)=max{iG(x),iG(y)} is a power of p, so a Sylow p-subgroup of G is non-abelian.*
3 Groups with a p-Baer factorisation
In this section we will prove Theorems A and B via a series of results. Firstly, we show two facts about p-decomposability in p-Baer factorisations.
Lemma 3.1**.**
Let G=AB be the product of the subgroups A and B, and let p be a prime. Then iG(x) is a p-number for each p-element x∈A∪B if and only if G is p-decomposable.
Proof. Only the necessity of the condition is in doubt. Let P=(P∩A)(P∩B)∈Sylp(G), which exists by virtue of Lemma 2.2. The hypotheses and Lemma 2.3 lead to x∈Op(G), for every x∈(P∩A)∪(P∩B). It follows that P is normal in G and so G=Op(G)H, with H a Hall p′-subgroup of G.
It remains only to prove that [H,Op(G)]=1. We may assume Op(G)=1, so there exists a minimal normal subgroup N of G such that N⩽Op(G). Since the class of p-decomposable groups is a saturated formation and the hypotheses hold for quotients of G, it follows by induction on ∣G∣ that N is the unique minimal normal subgroup of G and N=F(G)=CG(N)=Op(G) (see [10, A - 15.2, 15.8]). Consequently, since each element in (Op(G)∩A)∪(Op(G)∩B) has index a p-number and Op(G) is abelian, it follows that all of them are central in G. This fact yields Op(G)=(Op(G)∩A)(Op(G)∩B)⩽Z(G) and the claim is proved.
∎
Corollary 3.2**.**
Let G=AB be a p-Baer factorisation. Then G/CG(Op(G)) is p-decomposable.
Proof. We can assume 1=Op(G)Z(G). Denote G:=G/CG(Op(G)). If G is a p′-group the result follows, so let 1=x∈A∪B be a p-element. Then we can consider a p-element x∈A∪B such that x=xCG(Op(G)), and iG(x) is a prime power. But since x∈/CG(Op(G)), it follows that iG(x) is a power of p, and iG(x) so is. Finally, the previous lemma applies.
∎
The lemma below provides the proof of Theorem A (2).
Lemma 3.3**.**
Let G=AB be a p-Baer factorisation, and let P∈Sylp(G). Then:
(a) PF(G) is normal in G.
(b) POp′(G) is normal in G. In particular, G is p-soluble of p-length 1.
Proof. (a) Let P=(P∩A)(P∩B)∈Sylp(G), which exists by virtue of Lemma 2.2. By Proposition 2.4 and our assumptions, we have x∈F2(G) for every element x∈(P∩A)∪(P∩B). Therefore P⩽F2(G), so PF(G)/F(G)=Op(G/F(G)) and PF(G) is normal in G.
(b) We proceed by induction on ∣G∣. If N:=Op′(G)=1, then the result follows by (a). Hence we may assume N=1. Since G:=G/N inherits the hypotheses by Lemma 2.1, then POp′(G)=PN/N is normal in G/N, and the claim is proved.
∎
Note that the existence of Hall p′-subgroups in p-Baer factorisations is guaranteed as a consequence of the p-solubility of such groups. Indeed, if G=AB is a Baer factorisation (i.e., it is p-Baer for all p), then it follows that G/F(G) is nilpotent. This fact will be strengthened later (see Proposition C).
Proposition 3.4**.**
Let G=AB be a p-Baer factorisation, and let P=(P∩A)(P∩B)∈Sylp(G).
(a) If for some X∈{A,B} it holds that P∩XF(G), then P∩X⩽CG(Op(G)), P∩X is abelian, and [P∩A,P∩B]=1.
(b) If both P∩AF(G) and P∩BF(G), then P is abelian.
(c) The Sylow p-subgroup of G/F(G) is abelian.
(d) P is abelian if and only if Op(G) so is.
(e) If P∩XCG(Op(G)) for some X∈{A,B}, then P∩X⩽CG(H) for every H∈Hallp′(G). In particular, this holds when P∩X is non-abelian.
Proof. (a) Let x∈(P∩X)∖Op(G). Then iG(x) is a power of a prime q=p by Lemma 2.3, so x∈CG(Op(G)). Now let y∈Op(G)∩X. Then xy∈(P∩X)∖Op(G), so xy∈CG(Op(G)) and y∈CG(Op(G)). It follows P∩X∈CG(Op(G)) and the first claim is proved.
Now we show that P∩X is abelian. By Lemma 3.3 (b), we get Op′(G)=1, and for all g∈G it holds that Pg⩽(POp′(G))g=POp′(G), so there exists tg∈Op′(G) such that Pg=Ptg. Let x∈(P∩X)∖Op(G). By the assumptions and Lemma 2.3, we have that iG(x) is a power of a prime r=p, so there exists Pg=Ptg⩽CG(x). Hence x∈CG(P)Op′(G)⩽CG(P∩X)Op′(G). On the other hand, if x∈Op(G)∩X, then x∈CG(P∩X) by the first paragraph. It follows P∩X⩽CG(P∩X)Op′(G), and [P∩X,P∩X]⩽P∩[P∩X,Op′(G)][P∩X,CG(P∩X)]⩽P∩Op′(G)=1.
Finally, we prove that [P∩A,P∩B]=1. Take for instance X=A. If P∩B⩽F(G), then the claim is clear since P∩A⩽CG(Op(G)). We may assume P∩BF(G), and so Op(G)⩽CG(P∩B). Moreover, as in the previous paragraph, if x∈(P∩A)∖Op(G), then x∈CG(P∩B)Op′(G). Hence P∩A⩽CG(P∩B)Op′(G), and [P∩A,P∩B]=1.
(b) It is a direct consequence of (a).
(c) The uniqueness of the Sylow p-subgroup of G/F(G) follows from Lemma 3.3 (a). If both P∩AF(G) and P∩BF(G), then P is abelian by (b), and so is PF(G)/F(G). Finally, if for instance P∩AF(G) and P∩B⩽F(G), then P∩A is abelian by (a) and PF(G)/F(G)=(P∩A)F(G)/F(G) is also abelian.
(d) Let show that if P is not abelian, then Op(G) cannot be abelian. Applying (b), we can assume for instance that P∩A⩽F(G) and P∩BF(G). Then by (a) we have that P∩B is abelian and [P∩A,P∩B]=1. Therefore P∩A=Op(G)∩A cannot be abelian, and so Op(G) is not abelian either.
(e) By (a) it holds that P∩X=Op(G)∩X. Let x∈(P∩X)∖CG(Op(G)). Then Op(G)CG(x), and iG(x) is a power of p. Since x∈Op(G), then CG(Op(G))⩽CG(x), so ∣G/CG(Op(G)):CG(x)/CG(Op(G))∣=∣G:CG(x)∣, which is a power of p. By Corollary 3.2, G/CG(Op(G)) is p-decomposable, and its unique Hall p′-subgroup is contained in CG(x)/CG(Op(G)). Thus if H∈Hallp′(G), we deduce Hg⩽CG(x) for every g∈G, and for all x∈(P∩X)∖CG(Op(G)). On the other hand, given y∈P∩X∩CG(Op(G)), if x∈(P∩X)∖CG(Op(G)), then xy∈(P∩X)∖CG(Op(G)), so Hg⩽CG(xy)∩CG(x)=CG(x)∩CG(y)⩽CG(y). Therefore Hg⩽CG(P∩X) for all g∈G, and the first claim follows.
Finally, if P∩X is non-abelian, then by (a) P∩X⩽Op(G) and so P∩XCG(Op(G)).
∎
Corollary 3.5**.**
Let G=AB be a p-Baer factorisation. If the Sylow p-subgroups of A and B are non-abelian, then G is p-decomposable.
Proof. It is sufficient to take P=(P∩A)(P∩B)∈Sylp(G) with P∩A∈Sylp(A) and P∩B∈Sylp(B) and to apply the last statement of the above proposition.
∎
If we combine the previous results, we get the proof of Theorem A.
Proof of Theorem A.
The statement (1) is exactly Corollary 3.2. Lemma 3.3 yields (2), whilst claims (3), (4) and (5) are Proposition 3.4 (c), (d) and (e), respectively. Corollary 3.5 gives the last assertion.
∎
In the remainder of the section, we focus on proving Theorem B.
Lemma 3.6**.**
Let G=AB be a p-Baer factorisation. Let P=(P∩A)(P∩B)∈Sylp(G). If for some X∈{A,B} it holds PCG(Op(G)∩X), then ∣G:CG(P∩X)∣ is a p-number.
Proof. If P∩XF(G), then by Proposition 3.4 (a) we get a contradiction. Therefore P∩X=Op(G)∩X. Since PCG(Op(G)∩X), we have that either P∩X is non-abelian or [P∩X,P∩Y]=1 where {A,B}={X,Y}. In the last case, P∩Y⩽F(G) by Proposition 3.4 (a), and therefore P∩XCG(Op(G)). Thus we can apply in both cases Proposition 3.4 (e) to deduce P∩X⩽CG(H), for every H∈Hallp′(G). It follows that ∣G:CG(P∩X)∣ is a power of p.
∎
Proposition 3.7**.**
Let G=AB be a p-Baer factorisation, and let P∈Sylp(G). Then:
(a) There exist unique primes q and r such that iG(x) is a q-number for every p-element x∈A, and iG(y) is an r-number for every p-element y∈B, respectively. (Eventually p∈{q,r} or q=r.)
(b) P⩽CG(O{q,r}′(F(G))) and POq(G)Or(G) is normal in G.
(c) If p∈/{q,r}, then P is abelian.
Proof. By Lemma 2.2 we can assume that P=(P∩A)(P∩B) where P∩A∈Sylp(A) and P∩B∈Sylp(B):
(a) We argue for instance with A. If the result is false, then there exist p-elements a1,a2∈A such that 1=iG(a1) and 1=iG(a2) are relatively prime. By the conjugacy of the Sylow p-subgroups in A, we may assume a1,a2∈P∩A, and iG(a1a2) is a prime power. By Lemma 2.5, iG(a1a2)=max{iG(a1),iG(a2)} is a p-number, and a1,a2∈Op(G)∩A. Let assume that max{iG(a1),iG(a2)}=iG(a1). Hence, since a1 is not central, we get PCG(Op(G)∩A), and Lemma 3.6 leads to a2∈Z(G), the final contradiction.
(b) By (a) O{q,r}′(F(G))⩽CG(P∩A)∩CG(P∩B)=CG(P). Applying Lemma 3.3 (a), we deduce that POq(G)Or(G) is normal in G.
(c) Let suppose that P is not abelian. Then by Proposition 3.4 (d), P∩XCG(Op(G)) for some X∈{A,B}. Finally, we deduce from Proposition 3.4 (e) that ∣G:CG(P∩X)∣ is a p-number, and so p∈{q,r}.
∎
Example 1**.**
The primes q and r in the previous result may not be equal. Let G=A×B be the direct product of a symmetric groups A=Σ3 of three letters and a dihedral group B=D10 of order ten, and consider the prime p=2. Clearly, that factorisation is 2-Baer. Nevertheless, the 2-elements x∈A have iG(x)=3 and the 2-elements y∈B have iG(y)=5. Moreover, if P∈Syl2(G), neither PO3(G) nor PO5(G) are normal in G.
Proof of Theorem B.
The existence of the unique primes q and r follows from Proposition 3.7 (a). Then, the statement (1) is Lemma 3.1, and the remaining assertions follow by Proposition 3.7 (b) and (c).
∎
If we take the trivial factorisation G=A=B in Theorems A (2) and B, we partially recover the main theorem of Camina and Camina in [7] about p-Baer groups.
(b) there is a unique prime q such that each p-element has q-power index.
Further, let Q∈Sylq(G), then
(c) if p=q, P is a direct factor of G, or
(d) if p=q, P is abelian, and POq(G) is normal in G.
Finally, we emphasize the relations between the primes appearing as indices of the p-elements in the factors of a p-Baer factorisation.
Lemma 3.9**.**
Let G=AB be a p-Baer factorisation. Let assume that there exist non-central p-elements a∈A and b∈B, so that iG(a) is a q-number and iG(b) is an r-number, for some primes q and r.
Let assume that q=p and the factorisation is also q-Baer. Then:
(a) If the q-elements in A∪B have indices an s-power, then s∈{p,r}.
(b) Moreover, if q=r and s is the prime in (a), then s=p and a Hall {p,q}-subgroup of G is normal with abelian Sylow subgroups.
Proof. (a) Take P=(P∩A)(P∩B)∈Sylp(G) such that P∩A∈Sylp(A) and P∩B∈Sylp(B). We may assume that a∈P∩A and b∈P∩B. Suppose that s=p, and we claim that s=r. If s=q, then by Lemma 3.1 we obtain that G is q-decomposable, which contradicts that 1=iG(a) is a q-number and a is a q′-element. Hence, s∈/{p,q}. Now if we assume also that s=r, then π(iG(z))∩{p,q,r}=∅ for any q-element z∈A∪B. Since POq(G)Or(G) is a normal {p,q,r}-subgroup of G by Proposition 3.7 (b), given Q=(Q∩A)(Q∩B)∈Sylq(G) it follows P∩A⩽POq(G)Or(G)⩽CG(Q∩A)∩CG(Q∩B)=CG(Q). But this contradicts again that iG(a)=1 is a q-number.
(b) By (a), we deduce s∈{p,r}. As above, since q=r we get s=p because of Lemma 3.1. As a consequence, Proposition 3.7 (b) yields that POq(G) and QOp(G) are normal in G, for P∈Sylp(G) and Q∈Sylq(G). Hence PQOq(G)Op(G)=PQ⊴G, and it is a Hall {p,q}-subgroup of G. The abelianity of the Sylow subgroups of PQ follows from Proposition 3.7 (c).
∎
If we choose the trivial factorisation G=A=B in the above result, we recover:
Corollary 3.10**.**
[7, Lemma 5]*
Let G be a p-Baer group and a q-Baer group for primes p=q. Suppose that all p-elements have q-power index. Then all q-elements have p-power index.*
4 Groups with a Baer factorisation
In the sequel, the prime power index condition is imposed on all prime power order elements in the factors, that is, we consider Baer factorisations.
We start this section by proving Baer’s theorem ([3]) as a consequence of the results obtained in Section 3, when we consider the trivial factorisation G=A=B.
Let G be a finite group. Each element x∈G of prime power order has prime power index if and only if*
[TABLE]
where Gi and Gj have relatively prime orders for i=j, and if Gi is not of prime order, then ∣π(Gi)∣=2 and its Sylow subgroups are abelian.
Proof. The converse is clear. Let P∈Sylp(G). If P is not abelian, then P is a direct factor of G by Corollary 3.5. Therefore, all non-abelian Sylow subgroups of G are direct factors of it.
Now suppose that P is abelian and non-central in G. Hence there is a p-element x∈G such that 1=iG(x) is a q-number, for some prime q=p. Necessarily, by Lemma 3.1, there is a q-element y∈G such that 1=iG(y) is a q′-number. For some Q∈Sylq(G), Lemma 3.9 (b) yields that PQ is a normal Hall {p,q}-subgroup of G, and Q is also abelian.
Take a prime r∈/{p,q} and R∈Sylr(G). We may assume that R is abelian and non-central. Thus, for each element z∈R, we deduce π(iG(z))∩{p,q}=∅ by virtue of Lemma 3.9 (b) again. Consequently PQ⩽CG(R). Since this is valid for all primes r∈/{p,q}, the {p,q}-decomposability of G follows. The result is now established.
∎
Remark 2**.**
The results stated in Section 3 can be also used to give an alternative proof of [9, Theorem 2] due to Chillag and Herzog, avoiding Theorem 4.1.
Proof of Corollary C.
We deduce the first two statements from a direct application of Theorem A (3) and (4), respectively. The final two assertions follow from Theorem A (6).
∎
Next we are proving that the factors of a Baer factorisation are Baer groups. This is because in such a factorisation G=AB, the prime power index condition is inherited by both factors, even if A and B are not subnormal in G. This is no longer true for other arithmetical conditions on the indices (see for instance [11] for the square-free property). In particular, as pointed out in [6], subgroups of Baer groups are also Baer groups. It is an open question whether the factors of a p-Baer factorisation are p-Baer groups. Nevertheless, it might happen for such a group that the indices in a factor and in the whole group are powers of distinct primes (see Final examples (2)).
Proof of Proposition D.
Let P=(P∩A)(P∩B)∈Sylp(G) such that P∩A∈Sylp(A) and P∩B∈Sylp(B), for some prime p. Let X∈{A,B} and take x∈(P∩X)∖Z(G) such that iG(x) is a q-number. If q=p, then Proposition 3.7 (a) and Lemma 2.3 yields P∩X=Op(G)∩X. Moreover, PCG(Op(G)∩X) because 1=iG(x) is a p-power. Thus, by virtue of Lemma 3.6, we deduce that ∣G:CG(P∩X)∣ is a p-power. As P∩X is normal in X, then ∣X:CX(P∩X)∣=∣XCG(P∩X):CG(P∩X)∣ divides ∣G:CG(P∩X)∣. Therefore iX(x) divides the p-number ∣G:CG(P∩X)∣.
Hence we may assume q=p. Suppose Oq(G)=1. Note that the quotient G:=G/Oq(G) inherits the hypotheses. It follows by induction that iX(x)=X:CX(x) is a q-number, because iG(x) divides iG(x). However, since q=p, applying [12, 3.2.8] and the isomorphism X≅X/(X∩Oq(G)) we deduce CX(x)=CX(x). Thus X:CX(x)⋅∣(X∩Oq(G)):(CX(x)∩Oq(G))∣=∣X:CX(x)∣, which is also a q-power, and the result is proved in this case.
Now we assume F(G)=Oq′(F(G)). Let M:=XF(G) which is normal in G by Corollary C (1). Then M=X(M∩Y) with {X,Y}={A,B}, and M verifies the hypotheses. If M<G, by induction we get that iX(x) is a power of the same prime that divides iM(x), which divides iG(x). Consequently we may assume G=M=XOq′(F(G)). Let Gq′∈Hallq′(G). Then Gq′=Oq′(F(G))(X∩Gq′). Moreover, ∣G:Gq′∣=∣XOq′(F(G)):(X∩Gq′)Oq′(F(G))∣=∣X:X∩Gq′∣. Therefore, for each Gq′∈Hallq′(G), we have that X∩Gq′ is also a Hall q′-subgroup of X. Since iG(x) is a q-number, there exists some Hall q′-subgroup of G that centralises x, and so there exists a Hall q′-subgroup of X that centralises x, and we are done.
∎
Example 2**.**
(i) In contrast to Baer’s theorem (Theorem 4.1), and in spite of the above proposition, in a Baer factorisation G=AB it is not guaranteed that G is a direct product of proper Hall subgroups for pairwise disjoint sets of primes, even for direct products: To see this consider A=C3×[C7]C2×[C11]C5 and B=C5×[C7]C3×[C11]C2. Then G=A×B is a Baer factorisation, but there are no pairwise coprime proper direct factors of G.
(ii) We highlight that there are Baer factorisations which are not just a central product of Baer groups: Let G=H×K be the direct product of a symmetric group H=Σ3 and a dihedral group K=D10. Let A be a Sylow 2-subgroup of K, and let B be the direct product of H and the Sylow 5-subgroup of K. Then G=AB is a Baer factorisation. Note that there is a 2-element g∈G∖(A∪B) such that iG(g)=15, so G is not a Baer group.
Now, as a step to prove Theorem E, an application of Lemma 3.1 gives the next result.
Corollary 4.2**.**
Let G=AB be the product of the subgroups A and B, and let p be a prime. Then iG(x) is a p-number for each prime power order element x∈A∪B if and only if G=Op(G)×Op′(G), and Op′(G) is abelian.
Proof. The sufficient condition is straightforward. The p-decomposability of G follows directly from Lemma 3.1. Finally, if we take a prime q=p and a prefactorised Sylow q-subgroup Q=(Q∩A)(Q∩B), then iOp′(G)(x)=1 for each element x∈(Q∩A)∪(Q∩B). Therefore Q⩽Z(G) for every q=p, and the result follows.
∎
Furthermore, from the previous corollary we get:
Corollary 4.3**.**
Let G=AB be the Baer factorisation. Then for each prime p we have that G/CG(Op(G)) is p-decomposable with abelian p-complement.
In the remainder of the section, we focus on proving Theorem E.
Proposition 4.4**.**
Let G=AB be a Baer factorisation, and let P∈Sylp(G). If P⩽CG(Op(G)∩X) for some X∈{A,B}, then CG(Op(G)∩X) is normal in G and G/CG(Op(G)∩X) is an abelian q-group, for a prime q=p.
Proof. We denote G:=G/CG(Op(G)) and we have G=Op(G)×H by Corollary 4.3, where H∈Hallp′(G) is abelian for any H∈Hallp′(G). Since PCG(Op(G))⩽CG(Op(G)∩X), we get by the Dedekind law
[TABLE]
where H0:=H∩CG(Op(G)∩X), and thus CG(Op(G)∩X) is normal in G.
Set G:=G/CG(Op(G)∩X). Then G is a p′-group, and since it is isomorphic to a quotient of G, it is abelian. We may affirm that there exists an element x∈(Op(G)∩X)∖Z(G). Then iG(x) is a q-number for some prime q=p (actually, this holds for every element in Op(G)∩X). Moreover, ∣G:CG(x)∣=∣G:CG(x)∣ so q divides ∣G∣. Let suppose that there exists another prime r=q such that r divides ∣G∣. Since ∣G:CG(x)∣=∣G:CG(x)∣, it follows that the unique Sylow r-subgroup R of G is contained in CG(x). Hence R⩽CG(x) for every x∈Op(G)∩X, so R⩽CG(Op(G)∩X), which contradicts that r divides ∣G∣.
∎
This last proposition is not longer true for p-Baer factorisations, as Final examples (1) shows. The next result is the last step to prove Theorem E.
Proposition 4.5**.**
Let G=AB be a Baer factorisation, and let P=(P∩A)(P∩B)∈Sylp(G). Let assume that P∩XF(G) for some X∈{A,B}. Then:
(a) P∩X⩽Z(P).
(b) There exists a unique prime q=p such that P∩XCG(Oq(G)).
(c) ∣G:CG(P∩X)∣ is a power of the prime q in statement (b).
If, moreover, P∩YF(G) where {X,Y}={A,B}, then:
(d) P is abelian and ∣G:CG(P)∣ is a {q,r}-number, with p∈/{q,r}, q is the prime in (b), and r is the unique prime such that P∩YCG(Or(G)). (Eventually q=r.)
(b) By (a), for every x∈P∩X it hold that iG(x) is a q-power, for a fixed prime q=p. Then Oq′(F(G))⩽CG(P∩X). Finally, Oq(G)CG(P∩X) since otherwise P∩X⩽CG(F(G))⩽F(G), a contradiction.
(c) Take T∈Hall{p,q}′(G) such that PT is a q-complement of G. As G/F(G) is abelian by Proposition C (a), then L:=POq(G)T is normal in G. Consequently, for every x∈P∩X we obtain that iL(x) is a q-power, and there exists g∈L such that Tg centralises x, (actually by (a) we may assume g∈Oq(G)). Set K:=(P∩X)Oq(G). Hence K⊆∪g∈K(CK(T)Oq(G))g⊆K. It follows that K=CK(T)Oq(G) and [P∩X,T]⩽[K,T]=[CK(T)Oq(G),T]=[Oq(G),T]⩽Oq(G). But [P∩X,T]⩽PT, which is a q′-group. Then [P∩X,T]=1, and P also centralises P∩X by (a). The claim is now proved.
(d) P is abelian by (a). Moreover, by (c), ∣G:CG(P∩A)∣ is a q-number and ∣G:CG(P∩B)∣ is an r-number for some primes q and r. Note that CG(P)=CG(P∩A)∩CG(P∩B). If q=r, then G=CG(P∩A)CG(P∩B), and ∣G:CG(P)∣=∣G:CG(P∩A)∣⋅∣G:CG(P∩B)∣ is a {q,r}-number. Therefore we may assume that q=r, and so every p-element in A∪B has q-power index. Arguing analogously as in (c), for a T∈Hall{p,q}′(G) such that PT is a q-complement, we deduce that POq(G)=(P∩A)(P∩B)Oq(G)⩽CG(T)Oq(G), and [P,T]⩽PT∩Oq(G)=1. Then T centralises P, and P is abelian, so ∣G:CG(P)∣ is a q-power. The result is now established.
∎
Proof of Theorem E.
(1) Let P=(P∩A)(P∩B)∈Sylp(G) non-abelian. If P=Op(G), then either PCG(Op(G)∩A) or PCG(Op(G)∩B). Assume for instance that PCG(Op(G)∩A). Then by Lemma 3.6, we get that ∣G:CG(P∩A)∣ is a p-number. Moreover, if PCG(Op(G)∩B), then ∣G:CG(P∩B)∣ is also a p-number, and each element in (P∩A)∪(P∩B) has index a p-number. Therefore G is p-decomposable by virtue of Lemma 3.1, and ∣G:CG(P)∣ is clearly a p-power. On the other hand, if P⩽CG(Op(G)∩B), Proposition 4.4 yields that CG(Op(G)∩B) is normal in G and the quotient G/CG(Op(G)∩B) is an abelian q-group (q=p). We deduce G=CG(P∩A)CG(P∩B), and since CG(P)=CG(P∩A)∩CG(P∩B), then ∣G:CG(P)∣=∣G:CG(P∩A)∣⋅∣G:CG(P∩B)∣ is a {p,q}-number.
Now we assume PF(G). It cannot happen that both P∩AF(G) and P∩BF(G) by Proposition 4.5 (a). We may assume for instance that P∩AF(G) and P∩B⩽F(G). By Proposition 4.5 (a) and (c), we get that P∩A⩽Z(P) and ∣G:CG(P∩A)∣ is a q-number, where q=p. On the other hand, as P is not abelian, PCG(P∩B), so Lemma 3.6 yields ∣G:CG(P∩B)∣ is a p-number. Then ∣G:CG(P)∣ is a {p,q}-number.
(2) Consider that P=(P∩A)(P∩B)∈Sylp(G) is abelian. If P∩AF(G) and P∩BF(G) then the claim follows from Proposition 4.5 (d). Assume that P∩AF(G) and P∩B⩽F(G), so ∣G:CG(P∩A)∣ is a q-number with q=p by Proposition 4.5 (c). Since P⩽CG(Op(G)∩B), we deduce from Proposition 4.4 that CG(P∩B) is normal in G with index an r-number (r=p). If q=r, then G=CG(P∩A)CG(P∩B) and the claim follows. If q=r, we obtain that ∣CG(P∩A):CG(P)∣=∣CG(P∩A)CG(P∩B):CG(P∩B)∣ divides the q-number ∣G:CG(P∩B)∣. Hence the index ∣G:CG(P)∣ is a q-power.
Now suppose P=Op(G). Note that, by Proposition 4.4, both CG(Op(G)∩A) and CG(Op(G)∩B) are normal in G with indices a q-number and an r-number, respectively. The case q=r is again clear. If q=r, the above reasoning on the index of ∣CG(P∩A):CG(P)∣ shows that ∣G:CG(P)∣ is a q-power. Finally, from (1), (2) and Corollary 4.3 we conclude we last assertion of the theorem.
∎
Now we end by proving Theorem F, as a consequence of the previous result.
Proof of Theorem F.
The converse direction is trivial. Assume that G=AB is a Baer factorisation, and let P=(P∩A)(P∩B)∈Sylp(G) such that P∩A∈Sylp(A) and P∩B∈Sylp(B). Let X∈{A,B}. We claim that ∣G:CG(P∩X)∣ is a prime power. Now we distinguish two cases: either P∩XF(G) or P∩X=Op(G)∩X. In the first case, the claim follows from Proposition 4.5 (c). In the second case, if P⩽CG(Op(G)∩X), then we apply Proposition 4.4, and if PCG(Op(G)∩X), then Lemma 3.6 follows.
∎
Final examples**.**
Some of the results stated in this section fail when the hypotheses are weakened to p-Baer factorisations, as the following examples show:
(1) Proposition 4.4 and Theorem F do not hold for p-Baer factorisations: Let G=AB be the semidirect product of a non-abelian group B of order 21 acting on an elementary abelian group A of order 8, in such a way that the subgroup of order 7 permutes the involutions transitively (this group appears in [8]). Then iG(g)=7 for every 2-element g∈G (i.e., G is 2-Baer), and the unique abelian Sylow 2-subgroup P of G is equal to A, but ∣G:CG(P)∣=∣G:CG(O2(G)∩A)∣=21.
(2) Proposition D does not hold either for p-Baer factorisations: Let G be the group in (1). Then there is a subgroup H of G of order 24 and a subgroup K of order 7 such that G=HK is also a 2-Baer factorisation, and there exists a 2-element x∈H such that iH(x)=3, which clearly is not a 7-number.
(3) Proposition 4.5 (c) is neither true for p-Baer factorisations: Let now Q be a cyclic group of order 7. Consider the regular wreath product T=QwrG with G the group in (1), and denote by Q♮ the basis group (we point out that this group appears in [6]). Then the factorisation T=Q♮G is 2-Baer. Let P be the Sylow 2-subgroup of G, so P∈Syl2(T). Then P=P∩GF(T), but the index ∣T:CT(P∩G)∣ is divisible by 3 and 7.
Bibliography13
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1]
2[2] B. Amberg, S. Franciosi and F. de Giovanni: Products of groups. Oxford University Press, New York, 1992.
3[3] R. Baer: Group elements of prime power index. Trans. Amer. Math. Soc. 75 (1953) 20–47.
4[4] A. Ballester-Bolinches, J. Cossey and Y. Li: Mutually permutable products and conjugacy classes. Monatsh. Math. 170 (2012) 305–310.
5[5] A. Ballester-Bolinches, R. Esteban-Romero and M. Asaad: Products of finite groups. Vol. 53 of de Gruyter Expositions in Mathematics, Berlin, 2010.
6[6] Y. Berkovich and L. S. Kazarin: Indices of elements and normal structure of finite groups. J. Algebra 283 (2005) 564–583.
7[7] A. R. Camina and R. D. Camina: Implications of conjugacy class size. J. Group Theory 1 3 (1998) 257–269.
8[8] A. R. Camina, P. Shumyatsky and C. Sica: On elements of prime-power index in finite groups. J. Algebra 323 (2010) 522–525.