P-group generation algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, specifically group theory, finite groups of prime power order pn, for a fixed prime number p and varying integer exponents n0, are briefly called finite p-groups.

The p-group generation algorithm by M. F. Newman [1] and E. A. O'Brien [2] [3] is a recursive process for constructing the descendant tree of an assigned finite p-group which is taken as the root of the tree.

Lower exponent-p central series

[edit | edit source]

For a finite p-group G, the lower exponent-p central series (briefly lower p-central series) of G is a descending series (Pj(G))j0 of characteristic subgroups of G, defined recursively by

(1)P0(G):=G and Pj(G):=[Pj1(G),G]Pj1(G)p, for j1.

Since any non-trivial finite p-group G>1 is nilpotent, there exists an integer c1 such that Pc1(G)>Pc(G)=1 and clp(G):=c is called the exponent-p class (briefly p-class) of G. Only the trivial group 1 has clp(1)=0. Generally, for any finite p-group G, its p-class can be defined as clp(G):=min{c0Pc(G)=1}.

The complete lower p-central series of G is therefore given by

(2)G=P0(G)>Φ(G)=P1(G)>P2(G)>>Pc1(G)>Pc(G)=1,

since P1(G)=[P0(G),G]P0(G)p=[G,G]Gp=Φ(G) is the Frattini subgroup of G.

For the convenience of the reader and for pointing out the shifted numeration, we recall that the (usual) lower central series of G is also a descending series (γj(G))j1 of characteristic subgroups of G, defined recursively by

(3)γ1(G):=G and γj(G):=[γj1(G),G], for j2.

As above, for any non-trivial finite p-group G>1, there exists an integer c1 such that γc(G)>γc+1(G)=1 and cl(G):=c is called the nilpotency class of G, whereas c+1 is called the index of nilpotency of G. Only the trivial group 1 has cl(1)=0.

The complete lower central series of G is given by

(4)G=γ1(G)>G=γ2(G)>γ3(G)>>γc(G)>γc+1(G)=1,

since γ2(G)=[γ1(G),G]=[G,G]=G is the commutator subgroup or derived subgroup of G.

The following Rules should be remembered for the exponent-p class:

Let G be a finite p-group.

R

  1. Rule: cl(G)clp(G), since the γj(G) descend more quickly than the Pj(G).
  2. Rule: If ϑHom(G,G~), for some group G~, then ϑ(Pj(G))=Pj(ϑ(G)), for any j0.
  3. Rule: For any c0, the conditions NG and clp(G/N)=c imply Pc(G)N.
  4. Rule: Let c0. If clp(G)=c, then clp(G/Pk(G))=min(k,c), for all k0, in particular, clp(G/Pk(G))=k, for all 0kc.

Parents and descendant trees

[edit | edit source]

The parent π(G) of a finite non-trivial p-group G>1 with exponent-p class clp(G)=c1 is defined as the quotient π(G):=G/Pc1(G) of G by the last non-trivial term Pc1(G)>1 of the lower exponent-p central series of G. Conversely, in this case, G is called an immediate descendant of π(G). The p-classes of parent and immediate descendant are connected by clp(G)=clp(π(G))+1.

A descendant tree is a hierarchical structure for visualizing parent-descendant relations between isomorphism classes of finite p-groups. The vertices of a descendant tree are isomorphism classes of finite p-groups. However, a vertex will always be labelled by selecting a representative of the corresponding isomorphism class. Whenever a vertex π(G) is the parent of a vertex G a directed edge of the descendant tree is defined by Gπ(G) in the direction of the canonical projection π:Gπ(G) onto the quotient π(G)=G/Pc1(G).

In a descendant tree, the concepts of parents and immediate descendants can be generalized. A vertex R is a descendant of a vertex P, and P is an ancestor of R, if either R is equal to P or there is a path

(5)R=Q0Q1Qm1Qm=P, where m1,

of directed edges from R to P. The vertices forming the path necessarily coincide with the iterated parents Qj=πj(R) of R, with 0jm:

(6)R=π0(R)π1(R)πm1(R)πm(R)=P, where m1.

They can also be viewed as the successive quotients Qj=R/Pcj(R) of p-class cj of R when the p-class of R is given by clp(R)=cm:

(7)RR/Pc(R)R/Pc1(R)R/Pc+1m(R)R/Pcm(R)P, where cm1.

In particular, every non-trivial finite p-group G>1 defines a maximal path (consisting of c=clp(G) edges)

(8)GG/1=G/Pc(G)π(G)=G/Pc1(G)π2(G)=G/Pc2(G)

πc1(G)=G/P1(G)πc(G)=G/P0(G)=G/G1

ending in the trivial group πc(G)=1. The last but one quotient of the maximal path of G is the elementary abelian p-group πc1(G)=G/P1(G)Cpd of rank d=d(G), where d(G)=dim𝔽p(H1(G,𝔽p)) denotes the generator rank of G.

Generally, the descendant tree 𝒯(G) of a vertex G is the subtree of all descendants of G, starting at the root G. The maximal possible descendant tree 𝒯(1) of the trivial group 1 contains all finite p-groups and is exceptional, since the trivial group 1 has all the infinitely many elementary abelian p-groups with varying generator rank d1 as its immediate descendants. However, any non-trivial finite p-group (of order divisible by p) possesses only finitely many immediate descendants.

p-covering group, p-multiplicator and nucleus

[edit | edit source]

Let G be a finite p-group with d generators. Our goal is to compile a complete list of pairwise non-isomorphic immediate descendants of G. It turns out that all immediate descendants can be obtained as quotients of a certain extension G of G which is called the p-covering group of G and can be constructed in the following manner.

We can certainly find a presentation of G in the form of an exact sequence

(9)1RFG1,

where F denotes the free group with d generators and ϑ: FG is an epimorphism with kernel R:=ker(ϑ). Then RF is a normal subgroup of F consisting of the defining relations for GF/R. For elements rR and fF, the conjugate f1rfR and thus also the commutator [r,f]=r1f1rfR are contained in R. Consequently, R:=[R,F]Rp is a characteristic subgroup of R, and the p-multiplicator R/R of G is an elementary abelian p-group, since

(10)[R,R]Rp[R,F]Rp=R.

Now we can define the p-covering group of G by

(11)G:=F/R,

and the exact sequence

(12)1R/RF/RF/R1

shows that G is an extension of G by the elementary abelian p-multiplicator. We call

(13)μ(G):=dim𝔽p(R/R)

the p-multiplicator rank of G.

Let us assume now that the assigned finite p-group GF/R is of p-class clp(G)=c. Then the conditions RF and clp(F/R)=c imply Pc(F)R, according to the rule (R3), and we can define the nucleus of G by

(14)Pc(G)=Pc(F)R/RR/R

as a subgroup of the p-multiplicator. Consequently, the nuclear rank

(15)ν(G):=dim𝔽p(Pc(G))μ(G)

of G is bounded from above by the p-multiplicator rank.

Allowable subgroups of the p-multiplicator

[edit | edit source]

As before, let G be a finite p-group with d generators.

Proposition. Any p-elementary abelian central extension

(16)1ZHG1

of G by a p-elementary abelian subgroup Zζ1(H) such that d(H)=d(G)=d is a quotient of the p-covering group G of G.

For the proof click show on the right hand side.

Proof

The reason is that, since d(H)=d(G)=d, there exists an epimorphism ψ: FH such that ϑ=ωψ, where ω: HH/ZG denotes the canonical projection. Consequently, we have

R=ker(ϑ)=ker(ωψ)=(ωψ)1(1)=ψ1(ω1(1))=ψ1(Z)

and thus ψ(R)=ψ(ψ1(Z))=Z. Further, ψ(Rp)=Zp=1, since Z is p-elementary, and ψ([R,F])=[Z,H]=1, since Z is central. Together this shows that ψ(R)=ψ([R,F]Rp)=1 and thus ψ induces the desired epimorphism ψ: GH such that HG/ker(ψ).

In particular, an immediate descendant H of G is a p-elementary abelian central extension

(17)1Pc1(H)HG1

of G, since

1=Pc(H)=[Pc1(H),H]Pc1(H)p implies Pc1(H)p=1 and Pc1(H)ζ1(H),

where c=clp(H).

Definition. A subgroup M/RR/R of the p-multiplicator of G is called allowable if it is given by the kernel M/R=ker(ψ) of an epimorphism ψ: GH onto an immediate descendant H of G.

An equivalent characterization is that 1<M/R<R/R is a proper subgroup which supplements the nucleus

(18)(M/R)(Pc(F)R/R)=R/R.

Therefore, the first part of our goal to compile a list of all immediate descendants of G is done, when we have constructed all allowable subgroups of R/R which supplement the nucleus Pc(G)=Pc(F)R/R, where c=clp(G). However, in general the list

(19){F/MM/RR/R is allowable },

where G/(M/R)=(F/R)/(M/R)F/M, will be redundant, due to isomorphisms F/M1F/M2 among the immediate descendants.

Orbits under extended automorphisms

[edit | edit source]

Two allowable subgroups M1/R and M2/R are called equivalent if the quotients F/M1F/M2, that are the corresponding immediate descendants of G, are isomorphic.

Such an isomorphism φ: F/M1F/M2 between immediate descendants of G=F/R with c=clp(G) has the property that φ(R/M1)=φ(Pc(F/M1))=Pc(φ(F/M1))=Pc(F/M2)=R/M2 and thus induces an automorphism αAut(G) of G which can be extended to an automorphism αAut(G) of the p-covering group G=F/Rof G. The restriction of this extended automorphism α to the p-multiplicator R/R of G is determined uniquely by α.

Since α(M/R)Pc(F/R)=α[M/RPc(F/R)]=α(R/R)=R/R, each extended automorphism αAut(G) induces a permutation α of the allowable subgroups M/RR/R. We define P:=ααAut(G) to be the permutation group generated by all permutations induced by automorphisms of G. Then the map Aut(G)P, αα is an epimorphism and the equivalence classes of allowable subgroups M/RR/R are precisely the orbits of allowable subgroups under the action of the permutation group P.

Eventually, our goal to compile a list {F/Mi1iN} of all immediate descendants of G will be done, when we select a representative Mi/R for each of the N orbits of allowable subgroups of R/R under the action of P. This is precisely what the p-group generation algorithm does in a single step of the recursive procedure for constructing the descendant tree of an assigned root.

Capable p-groups and step sizes

[edit | edit source]

A finite p-group G is called capable (or extendable) if it possesses at least one immediate descendant, otherwise it is terminal (or a leaf). The nuclear rank ν(G) of G admits a decision about the capability of G:

  • G is terminal if and only if ν(G)=0.
  • G is capable if and only if ν(G)1.

In the case of capability, G=F/R has immediate descendants of ν=ν(G) different step sizes 1sν, in dependence on the index (R/R:M/R)=ps of the corresponding allowable subgroup M/R in the p-multiplicator R/R. When G is of order |G|=pn, then an immediate descendant of step size s is of order #(F/M)=(F/R:M/R)=(F/R:R/R)(R/R:M/R) =#(F/R)ps=|G|ps=pnps=pn+s.

For the related phenomenon of multifurcation of a descendant tree at a vertex G with nuclear rank ν(G)2 see the article on descendant trees.

The p-group generation algorithm provides the flexibility to restrict the construction of immediate descendants to those of a single fixed step size 1sν, which is very convenient in the case of huge descendant numbers (see the next section).

Numbers of immediate descendants

[edit | edit source]

We denote the number of all immediate descendants, resp. immediate descendants of step size s, of G by N, resp. Ns. Then we have N=s=1νNs. As concrete examples, we present some interesting finite metabelian p-groups with extensive sets of immediate descendants, using the SmallGroups identifiers and additionally pointing out the numbers 0CsNs of capable immediate descendants in the usual format (N1/C1;;Nν/Cν) as given by actual implementations of the p-group generation algorithm in the computer algebra systems GAP and MAGMA.

First, let p=3.

We begin with groups having abelianization of type (3,3). See Figure 4 in the article on descendant trees.

  • The group 27,3 of coclass 1 has ranks ν=2, μ=4 and descendant numbers (4/1;7/5), N=11.
  • The group 243,3=27,3#2;1 of coclass 2 has ranks ν=2, μ=4 and descendant numbers (10/6;15/15), N=25.
  • One of its immediate descendants, the group 729,40=243,3#1;7, has ranks ν=2, μ=5 and descendant numbers (16/2;27/4), N=43.

In contrast, groups with abelianization of type (3,3,3) are partially located beyond the limit of computability.

  • The group 81,12 of coclass 2 has ranks ν=2, μ=7 and descendant numbers (10/2;100/50), N=110.
  • The group 243,37 of coclass 3 has ranks ν=5, μ=9 and descendant numbers (35/3;2783/186;81711/10202;350652/202266;), N>4105 unknown.
  • The group 729,122 of coclass 4 has ranks ν=8, μ=11 and descendant numbers (45/3;117919/1377;), N>105 unknown.

Next, let p=5.

Corresponding groups with abelianization of type (5,5) have bigger descendant numbers than for p=3.

  • The group 125,3 of coclass 1 has ranks ν=2, μ=4 and descendant numbers (4/1;12/6), N=16.
  • The group 3125,3=125,3#2;1 of coclass 2 has ranks ν=3, μ=5 and descendant numbers (8/3;61/61;47/47), N=116.

Schur multiplier

[edit | edit source]

Via the isomorphism /μ, ndexp(nd2πi) the quotient group /={ndd1, 0nd1} can be viewed as the additive analogue of the multiplicative group μ={zzd=1 for some integer d1} of all roots of unity.

Let p be a prime number and G be a finite p-group with presentation G=F/R as in the previous section. Then the second cohomology group M(G):=H2(G,/) of the G-module / is called the Schur multiplier of G. It can also be interpreted as the quotient group M(G)=(R[F,F])/[F,R].

I. R. Shafarevich[4] has proved that the difference between the relation rank r(G)=dim𝔽p(H2(G,𝔽p)) of G and the generator rank d(G)=dim𝔽p(H1(G,𝔽p)) of G is given by the minimal number of generators of the Schur multiplier of G, that is r(G)d(G)=d(M(G)).

N. Boston and H. Nover[5] have shown that μ(Gj)ν(Gj)r(G), for all quotients Gj:=G/Pj(G) of p-class clp(Gj)=j, j0, of a pro-p group G with finite abelianization G/G.

Furthermore, J. Blackhurst (in the appendix On the nucleus of certain p-groups of a paper by N. Boston, M. R. Bush and F. Hajir [6]) has proved that a non-cyclic finite p-group G with trivial Schur multiplier M(G) is a terminal vertex in the descendant tree 𝒯(1) of the trivial group 1, that is, M(G)=1 ν(G)=0.

Examples

[edit | edit source]
  • A finite p-group G has a balanced presentation r(G)=d(G) if and only if r(G)d(G)=0=d(M(G)), that is, if and only if its Schur multiplier M(G)=1 is trivial. Such a group is called a Schur group and it must be a leaf in the descendant tree 𝒯(1).
  • A finite p-group G satisfies r(G)=d(G)+1 if and only if r(G)d(G)=1=d(M(G)), that is, if and only if it has a non-trivial cyclic Schur multiplier M(G). Such a group is called a Schur+1 group.

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Translasted in Amer. Math. Soc. Transl. (2), 59: 128-149, (1966).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).