-nilpotency criteria for some verbal subgroups
Abstract.
Let be a finite group, let be a prime and let be a group-word. We say that satisfies if the prime divides the order of for every -value in of -order and for every non-trivial -value in of order divisible by . With , we prove that the th term of the lower central series of is -nilpotent if and only if satisfies . In addition, if is soluble, we show that the th term of the derived series of is -nilpotent if and only if satisfies .
Key words and phrases:
-nilpotency, lower central word, derived word2010 Mathematics Subject Classification:
20D12, 20F151. Introduction
Let be a finite group and let be a prime. We say that is -nilpotent if has a normal -complement, that is, a normal subgroup of having -order and -power index in . There are well known results giving sufficient conditions for the -nilpotecy of a finite group, such as Burniside’s theorem [9, Theorem 7.4.3], and remarkable criteria like Frobenius’ normal -complement theorem [9, Theorem 7.4.5], which says that a group is -nilpotent if and only if is a -group for every -subgroup of . These results mainly deal with properties of -local subgroups and they motivated other works in the subject (see for instance [1] and [2]). In recent years, the problems of nilpotency and -nilpotency of a group have been studied from a different point of view. In an unpublished work of 2014 [6], Baumslag and Wiegold studied the nilpotency of a finite group looking at the behaviour of elements of coprime orders. Beltrán and Sáez [7] took inspiration to characterize the -nilpotency of a finite group by means of the orders of its elements:
Theorem A.
[7, Theorem A] Let be a finite group and let be a prime. Then is -nilpotent if and only if for every -element of of prime power order and for every -element of , divides .
Here denotes the order of the group element . We point out that, instead of studying the couple of elements , where is a -element of prime power order and is a non-trivial -element, one can focus on the couple , where is a -element and is a non-trivial element of order divisible by .
Corollary B.
Let be a finite group and let be a prime. Then is -nilpotent if and only if for every such that does not divide and for every such that divides , divides .
The work of Baumslag and Wiegold has been extended to the realm of group-words in a series of papers [3, 4, 5, 8, 12]. In a similar matter, the aim of this work is to generalize Theorem A obtaining a verbal version.
A group-word is any nontrivial element of a free group on free generators , that is, a product of finitely many ’s and their inverses. The elements of the commutator subgroup of are called commutator words. Let be a group-word in the variables . For any group and arbitrary , the elements of the form are called -values in . We denote by the set of all -values in . The verbal subgroup of corresponding to is the subgroup of generated by .
Definition.
Let be a group, let be a prime and let be a group-word. We say that satisfies if the prime divides , for every of -order and for every non-trivial of order divisible by .
Let be a group-word and let be a prime. If is a finite group and is -nilpotent, then Corollary B implies that satisfies . An interesting question is the following:
Question 1.
If is a finite group satisfying , is -nilpotent?
In general the answer is negative. For instance, one may consider any non-abelian simple group , say of exponent , and the word , where is a divisor of such that is prime. If is a prime dividing the order of , then satisfies , but is not -nilpotent.
Even in the case of commutator words we can find counterexamples. Indeed, if is the alternating group of degree and is the word considered in [12, Example 4.2], then consists of the identity and all products of two transpositions. In particular if then satisfies , but is a simple group and therefore not -nilpotent.
However, if we consider the group-word , Corollary B says exactly that is -nilpotent if and only if G satisfies . Actually, this situation is a particular instance of a more general result concerning the commutator word .
Given an integer , the word is defined inductively by the formulae
where , for any group elements and . Note that is the derived subgroup of and in general the subgroup of corresponds to the -th term of the lower central series of .
Our first main theorem is the following:
Theorem C.
Let be a finite group, let be an integer and let be a prime. Then is -nilpotent if and only if satisfies .
It is worth mentioning that Theorem C gives a positive answer to Question 1 for -words. Such words belong to the larger class of multilinear commutator words, which are words obtained by nesting commutators but using always different variables. For example the word is a multilinear commutator, while the Engel word is not. Hence, it is natural to ask if the answer to Question 1 remains positive if is any finite group and the word considered is any multilinear commutator word. In this direction, we provide another positive answer when belongs to the family of -words. Given an integer , the word is defined inductively by the formulae
We have and corresponds to the -th term of the derived series of . Since for , Theorem C gives an affirmative answer to Question 1 when . For with , we prove the following:
Theorem D.
Let be a finite soluble group, let be an integer and let be a prime. Then is -nilpotent if and only if satisfies .
2. Preliminaries
Let be a finite group and let be a prime. We denote by the largest normal -subgroup of and by the largest normal -subgroup of . If is -nilpotent, then the normal -complement of is unique and corresponds to the group . In particular we can write for some Sylow -subgroup of . Moreover, if is -nilpotent then contains all elements of having -order. Now, Corollary B is a direct consequence of Theorem A and basic properties of -nilpotent groups.
Proof of Corollary B.
Suppose is -nilpotent. Then it has a normal -complement . Let be such that does not divide and divides , with . Then and as . Hence divides . The other implication follows immediately from Theorem A. ∎
If is a group, we denote by the Fitting subgroup of , that is the largest normal nilpotent subgroup of , and by the -Fitting subgroup of , that is the largest normal -nilpotent subgroup of . Note that .
Lemma 2.1.
Let be a finite group and let be a prime. If then is a -group.
Proof.
We have . Since is -nilpotent, we also have for some Sylow -subgroup of . Hence is a normal -subgroup of . Thus . On the other hand, is a normal -nilpotent subgroup of , and so we conclude that . ∎
A group is said to be metanilpotent if it has a normal subgroup such that both and are nilpotent.
Lemma 2.2.
[4, Lemma 3] Let be a prime and a finite metanilpotent group. Suppose that is a -element in such that . Then .
We recall that a subset of a group is said to be commutator-closed if , and symmetric if . In [8, Lemma 2.1], it has been showed that a finite soluble group admits a commutator-closed subset such that and every element of has prime power order. From the proof, it is easy to check that such an is also symmetric. Hence we have the following.
Lemma 2.3.
Let be a finite group. If is soluble then there exists a commutator-closed and symmetric subset of such that and every element of has prime power order.
Next results give sufficient conditions for a group to be generated by certain -values of prime power order.
Lemma 2.4.
Let be a finite soluble group. Then for every the group is generated by -values of prime power order.
Proof.
By Lemma 2.3 there exists a commutator-closed and symmetric subset of such that and every element of has prime power order. Hence by [10, Lemma 3.6 item (c)] we get . Note that , and is a -value for every . Also, since is commutator-closed, we get that has prime power order. Thus, is generated by -values of prime power order. ∎
Lemma 2.5.
[4, Lemma 4] Let be a positive integer and a finite group such that . If is a prime dividing the order of , then is generated by -values of -power order for primes .
Lemma 2.6.
[8, Lemma 2.5] Let be a finite soluble group and let be a Sylow -subgroup of . Then for every the group can be generated by -values lying in .
The following relation between the subgroups and of is an immediate consequence of [10, Lemma 3.25].
Lemma 2.7.
If is a group, then for every we have .
We conclude this section with a direct application of [11, Theorem 1], which says that in almost every finite quasisimple group all elements are commutators.
Proposition 2.8.
Let be a finite quasisimple group and suppose that is a -group. Then every element of is a commutator, with the following exceptions:
-
(1)
, , and the non-central elements of that are not commutators have order ;
-
(2)
, , and the non-central elements of that are not commutators have order ;
-
(3)
, , and the non-central elements of that are not commutators have order .
3. Groups with Property
In this section is any group-word. We study the properties of groups satisfying property but being minimal such that is not -nilpotent.
Definition 3.1.
We say that a group is a minimal -exception if
-
•
satisfies ,
-
•
is not -nilpotent,
-
•
whenever is a proper subgroup of , the group is -nilpotent;
-
•
whenever is a proper quotient of satisfying , the group is -nilpotent.
Next lemma shows that property is closed with respect to forming subgroups and certain images.
Lemma 3.2.
Let be a finite group satisfying .
-
•
If is a subgroup of then satisfies .
-
•
If is a normal subgroup of of -order, then satisfies .
Proof.
If then for every we have . Thus satisfies if does.
Assume that is a normal subgroup of of -order and consider . Let be a -value of -order and let be a -value of order divisible by . Then we can assume that . Also, divides the order of and, since has -order, does not divide the order of . Thus by we deduce that divides the order of . In particular and divides the order of . This shows that satisfies property . ∎
Lemma 3.3.
If is a minimal -exception then and .
Proof.
Set . Aiming for a contradiction, suppose and consider . Then and by Lemma 3.2 the group satisfies . Since is a minimal -exception we deduce that is -nilpotent. Then where and . Set . Since , we deduce that . Also, divides and so is prime to . Finally, divides , that is a power of . We deduce that is a normal -complement of and is -nilpotent, a contradiction. Therefore we must have . The second part of the statement now follows from Lemma 2.1.
∎
Lemma 3.4.
Suppose is a minimal -exception, and is nilpotent. Then has a normal Sylow -subgroup.
Proof.
Note that satisfies by Lemma 3.2. Since is a minimal -exception and we deduce that is -nilpotent. Note that is a normal subgroup of , so by Lemma 3.3. Hence and since is -nilpotent we deduce that is a -group. In particular is nilpotent. By assumption is nilpotent. Hence the group is metanilpotent. Let denote the Fitting subgroup of . Then (again by Lemma 3.3), so is a -group. Let be a Sylow -subgroup. Then . On the other hand, and by Lemma 2.2 we get . Therefore is normal in . ∎
Lemma 3.5.
Suppose is a minimal -exception and soluble. If is a normal subgroup of and then .
4. Proof of Theorem C
In this section we consider the word and we prove Theorem C.
Note that if a finite group satisfies property then it satisfies property for every . However, in general the converse is not true. As an example, consider the group generated by subject to the following relations
Then is a group of order with , thus satisfies property . However has order , has order 2 and has order . Thus does not satisfy property .
Lemma 4.1.
Let be a quasisimple group. Then for every . In particular if is quasisimple, is a prime and , then satisfies property if and only if it satisfies property .
Proof.
It is enough to prove that , then the result will follow by induction on . Clearly every -value is a commutator, so .
Now, let be a commutator. Using Ore’s conjecture and the fact that is quasisimple, we can write where is a commutator and . So . Therefore . This completes the proof. ∎
Lemma 4.2.
Let be a finite group, a prime and . Suppose that satisfies and let be a -value of -order. Then for every element , the element has -order.
Proof.
Note that for every we have
Aiming for a contradiction, suppose there exists such that divides the order of . Then and by we deduce that divides the order of . Thus divides the order of , that coincides with the order of , a contradiction. This proves the statement. ∎
Lemma 4.3.
Let be a finite group satisfying . If is a -subgroup of and is such that has -order, then .
Proof.
Lemma 4.4.
Let be a finite group and a prime. Suppose , satisfies and assume that is minimal (with respect to the order) such that is not -nilpotent. Then and is quasisimple.
Proof.
Note that is a minimal -exception. Hence by Lemma 3.3 we have . By Lemma 2.5 the group is generated by -values of -order. Since , Lemma 4.2 implies that . On the other hand, is abelian and so -nilpotent and it is normal in , so . Thus .
It remains to prove that is quasisimple. Since , it is enough to show that is simple. Let be a proper normal subgroup of . Then is a proper subgroup and has property by Lemma 3.2. Hence is -nilpotent by minimality of . Therefore . In particular and so is nilpotent and . Thus . This shows that is simple and completes the proof. ∎
Lemma 4.5.
Let be a finite quasisimple group, a prime and . If satisfies and is a -group, then every element of is a -value.
Proof.
If every element of is a commutator, then by induction on we deduce that every element of is a -value. Suppose contains elements that are not commutators. Then by Proposition 2.8 one of the following holds:
-
(1)
, and ;
-
(2)
, and ;
-
(3)
, and .
Using GAP we can check that none of the groups in the above list satisfies property (where in the first case and in the others). Hence by Lemma 4.1 the groups in the list do not satisfy property , a contradiction. ∎
Lemma 4.6.
Let be a finite group, a prime and . Suppose satisfies and is minimal (with respect to the order) such that is not -nilpotent. Then is soluble and has a normal Sylow -subgroup.
Proof.
We first show that . Aiming for a contradiction, suppose . Then by Lemma 4.4 we deduce that is quasisimple and is a -group. By Lemma 4.5 every element of is a -value. Let be a -subgroup and let be an element of -order. Then is a -value of -order and by Lemma 4.3 we deduce that . Hence is a -group. By Frobenius criterion we conclude that is -nilpotent, a contradiction. Hence . The fact that has a normal Sylow -subgroup follows from Lemma 3.4.
Proof of Theorem C.
If is -nilpotent then satisfies property by Corollary B. Suppose that has property . Aiming for a contradiction, suppose is minimal (with respect to the order) such that is not -nilpotent. Then by Lemma 4.6 we get that is soluble and has a normal Sylow -subgroup . Set . Note that is a minimal -exception, so by Lemma 3.5 we deduce that . Since , Lemma 4.3 implies that every -value of has order divisible by . Using Lemma 2.4 we conclude that every -value of has -power order. Therefore is a -group and so it is -nilpotent, a contradiction. This completes the proof. ∎
5. Proof of Theorem D
In this section we consider the word and we prove Theorem D.
Lemma 5.1.
Let be a finite group satisfying and let be a -value of -order. Then for every element , the element has -order.
Proof.
Let be an element and let be a -value of -order. Note that
is a -value of . Also,
Now, and are -values of of -order (their order is equal to the one of ). Since satisfies , we deduce that has -order. ∎
Lemma 5.2.
Let be a finite group satisfying . If is a -subgroup of and is such that has -order, then .
Proof.
Proof of Theorem D.
If is -nilpotent then satisfies property by Corollary B.
Suppose is soluble and satisfies but is minimal such that is not -nilpotent. Note that every proper subgroup and every proper quotient of is soluble, so is a minimal -exception. By Lemma 3.2 the group satisfies . Since is soluble, we have and so is -nilpotent. In particular is contained in , that is a -group by Lemma 3.3. Let . Then and
Thus is normal in . By the Schur-Zassenhaus theorem [9, Theorem 6.2.1] there exists a subgroup of of -order such that . Let be all prime numbers dividing the order of and distinct from , with for every . Let be a Sylow -subgroup of and set . Since is soluble, by Lemma 2.6 the group is generated by -values of lying in . Note that , so is generated by -values of of -order. Since , we deduce that by Lemma 5.2. Thus is a normal -complement of and is -nilpotent, a contradiction. This completes the proof. ∎
References
- [1] M. Asaad, On -nilpotence of finite groups, J. Algebra 277 (2004), 157–164.
- [2] A. Ballester-Bolinches and G. Xiuyun, Some results on p-nilpotence and solubility of finite groups, J. Algebra 228 (2000), 491–496.
- [3] R. Bastos and C. Monetta, Coprime commutators in finite groups, Comm. Algebra 47 (2019), no. 10, 4137–4147.
- [4] R. Bastos, C. Monetta, and P. Shumyatsky, A criterion for metanilpotency of a finite group, J. Group Theory 21 (2018), no. 4, 713–718.
- [5] R. Bastos and P. Shumyatsky, A sufficient condition for nilpotency of the commutator subgroup, Sib. Math. J. 57 (2016), no. 5, 762–763.
- [6] B. Baumslag and J. Wiegold, A sufficient condition for nilpotency in a finite group, preprint available at arXiv:1411.2877v1 [math.GR] (2014).
- [7] A. Beltrán and A. Sáez, Existence of normal Hall subgroups by means of orders of products, Math. Nachr. 292 (2019), 720–723.
- [8] J. da Silva Alves and P. Shumyatsky, On nilpotency of higher commutator subgroups of a finite soluble group, Arch. Math. (Basel) 116 (2021), no. 1, 1–6.
- [9] D. Gorenstein, Finite groups, second ed., Chelsea Publishing Co., New York, 1980.
- [10] E. I. Khukhro, p-automorphisms of finite p-groups, London Mathematical Society Lecture Note Series. 246, 1998.
- [11] M. W. Liebeck, E. A. O’Brien, A. Shalev, and P. H. Tiep, Commutators in finite quasisimple groups, Bull. Lond. Math. Soc. 43 (2011), no. 6, 1079–1092.
- [12] C. Monetta and A. Tortora, A nilpotency criterion for some verbal subgroups, Bull. Aust. Math. Soc. 100 (2019), no. 2, 281–289.