Artin transfer (group theory): Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>Tpbradbury
no its readable prose size is 43kb and 8000 words
 
(No difference)

Latest revision as of 10:20, 9 December 2023

Template:Technical

In the mathematical field of group theory, an Artin transfer is a certain homomorphism from an arbitrary finite or infinite group to the commutator quotient group of a subgroup of finite index. Originally, such mappings arose as group theoretic counterparts of class extension homomorphisms of abelian extensions of algebraic number fields by applying Artin's reciprocity maps to ideal class groups and analyzing the resulting homomorphisms between quotients of Galois groups. However, independently of number theoretic applications, a partial order on the kernels and targets of Artin transfers has recently turned out to be compatible with parent-descendant relations between finite p-groups (with a prime number p), which can be visualized in descendant trees. Therefore, Artin transfers provide a valuable tool for the classification of finite p-groups and for searching and identifying particular groups in descendant trees by looking for patterns defined by the kernels and targets of Artin transfers. These strategies of pattern recognition are useful in purely group theoretic context, as well as for applications in algebraic number theory concerning Galois groups of higher p-class fields and Hilbert p-class field towers.

Transversals of a subgroup

Let G be a group and HG be a subgroup of finite index n.

Definitions.[1] A left transversal of H in G is an ordered system (g1,,gn) of representatives for the left cosets of H in G such that

G=i=1ngiH.

Similarly a right transversal of H in G is an ordered system (d1,,dn) of representatives for the right cosets of H in G such that

G=i=1nHdi.

Remark. For any transversal of H in G, there exists a unique subscript 1i0n such that gi0H, resp. di0H. Of course, this element with subscript i0 which represents the principal coset (i.e., the subgroup H itself) may be, but need not be, replaced by the neutral element 1.

Lemma.[2] Let G be a non-abelian group with subgroup H. Then the inverse elements (g11,,gn1) of a left transversal (g1,,gn) of H in G form a right transversal of H in G. Moreover, if H is a normal subgroup of G, then any left transversal is also a right transversal of H in G.

Proof. Since the mapping xx1 is an involution of G we see that:
G=G1=i=1n(giH)1=i=1nH1gi1=i=1nHgi1.
For a normal subgroup H we have xH=Hx for each xG.

We must check when the image of a transversal under a homomorphism is also a transversal.

Proposition. Let ϕ:GK be a group homomorphism and (g1,,gn) be a left transversal of a subgroup H in G with finite index n. The following two conditions are equivalent:

  • (ϕ(g1),,ϕ(gn)) is a left transversal of the subgroup ϕ(H) in the image ϕ(G) with finite index (ϕ(G):ϕ(H))=n.
  • ker(ϕ)H.
Proof. As a mapping of sets ϕ maps the union to another union:
ϕ(G)=ϕ(i=1ngiH)=i=1nϕ(giH)=i=1nϕ(gi)ϕ(H),
but weakens the equality for the intersection to a trivial inclusion:
=ϕ()=ϕ(giHgjH)ϕ(giH)ϕ(gjH)=ϕ(gi)ϕ(H)ϕ(gj)ϕ(H),ij.
Suppose for some 1ijn:
ϕ(gi)ϕ(H)ϕ(gj)ϕ(H)
then there exists elements hi,hjH such that
ϕ(gi)ϕ(hi)=ϕ(gj)ϕ(hj)
Then we have:
ϕ(gi)ϕ(hi)=ϕ(gj)ϕ(hj)ϕ(gj)1ϕ(gi)ϕ(hi)ϕ(hj)1=1ϕ(gj1gihihj1)=1gj1gihihj1ker(ϕ)gj1gihihj1Hker(ϕ)Hgj1giHhihj1HgiH=gjHi=j
Conversely if ker(ϕ)H then there exists xGH such that ϕ(x)=1. But the homomorphism ϕ maps the disjoint cosets xH1H= to equal cosets:
ϕ(x)ϕ(H)ϕ(1)ϕ(H)=1ϕ(H)1ϕ(H)=ϕ(H).

Remark. We emphasize the important equivalence of the proposition in a formula:

(1)ker(ϕ)H{ϕ(G)=i=1nϕ(gi)ϕ(H)(ϕ(G):ϕ(H))=n

Permutation representation

Suppose (g1,,gn) is a left transversal of a subgroup H of finite index n in a group G. A fixed element xG gives rise to a unique permutation πxSn of the left cosets of H in G by left multiplication such that:

(2)i{1,,n}:xgiH=gπx(i)Hxgigπx(i)H.

Using this we define a set of elements called the monomials associated with x with respect to (g1,,gn):

i{1,,n}:ux(i):=gπx(i)1xgiH.

Similarly, if (d1,,dn) is a right transversal of H in G, then a fixed element xG gives rise to a unique permutation ρxSn of the right cosets of H in G by right multiplication such that:

(3)i{1,,n}:Hdix=Hdρx(i)dixHdρx(i).

And we define the monomials associated with x with respect to (d1,,dn):

i{1,,n}:wx(i):=dixdρx(i)1H.

Definition.[1] The mappings:

{GSnxπx{GSnxρx

are called the permutation representation of G in the symmetric group Sn with respect to (g1,,gn) and (d1,,dn) respectively.

Definition.[1] The mappings:

{GHn×Snx(ux(1),,ux(n);πx){GHn×Snx(wx(1),,wx(n);ρx)

are called the monomial representation of G in Hn×Sn with respect to (g1,,gn) and (d1,,dn) respectively.

Lemma. For the right transversal (g11,,gn1) associated to the left transversal (g1,,gn), we have the following relations between the monomials and permutations corresponding to an element xG:

(4){wx1(i)=ux(i)11inρx1=πx
Proof. For the right transversal (g11,,gn1), we have wx(i)=gi1xgρx(i), for each 1in. On the other hand, for the left transversal (g1,,gn), we have
i{1,,n}:ux(i)1=(gπx(i)1xgi)1=gi1x1gπx(i)=gi1x1gρx1(i)=wx1(i).
This relation simultaneously shows that, for any xG, the permutation representations and the associated monomials are connected by ρx1=πx and wx1(i)=ux(i)1 for each 1in.

Artin transfer

Definitions.[2][3] Let G be a group and H a subgroup of finite index n. Assume (g)=(g1,,gn) is a left transversal of H in G with associated permutation representation πx:GSn, such that

i{1,,n}:ux(i):=gπx(i)1xgiH.

Similarly let (d)=(d1,,dn) be a right transversal of H in G with associated permutation representation ρx:GSn such that

i{1,,n}:wx(i):=dixdρx(i)1H.

The Artin transfer TG,H(g):GH/H with respect to (g1,,gn) is defined as:

(5)xG:TG,H(g)(x):=i=1ngπx(i)1xgiH=i=1nux(i)H.

Similarly we define:

(6)xG:TG,H(d)(x):=i=1ndixdρx(i)1H=i=1nwx(i)H.

Remarks. Isaacs[4] calls the mappings

{P:GHxi=1nux(i){P:GHxi=1nwx(i)

the pre-transfer from G to H. The pre-transfer can be composed with a homomorphism ϕ:HA from H into an abelian group A to define a more general version of the transfer from G to A via ϕ, which occurs in the book by Gorenstein.[5]

{(ϕP):GAxi=1nϕ(ux(i)){(ϕP):GAxi=1nϕ(wx(i))

Taking the natural epimorphism

{ϕ:HH/HvvH

yields the preceding definition of the Artin transfer TG,H in its original form by Schur[2] and by Emil Artin,[3] which has also been dubbed Verlagerung by Hasse.[6] Note that, in general, the pre-transfer is neither independent of the transversal nor a group homomorphism.

Independence of the transversal

Proposition.[1][2][4][5][7][8][9] The Artin transfers with respect to any two left transversals of H in G coincide.

Proof. Let ()=(1,,n) and (g)=(g1,,gn) be two left transversals of H in G. Then there exists a unique permutation σSn such that:
i{1,,n}:giH=σ(i)H.
Consequently:
i{1,,n},hiH:gihi=σ(i).
For a fixed element xG, there exists a unique permutation λxSn such that:
i{1,,n}:λx(σ(i))H=xσ(i)H=xgihiH=xgiH=gπx(i)H=gπx(i)hπx(i)H=σ(πx(i))H.
Therefore, the permutation representation of G with respect to (1,,n) is given by λxσ=σπx which yields: λx=σπxσ1Sn. Furthermore, for the connection between the two elements:
vx(i):=λx(i)1xiHux(i):=gπx(i)1xgiH
we have:
i{1,,n}:vx(σ(i))=λx(σ(i))1xσ(i)=σ(πx(i))1xgihi=(gπx(i)hπx(i))1xgihi=hπx(i)1gπx(i)1xgihi=hπx(i)1ux(i)hi.
Finally since H/H is abelian and σ and πx are permutations, the Artin transfer turns out to be independent of the left transversal:
TG,H()(x)=i=1nvx(σ(i))H=i=1nhπx(i)1ux(i)hiH=i=1nux(i)i=1nhπx(i)1i=1nhiH=i=1nux(i)1H=i=1nux(i)H=TG,H(g)(x),
as defined in formula (5).

Proposition. The Artin transfers with respect to any two right transversals of H in G coincide.

Proof. Similar to the previous proposition.

Proposition. The Artin transfers with respect to (g1)=(g11,,gn1) and (g)=(g1,,gn) coincide.

Proof. Using formula (4) and H/H being abelian we have:
TG,H(g1)(x)=i=1ngi1xgρx(i)H=i=1nwx(i)H=i=1nux1(i)1H=(i=1nux1(i)H)1=(TG,H(g)(x1))1=TG,H(g)(x).
The last step is justified by the fact that the Artin transfer is a homomorphism. This will be shown in the following section.

Corollary. The Artin transfer is independent of the choice of transversals and only depends on H and G.

Artin transfers as homomorphisms

Theorem.[1][2][4][5][7][8][9] Let (g1,,gn) be a left transversal of H in G. The Artin transfer

{TG,H:GH/Hxi=1ngπx(i)1xgiH

and the permutation representation:

{GSnxπx

are group homomorphisms:

(7)x,yG:TG,H(xy)=TG,H(x)TG,H(y)andπxy=πxπy.

Template:Hidden begin Let x,yG:

TG,H(x)TG,H(y)=i=1ngπx(i)1xgiHj=1ngπy(j)1ygjH

Since H/H is abelian and πy is a permutation, we can change the order of the factors in the product:

i=1ngπx(i)1xgiHj=1ngπy(j)1ygjH=j=1ngπx(πy(j))1xgπy(j)Hj=1ngπy(j)1ygjH=j=1ngπx(πy(j))1xgπy(j)gπy(j)1ygjH=j=1ng(πxπy)(j))1xygjH=TG,H(xy)

This relation simultaneously shows that the Artin transfer and the permutation representation are homomorphisms. Template:Hidden end

It is illuminating to restate the homomorphism property of the Artin transfer in terms of the monomial representation. The images of the factors x,y are given by

TG,H(x)=i=1nux(i)HandTG,H(y)=j=1nuy(j)H.

In the last proof, the image of the product xy turned out to be

TG,H(xy)=j=1ngπx(πy(j))1xgπy(j)gπy(j)1ygjH=j=1nux(πy(j))uy(j)H,

which is a very peculiar law of composition discussed in more detail in the following section.

The law is reminiscent of crossed homomorphisms xux in the first cohomology group H1(G,M) of a G-module M, which have the property uxy=uxyuy for x,yG.

Wreath product of H and S(n)

The peculiar structures which arose in the previous section can also be interpreted by endowing the cartesian product Hn×Sn with a special law of composition known as the wreath product HSn of the groups H and Sn with respect to the set {1,,n}.

Definition. For x,yG, the wreath product of the associated monomials and permutations is given by

(8)(ux(1),,ux(n);πx)(uy(1),,uy(n);πy):=(ux(πy(1))uy(1),,ux(πy(n))uy(n);πxπy)=(uxy(1),,uxy(n);πxy).

Theorem.[1][7] With this law of composition on Hn×Sn the monomial representation

{GHSnx(ux(1),,ux(n);πx)

is an injective homomorphism.

Template:Hidden begin The homomorphism property has been shown above already. For a homomorphism to be injective, it suffices to show the triviality of its kernel. The neutral element of the group Hn×Sn endowed with the wreath product is given by (1,,1;1), where the last 1 means the identity permutation. If (ux(1),,ux(n);πx)=(1,,1;1), for some xG, then πx=1 and consequently

i{1,,n}:1=ux(i)=gπx(i)1xgi=gi1xgi.

Finally, an application of the inverse inner automorphism with gi yields x=1, as required for injectivity. Template:Hidden end

Remark. The monomial representation of the theorem stands in contrast to the permutation representation, which cannot be injective if |G|>n!.

Remark. Whereas Huppert[1] uses the monomial representation for defining the Artin transfer, we prefer to give the immediate definitions in formulas (5) and (6) and to merely illustrate the homomorphism property of the Artin transfer with the aid of the monomial representation.

Composition of Artin transfers

Theorem.[1][7] Let G be a group with nested subgroups KHG such that (G:H)=n,(H:K)=m and (G:K)=(G:H)(H:K)=nm<. Then the Artin transfer TG,K is the compositum of the induced transfer T~H,K:H/HK/K and the Artin transfer TG,H, that is:

(9)TG,K=T~H,KTG,H.

Template:Hidden begin If (g1,,gn) is a left transversal of H in G and (h1,,hm) is a left transversal of K in H, that is G=i=1ngiH and H=j=1mhjK, then

G=i=1nj=1mgihjK

is a disjoint left coset decomposition of G with respect to K.

Given two elements xG and yH, there exist unique permutations πxSn, and σySm, such that

ux(i):=gπx(i)1xgiHfor all 1invy(j):=hσy(j)1yhjKfor all 1jm

Then, anticipating the definition of the induced transfer, we have

TG,H(x)=i=1nux(i)HT~H,K(yH)=TH,K(y)=j=1mvy(j)K

For each pair of subscripts 1in and 1jm, we put yi:=ux(i), and we obtain

xgihj=gπx(i)gπx(i)1xgihj=gπx(i)ux(i)hj=gπx(i)yihj=gπx(i)hσyi(j)hσyi(j)1yihj=gπx(i)hσyi(j)vyi(j),

resp.

hσyi(j)1gπx(i)1xgihj=vyi(j).

Therefore, the image of x under the Artin transfer TG,K is given by

TG,K(x)=i=1nj=1mvyi(j)K=i=1nj=1mhσyi(j)1gπx(i)1xgihjK=i=1nj=1mhσyi(j)1ux(i)hjK=i=1nj=1mhσyi(j)1yihjK=i=1nT~H,K(yiH)=T~H,K(i=1nyiH)=T~H,K(i=1nux(i)H)=T~H,K(TG,H(x))

Template:Hidden end

Finally, we want to emphasize the structural peculiarity of the monomial representation

{GKnm×Snmx(kx(1,1),,kx(n,m);γx)

which corresponds to the composite of Artin transfers, defining

kx(i,j):=((gh)γx(i,j))1x(gh)(i,j)K

for a permutation γxSnm, and using the symbolic notation (gh)(i,j):=gihj for all pairs of subscripts 1in, 1jm.

The preceding proof has shown that

kx(i,j)=hσyi(j)1gπx(i)1xgihj.

Therefore, the action of the permutation γx on the set [1,n]×[1,m] is given by γx(i,j)=(πx(i),σux(i)(j)). The action on the second component j depends on the first component i (via the permutation σux(i)Sm), whereas the action on the first component i is independent of the second component j. Therefore, the permutation γxSnm can be identified with the multiplet

(πx;σux(1),,σux(n))Sn×Smn,

which will be written in twisted form in the next section.

Wreath product of S(m) and S(n)

The permutations γx, which arose as second components of the monomial representation

{GKSnmx(kx(1,1),,kx(n,m);γx)

in the previous section, are of a very special kind. They belong to the stabilizer of the natural equipartition of the set [1,n]×[1,m] into the n rows of the corresponding matrix (rectangular array). Using the peculiarities of the composition of Artin transfers in the previous section, we show that this stabilizer is isomorphic to the wreath product SmSn of the symmetric groups Sm and Sn with respect to the set {1,,n}, whose underlying set Smn×Sn is endowed with the following law of composition:

(10)x,zG:γxγz=(σux(1),,σux(n);πx)(σuz(1),,σuz(n);πz)=(σux(πz(1))σuz(1),,σux(πz(n))σuz(n);πxπz)=(σuxz(1),,σuxz(n);πxz)=γxz

This law reminds of the chain rule D(gf)(x)=D(g)(f(x))D(f)(x) for the Fréchet derivative in xE of the compositum of differentiable functions f:EF and g:FG between complete normed spaces.

The above considerations establish a third representation, the stabilizer representation,

{GSmSnx(σux(1),,σux(n);πx)

of the group G in the wreath product SmSn, similar to the permutation representation and the monomial representation. As opposed to the latter, the stabilizer representation cannot be injective, in general. For instance, certainly not, if G is infinite. Formula (10) proves the following statement.

Theorem. The stabilizer representation

{GSmSnxγx=(σux(1),,σux(n);πx)

of the group G in the wreath product SmSn of symmetric groups is a group homomorphism.

Cycle decomposition

Let (g1,,gn) be a left transversal of a subgroup H of finite index n in a group G and xπx be its associated permutation representation.

Theorem.[1][3][4][5][8][9] Suppose the permutation πx decomposes into pairwise disjoint (and thus commuting) cycles ζ1,,ζtSn of lengths f1,ft, which is unique up to the ordering of the cycles. More explicitly, suppose

(11)(gjH,gζj(j)H,gζj2(j)H,,gζjfj1(j)H)=(gjH,xgjH,x2gjH,,xfj1gjH),

for 1jt, and f1++ft=n. Then the image of xG under the Artin transfer is given by

(12)TG,H(x)=j=1tgj1xfjgjH.

Template:Hidden begin Define j,k:=xkgj for 0kfj1 and 1jt. This is a left transversal of H in G since

(13)G=j=1tk=0fj1xkgjH

is a disjoint decomposition of G into left cosets of H.

Fix a value of 1jt. Then:

xj,k=xxkgj=xk+1gj=j,k+1j,k+1Hk{0,,fj2}xj,fj1=xxfj1gj=xfjgjgjH=j,0H

Define:

ux(j,k):=j,k+11xj,k=1Hk{0,,fj2}ux(j,fj1):=j,01xj,fj1=gj1xfjgjH

Consequently,

TG,H(x)=j=1tk=0fj1ux(j,k)H=j=1t(k=0fj21)ux(j,fj1)H=j=1tgj1xfjgjH.

Template:Hidden end

The cycle decomposition corresponds to a (x,H) double coset decomposition of G:

G=j=1txgjH

It was this cycle decomposition form of the transfer homomorphism which was given by E. Artin in his original 1929 paper.[3]

Transfer to a normal subgroup

Let H be a normal subgroup of finite index n in a group G. Then we have xH=Hx, for all xG, and there exists the quotient group G/H of order n. For an element xG, we let f:=ord(xH) denote the order of the coset xH in G/H, and we let (g1,,gt) be a left transversal of the subgroup x,H in G, where t=n/f.

Theorem. Then the image of xG under the Artin transfer TG,H is given by:

(14)TG,H(x)=j=1tgj1xfgjH.

Template:Hidden begin xH is a cyclic subgroup of order f in G/H, and a left transversal (g1,,gt) of the subgroup x,H in G, where t=n/f and G=j=1tgjx,H is the corresponding disjoint left coset decomposition, can be refined to a left transversal gjxk(1jt, 0kf1) with disjoint left coset decomposition:

(15)G=j=1tk=0f1gjxkH

of H in G. Hence, the formula for the image of x under the Artin transfer TG,H in the previous section takes the particular shape

TG,H(x)=j=1tgj1xfgjH

with exponent f independent of j. Template:Hidden end

Corollary. In particular, the inner transfer of an element xH is given as a symbolic power:

(16)TG,H(x)=xTrG(H)H

with the trace element

(17)TrG(H)=j=1tgj[G]

of H in G as symbolic exponent.

The other extreme is the outer transfer of an element xGH which generates G/H, that is G=x,H.

It is simply an nth power

(18)TG,H(x)=xnH.

Template:Hidden begin The inner transfer of an element xH, whose coset xH=H is the principal set in G/H of order f=1, is given as the symbolic power

TG,H(x)=j=1tgj1xgjH=j=1txgjH=xj=1tgjH

with the trace element

TrG(H)=j=1tgj[G]

of H in G as symbolic exponent.

The outer transfer of an element xGH which generates G/H, that is G=x,H, whence the coset xH is generator of G/H with orderf=n, is given as the nth power

TG,H(x)=j=1111xn1H=xnH.

Template:Hidden end

Transfers to normal subgroups will be the most important cases in the sequel, since the central concept of this article, the Artin pattern, which endows descendant trees with additional structure, consists of targets and kernels of Artin transfers from a group G to intermediate groups GHG between G and G. For these intermediate groups we have the following lemma.

Lemma. All subgroups containing the commutator subgroup are normal.

Template:Hidden begin Let GHG. If H were not a normal subgroup of G, then we had x1Hx⊈H for some element xGH. This would imply the existence of elements hH and yGH such that x1hx=y, and consequently the commutator [h,x]=h1x1hx=h1y would be an element in GH in contradiction to GH. Template:Hidden end

Explicit implementations of Artin transfers in the simplest situations are presented in the following section.

Computational implementation

Abelianization of type (p,p)

Let G be a p-group with abelianization G/G of elementary abelian type (p,p). Then G has p+1 maximal subgroups H1,,Hp+1 of index p.

Lemma. In this particular case, the Frattini subgroup, which is defined as the intersection of all maximal subgroups coincides with the commutator subgroup.

Proof. To see this note that due to the abelian type of G/G the commutator subgroup contains all p-th powers GGp, and thus we have Φ(G)=GpG=G.

For each 1ip+1, let Ti:GHi/Hi be the Artin transfer homomorphism. According to Burnside's basis theorem the group G can therefore be generated by two elements x,y such that xp,ypG. For each of the maximal subgroups Hi, which are also normal we need a generator hi with respect to G, and a generator ti of a transversal (1,ti,ti2,,tip1) such that

Hi=hi,GG=ti,Hi=j=0p1tijHi

A convenient selection is given by

(19){h1=yt1=xhi=xyi22ip+1ti=y2ip+1

Then, for each 1ip+1 we use equations (16) and (18) to implement the inner and outer transfers:

(20)Ti(hi)=hiTrG(Hi)Hi=hi1+ti+ti2++tip1Hi=hi(ti1hiti)(ti2hiti2)(tip+1hitip1)Hi=(hiti1)ptipHi(21)Ti(ti)=tipHi,

The reason is that in G/Hi, ord(hiHi)=1 and ord(tiHi)=p.

The complete specification of the Artin transfers Ti also requires explicit knowledge of the derived subgroups Hi. Since G is a normal subgroup of index p in Hi, a certain general reduction is possible by Hi=[Hi,Hi]=[G,Hi]=(G)hi1,[10] but a presentation of G must be known for determining generators of G=s1,,sn, whence

(22)Hi=(G)hi1=[s1,hi],,[sn,hi].

Abelianization of type (p2,p)

Let G be a p-group with abelianization G/G of non-elementary abelian type (p2,p). Then G has p+1 maximal subgroups H1,,Hp+1 of index p and p+1 subgroups U1,,Up+1 of index p2. For each i{1,,p+1} let

T1,i:GHi/HiT2,i:GUi/Ui

be the Artin transfer homomorphisms. Burnside's basis theorem asserts that the group G can be generated by two elements x,y such that xp2,ypG.

We begin by considering the first layer of subgroups. For each of the normal subgroups Hi, we select a generator

(23)hi=xyi1

such that Hi=hi,G. These are the cases where the factor group Hi/G is cyclic of order p2. However, for the distinguished maximal subgroup Hp+1, for which the factor group Hp+1/G is bicyclic of type (p,p), we need two generators:

(24){hp+1=yh0=xp

such that Hp+1=hp+1,h0,G. Further, a generator ti of a transversal must be given such that G=ti,Hi, for each 1ip+1. It is convenient to define

(25){ti=y1iptp+1=x

Then, for each 1ip+1, we have inner and outer transfers:

(26)T1,i(hi)=hiTrG(Hi)Hi=hi1+ti+ti2++tip1Hi=(hiti1)ptipHi(27)T1,i(ti)=tipHi

since ord(hiHi)=1 and ord(tiHi)=p.

Now we continue by considering the second layer of subgroups. For each of the normal subgroups Ui, we select a generator

(28){u1=yui=xpyi12ipup+1=xp

such that Ui=ui,G. Among these subgroups, the Frattini subgroup Up+1=xp,G=GpG is particularly distinguished. A uniform way of defining generators ti,wi of a transversal such that G=ti,wi,Ui, is to set

(29){ti=x1ipwi=xp1iptp+1=xwp+1=y

Since ord(uiUi)=1, but on the other hand ord(tiUi)=p2 and ord(wiUi)=p, for 1ip+1, with the single exception that ord(tp+1Up+1)=p, we obtain the following expressions for the inner and outer transfers

(30)T2,i(ui)=uiTrG(Ui)Ui=uij=0p1k=0p1wijtikUi=j=0p1k=0p1(wijtik)1uiwijtikUi(31)T2,i(ti)=tip2Ui

exceptionally

(32)T2,p+1(tp+1)=(tp+1p)1+wp+1+wp+12++wp+1p1Up+1(33)T2,i(wi)=(wip)1+ti+ti2++tip1Ui1ip+1

The structure of the derived subgroups Hi and Ui must be known to specify the action of the Artin transfers completely.

Transfer kernels and targets

Let G be a group with finite abelianization G/G. Suppose that (Hi)iI denotes the family of all subgroups which contain G and are therefore necessarily normal, enumerated by a finite index set I. For each iI, let Ti:=TG,Hi be the Artin transfer from G to the abelianization Hi/Hi.

Definition.[11] The family of normal subgroups ϰH(G)=(ker(Ti))iI is called the transfer kernel type (TKT) of G with respect to (Hi)iI, and the family of abelianizations (resp. their abelian type invariants) τH(G)=(Hi/Hi)iI is called the transfer target type (TTT) of G with respect to (Hi)iI. Both families are also called multiplets whereas a single component will be referred to as a singulet.

Important examples for these concepts are provided in the following two sections.

Abelianization of type (p,p)

Let G be a p-group with abelianization G/G of elementary abelian type (p,p). Then G has p+1 maximal subgroups H1,,Hp+1 of index p. For i{1,,p+1} let Ti:GHi/Hi denote the Artin transfer homomorphism.

Definition. The family of normal subgroups ϰH(G)=(ker(Ti))1ip+1 is called the transfer kernel type (TKT) of G with respect to H1,,Hp+1.

Remark. For brevity, the TKT is identified with the multiplet (ϰ(i))1ip+1, whose integer components are given by

ϰ(i)={0ker(Ti)=Gjker(Ti)=Hj for some 1jp+1

Here, we take into consideration that each transfer kernel ker(Ti) must contain the commutator subgroup G of G, since the transfer target Hi/Hi is abelian. However, the minimal case ker(Ti)=G cannot occur.

Remark. A renumeration of the maximal subgroups Ki=Hπ(i) and of the transfers Vi=Tπ(i) by means of a permutation πSp+1 gives rise to a new TKT λK(G)=(ker(Vi))1ip+1 with respect to K1,,Kp+1, identified with (λ(i))1ip+1, where

λ(i)={0ker(Vi)=Gjker(Vi)=Kj for some 1jp+1

It is adequate to view the TKTs λK(G)ϰH(G) as equivalent. Since we have

Kλ(i)=ker(Vi)=ker(Tπ(i))=Hϰ(π(i))=Kπ~1(ϰ(π(i))),

the relation between λ and ϰ is given by λ=π~1ϰπ. Therefore, λ is another representative of the orbit ϰSp+1 of ϰ under the action (π,μ)π~1μπ of the symmetric group Sp+1 on the set of all mappings from {1,,p+1}{0,1,,p+1}, where the extension π~Sp+2 of the permutation πSp+1 is defined by π~(0)=0, and formally H0=G,K0=G.

Definition. The orbit ϰ(G)=ϰSp+1 of any representative ϰ is an invariant of the p-group G and is called its transfer kernel type, briefly TKT.

Remark. Let #0(G):=#{1ip+1ϰ(i)=0} denote the counter of total transfer kernels ker(Ti)=G, which is an invariant of the group G. In 1980, S. M. Chang and R. Foote[12] proved that, for any odd prime p and for any integer 0np+1, there exist metabelian p-groups G having abelianization G/G of type (p,p) such that #0(G)=n. However, for p=2, there do not exist non-abelian 2-groups G with G/G(2,2), which must be metabelian of maximal class, such that #0(G)2. Only the elementary abelian 2-group G=C2×C2 has #0(G)=3. See Figure 5.

In the following concrete examples for the counters #0(G), and also in the remainder of this article, we use identifiers of finite p-groups in the SmallGroups Library by H. U. Besche, B. Eick and E. A. O'Brien.[13][14]

For p=3, we have

  • #0(G)=0 for the extra special group G=27,4 of exponent 9 with TKT ϰ=(1111) (Figure 6),
  • #0(G)=1 for the two groups G{243,6,243,8} with TKTs ϰ{(0122),(2034)} (Figures 8 and 9),
  • #0(G)=2 for the group G=243,3 with TKT ϰ=(0043) (Figure 4 in the article on descendant trees),
  • #0(G)=3 for the group G=81,7 with TKT ϰ=(2000) (Figure 6),
  • #0(G)=4 for the extra special group G=27,3 of exponent 3 with TKT ϰ=(0000) (Figure 6).

Abelianization of type (p2,p)

Let G be a p-group with abelianization G/G of non-elementary abelian type (p2,p). Then G possesses p+1 maximal subgroups H1,,Hp+1 of index p and p+1 subgroups U1,,Up+1 of index p2.

Assumption. Suppose

Hp+1=j=1p+1Uj

is the distinguished maximal subgroup and

Up+1=j=1p+1Hj

is the distinguished subgroup of index p2 which as the intersection of all maximal subgroups, is the Frattini subgroup Φ(G) of G.

First layer

For each 1ip+1, let T1,i:GHi/Hi denote the Artin transfer homomorphism.

Definition. The family ϰ1,H,U(G)=(ker(T1,i))i=1p+1 is called the first layer transfer kernel type of G with respect to H1,,Hp+1 and U1,,Up+1, and is identified with (ϰ1(i))i=1p+1, where

ϰ1(i)={0ker(T1,i)=Hp+1,jker(T1,i)=Uj for some 1jp+1.

Remark. Here, we observe that each first layer transfer kernel is of exponent p with respect to G and consequently cannot coincide with Hj for any 1jp, since Hj/G is cyclic of order p2, whereas Hp+1/G is bicyclic of type (p,p).

Second layer

For each 1ip+1, let T2,i:GUi/Ui be the Artin transfer homomorphism from G to the abelianization of Ui.

Definition. The family ϰ2,U,H(G)=(ker(T2,i))i=1p+1 is called the second layer transfer kernel type of G with respect to U1,,Up+1 and H1,,Hp+1, and is identified with (ϰ2(i))i=1p+1, where

ϰ2(i)={0ker(T2,i)=G,jker(T2,i)=Hj for some 1jp+1.

Transfer kernel type

Combining the information on the two layers, we obtain the (complete) transfer kernel type ϰH,U(G)=(ϰ1,H,U(G);ϰ2,U,H(G)) of the p-group G with respect to H1,,Hp+1 and U1,,Up+1.

Remark. The distinguished subgroups Hp+1 and Up+1=Φ(G) are unique invariants of G and should not be renumerated. However, independent renumerations of the remaining maximal subgroups Ki=Hτ(i)(1ip) and the transfers V1,i=T1,τ(i) by means of a permutation τSp, and of the remaining subgroups Wi=Uσ(i)(1ip) of index p2 and the transfers V2,i=T2,σ(i) by means of a permutation σSp, give rise to new TKTs λ1,K,W(G)=(ker(V1,i))i=1p+1 with respect to K1,,Kp+1 and W1,,Wp+1, identified with (λ1(i))i=1p+1, where

λ1(i)={0ker(V1,i)=Kp+1,jker(V1,i)=Wj for some 1jp+1,

and λ2,W,K(G)=(ker(V2,i))i=1p+1 with respect to W1,,Wp+1 and K1,,Kp+1, identified with (λ2(i))i=1p+1, where

λ2(i)={0ker(V2,i)=G,jker(V2,i)=Kj for some 1jp+1.

It is adequate to view the TKTs λ1,K,W(G)ϰ1,H,U(G) and λ2,W,K(G)ϰ2,U,H(G) as equivalent. Since we have

Wλ1(i)=ker(V1,i)=ker(T1,τ^(i))=Uϰ1(τ^(i))=Wσ~1(ϰ1(τ^(i)))Kλ2(i)=ker(V2,i)=ker(T2,σ^(i))=Hϰ2(σ^(i))=Kτ~1(ϰ2(σ^(i)))

the relations between λ1 and ϰ1, and λ2 and ϰ2, are given by

λ1=σ~1ϰ1τ^
λ2=τ~1ϰ2σ^

Therefore, λ=(λ1,λ2) is another representative of the orbit ϰSp×Sp of ϰ=(ϰ1,ϰ2) under the action:

((σ,τ),(μ1,μ2))(σ~1μ1τ^,τ~1μ2σ^)

of the product of two symmetric groups Sp×Sp on the set of all pairs of mappings {1,,p+1}{0,1,,p+1}, where the extensions π^Sp+1 and π~Sp+2 of a permutation πSp are defined by π^(p+1)=π~(p+1)=p+1 and π~(0)=0, and formally H0=K0=G,Kp+1=Hp+1,U0=W0=Hp+1, and Wp+1=Up+1=Φ(G).

Definition. The orbit ϰ(G)=ϰSp×Sp of any representative ϰ=(ϰ1,ϰ2) is an invariant of the p-group G and is called its transfer kernel type, briefly TKT.

Connections between layers

The Artin transfer T2,i:GUi/Ui is the composition T2,i=T~Hj,UiT1,j of the induced transfer T~Hj,Ui:Hj/HjUi/Ui from Hj to Ui and the Artin transfer T1,j:GHj/Hj.

There are two options regarding the intermediate subgroups

  • For the subgroups U1,,Up only the distinguished maximal subgroup Hp+1 is an intermediate subgroup.
  • For the Frattini subgroup Up+1=Φ(G) all maximal subgroups H1,,Hp+1 are intermediate subgroups.
This causes restrictions for the transfer kernel type ϰ2(G) of the second layer, since
ker(T2,i)=ker(T~Hj,UiT1,j)ker(T1,j),
and thus
i{1,,p}:ker(T2,i)ker(T1,p+1).
But even
ker(T2,p+1)j=1p+1ker(T1,j).
Furthermore, when G=x,y with xpG,ypG, an element xyk1(1kp) of order p2 with respect to G, can belong to ker(T2,i) only if its pth power is contained in ker(T1,j), for all intermediate subgroups Ui<Hj<G, and thus: xyk1ker(T2,i), for certain 1i,kp, enforces the first layer TKT singulet ϰ1(p+1)=p+1, but xyk1ker(T2,p+1), for some 1kp, even specifies the complete first layer TKT multiplet ϰ1=((p+1)p+1), that is ϰ1(j)=p+1, for all 1jp+1.
FactorThroughAbelianization
Figure 1: Factoring through the abelianization.

Inheritance from quotients

The common feature of all parent-descendant relations between finite p-groups is that the parent π(G) is a quotient G/N of the descendant G by a suitable normal subgroup N. Thus, an equivalent definition can be given by selecting an epimorphism ϕ:GG~ with ker(ϕ)=N. Then the group G~=ϕ(G) can be viewed as the parent of the descendant G.

In the following sections, this point of view will be taken, generally for arbitrary groups, not only for finite p-groups.

Passing through the abelianization

Proposition. Suppose A is an abelian group and ϕ:GA is a homomorphism. Let ω:GG/G denote the canonical projection map. Then there exists a unique homomorphism ϕ~:G/GA such that ϕ=ϕ~ω and ker(ϕ~)=ker(ϕ)/G (See Figure 1).

Proof. This statement is a consequence of the second Corollary in the article on the induced homomorphism. Nevertheless, we give an independent proof for the present situation: the uniqueness of ϕ~ is a consequence of the condition ϕ=ϕ~ω, which implies for any xG we have:

ϕ~(xG)=ϕ~(ω(x))=(ϕ~ω)(x)=ϕ(x),

ϕ~ is a homomorphism, let x,yG be arbitrary, then:

ϕ~(xGyG)=ϕ~((xy)G)=ϕ(xy)=ϕ(x)ϕ(y)=ϕ~(xG)ϕ~(xG)ϕ([x,y])=ϕ(x1y1xy)=ϕ(x1)ϕ(y1)ϕ(x)ϕ(y)=[ϕ(x),ϕ(y)]=1A is abelian.

Thus, the commutator subgroup Gker(ϕ), and this finally shows that the definition of ϕ~ is independent of the coset representative,

xG=yGy1xGker(ϕ)1=ϕ(y1x)=ϕ~(y1xG)=ϕ~(yG)1ϕ~(xG)ϕ~(xG)=ϕ~(yG)
EpiAndDerivedQuotients
Figure 2: Epimorphisms and derived quotients.

TTT singulets

Proposition. Assume G,G~,ϕ are as above and H~=ϕ(H) is the image of a subgroup H. The commutator subgroup of H~ is the image of the commutator subgroup of H. Therefore, ϕ induces a unique epimorphism ϕ~:H/HH~/H~, and thus H~/H~ is a quotient of H/H. Moreover, if ker(ϕ)H, then the map ϕ~ is an isomorphism (See Figure 2).

Proof. This claim is a consequence of the Main Theorem in the article on the induced homomorphism. Nevertheless, an independent proof is given as follows: first, the image of the commutator subgroup is

ϕ(H)=ϕ([H,H])=ϕ([u,v]|u,vH)=[ϕ(u),ϕ(v)]u,vH=[ϕ(H),ϕ(H)]=ϕ(H)=H~.

Second, the epimorphism ϕ can be restricted to an epimorphism ϕ|H:HH~. According to the previous section, the composite epimorphism (ωH~ϕ|H):HH~/H~ factors through H/H by means of a uniquely determined epimorphism ϕ~:H/HH~/H~ such that ϕ~ωH=ωH~ϕ|H. Consequently, we have H~/H~(H/H)/ker(ϕ~). Furthermore, the kernel of ϕ~ is given explicitly by ker(ϕ~)=(Hker(ϕ))/H.

Finally, if ker(ϕ)H, then ϕ~ is an isomorphism, since ker(ϕ~)=H/H=1.

Definition.[15] Due to the results in the present section, it makes sense to define a partial order on the set of abelian type invariants by putting H~/H~H/H, when H~/H~(H/H)/ker(ϕ~), and H~/H~=H/H, when H~/H~H/H.

EpiAndArtinTransfers
Figure 3: Epimorphisms and Artin transfers.

TKT singulets

Proposition. Assume G,G~,ϕ are as above and H~=ϕ(H) is the image of a subgroup of finite index n. Let TG,H:GH/H and TG~,H~:G~H~/H~ be Artin transfers. If ker(ϕ)H, then the image of a left transversal of H in G is a left transversal of H~ in G~, and ϕ(ker(TG,H))ker(TG~,H~). Moreover, if ker(ϕ)H then ϕ(ker(TG,H))=ker(TG~,H~) (See Figure 3).

Proof. Let (g1,,gn) be a left transversal of H in G. Then we have a disjoint union:

G=i=1ngiH.

Consider the image of this disjoint union, which is not necessarily disjoint,

ϕ(G)=i=1nϕ(gi)ϕ(H),

and let j,k{1,,n}. We have:

ϕ(gj)ϕ(H)=ϕ(gk)ϕ(H)ϕ(H)=ϕ(gj)1ϕ(gk)ϕ(H)=ϕ(gj1gk)ϕ(H)ϕ(gj1gk)=ϕ(h)for some hHϕ(h1gj1gk)=1h1gj1gkker(ϕ)Hgj1gkHj=k

Let ϕ~:H/HH~/H~ be the epimorphism from the previous proposition. We have:

ϕ~(TG,H(x))=ϕ~(i=1ngπx(i)1xgiH)=i=1nϕ(gπx(i))1ϕ(x)ϕ(gi)ϕ(H).

Since ϕ(H)=ϕ(H)=H~, the right hand side equals TG~,H~(ϕ(x)), if (ϕ(g1),,ϕ(gn)) is a left transversal of H~ in G~, which is true when ker(ϕ)H. Therefore, ϕ~TG,H=TG~,H~ϕ. Consequently, ker(ϕ)H implies the inclusion

ϕ(ker(TG,H))ker(TG~,H~).

Finally, if ker(ϕ)H, then by the previous proposition ϕ~ is an isomorphism. Using its inverse we get TG,H=ϕ~1TG~,H~ϕ, which proves

ϕ1(ker(TG~,H~))ker(TG,H).

Combining the inclusions we have:

{ϕ(ker(TG,H))ker(TG~,H~)ϕ1(ker(TG~,H~))ker(TG,H){ϕ(ker(TG,H))ker(TG~,H~)ϕ(ϕ1(ker(TG~,H~)))ϕ(ker(TG,H))ϕ(ϕ1(ker(TG~,H~)))ϕ(ker(TG,H))ker(TG~,H~)ker(TG~,H~)ϕ(ker(TG,H))ker(TG~,H~)ϕ(ker(TG,H))=ker(TG~,H~)

Definition.[15] In view of the results in the present section, we are able to define a partial order of transfer kernels by setting ker(TG,H)ker(TG~,H~), when ϕ(ker(TG,H))ker(TG~,H~).

TTT and TKT multiplets

Assume G,G~,ϕ are as above and that G/G and G~/G~ are isomorphic and finite. Let (Hi)iI denote the family of all subgroups containing G (making it a finite family of normal subgroups). For each iI let:

Hi~:=ϕ(Hi)Ti:=TG,Hi:GHi/HiTi~:=TG~,Hi~:G~Hi~/Hi~

Take J be any non-empty subset of I. Then it is convenient to define ϰH(G)=(ker(Tj))jJ, called the (partial) transfer kernel type (TKT) of G with respect to (Hj)jJ, and τH(G)=(Hj/Hj)jJ, called the (partial) transfer target type (TTT) of G with respect to (Hj)jJ.

Due to the rules for singulets, established in the preceding two sections, these multiplets of TTTs and TKTs obey the following fundamental inheritance laws:

Inheritance Law I. If ker(ϕ)jJHj, then τH~(G~)τH(G), in the sense that Hj~/Hj~Hj/Hj, for each jJ, and ϰH(G)ϰH~(G~), in the sense that ker(Tj)ker(Tj~), for each jJ.
Inheritance Law II. If ker(ϕ)jJHj, then τH~(G~)=τH(G), in the sense that Hj~/Hj~=Hj/Hj, for each jJ, and ϰH(G)=ϰH~(G~), in the sense that ker(Tj)=ker(Tj~), for each jJ.

Inherited automorphisms

A further inheritance property does not immediately concern Artin transfers but will prove to be useful in applications to descendant trees.

Inheritance Law III. Assume G,G~,ϕ are as above and σAut(G). If σ(ker(ϕ))ker(ϕ) then there exists a unique epimorphism σ~:G~G~ such that ϕσ=σ~ϕ. If σ(ker(ϕ))=ker(ϕ), then σ~Aut(G~).

Proof. Using the isomorphism G~=ϕ(G)G/ker(ϕ) we define:

{σ~:G~G~σ~(gker(ϕ)):=σ(g)ker(ϕ)

First we show this map is well-defined:

gker(ϕ)=hker(ϕ)h1gker(ϕ)σ(h1g)σ(ker(ϕ))σ(h1g)ker(ϕ)σ(ker(ϕ))ker(ϕ)σ(h1)σ(g)ker(ϕ)σ(g)ker(ϕ)=σ(h)ker(ϕ)

The fact that σ~ is surjective, a homomorphism and satisfies ϕσ=σ~ϕ are easily verified.

And if σ(ker(ϕ))=ker(ϕ), then injectivity of σ~ is a consequence of

σ~(gker(ϕ))=ker(ϕ)σ(g)ker(ϕ)=ker(ϕ)σ(g)ker(ϕ)σ1(σ(g))σ1(ker(ϕ))gσ1(ker(ϕ))gker(ϕ)σ1(ker(ϕ))ker(ϕ)gker(ϕ)=ker(ϕ)

Let ω:GG/G be the canonical projection then there exists a unique induced automorphism σ¯Aut(G/G) such that ωσ=σ¯ω, that is,

gG:σ¯(gG)=σ¯(ω(g))=ω(σ(g))=σ(g)G,

The reason for the injectivity of σ¯ is that

σ(g)G=σ¯(gG)=Gσ(g)Gg=σ1(σ(g))G,

since G is a characteristic subgroup of G.

Definition. G is called a σ−group, if there exists σAut(G) such that the induced automorphism acts like the inversion on G/G, that is for all

gG:σ(g)G=σ¯(gG)=g1Gσ(g)gG.

The Inheritance Law III asserts that, if G is a σ−group and σ(ker(ϕ))=ker(ϕ), then G~ is also a σ−group, the required automorphism being σ~. This can be seen by applying the epimorphism ϕ to the equation σ(g)G=σ¯(gG)=g1G which yields

x=ϕ(g)ϕ(G)=G~:σ~(x)G~=σ~(ϕ(g))G~=ϕ(σ(g))ϕ(G)=ϕ(g1)ϕ(G)=ϕ(g)1G~=x1G~.

Stabilization criteria

In this section, the results concerning the inheritance of TTTs and TKTs from quotients in the previous section are applied to the simplest case, which is characterized by the following

Assumption. The parent π(G) of a group G is the quotient π(G)=G/N of G by the last non-trivial term N=γc(G)G of the lower central series of G, where c denotes the nilpotency class of G. The corresponding epimorphism π from G onto π(G)=G/γc(G) is the canonical projection, whose kernel is given by ker(π)=γc(G).

Under this assumption, the kernels and targets of Artin transfers turn out to be compatible with parent-descendant relations between finite p-groups.

Compatibility criterion. Let p be a prime number. Suppose that G is a non-abelian finite p-group of nilpotency class c=cl(G)2. Then the TTT and the TKT of G and of its parent π(G) are comparable in the sense that τ(π(G))τ(G) and ϰ(G)ϰ(π(G)).

The simple reason for this fact is that, for any subgroup GHG, we have ker(π)=γc(G)γ2(G)=GH, since c2.

For the remaining part of this section, the investigated groups are supposed to be finite metabelian p-groups G with elementary abelianization G/G of rank 2, that is of type (p,p).

Partial stabilization for maximal class. A metabelian p-group G of coclass cc(G)=1 and of nilpotency class c=cl(G)3 shares the last p components of the TTT τ(G) and of the TKT ϰ(G) with its parent π(G). More explicitly, for odd primes p3, we have τ(G)i=(p,p) and ϰ(G)i=0 for 2ip+1. [16]

This criterion is due to the fact that c3 implies ker(π)=γc(G)γ3(G)=Hi, [17] for the last p maximal subgroups H2,,Hp+1 of G.

The condition c3 is indeed necessary for the partial stabilization criterion. For odd primes p3, the extra special p-group G=G03(0,1) of order p3 and exponent p2 has nilpotency class c=2 only, and the last p components of its TKT ϰ=(1p+1) are strictly smaller than the corresponding components of the TKT ϰ=(0p+1) of its parent π(G) which is the elementary abelian p-group of type (p,p). [16] For p=2, both extra special 2-groups of coclass 1 and class c=2, the ordinary quaternion group G=G03(0,1) with TKT ϰ=(123) and the dihedral group G=G03(0,0) with TKT ϰ=(023), have strictly smaller last two components of their TKTs than their common parent π(G)=C2×C2 with TKT ϰ=(000).

Total stabilization for maximal class and positive defect.

A metabelian p-group G of coclass cc(G)=1 and of nilpotency class c=m1=cl(G)4, that is, with index of nilpotency m5, shares all p+1 components of the TTT τ(G) and of the TKT ϰ(G) with its parent π(G), provided it has positive defect of commutativity k=k(G)1. [11] Note that k1 implies p3, and we have ϰ(G)i=0 for all 1ip+1. [16]

This statement can be seen by observing that the conditions m5 and k1 imply ker(π)=γm1(G)γmk(G)Hi, [17] for all the p+1 maximal subgroups H1,,Hp+1 of G.

The condition k1 is indeed necessary for total stabilization. To see this it suffices to consider the first component of the TKT only. For each nilpotency class c4, there exist (at least) two groups G=G0c+1(0,1) with TKT ϰ=(10p) and G=G0c+1(1,0) with TKT ϰ=(20p), both with defect k=0, where the first component of their TKT is strictly smaller than the first component of the TKT ϰ=(0p+1) of their common parent π(G)=G0c(0,0).

Partial stabilization for non-maximal class.

Let p=3 be fixed. A metabelian 3-group G with abelianization G/G(3,3), coclass cc(G)2 and nilpotency class c=cl(G)4 shares the last two (among the four) components of the TTT τ(G) and of the TKT ϰ(G) with its parent π(G).

This criterion is justified by the following consideration. If c4, then ker(π)=γc(G)γ4(G)Hi [17] for the last two maximal subgroups H3,H4 of G.

The condition c4 is indeed unavoidable for partial stabilization, since there exist several 3-groups of class c=3, for instance those with SmallGroups identifiers G{243,3,243,6,243,8}, such that the last two components of their TKTs ϰ{(0043),(0122),(2034)} are strictly smaller than the last two components of the TKT ϰ=(0000) of their common parent π(G)=G03(0,0).

Total stabilization for non-maximal class and cyclic centre.

Again, let p=3 be fixed. A metabelian 3-group G with abelianization G/G(3,3), coclass cc(G)2, nilpotency class c=cl(G)4 and cyclic centre ζ1(G) shares all four components of the TTT τ(G) and of the TKT ϰ(G) with its parent π(G).

The reason is that, due to the cyclic centre, we have ker(π)=γc(G)=ζ1(G)Hi [17] for all four maximal subgroups H1,,H4 of G.

The condition of a cyclic centre is indeed necessary for total stabilization, since for a group with bicyclic centre there occur two possibilities. Either γc(G)=ζ1(G) is also bicyclic, whence γc(G) is never contained in H2, or γc(G)<ζ1(G) is cyclic but is never contained in H1.

Summarizing, we can say that the last four criteria underpin the fact that Artin transfers provide a marvellous tool for classifying finite p-groups.

In the following sections, it will be shown how these ideas can be applied for endowing descendant trees with additional structure, and for searching particular groups in descendant trees by looking for patterns defined by the kernels and targets of Artin transfers. These strategies of pattern recognition are useful in pure group theory and in algebraic number theory.

TreeCoclass2RootQ
Figure 4: Endowing a descendant tree with information on Artin transfers.

Structured descendant trees (SDTs)

This section uses the terminology of descendant trees in the theory of finite p-groups. In Figure 4, a descendant tree with modest complexity is selected exemplarily to demonstrate how Artin transfers provide additional structure for each vertex of the tree. More precisely, the underlying prime is p=3, and the chosen descendant tree is actually a coclass tree having a unique infinite mainline, branches of depth 3, and strict periodicity of length 2 setting in with branch (7). The initial pre-period consists of branches (5) and (6) with exceptional structure. Branches (7) and (8) form the primitive period such that (j)(7), for odd j9, and (j)(8), for even j10. The root of the tree is the metabelian 3-group with identifier R=243,6, that is, a group of order |R|=35=243 and with counting number 6. This root is not coclass settled, whence its entire descendant tree 𝒯(R) is of considerably higher complexity than the coclass-2 subtree 𝒯2(R), whose first six branches are drawn in the diagram of Figure 4. The additional structure can be viewed as a sort of coordinate system in which the tree is embedded. The horizontal abscissa is labelled with the transfer kernel type (TKT) ϰ, and the vertical ordinate is labelled with a single component τ(1) of the transfer target type (TTT). The vertices of the tree are drawn in such a manner that members of periodic infinite sequences form a vertical column sharing a common TKT. On the other hand, metabelian groups of a fixed order, represented by vertices of depth at most 1, form a horizontal row sharing a common first component of the TTT. (To discourage any incorrect interpretations, we explicitly point out that the first component of the TTT of non-metabelian groups or metabelian groups, represented by vertices of depth 2, is usually smaller than expected, due to stabilization phenomena!) The TTT of all groups in this tree represented by a big full disk, which indicates a bicyclic centre of type (3,3), is given by τ=[A(3,c),(3,3,3),(9,3),(9,3)] with varying first component τ(1)=A(3,c), the nearly homocyclic abelian 3-group of order 3c, and fixed further components τ(2)=(3,3,3)=^(13) and τ(3)=τ(4)=(9,3)=^(21), where the abelian type invariants are either written as orders of cyclic components or as their 3-logarithms with exponents indicating iteration. (The latter notation is employed in Figure 4.) Since the coclass of all groups in this tree is 2, the connection between the order 3n and the nilpotency class is given by c=n2.

Pattern recognition

For searching a particular group in a descendant tree by looking for patterns defined by the kernels and targets of Artin transfers, it is frequently adequate to reduce the number of vertices in the branches of a dense tree with high complexity by sifting groups with desired special properties, for example

  • filtering the σ-groups,
  • eliminating a set of certain transfer kernel types,
  • cancelling all non-metabelian groups (indicated by small contour squares in Fig. 4),
  • removing metabelian groups with cyclic centre (denoted by small full disks in Fig. 4),
  • cutting off vertices whose distance from the mainline (depth) exceeds some lower bound,
  • combining several different sifting criteria.

The result of such a sieving procedure is called a pruned descendant tree with respect to the desired set of properties. However, in any case, it should be avoided that the main line of a coclass tree is eliminated, since the result would be a disconnected infinite set of finite graphs instead of a tree. For example, it is neither recommended to eliminate all σ-groups in Figure 4 nor to eliminate all groups with TKT ϰ=(0122). In Figure 4, the big double contour rectangle surrounds the pruned coclass tree 𝒯2(R), where the numerous vertices with TKT ϰ=(2122) are completely eliminated. This would, for instance, be useful for searching a σ-group with TKT ϰ=(1122) and first component τ(1)=(43) of the TTT. In this case, the search result would even be a unique group. We expand this idea further in the following detailed discussion of an important example.

Historical example

The oldest example of searching for a finite p-group by the strategy of pattern recognition via Artin transfers goes back to 1934, when A. Scholz and O. Taussky [18] tried to determine the Galois group G=G3(K)=Gal(F3(K)|K) of the Hilbert 3-class field tower, that is the maximal unramified pro-3 extension F3(K), of the complex quadratic number field K=(9748). They actually succeeded in finding the maximal metabelian quotient Q=G/G=G32(K)=Gal(F32(K)|K) of G, that is the Galois group of the second Hilbert 3-class field F32(K) of K. However, it needed 78 years until M. R. Bush and D. C. Mayer, in 2012, provided the first rigorous proof [15] that the (potentially infinite) 3-tower group G=G3(K) coincides with the finite 3-group G33(K)=Gal(F33(K)|K) of derived length dl(G)=3, and thus the 3-tower of K has exactly three stages, stopping at the third Hilbert 3-class field F33(K) of K.

Table 1: Possible quotients Pc of the 3-tower group G of K [15]
c order
of Pc
SmallGroups
identifier of Pc
TKT ϰ
of Pc
TTT τ
of Pc
ν μ descendant
numbers of Pc
1 9 9,2 (0000) [(1)(1)(1)(1)] 3 3 3/2;3/3;1/1
2 27 27,3 (0000) [(12)(12)(12)(12)] 2 4 4/1;7/5
3 243 243,8 (2034) [(21)(21)(21)(21)] 1 3 4/4
4 729 729,54 (2034) [(21)(22)(21)(21)] 2 4 8/3;6/3
5 2187 2187,302 (2334) [(21)(32)(21)(21)] 0 3 0/0
5 2187 2187,306 (2434) [(21)(32)(21)(21)] 0 3 0/0
5 2187 2187,303 (2034) [(21)(32)(21)(21)] 1 4 5/2
5 6561 729,54#2;2 (2334) [(21)(32)(21)(21)] 0 2 0/0
5 6561 729,54#2;6 (2434) [(21)(32)(21)(21)] 0 2 0/0
5 6561 729,54#2;3 (2034) [(21)(32)(21)(21)] 1 3 4/4
6 6561 2187,303#1;1 (2034) [(21)(32)(21)(21)] 1 4 7/3
6 19683 729,54#2;3#1;1 (2034) [(21)(32)(21)(21)] 2 4 8/3;6/3

The search is performed with the aid of the p-group generation algorithm by M. F. Newman [19] and E. A. O'Brien. [20] For the initialization of the algorithm, two basic invariants must be determined. Firstly, the generator rank d of the p-groups to be constructed. Here, we have p=3 and d=r3(K)=d(Cl3(K)) is given by the 3-class rank of the quadratic field K. Secondly, the abelian type invariants of the 3-class group Cl3(K)(12) of K. These two invariants indicate the root of the descendant tree which will be constructed successively. Although the p-group generation algorithm is designed to use the parent-descendant definition by means of the lower exponent-p central series, it can be fitted to the definition with the aid of the usual lower central series. In the case of an elementary abelian p-group as root, the difference is not very big. So we have to start with the elementary abelian 3-group of rank two, which has the SmallGroups identifier 9,2, and to construct the descendant tree 𝒯(9,2). We do that by iterating the p-group generation algorithm, taking suitable capable descendants of the previous root as the next root, always executing an increment of the nilpotency class by a unit.

As explained at the beginning of the section Pattern recognition, we must prune the descendant tree with respect to the invariants TKT and TTT of the 3-tower group G, which are determined by the arithmetic of the field K as ϰ{(2334),(2434)} (exactly two fixed points and no transposition) and τ=[(21)(32)(21)(21)]. Further, any quotient of G must be a σ-group, enforced by number theoretic requirements for the quadratic field K.

The root 9,2 has only a single capable descendant 27,3 of type (12). In terms of the nilpotency class, 9,2 is the class-1 quotient G/γ2(G) of G and 27,3 is the class-2 quotient G/γ3(G) of G. Since the latter has nuclear rank two, there occurs a bifurcation 𝒯(27,3)=𝒯1(27,3)𝒯2(27,3), where the former component 𝒯1(27,3) can be eliminated by the stabilization criterion ϰ=(000) for the TKT of all 3-groups of maximal class.

Due to the inheritance property of TKTs, only the single capable descendant 243,8 qualifies as the class-3 quotient G/γ4(G) of G. There is only a single capable σ-group 729,54 among the descendants of 243,8. It is the class-4 quotient G/γ5(G) of G and has nuclear rank two.

This causes the essential bifurcation 𝒯(729,54)=𝒯2(729,54)𝒯3(729,54) in two subtrees belonging to different coclass graphs 𝒢(3,2) and 𝒢(3,3). The former contains the metabelian quotient Q=G/G of G with two possibilities Q{2187,302,2187,306}, which are not balanced with relation rank r=3>2=d bigger than the generator rank. The latter consists entirely of non-metabelian groups and yields the desired 3-tower group G as one among the two Schur σ-groups 729,54#2;2 and 729,54#2;6 with r=2=d.

Finally the termination criterion is reached at the capable vertices 2187,303#1;1𝒢(3,2) and 729,54#2;3#1;1𝒢(3,3), since the TTT τ=[(21)(32)(21)(21)]>[(21)(32)(21)(21)] is too big and will even increase further, never returning to [(21)(32)(21)(21)]. The complete search process is visualized in Table 1, where, for each of the possible successive p-quotients Pc=G/γc+1(G) of the 3-tower group G=G3(K) of K=(9748), the nilpotency class is denoted by c=cl(Pc), the nuclear rank by ν=ν(Pc), and the p-multiplicator rank by μ=μ(Pc).

Commutator calculus

This section shows exemplarily how commutator calculus can be used for determining the kernels and targets of Artin transfers explicitly. As a concrete example we take the metabelian 3-groups with bicyclic centre, which are represented by big full disks as vertices, of the coclass tree diagram in Figure 4. They form ten periodic infinite sequences, four, resp. six, for even, resp. odd, nilpotency class c, and can be characterized with the aid of a parametrized polycyclic power-commutator presentation:

Template:EquationNote Gc,n(z,w)=x,y,s2,t3,s3,,scx3=scw, y3=s32s4scz, sj3=sj+22sj+3 for 2jc3, sc23=sc2, t33=1,s2=[y,x], t3=[s2,y], sj=[sj1,x] for 3jc,

where c5 is the nilpotency class, 3n with n=c+2 is the order, and 0w1,1z1 are parameters.

The transfer target type (TTT) of the group G=Gc,n(z,w) depends only on the nilpotency class c, is independent of the parameters w,z, and is given uniformly by τ=[A(3,c),(3,3,3),(9,3),(9,3)]. This phenomenon is called a polarization, more precisely a uni-polarization,[11] at the first component.

The transfer kernel type (TKT) of the group G=Gc,n(z,w) is independent of the nilpotency class c, but depends on the parameters w,z, and is given by c.18, ϰ=(0122), for w=z=0 (a mainline group), H.4, ϰ=(2122), for w=0,z=±1 (two capable groups), E.6, ϰ=(1122), for w=1,z=0 (a terminal group), and E.14, ϰ{(4122),(3122)}, for w=1,z=±1 (two terminal groups). For even nilpotency class, the two groups of types H.4 and E.14, which differ in the sign of the parameter z only, are isomorphic.

These statements can be deduced by means of the following considerations.

As a preparation, it is useful to compile a list of some commutator relations, starting with those given in the presentation, [a,x]=1 for a{sc,t3} and [a,y]=1 for a{s3,,sc,t3}, which shows that the bicyclic centre is given by ζ1(G)=sc,t3. By means of the right product rule [a,xy]=[a,y][a,x][[a,x],y] and the right power rule [a,y2]=[a,y]1+y, we obtain [s2,xy]=s3t3, [s2,xy2]=s3t32, and [sj,xy]=[sj,xy2]=[sj,x]=sj+1, for j3.

The maximal subgroups of G are taken in a similar way as in the section on the computational implementation, namely

H1=y,GH2=x,GH3=xy,GH4=xy2,G

Their derived subgroups are crucial for the behavior of the Artin transfers. By making use of the general formula Hi=(G)hi1, where Hi=hi,G, and where we know that G=s2,t3,s3,,sc in the present situation, it follows that

H1=s2y1=t3H2=s2x1,,sc1x1=s3,,scH3=s2xy1,,sc1xy1=s3t3,s4,,scH4=s2xy21,,sc1xy21=s3t32,s4,,sc

Note that H1 is not far from being abelian, since H1=t3 is contained in the centre ζ1(G)=sc,t3.

As the first main result, we are now in the position to determine the abelian type invariants of the derived quotients:

H1/H1=y,s2,,scH1/H1A(3,c),

the unique quotient which grows with increasing nilpotency class c, since ord(y)=ord(s2)=3m for even c=2m and ord(y)=3m+1,ord(s2)=3m for odd c=2m+1,

H2/H2=x,s2,t3H2/H2(3,3,3)H3/H3=xy,s2,t3H3/H3(9,3)H4/H4=xy2,s2,t3H4/H4(9,3)

since generally ord(s2)=ord(t3)=3, but ord(x)=3 for H2, whereas ord(xy)=ord(xy2)=9 for H3 and H4.

Now we come to the kernels of the Artin transfer homomorphisms Ti:GHi/Hi. It suffices to investigate the induced transfers T~i:G/GHi/Hi and to begin by finding expressions for the images T~i(gG) of elements gGG/G, which can be expressed in the form

gxjy(modG),j,{1,0,1}.

First, we exploit outer transfers as much as possible:

xH1T~1(xG)=x3H1=scwH1yH2T~2(yG)=y3H2=s32s4sczH2=1H2x,yH3,H4{T~i(xG)=x3Hi=scwHi=1HiT~i(yG)=y3Hi=s32s4sczHi=s32Hi3i4

Next, we treat the unavoidable inner transfers, which are more intricate. For this purpose, we use the polynomial identity

X2+X+1=(X1)2+3(X1)+3

to obtain:

yH1T~1(yG)=y1+x+x2H1=y3+3(x1)+(x1)2H1=y3[y,x]3[[y,x],x]H1=s32s4sczs23s3H1=s23s33s4sczH1=sczH1xH2T~2(xG)=x1+y+y2H2=x3+3(y1)+(y1)2H2=x3[x,y]3[[x,y],y]H2=scws23t31H2=t31H2

Finally, we combine the results: generally

T~i(gG)=T~i(xG)jT~i(yG),

and in particular,

T~1(gG)=scwj+zH1T~2(gG)=t3jH2T~i(gG)=s32Hi3i4

To determine the kernels, it remains to solve the equations:

scwj+zH1=H1{arbitrary j, and w=z=0=0,arbitrary j and w=0,z=±1j=0,arbitrary  and w=1,z=0j=,w=1,z=±1t3jH2=H2j=0 with arbitrary s32Hi=Hi=0 with arbitrary j3i4

The following equivalences, for any 1i4, finish the justification of the statements:

  • j, both arbitrary ker(Ti)=x,y,G=Gϰ(i)=0.
  • j=0 with arbitrary ker(Ti)=y,G=H1ϰ(i)=1,
  • =0 with arbitrary jker(Ti)=x,G=H2ϰ(i)=2,
  • j=ker(Ti)=xy,G=H3ϰ(i)=3,
  • j=ker(Ti)=xy1,G=H4ϰ(i)=4

Consequently, the last three components of the TKT are independent of the parameters w,z, which means that both, the TTT and the TKT, reveal a uni-polarization at the first component.

Systematic library of SDTs

The aim of this section is to present a collection of structured coclass trees (SCTs) of finite p-groups with parametrized presentations and a succinct summary of invariants. The underlying prime p is restricted to small values p{2,3,5}. The trees are arranged according to increasing coclass r1 and different abelianizations within each coclass. To keep the descendant numbers manageable, the trees are pruned by eliminating vertices of depth bigger than one. Further, we omit trees where stabilization criteria enforce a common TKT of all vertices, since we do not consider such trees as structured any more. The invariants listed include

  • pre-period and period length,
  • depth and width of branches,
  • uni-polarization, TTT and TKT,
  • σ-groups.

We refrain from giving justifications for invariants, since the way how invariants are derived from presentations was demonstrated exemplarily in the section on commutator calculus

Coclass1Tree2Groups
Figure 5: Structured descendant tree of 2-groups with coclass 1.

Coclass 1

For each prime p{2,3,5}, the unique tree of p-groups of maximal class is endowed with information on TTTs and TKTs, that is, 𝒯1(4,2) for p=2,𝒯1(9,2) for p=3, and 𝒯1(25,2) for p=5. In the last case, the tree is restricted to metabelian 5-groups.

The 2-groups of coclass 1 in Figure 5 can be defined by the following parametrized polycyclic pc-presentation, quite different from Blackburn's presentation.[10]

Template:EquationNote Gc,n(z,w)=x,y,s2,,scx2=scw, y2=scz, sj2=sj+1sj+2 for 2jc2, sc12=sc,s2=[y,x], sj=[sj1,x]=[sj1,y] for 3jc,

where the nilpotency class is c3, the order is 2n with n=c+1, and w,z are parameters. The branches are strictly periodic with pre-period 1 and period length 1, and have depth 1 and width 3. Polarization occurs for the third component and the TTT is τ=[(12),(12),A(2,c)], only dependent on c and with cyclic A(2,c). The TKT depends on the parameters and is ϰ=(210) for the dihedral mainline vertices with w=z=0, ϰ=(213) for the terminal generalized quaternion groups with w=z=1, and ϰ=(211) for the terminal semi dihedral groups with w=1,z=0. There are two exceptions, the abelian root with τ=[(1),(1),(1)] and ϰ=(000), and the usual quaternion group with τ=[(2),(2),(2)] and ϰ=(123).

Coclass1Tree3Groups
Figure 6: Structured descendant tree of 3-groups with coclass 1.

The 3-groups of coclass 1 in Figure 6 can be defined by the following parametrized polycyclic pc-presentation, slightly different from Blackburn's presentation.[10]

Template:EquationNote Gac,n(z,w)=x,y,s2,t3,s3,,scx3=scw, y3=s32s4scz, t3=sca, sj3=sj+22sj+3 for 2jc3, sc23=sc2,s2=[y,x], t3=[s2,y], sj=[sj1,x] for 3jc,

where the nilpotency class is c5, the order is 3n with n=c+1, and a,w,z are parameters. The branches are strictly periodic with pre-period 2 and period length 2, and have depth 1 and width 7. Polarization occurs for the first component and the TTT is τ=[A(3,ca),(12),(12),(12)], only dependent on c and a. The TKT depends on the parameters and is ϰ=(0000) for the mainline vertices with a=w=z=0,ϰ=(1000) for the terminal vertices with a=0,w=1,z=0,ϰ=(2000) for the terminal vertices with a=w=0,z=±1, and ϰ=(0000) for the terminal vertices with a=1,w{1,0,1},z=0. There exist three exceptions, the abelian root with τ=[(1),(1),(1),(1)], the extra special group of exponent 9 with τ=[(12),(2),(2),(2)] and ϰ=(1111), and the Sylow 3-subgroup of the alternating group A9 with τ=[(13),(12),(12),(12)]. Mainline vertices and vertices on odd branches are σ-groups.

Coclass1Tree5Groups
Figure 7: Structured descendant tree of metabelian 5-groups with coclass 1.

The metabelian 5-groups of coclass 1 in Figure 7 can be defined by the following parametrized polycyclic pc-presentation, slightly different from Miech's presentation.[21]

Template:EquationNote Gac,n(z,w)=x,y,s2,t3,s3,,scx5=scw, y5=scz, t3=sca,s2=[y,x], t3=[s2,y], sj=[sj1,x] for 3jc,

where the nilpotency class is c3, the order is 5n with n=c+1, and a,w,z are parameters. The (metabelian!) branches are strictly periodic with pre-period 3 and period length 4, and have depth 3 and width 67. (The branches of the complete tree, including non-metabelian groups, are only virtually periodic and have bounded width but unbounded depth!) Polarization occurs for the first component and the TTT is τ=[A(5,ck),(12)5], only dependent on c and the defect of commutativity k. The TKT depends on the parameters and is ϰ=(06) for the mainline vertices with a=w=z=0,ϰ=(105) for the terminal vertices with a=0,w=1,z=0,ϰ=(205) for the terminal vertices with a=w=0,z0, and ϰ=(06) for the vertices with a0. There exist three exceptions, the abelian root with τ=[(1)6], the extra special group of exponent 25 with τ=[(12),(2)5] and ϰ=(16), and the group 15625,631 with τ=[(15),(12)5]. Mainline vertices and vertices on odd branches are σ-groups.

Coclass 2

Abelianization of type (p,p)

Three coclass trees, 𝒯2(243,6), 𝒯2(243,8) and 𝒯2(729,40) for p=3, are endowed with information concerning TTTs and TKTs.

Coclass2TreeQType33
Figure 8: First structured descendant tree of 3-groups with coclass 2 and abelianization (3,3).

On the tree 𝒯2(243,6), the 3-groups of coclass 2 with bicyclic centre in Figure 8 can be defined by the following parametrized polycyclic pc-presentation. [11]

Template:EquationNote Gc,n(z,w)=x,y,s2,t3,s3,,scx3=scw, y3=s32s4scz, sj3=sj+22sj+3 for 2jc3, sc23=sc2, t33=1,s2=[y,x], t3=[s2,y], sj=[sj1,x] for 3jc,

where the nilpotency class is c5, the order is 3n with n=c+2, and w,z are parameters. The branches are strictly periodic with pre-period 2 and period length 2, and have depth 3 and width 18. Polarization occurs for the first component and the TTT is τ=[A(3,c),(13),(21),(21)], only dependent on c. The TKT depends on the parameters and is ϰ=(0122) for the mainline vertices with w=z=0, ϰ=(2122) for the capable vertices with w=0,z=±1, ϰ=(1122) for the terminal vertices with w=1,z=0, and ϰ=(3122) for the terminal vertices with w=1,z=±1. Mainline vertices and vertices on even branches are σ-groups.

Coclass2TreeUType33
Figure 9: Second structured descendant tree of 3-groups with coclass 2 and abelianization (3,3).

On the tree 𝒯2(243,8), the 3-groups of coclass 2 with bicyclic centre in Figure 9 can be defined by the following parametrized polycyclic pc-presentation. [11]

Template:EquationNote Gc,n(z,w)=x,y,t2,s3,t3,,tcy3=s3tcw, x3=t3t42t5tcz, tj3=tj+22tj+3 for 2jc3, tc23=tc2, s33=1,t2=[y,x], s3=[t2,x], tj=[tj1,y] for 3jc,

where the nilpotency class is c6, the order is 3n with n=c+2, and w,z are parameters. The branches are strictly periodic with pre-period 2 and period length 2, and have depth 3 and width 16. Polarization occurs for the second component and the TTT is τ=[(21),A(3,c),(21),(21)], only dependent on c. The TKT depends on the parameters and is ϰ=(2034) for the mainline vertices with w=z=0, ϰ=(2134) for the capable vertices with w=0,z=±1, ϰ=(2234) for the terminal vertices with w=1,z=0, and ϰ=(2334) for the terminal vertices with w=1,z=±1. Mainline vertices and vertices on even branches are σ-groups.

Abelianization of type (p2,p)

𝒯2(16,3) and 𝒯2(16,4) for p=2, 𝒯2(243,15) and 𝒯2(243,17) for p=3.

Abelianization of type (p,p,p)

𝒯2(16,11) for p=2, and 𝒯2(81,12) for p=3.

Coclass 3

Abelianization of type (p2,p)

𝒯3(729,13), 𝒯3(729,18) and 𝒯3(729,21) for p=3.

Abelianization of type (p,p,p)

𝒯3(32,35) and 𝒯3(64,181) for p=2, 𝒯3(243,38) and 𝒯3(243,41) for p=3.

MinDiscriminantsTreeQ
Figure 10: Minimal discriminants for the first ASCT of 3-groups with coclass 2 and abelianization (3,3).

Arithmetical applications

In algebraic number theory and class field theory, structured descendant trees (SDTs) of finite p-groups provide an excellent tool for

  • visualizing the location of various non-abelian p-groups G(K) associated with algebraic number fields K,
  • displaying additional information about the groups G(K) in labels attached to corresponding vertices, and
  • emphasizing the periodicity of occurrences of the groups G(K) on branches of coclass trees.

For instance, let p be a prime number, and assume that Fp2(K) denotes the second Hilbert p-class field of an algebraic number field K, that is the maximal metabelian unramified extension of K of degree a power of p. Then the second p-class group Gp2(K)=Gal(Fp2(K)|K) of K is usually a non-abelian p-group of derived length 2 and frequently permits to draw conclusions about the entire p-class field tower of K, that is the Galois group Gp(K)=Gal(Fp(K)|K) of the maximal unramified pro-p extension Fp(K) of K.

Given a sequence of algebraic number fields K with fixed signature (r1,r2), ordered by the absolute values of their discriminants d=d(K), a suitable structured coclass tree (SCT) 𝒯, or also the finite sporadic part 𝒢0(p,r) of a coclass graph 𝒢(p,r), whose vertices are entirely or partially realized by second p-class groups Gp2(K) of the fields K is endowed with additional arithmetical structure when each realized vertex V𝒯, resp. V𝒢0(p,r), is mapped to data concerning the fields K such that V=Gp2(K).

MinDiscriminantsTreeU
Figure 11: Minimal discriminants for the second ASCT of 3-groups with coclass 2 and abelianization (3,3).

Example

To be specific, let p=3 and consider complex quadratic fields K(d)=(d) with fixed signature (0,1) having 3-class groups with type invariants (3,3). See OEIS A242863 [1]. Their second 3-class groups G32(K) have been determined by D. C. Mayer [17] for the range 106<d<0, and, most recently, by N. Boston, M. R. Bush and F. Hajir[22] for the extended range 108<d<0.

Let us firstly select the two structured coclass trees (SCTs) 𝒯2(243,6) and 𝒯2(243,8), which are known from Figures 8 and 9 already, and endow these trees with additional arithmetical structure by surrounding a realized vertex V with a circle and attaching an adjacent underlined boldface integer min{|d|V=G32(K(d))} which gives the minimal absolute discriminant such that V is realized by the second 3-class group G32(K(d)). Then we obtain the arithmetically structured coclass trees (ASCTs) in Figures 10 and 11, which, in particular, give an impression of the actual distribution of second 3-class groups.[11] See OEIS A242878 [2].

Table 2: Minimal absolute discriminants for states of six sequences
State
n
TKT E.14
ϰ=(3122)
TKT E.6
ϰ=(1122)
TKT H.4
ϰ=(2122)
TKT E.9
ϰ=(2334)
TKT E.8
ϰ=(2234)
TKT G.16
ϰ=(2134)
GS 0 16627 15544 21668 9748 34867 17131
ES1 1 262744 268040 446788 297079 370740 819743
ES2 2 4776071 1062708 3843907 1088808 4087295 2244399
ES3 3 40059363 27629107 52505588 11091140 19027947 30224744
ES4 4 94880548

Concerning the periodicity of occurrences of second 3-class groups G32(K(d)) of complex quadratic fields, it was proved[17] that only every other branch of the trees in Figures 10 and 11 can be populated by these metabelian 3-groups and that the distribution sets in with a ground state (GS) on branch (6) and continues with higher excited states (ES) on the branches (j) with even j8. This periodicity phenomenon is underpinned by three sequences with fixed TKTs [16]

  • E.14 ϰ=(3122), OEIS A247693 [3],
  • E.6 ϰ=(1122), OEIS A247692 [4],
  • H.4 ϰ=(2122), OEIS A247694 [5]

on the ASCT 𝒯2(243,6), and by three sequences with fixed TKTs [16]

  • E.9 ϰ=(2334), OEIS A247696 [6],
  • E.8 ϰ=(2234), OEIS A247695 [7],
  • G.16 ϰ=(2134),OEIS A247697 [8]

on the ASCT 𝒯2(243,8). Up to now,[22] the ground state and three excited states are known for each of the six sequences, and for TKT E.9 ϰ=(2334) even the fourth excited state occurred already. The minimal absolute discriminants of the various states of each of the six periodic sequences are presented in Table 2. Data for the ground states (GS) and the first excited states (ES1) has been taken from D. C. Mayer,[17] most recent information on the second, third and fourth excited states (ES2, ES3, ES4) is due to N. Boston, M. R. Bush and F. Hajir. [22]

FrequencyCoclass2Type33Sporadic
Figure 12: Frequency of sporadic 3-groups with coclass 2 and abelianization (3,3).
Table 3: Absolute and relative frequencies of four sporadic 3-groups
|d|
<
Total
#
TKT D.10
ϰ=(3144)
τ=[(21)(13)(21)(21)]
G=243,5
TKT D.5
ϰ=(1133)
τ=[(21)(13)(21)(13)]
G=243,7
TKT H.4
ϰ=(4111)
τ=[(13)(13)(13)(21)]
G=729,45
TKT G.19
ϰ=(2143)
τ=[(21)(21)(21)(21)]
G=729,57
b=106 2020 667 (33.0%) 269 (13.3%) 297 (14.7%) 94 (4.7%)
b=107 24476 7622 (31.14%) 3625 (14.81%) 3619 (14.79%) 1019 (4.163%)
b=108 276375 83353 (30.159%) 41398 (14.979%) 40968 (14.823%) 10426 (3.7724%)

In contrast, let us secondly select the sporadic part 𝒢0(3,2) of the coclass graph 𝒢(3,2) for demonstrating that another way of attaching additional arithmetical structure to descendant trees is to display the counter #{|d|<bV=G32(K(d))} of hits of a realized vertex V by the second 3-class group G32(K(d)) of fields with absolute discriminants below a given upper bound b, for instance b=108. With respect to the total counter 276375 of all complex quadratic fields with 3-class group of type (3,3) and discriminant b<d<0, this gives the relative frequency as an approximation to the asymptotic density of the population in Figure 12 and Table 3. Exactly four vertices of the finite sporadic part 𝒢0(3,2) of 𝒢(3,2) are populated by second 3-class groups G32(K(d)):

  • 243,5, OEIS A247689 [9],
  • 243,7, OEIS A247690 [10],
  • 729,45, OEIS A242873 [11],
  • 729,57, OEIS A247688 [12].
MinDiscriminantsCoclass2Type33Sporadic
Figure 13: Minimal absolute discriminants of sporadic 3-groups with coclass 2 and abelianization (3,3).
MinDiscriminantsCoclass2Type55Sporadic
Figure 14: Minimal absolute discriminants of sporadic 5-groups with coclass 2 and abelianization (5,5).
MinDiscriminantsCoclass2Type77Sporadic
Figure 15: Minimal absolute discriminants of sporadic 7-groups with coclass 2 and abelianization (7,7).

Comparison of various primes

Now let p{3,5,7} and consider complex quadratic fields K(d)=(d) with fixed signature (0,1) and p-class groups of type (p,p). The dominant part of the second p-class groups of these fields populates the top vertices of order p5 of the sporadic part 𝒢0(p,2) of the coclass graph 𝒢(p,2), which belong to the stem of P. Hall's isoclinism family Φ6, or their immediate descendants of order p6. For primes p>3, the stem of Φ6 consists of p+7 regular p-groups and reveals a rather uniform behaviour with respect to TKTs and TTTs, but the seven 3-groups in the stem of Φ6 are irregular. We emphasize that there also exist several (3 for p=3 and 4 for p>3) infinitely capable vertices in the stem of Φ6 which are partially roots of coclass trees. However, here we focus on the sporadic vertices which are either isolated Schur σ-groups (2 for p=3 and p+1 for p>3) or roots of finite trees within 𝒢0(p,2) (2 for each p3). For p>3, the TKT of Schur σ-groups is a permutation whose cycle decomposition does not contain transpositions, whereas the TKT of roots of finite trees is a compositum of disjoint transpositions having an even number (0 or 2) of fixed points.

We endow the forest 𝒢0(p,2) (a finite union of descendant trees) with additional arithmetical structure by attaching the minimal absolute discriminant min{|d|V=Gp2(K(d))} to each realized vertex V𝒢0(p,2). The resulting structured sporadic coclass graph is shown in Figure 13 for p=3, in Figure 14 for p=5, and in Figure 15 for p=7.

References

Template:Reflist