This paper characterizes the structure of finite p-groups that reach the maximum possible order of their Schur multiplier, based on their minimal generating set and derived subgroup size, and shows these groups are capable.
Contribution
It determines the structure of all p-groups attaining the upper bound of their Schur multiplier's order and proves their capability.
Findings
01
Identified the structure of p-groups reaching the Schur multiplier bound.
02
Proved all such groups are capable.
03
Provided a classification for these extremal p-groups.
Abstract
Let d(G) be the minimum number of elements required to generated a group G. For a group G of order pn with derived subgroup of order pk and d(G)=d, we knew the order of the Schur multiplier of G is bounded by p21(d−1)(n−k+2)+1. In the current paper, we find the structure of all p-groups that attains the mentioned bound. Moreover, we show that all of them are capable.
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.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
Full text
Classification of finite p-groups by the size of their Schur multipliers
Let d(G) be the minimum number of elements required to generated a group G. For a group G of order
pn with derived subgroup of order pk and d(G)=d, we knew the order of the Schur multiplier of G is bounded by p21(d−1)(n−k+2)+1. In the current paper, we find the structure of all p-groups that attains
the mentioned bound. Moreover, we show that all of them are capable.
The Schur multiplier, M(G), of a group G first appeared in 1904 in the work of Schur on projective representations of groups.
The Schur multiplier was studied by several authors and proved to be an important tool in the classification of p-groups. For a group G of order pn, by a result of Green in [10], we have ∣M(G)∣≤p21n(n−1)−t(G) with t(G)≥0. Several authors characterized the structure of p-groups by using t(G). The reader can find the structure
of p-groups when t(G)∈{0,…,6} (see [1, 7, 11, 17, 22, 23]).
Later, the first author [16] improved Green’s bound and showed for any non-abelian group G of order pn with ∣G′∣=pk, we have
[TABLE]
He also characterized all of p-groups that attain the upper bound when k=1. Recently, Rai [18] improved this bound. He showed for a p-group G of order pn with ∣G′∣=pk and d(G)=d, we have
[TABLE]
In the present paper, we are going to find the structure of all
p-groups that attain the bound (1.2), and then we show that all of them are capable.
The concept of the non-abelian tensor square G⊗G of a group G is a special case of the non-abelian tensor product of two arbitrary groups that was introduced by Brown and Loday [5]. It is easy to check that κ:G⊗G→G′ given by g⊗g′→[g,g′] for all g,g′∈G is an epimorphism. Let J2(G) be the kernel of κ, and let ▽(G) be a subgroup of G⊗G generated by the set {g⊗g∣g∈G}. Clearly, ▽(G) is a central subgroup of G⊗G.
The non-abelian exterior square G∧G is the quotient group ▽(G)G⊗G. The element (g⊗g′)▽(G) in G∧G is denoted by g∧g′ for all g,g′∈G. The map κ induces the epimorphism κ′:G∧G→G′ given by g∧g′→[g,g′] for all g,g′∈G. The kernel of the map κ′ is isomorphic to the Schur multiplier of G (for more information,
see [5]).
Recall that a group G is called capable provided that G≅H/Z(H) for a group H. Beyl et al. [3] gave a
criterion for detecting capable groups. They showed that a group G is capable if and only if the epicenter of G,Z∗(G), is trivial.
Ellis [9] showed Z∧(G)=Z∗(G), where Z∧(G) is the exterior center of G, i.e. the set of all elements g of G for which
g∧h=1G∧G for all h∈G
(see for instance [9] to find more information in these topics).
The following technical result characterizes the structure of all minimal non-abelian p-groups.
Lemma 1.1**.**
[2, Exercise 8a.]** and [21]
Let G be a minimal non-abelian p-group. Then ∣G′∣=p and G is isomorphic to one of the following groups:
(a).
G≅⟨a,b∣apm=1,bpn=1,[a,b]=apm−1,[a,b,a]=[a,b,b]=1⟩* for all m,n such that m≥2,n≥1. Moreover, ∣G∣=pm+n and Z(G)=⟨ap⟩×⟨bp⟩.*
(b).
G≅⟨a,b∣apm=bpn=[a,b]p=1,[a,b,a]=[a,b,b]=1⟩* is
of order pm+n+1 and if p=2, then m+n>2. Moreover, Z(G)=⟨ap⟩×⟨bp⟩×⟨[a,b]⟩.*
(c).
G≅Q8.**
Let Zn(t) denote the direct sum of t copies of Zn, in which Zn is the cyclic group
of order n.
Proposition 1.2**.**
Let G be a minimal non-abelian p-group as in Lemma 1.1(a), where n≥1, and m≥2 if p>2,m≥3 if p=2. If G/G′ is homocyclic, then n=m−1,G is non-capable, and Z∧(G)=G′.
Proof.
Since G/G′ is homocyclic and G/G′≅Zpn×Zpm−1,n=m−1. We claim that Z∧(G)=G′.
[3, Corollary 7.4] implies G/G′ is capable and so Z∧(G)⊆G′≅Zp, by [3, Corollary 2.2]. It is sufficient to show that G′=⟨apm−1⟩⊆Z∧(G). Since bpm−1=1, we have
[TABLE]
Clearly,
[TABLE]
Since [a,b]p=1, we get
[b,a]21pm−1(pm−1−1)=1, and so
i=1∏pm−1−1(b∧[b,a])i=1. Thus
[TABLE]
We will show that apm−1∧b=(a∧b)pm−1. Since
[TABLE]
we have apm−1∧b=(a∧b)pm−1=(b∧a)−pm−1=(bpm−1∧a)−1=1G∧G. Moreover, a∧[a,b]=a∧apm−1=1G∧G. Therefore 1=apm−1∈Z∧(G) and so Z∧(G)=G′. Hence G is non-capable.
∎
Let d(G) denote the minimum number of elements required to generate a group G.
Lemma 1.3**.**
Let G be a capable non-abelian p-group of order pn such that ∣G′∣=p,d(G)=d, and e(G/G′)>p. Then ∣G/Z(G)∣=p2 and G=NZ(G), where N is a minimal non-abelian p-group.
Proof.
[12, Theorem C] implies that ∣G/Z(G)∣=p2.
Using [2, Lemma 4.2], we have G=NZ(G), where N is minimal non-abelian.
∎
Let γi(G) be denoted the i-th term of the lower central series of a group G.
We need the following result in the proof of Theorem 1.5.
Proposition 1.4**.**
[8, Proposition 1]** and [6, 11]
Let G be a finite non-abelian p-group of class c.
(i)
The map
[TABLE]
*given by
*xG′Z(G)⊗yG′Z(G)⊗zG′Z(G)↦
[TABLE]
is a homomorphism. If any two elements of the set {x,y,z} are linearly dependent, then \Psi_{2}(xG^{\prime}Z(G)\otimes yG^{\prime}Z(G)\otimes zG^{\prime}Z(G))=1_{\big{(}G^{\prime}/\gamma_{3}(G)\big{)}\otimes G/G^{\prime}}.
(ii)
The map
[TABLE]
is a homomorphism.
Theorem 1.5**.**
Let G be a non-abelian group of order pn of class c with ∣G′∣=pk and d=d(G). Then
[TABLE]
where
[TABLE]
[TABLE]
is a natural homomorphism
for all i such that i≥2.
Proof.
Similar to the proof of [6, Proposition 5], we have
[TABLE]
Since ∣G∧G∣=∣M(G)∣∣G′∣ and using the proof of [18, Theorem 1.2], we have
[TABLE]
We claim that ∣ImΨ2∣∣ImΨ3∣≤∏i=2c∣kerαi∣.
Clearly, the map
[TABLE]
given by xγi+1(G)⊗yG′↦xγi+1(G)⊗yG′Z(G) is a natural epimorphism for all i≥2. By [20, Proposition 2.1], we have
[TABLE]
and so ∣ImΨ2∣∣ImΨ3∣≤∏i=2c∣kerαi∣/∣kerδi∣≤∏i=2c∣kerαi∣.
Therefore
[TABLE]
The proof is completed.
∎
Let 1→R→FπG→1 be a free presentation for a group G and the exponent of a group X is denoted by e(X).
The next result is extracted from the work of Blackburn and Evens in
[4, Remark, Section 3].
Theorem 1.6**.**
Let G be a non-abelian p-group of class two and e(G/G′)=ps. Then
1→kerη→G′⊗G/G′ηM(G)→M(G/G′)→G′→1
is exact, in which
such that
π(x~R)=x and π(z~R)=z.
Similar to the proof of [4, Theorem 3.1], we have
⟨([x,y]⊗zG′)([z,x]⊗yG′)([y,z]⊗xG′),wps⊗wG′∣x,y,z,w∈G⟩⊆kerη, as required.
∎
Lemma 1.7**.**
Let G be a group of class two such that d(G/Z(G))=d is finite. Then d(G′)≤21d(d−1).
Proof.
We can choose a generating set {x1Z(G),…,xdZ(G)} for G/Z(G) such that [xi,xj] is non-trivial for i=j.
It is clear to see that {[xi,xj]∣1≤i<j≤d} generates G′, as required.
∎
Lemma 1.8**.**
Let G be a group.
(i)
If G≅⟨a,b∣apm=bpm=[a,b]pm=1,[a,b,a]=[a,b,b]=1,m≥2⟩ for p=2, then M(G)≅Zpm×Zpm.
(ii)
If G≅⟨a,b∣apm=bpm=[a,b]pk=1,[a,b,a]=[a,b,b]=1,1≤k<m⟩, then M(G)≅Zpm−k×Zpk×Zpk.
Proof.
It is clearly obtained by [15, Theorems 49 and 50].
∎
Theorem 1.9**.**
[19, Theorem 1.1]**
Let G be a non-abelian group of order pn of class two and ∣G′∣=pk. Then
∣M(G)∣=p21(n−k−1)(n+k−2)+1 if and only if G is isomorphic to one of the following groups:
For p=2,G1≅E1×Zp(n−3), where E1 is the extra-special p-group of order p3 and exponent p.
For p=2,G2≅Zp(4)⋊Zp.
For p=2,
[TABLE]
[TABLE]
2. main results
As proven in [18, Theorem 1.1], the Schur multiplier of a non-abelian group G of order pn with ∣G′∣=pk and d(G)=d is bounded by p21(d−1)(n+k−2)+1. Let p is an odd prime number. The main result of this paper is devoted to characterizing the structure of all finite
p-groups that attain the mentioned upper bound. Moreover, we show that all p-groups that attain the bound are capable.
Throughout the paper, we say that ∣M(G)∣ attains the bound provided that ∣M(G)∣=p21(d−1)(n+k−2)+1.
Main Theorem**.**
Let G be a non-abelian group of order pn with p=2,∣G′∣=pk, and d(G)=d. Then
∣M(G)∣=p21(d−1)(n+k−2)+1 if and only if G is isomorphic to one of the following groups:
(i)
H1≅E1×Zp(n−3), where E1 is the extra-special p-group of order p3 and exponent p.
(ii)
H2≅⟨a,b∣apm=bpm=[a,b]p=1,[a,b,a]=[a,b,b]=1⟩, where m>1.
(iii)
H3≅⟨a,b∣apm=bpm=[a,b]pm=1,[a,b,a]=[a,b,b]=1⟩, where m≥2.
Let cl(G)=c. By part (i),G/G′ is homocyclic and so n=dα1+k.
Theorem 1.5 and [14, Corollary 2.2.12] imply
[TABLE]
Thus
[TABLE]
Consider
G=⟨x1,x2,…,xd⟩ and 1=[x1,x2]∈G′∖γ3(G).
We claim that ImΨ2≅Zp(d−2).
Similar to the proof of [8, Theorem 2], the set A={Ψ2(x1G′⊗x2G′⊗xjG′)∣3≤j≤d} consists of d−2 linearly independent elements of order at least p in the abelian p-group G/G′⊗G′/γ3(G). Hence pd−2≤∣⟨A⟩∣≤∣ImΨ2∣.
By using (2.1) and the proof of Theorem 1.5,
[TABLE]
Hence
∣⟨A⟩∣=∣ImΨ2∣=∣kerα2∣=pd−2 and ∣ImΨ3∣=1 and so ⟨A⟩=ImΨ2≅Zp(d−2).
∎
Proposition 2.2**.**
Let G be a non-abelian group of order pn with ∣G′∣=pk,d(G)=d and
∣M(G)∣=p21(d−1)(n+k−2)+1. If k≥2 and
K is a central subgroup of order p
contained in Z(G)∩G′, then ∣M(G/K)∣ also attains the bound, that is
[TABLE]
Proof.
Let K⊆Z(G)∩G′ and ∣K∣=p.
Lemma 2.1(i) implies G/G′≅Zpm(d) for some m≥1, and so G/G′⊗K≅Zp(d).
Using [13, Theorem 4.1], we have
[TABLE]
Thus
[TABLE]
Therefore ∣M(G/K)∣=p21(d−1)(n+k−4)+1,
as required.
∎
The following lemma shows that if the order of the Schur multiplier of a non-abelian p-group G attains the bound, then G is capable.
Lemma 2.3**.**
Let G be a non-abelian p-group of order pn with ∣G′∣=pk and d(G)=d. If
∣M(G)∣ attains the bound, then G is capable.
Proof.
Lemma 2.1(i) implies G/G′ is homocyclic. Therefore G/G′ is capable, by [3, Corollary 7.4]. Hence Z∗(G)⊆G′, by [3, Corollary 2.2]. Assume to the contrary that G is non-capable. Then there is a normal subgroup K of order p in Z∗(G). By using [3, Theorem 4.2] and [14, Theorem 2.5.6(i)], we have ∣M(G)∣=∣M(G/K)∣p−1. Proposition 2.2 implies that ∣M(G)∣=p21(d−1)(n+k−4), which is a contradiction, since by our assumption, we have ∣M(G)∣=p21(d−1)(n+k−2)+1. Thus Z∗(G)=1 and so the result follows from [3, Corollary 2.3].
∎
Proposition 2.4**.**
Let G be a non-abelian finite p-group of order pn such that ∣G′∣=p and d(G)=d. If e(G/G′)>p, then
∣M(G)∣ attains the bound if and only if
G≅⟨a,b∣apm=bpm=[a,b]p=1,[a,b,a]=[a,b,b]=1⟩, where m≥1.
Proof.
Assume that ∣M(G)∣ attains the bound. By Lemmas 1.3 and 2.3, we have
∣G/Z(G)∣=p2 and G=NZ(G), where N is a minimal non-abelian p-group. Since G/G′ is homocyclic, we get G/G′≅Zpα1(d) and G/Z(G)≅Zp⊕Zp. Since G=NZ(G), we have G′=N′=⟨c⟩ such that N=⟨a,b⟩ and c=[a,b]. We claim that G=N.
Assume that G=N. Choose an element y∈Z(G)∖G′.
Thus c⊗yG′ is a non-trivial element in G′⊗G/G′. By using Theorem 1.6, we can see that c⊗yG′ is non-trivial in kerη and so
[TABLE]
Thus ∣M(G)∣≤p21d(d−1)α1+d−2.
Now, since n=α1d+1, by our assumption we have ∣M(G)∣=p21(d−1)(n+1−2)+1=p21d(d−1)α1+1. It is a contradiction.
Now G=NZ(G)=N. So, G is a capable minimal non-abelian p-group. By Lemma 1.1, Proposition 1.2, and [3, Corollary 8.2], we get
Let G be a non-abelian group of order pn of class t such that ∣G′∣=pk,d(G)=d and ∣M(G)∣=p21(d−1)(n+k−2)+1 for all k such that k≥2. If
K is a non-trivial central subgroup of order pm contained in Z(G)∩G′=G′,
then ∣M(G/K)∣ also attains the bound, that is
[TABLE]
Proof.
Let K be a non-trivial central subgroup of order pm contained in Z(G)∩G′. We have ∣G/K∣=pn−m and ∣(G/K)′∣=pk−m. We prove the result by using induction on m. If m=1, then the result holds by Proposition 2.2. Now let m≥2. Consider a normal subgroup K1 in K of order pm−1 and using the induction hypothesis, we have
[TABLE]
Since K/K1⊆Z(G/K1)∩(G′/K1) and ∣K/K1∣=p,
Proposition 2.2 implies that
[TABLE]
This completes the proof.
∎
The proof of the following corollary is similar to that of [20, Theorem 1.2].
Corollary 2.6**.**
Let G be a non-abelian group of order pn of class t≥3 such that ∣G′∣=pk,d(G)=d and ∣M(G)∣=p21(d−1)(n+k−2)+1 for k≥2. Then ∣M(G/γi(G))∣ also attains the bound for all i such that 3≤i≤t.
Proof.
We prove the result by using induction on j=t−i+3 for all i such that 3≤i≤t. If j=3, then since k≥2, by using Proposition 2.5, ∣M(G/γt(G))∣ attains the bound. Using the induction hypothesis, ∣M(G/γi(G))∣ attains the bound.
Since γi−1(G)/γi(G)⊆Z(G/γi(G))∩G′/γi(G), Proposition 2.5 implies that
[TABLE]
attains the bound, as required.
∎
Proposition 2.7**.**
Let G be a non-abelian group of order pn such that G/G′≅Zpm(2) and G′≅Zpk with k≥2. Then
∣M(G)∣ attains the bound if and only if
[TABLE]
where m≥2 and p=2 or
[TABLE]
Proof.
Let ∣M(G)∣ attain the bound. Now by [15, Theorem 1], we get
[TABLE]
where α+β+γ=n,1≤γ≤β≤α, and 0≤ρ,σ≤γ. Since G/G′≅Zpm(2), we have α=β. By Lemma 2.3 and [15, Theorems 63 and 67(i)], ρ=σ=γ. Using [15, Theorem 1], we conclude that
Now we are ready to obtain the structure of a p-group G of class two such that ∣M(G)∣ attains the bound.
Lemma 2.8**.**
Let G be a non-abelian group of order pn of class two such that ∣G′∣≥p2 and d(G)=d. If ∣M(G)∣ attains the bound, then 2≤d≤3.
Proof.
If e(G/G′)=p, then d=n−k. By using Theorem 1.9, 2≤d≤3. Let e(G/G′)>p. If k=1, then Proposition 2.4 implies d=2. Now, assume that k≥2 and K⫋G′ such that
∣G′/K∣=p. By Proposition 2.5, ∣M(G/K)∣ attains the bound so d=d(G/K)=2, by Proposition 2.4. Hence, 2≤d≤3.
∎
Lemma 2.9**.**
There exists no non-abelian group G of order pn of class two such that d(G)=3,e(G′)≥p2,e(G/G′)≥p2, and ∣M(G)∣=p21(d−1)(n+k−2)+1.
Proof.
Assume to the country that there is a such group G. Clearly, e(G/Z(G))=e(G′)=pk. Using Lemma 1.7, d(G′)≤3. Now let G′≅Zpk.
Consider the factor group G/G′p.
Obviously, (G/G′p)′≅Zp and d(G/G′p)=3. Using Proposition 2.5,
∣M(G/G′p)∣ also attains the bound, so Proposition 2.4 implies
d(G/G′p)=2. It is a contradiction. By a similar way, if
2≤d(G′)≤3, then we get a contradiction.
∎
Theorem 2.10**.**
Let G be a non-abelian group of order pn of class two such that ∣G′∣=pk and d(G)=d. Then
∣M(G)∣ attains the bound if and only if G is isomorphic to one of the following groups:
(i)
For p=2,H1≅E1×Zp(n−3), where E1 is the extra-special p-group of order p3 and exponent p.
(ii)
H2≅⟨a,b∣apm=bpm=[a,b]p=1,[a,b,a]=[a,b,b]=1⟩,* where m>1.*
(iii)
For p=2,H3≅⟨a,b∣apm=bpm=[a,b]pm=1,[a,b,a]=[a,b,b]=1⟩, where m≥2.
Suppose that ∣M(G)∣ attains the bound.
First assume that ∣G′∣=p. By Lemma 2.1(i),G/G′ is homocyclic. Theorem 1.9(i) and Proposition 2.4 imply G≅E1×Zp(n−3)≅H1 or
[TABLE]
where m>1.
Now suppose that ∣G′∣≥p2. By using Lemma 2.8, 2≤d≤3. Let d=2.
By Proposition 2.7, we have
[TABLE]
where m≥2 and p=2 or
[TABLE]
Thus G≅H3 or G≅H4.
Let now d=3. By Lemma 2.9, G/G′ is of exponent p and hence G′=ϕ(G). Thus d(G)=n−k=3. Therefore
[TABLE]
Using Theorem 1.9, G≅H5 or G≅H6. The converse follows from Propositions 2.4, 2.7 and Theorem 1.9. The proof is completed.
∎
Proposition 2.11**.**
There exists no non-abelian 2-generator group G of order pn of class t≥3 such that ∣G′∣≥p2 and ∣M(G)∣=p21(d−1)(n+k−2)+1 with p=2.
Proof.
Assume to the contrary that there is a such group G. Let G=⟨x,y⟩, where x,y∈G∖ϕ(G). Without loss of generality, we may assume that [x,y,x]=1.
So, Ψ3(xG′⊗yG′⊗xG′⊗yG′)=([[x,y],x]⊗yG′)2([y,[x,y]]⊗xG′)2=1. On the other hand, by Lemma 2.1(ii),∣ImΨ3∣=1. Hence we have a contradiction.
∎
We are ready to obtain the structures of G when ∣M(G)∣=p21(d−1)(n+k−2)+1.
Proof of the Main Theorem**.**
Suppose that G is nilpotent of class two and ∣M(G)∣ attains the bound. Then G is isomorphic to one of the groups H1,H2,H3,H4,H5 or H6, by Theorem 2.10. Now, let G be nilpotent of class at least 3. Using Corollary 2.6,
∣M(G/γ3(G))∣ attains the bound. Theorem 2.10 implies that
G/γ3(G)≅Hi for some i in 1≤i≤6 and so
2≤d(G/γ3(G))≤3. Since d(G)=d(G/γ3(G)), we have 2≤d(G)≤3. Thus by Proposition 2.11, d(G)=3 and so d(G/γ3(G))=3.
By Theorem 2.10, G/γ3(G)≅H5 or G/γ3(G)≅H6. Hence (G/γ3(G))ab is elementary abelian. Thus d(G)=n−k. By using [20, Theorem 1.2](iv),G≅H7. The converse holds by Theorem 2.10 and [20, Theorem 1.2].**
Bibliography23
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Ya. G., Berkovich, On the order of the commutator subgroup and the Schur multiplier of a finite p 𝑝 p -group. J. Algebra 144 (1991), no. 2, 269–272.
2[2] Y. Berkovich, Groups of Prime Power Order, Vol. 1, Walter de Gruyter · Berlin · New York, 2008.
3[3] F. R. Beyl, U. Felgner, and P. Schmid, On groups occurring as center factor groups. J. Algebra 61 (1979), no. 1, 161–177.
4[4] N. Blackburn, L. Evens, Schur multipliers of p 𝑝 p -groups. J. Reine Angew. Math. 309 (1979), 100–113.
5[5] R. Brown, D. L. Johnson, and E. F. Robertson, Some computations of non-abelian tensor products of groups. J. Algebra 111 (1987), no. 1, 177–202.
6[6] G. Ellis, A bound for the derived and Frattini subgroups of a prime-power group. Proc. Amer. Math. Soc. 126 (1998), no. 9, 2513–2523.
7[7] G. Ellis, On the Schur multiplier of p 𝑝 p -groups. Comm. Algebra 27 (1999), no. 9, 4173–4177.
8[8] G. Ellis, J. Wiegold, A bound on the Schur multiplier of a prime-power group. Bull. Austral. Math. Soc. 60 (1999), no. 2, 191–196.