Artin Transfer (group Theory)
   HOME

TheInfoList



OR:

In the mathematical field of
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ...
, an Artin transfer is a certain
homomorphism In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type (such as two groups, two rings, or two vector spaces). The word ''homomorphism'' comes from the Ancient Greek language: () meaning "same" ...
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 field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a f ...
s 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 Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic ob ...
concerning Galois groups of higher ''p''-class fields and Hilbert ''p''-class field towers.


Transversals of a subgroup

Let G be a group and H\le G be a subgroup of finite index n. Definitions. A left transversal of H in G is an ordered system (g_1,\ldots,g_n) of representatives for the left cosets of H in G such that :G=\bigsqcup_^n g_iH. Similarly a right transversal of H in G is an ordered system (d_1, \ldots, d_n) of representatives for the right cosets of H in G such that :G=\bigsqcup_^n Hd_i. Remark. For any transversal of H in G, there exists a unique subscript 1\le i_0\le n such that g_\in H, resp. d_\in H. Of course, this element with subscript i_0 which represents the principal coset (i.e., the subgroup H itself) may be, but need not be, replaced by the neutral element 1. Lemma. Let G be a non-abelian group with subgroup H. Then the inverse elements (g_1^,\ldots,g_n^) of a left transversal (g_1,\ldots,g_n) 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 x\mapsto x^ is an
involution Involution may refer to: * Involute, a construction in the differential geometry of curves * '' Agricultural Involution: The Processes of Ecological Change in Indonesia'', a 1963 study of intensification of production through increased labour inpu ...
of G we see that: ::G=G^=\bigsqcup_^n (g_iH)^=\bigsqcup_^n H^g_i^=\bigsqcup_^n Hg_i^. :For a normal subgroup H we have xH=Hx for each x\in G. We must check when the image of a transversal under a homomorphism is also a transversal. Proposition. Let \phi: G\to K be a group homomorphism and (g_1,\ldots,g_n) be a left transversal of a subgroup H in G with finite index n. The following two conditions are equivalent: *(\phi(g_1),\ldots,\phi(g_n)) is a left transversal of the subgroup \phi(H) in the image \phi(G) with finite index (\phi(G):\phi(H))=n. *\ker(\phi)\le H. :Proof. As a mapping of sets \phi maps the union to another union: ::\phi(G)=\phi \left(\bigcup_^n g_iH \right )=\bigcup_^n \phi(g_iH)=\bigcup_^n \phi(g_i)\phi(H), :but weakens the equality for the intersection to a trivial inclusion: ::\emptyset=\phi(\emptyset)=\phi(g_iH\cap g_jH)\subseteq\phi(g_iH)\cap\phi(g_jH)=\phi(g_i)\phi(H)\cap\phi(g_j)\phi(H), \qquad i \ne j. :Suppose for some 1\le i\le j\le n: ::\phi(g_i)\phi(H)\cap\phi(g_j)\phi(H)\ne\emptyset :then there exists elements h_i,h_j\in H such that ::\phi(g_i)\phi(h_i)=\phi(g_j)\phi(h_j) :Then we have: ::\begin \phi(g_i)\phi(h_i)=\phi(g_j)\phi(h_j) &\Longrightarrow \phi(g_j)^\phi(g_i)\phi(h_i)\phi(h_j)^=1 \\ &\Longrightarrow \phi \left (g_j^g_ih_ih_j^ \right )= 1 \\ &\Longrightarrow g_j^g_ih_ih_j^\in\ker(\phi) \\ &\Longrightarrow g_j^g_ih_ih_j^\in H && \ker(\phi)\le H \\ &\Longrightarrow g_j^g_i \in H && h_ih_j^\in H \\ &\Longrightarrow g_iH=g_jH \\ &\Longrightarrow i = j \end :Conversely if \ker(\phi) \nsubseteq H then there exists x\in G\setminus H such that \phi(x)=1. But the homomorphism \phi maps the disjoint cosets x\cdot H\cap 1 \cdot H=\emptyset to equal cosets: ::\phi(x)\phi(H)\cap\phi(1)\phi(H)=1\cdot\phi(H)\cap 1\cdot\phi(H)=\phi(H). Remark. We emphasize the important equivalence of the proposition in a formula: :(1)\quad \ker(\phi)\le H \quad \Longleftrightarrow\quad \begin \phi(G)=\bigsqcup_^n \phi(g_i)\phi(H) \\(\phi(G):\phi(H))=n \end


Permutation representation

Suppose (g_1,\ldots,g_n) is a left transversal of a subgroup H of finite index n in a group G. A fixed element x\in G gives rise to a unique permutation \pi_x\in S_n of the left cosets of H in G by left multiplication such that: :(2)\quad \forall i \in \: \qquad xg_iH=g_H \Longrightarrow xg_i\in g_H. Using this we define a set of elements called the monomials associated with x with respect to (g_1,\ldots,g_n): :\forall i \in \: \qquad u_x(i):=g_^xg_i\in H. Similarly, if (d_1,\ldots,d_n) is a right transversal of H in G, then a fixed element x\in G gives rise to a unique permutation \rho_x\in S_n of the right cosets of H in G by right multiplication such that: :(3)\quad \forall i \in \: \qquad Hd_ix=Hd_ \Longrightarrow d_ix\in Hd_. And we define the monomials associated with x with respect to (d_1,\ldots,d_n): :\forall i \in \: \qquad w_x(i):=d_ixd_^\in H. Definition. The mappings: :\begin G\to S_n \\ x\mapsto\pi_x \end \qquad \begin G\to S_n \\ x\mapsto\rho_x \end are called the permutation representation of G in the symmetric group S_n with respect to (g_1,\ldots,g_n) and (d_1,\ldots,d_n) respectively. Definition. The mappings: :\begin G\to H^n\times S_n \\ x\mapsto(u_x(1),\ldots,u_x(n);\pi_x)\end \qquad \begin G\to H^n\times S_n \\ x\mapsto(w_x(1),\ldots,w_x(n);\rho_x) \end are called the monomial representation of G in H^n\times S_n with respect to (g_1,\ldots,g_n) and (d_1,\ldots,d_n) respectively. Lemma. For the right transversal (g_1^,\ldots,g_n^) associated to the left transversal (g_1, \ldots, g_n), we have the following relations between the monomials and permutations corresponding to an element x\in G: :(4)\quad \begin w_(i)=u_x(i)^ & 1\le i\le n \\ \rho_=\pi_x \end :Proof. For the right transversal (g_1^,\ldots,g_n^), we have w_x(i)=g_i^xg_, for each 1\le i\le n. On the other hand, for the left transversal (g_1,\ldots,g_n), we have ::\forall i \in \: \qquad u_x(i)^= \left (g_^xg_i \right )^=g_i^x^g_=g_i^x^g_=w_(i). :This relation simultaneously shows that, for any x\in G, the permutation representations and the associated monomials are connected by \rho_=\pi_x and w_(i)=u_x(i)^ for each 1\le i\le n.


Artin transfer

Definitions. Let G be a group and H a subgroup of finite index n. Assume (g) = (g_1,\ldots,g_n) is a left transversal of H in G with associated permutation representation \pi_x: G\to S_n, such that :\forall i\in\: \qquad u_x(i) :=g_^xg_i\in H. Similarly let (d) = (d_1,\ldots,d_n) be a right transversal of H in G with associated permutation representation \rho_x: G \to S_n such that :\forall i\in\: \qquad w_x(i):=d_ixd_^\in H. The Artin transfer T_^: G\to H/H' with respect to (g_1,\ldots,g_n) is defined as: :(5)\quad \forall x \in G: \qquad T_^(x) := \prod_^n g_^xg_i\cdot H' = \prod_^n u_x(i)\cdot H'. Similarly we define: :(6)\quad \forall x \in G: \qquad T_^(x) := \prod_^n d_ixd_^\cdot H' =\prod_^n w_x(i)\cdot H'. Remarks. Isaacs calls the mappings :\begin P: G\to H \\ x\mapsto \prod_^n u_x(i)\end \qquad \begin P: G\to H \\ x\mapsto\prod_^n w_x(i) \end the ''pre-transfer'' from G to H. The pre-transfer can be composed with a homomorphism \phi: H\to A from H into an abelian group A to define a more ''general version of the transfer'' from G to A via \phi, which occurs in the book by Gorenstein. :\begin (\phi\circ P): G\to A \\ x\mapsto\prod_^n \phi(u_x(i))\end \qquad \begin (\phi\circ P): G\to A \\ x\mapsto\prod_^n \phi(w_x(i))\end Taking the natural epimorphism :\begin \phi: H\to H/H' \\ v\mapsto vH' \end yields the preceding definition of the ''Artin transfer'' T_ in its original form by Schur and by Emil Artin, which has also been dubbed ''Verlagerung'' by Hasse. Note that, in general, the pre-transfer is neither independent of the transversal nor a group homomorphism.


Independence of the transversal

Proposition. The Artin transfers with respect to any two left transversals of H in G coincide. :Proof. Let (\ell) = (\ell_1,\ldots,\ell_n) and (g)=(g_1,\ldots,g_n) be two left transversals of H in G. Then there exists a unique permutation \sigma\in S_n such that: ::\forall i \in \: \qquad g_iH=\ell_H. :Consequently: ::\forall i \in \, \exists h_i \in H: \qquad g_ih_i=\ell_. :For a fixed element x\in G, there exists a unique permutation \lambda_x \in S_n such that: ::\forall i \in \: \qquad \ell_H=x\ell_H= xg_ih_iH= xg_iH= g_H= g_ h_H =\ell_ H. :Therefore, the permutation representation of G with respect to (\ell_1, \ldots, \ell_n) is given by \lambda_x \circ \sigma = \sigma\circ\pi_x which yields: \lambda_x =\sigma \circ \pi_x \circ \sigma^ \in S_n. Furthermore, for the connection between the two elements: ::\begin v_x(i) &:= \ell_^ x\ell_i\in H \\ u_x(i) &:= g_^xg_i\in H \end :we have: ::\forall i \in \: \qquad v_x(\sigma(i)) =\ell_^ x\ell_= \ell_^ xg_ih_i=\left (g_h_ \right )^ xg_ih_i= h_^ g_^ xg_ih_i=h_^u_x(i)h_i. :Finally since H/H' is abelian and \sigma and \pi_x are permutations, the Artin transfer turns out to be independent of the left transversal: ::T_^(x)=\prod_^n v_x(\sigma(i))\cdot H'=\prod_^n h_^u_x(i)h_i\cdot H'=\prod_^n u_x(i)\prod_^n h_^ \prod_^n h_i\cdot H'=\prod_^n u_x(i)\cdot 1\cdot H'=\prod_^n u_x(i)\cdot H'=T_^(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 (g^) = (g_1^,\ldots,g_n^) and (g) = (g_1,\ldots,g_n) coincide. :Proof. Using formula (4) and H/H' being abelian we have: ::T_^(x)=\prod_^n g_i^xg_\cdot H'=\prod_^n w_x(i)\cdot H' =\prod_^n u_(i)^\cdot H'= \left (\prod_^n u_(i)\cdot H' \right )^ = \left (T_^ \left (x^ \right ) \right )^=T_^(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. Let (g_1,\ldots,g_n) be a left transversal of H in G. The Artin transfer :\begin T_: G\to H/H' \\ x\mapsto\prod_^n g_^xg_i\cdot H' \end and the permutation representation: :\beginG\to S_n \\ x\mapsto\pi_x \end are group homomorphisms: :(7)\quad \forall x, y \in G: \qquad T_(xy)=T_(x)\cdot T_(y) \quad \text \quad \pi_=\pi_x\circ\pi_y. Let x,y\in G: :T_(x)\cdot T_(y) = \prod_^n g_^xg_iH'\cdot\prod_^n g_^yg_j\cdot H' Since H/H' is abelian and \pi_y is a permutation, we can change the order of the factors in the product: :\begin \prod_^n g_^xg_iH'\cdot\prod_^n g_^yg_j\cdot H' &=\prod_^n g_^ x g_ H'\cdot\prod_^n g_^yg_j\cdot H' \\ &=\prod_^n g_^xg_g_^yg_j\cdot H' \\ &=\prod_^n g_^xyg_j\cdot H' \\ &=T_(xy) \end This relation simultaneously shows that the Artin transfer and the permutation representation are homomorphisms. 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 :T_(x)=\prod_^n u_x(i)\cdot H' \quad \text \quad T_(y)=\prod_^n u_y(j)\cdot H'. In the last proof, the image of the product xy turned out to be :T_(xy)=\prod_^n g_^xg_g_^yg_j\cdot H'=\prod_^n u_x(\pi_y(j))\cdot u_y(j)\cdot H', which is a very peculiar law of composition discussed in more detail in the following section. The law is reminiscent of crossed homomorphisms x\mapsto u_x in the first
cohomology group In mathematics, specifically in homology theory and algebraic topology, cohomology is a general term for a sequence of abelian groups, usually one associated with a topological space, often defined from a cochain complex. Cohomology can be viewe ...
\mathrm^1(G,M) of a G-module M, which have the property u_=u_x^y\cdot u_y for x,y\in G.


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 H^n\times S_n with a special law of composition known as the wreath product H\wr S_n of the groups H and S_n with respect to the set \. Definition. For x,y\in G, the wreath product of the associated monomials and permutations is given by :(8) \quad (u_x(1),\ldots,u_x(n);\pi_x) \cdot (u_y(1),\ldots,u_y(n);\pi_y):=(u_x(\pi_y(1))\cdot u_y(1),\ldots,u_x(\pi_y(n))\cdot u_y(n); \pi_x \circ\pi_y)=(u_(1),\ldots,u_(n);\pi_). Theorem. With this law of composition on H^n\times S_n the ''monomial representation'' :\begin G\to H\wr S_n \\ x\mapsto (u_x(1),\ldots,u_x(n);\pi_x) \end is an injective homomorphism. 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 H^n\times S_n endowed with the wreath product is given by (1,\ldots,1;1), where the last 1 means the identity permutation. If (u_x(1),\ldots,u_x(n);\pi_x)=(1,\ldots,1;1), for some x\in G, then \pi_x=1 and consequently :\forall i \in \: \qquad 1=u_x(i)=g_^xg_i=g_i^xg_i. Finally, an application of the inverse inner automorphism with g_i yields x =1 , as required for injectivity. Remark. The monomial representation of the theorem stands in contrast to the permutation representation, which cannot be injective if , G, > n!. Remark. Whereas Huppert 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. Let G be a group with nested subgroups K\le H\le G such that (G:H)=n, (H:K)=m and (G:K)=(G:H)\cdot (H:K)=nm < \infty. Then the Artin transfer T_ is the compositum of the induced transfer \tilde_: H/H'\to K/K' and the Artin transfer T_, that is: :(9)\quad T_=\tilde_\circ T_. If (g_1,\ldots,g_n) is a left transversal of H in G and (h_1,\ldots,h_m) is a left transversal of K in H, that is G=\sqcup_^n g_iH and H=\sqcup_^m h_jK, then :G=\bigsqcup_^n \bigsqcup_^m g_ih_jK is a disjoint left coset decomposition of G with respect to K. Given two elements x\in G and y\in H, there exist unique permutations \pi_x\in S_n, and \sigma_y\in S_m, such that :\begin u_x(i) & :=g_^xg_i\in H && \text 1\le i\le n \\ v_y(j) & :=h_^yh_j\in K && \text 1\le j\le m \end Then, anticipating the definition of the induced transfer, we have :\begin T_(x) &=\prod_^n u_x(i)\cdot H' \\ \tilde_(y\cdot H') &=T_(y)=\prod_^m v_y(j)\cdot K' \end For each pair of subscripts 1\le i\le n and 1\le j\le m, we put y_i:=u_x(i), and we obtain :xg_ih_j=g_g_^xg_ih_j=g_u_x(i)h_j=g_y_ih_j =g_h_h_^ y_ih_j =g_h_v_(j), resp. :h_^g_^xg_ih_j=v_(j). Therefore, the image of x under the Artin transfer T_ is given by :\begin T_(x) &=\prod_^n \prod_^m v_(j)\cdot K' \\ &=\prod_^n \prod_^m h_^g_^xg_ih_j\cdot K' \\ &=\prod_^n \prod_^m h_^u_x(i)h_j\cdot K' \\ &=\prod_^n \prod_^m h_^y_ih_j\cdot K' \\ &=\prod_^n \tilde_ \left (y_i\cdot H' \right ) \\ &=\tilde_ \left (\prod_^n y_i\cdot H' \right ) \\ &=\tilde_ \left (\prod_^n u_x(i)\cdot H' \right ) \\ &=\tilde_(T_(x)) \end Finally, we want to emphasize the structural peculiarity of the ''monomial representation'' :\beginG\to K^\times S_ \\ x\mapsto (k_x(1,1),\ldots,k_x(n,m);\gamma_x) \end which corresponds to the composite of Artin transfers, defining :k_x(i,j):= \left ((gh)_ \right)^x(gh)_\in K for a permutation \gamma_x\in S_, and using the symbolic notation (gh)_:=g_ih_j for all pairs of subscripts 1\le i\le n, 1\le j\le m. The preceding proof has shown that :k_x(i,j)=h_^g_^xg_ih_j. Therefore, the action of the permutation \gamma_x on the set ,ntimes ,m/math> is given by \gamma_x (i,j) =(\pi_x(i), \sigma_(j)). The action on the second component j depends on the first component i (via the permutation \sigma_\in S_m), whereas the action on the first component i is independent of the second component j. Therefore, the permutation \gamma_x\in S_ can be identified with the multiplet :(\pi_x;\sigma_,\ldots,\sigma_)\in S_n\times S_m^n, which will be written in twisted form in the next section.


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

The permutations \gamma_x, which arose as second components of the ''monomial representation'' :\begin G\to K\wr S_ \\ x\mapsto (k_x(1,1),\ldots,k_x(n,m);\gamma_x) \end in the previous section, are of a very special kind. They belong to the ''stabilizer'' of the natural equipartition of the set ,ntimes ,m/math> 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 S_m\wr S_n of the symmetric groups S_m and S_n with respect to the set \, whose underlying set S_m^n\times S_n is endowed with the following ''law of composition'': :\begin (10)\quad \forall x,z\in G: \qquad \gamma_x\cdot\gamma_z &=(\sigma_,\ldots,\sigma_;\pi_x)\cdot (\sigma_,\ldots,\sigma_;\pi_z)\\ &=(\sigma_\circ\sigma_,\ldots,\sigma_\circ\sigma_;\pi_x\circ \pi_z) \\ &=(\sigma_,\ldots,\sigma_;\pi_) \\ &=\gamma_ \end This law reminds of the ''chain rule'' D(g\circ f)(x)=D(g)(f(x))\circ D(f)(x) for the ''Fréchet derivative'' in x\in E of the compositum of ''differentiable'' functions f: E\to F and g: F\to G between ''complete normed spaces''. The above considerations establish a third representation, the ''stabilizer representation'', :\begin G\to S_m\wr S_n \\ x\mapsto(\sigma_,\ldots,\sigma_;\pi_x) \end of the group G in the ''wreath product'' S_m\wr S_n, 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 :\begin G\to S_m\wr S_n \\ x\mapsto\gamma_=(\sigma_,\ldots,\sigma_;\pi_x) \end of the group G in the wreath product S_m\wr S_n of symmetric groups is a group homomorphism.


Cycle decomposition

Let (g_1,\ldots,g_n) be a left transversal of a subgroup H of finite index n in a group G and x \mapsto \pi_x be its associated permutation representation. Theorem. Suppose the permutation \pi_x decomposes into pairwise disjoint (and thus commuting) cycles \zeta_1, \ldots, \zeta_t \in S_n of lengths f_1, \ldots f_t, which is unique up to the ordering of the cycles. More explicitly, suppose :(11)\quad \left (g_jH, g_H, g_H, \ldots, g_H \right )= \left (g_jH, xg_jH, x^2g_jH, \ldots, x^ g_jH \right ), for 1\le j\le t, and f_1 + \cdots+ f_t=n. Then the image of x\in G under the Artin transfer is given by :(12)\quad T_(x)=\prod_^t g_j^x^g_j\cdot H'. Define \ell_ :=x^kg_j for 0\le k\le f_j-1 and 1\le j\le t. This is a left transversal of H in G since :(13)\quad G=\bigsqcup_^t \bigsqcup_^ x^kg_jH is a disjoint decomposition of G into left cosets of H. Fix a value of 1\le j\le t. Then: :\begin x\ell_ &=xx^kg_j=x^g_j=\ell_\in\ell_H && \forall k \in \ \\ x\ell_ &=xx^g_j=x^g_j\in g_jH=\ell_H \end Define: :\begin u_x(j,k) &:=\ell_^x\ell_=1\in H && \forall k \in \ \\ u_x(j,f_j-1) &:=\ell_^x\ell_=g_j^x^g_j\in H \end Consequently, :T_(x)=\prod_^t \prod_^ u_x(j,k)\cdot H'=\prod_^t \left (\prod_^ 1 \right )\cdot u_x(j,f_j-1)\cdot H'=\prod_^t g_j^x^g_j\cdot H'. The cycle decomposition corresponds to a (\langle x\rangle, H)
double coset In group theory, a field of mathematics, a double coset is a collection of group elements which are equivalent under the symmetries coming from two subgroups. More precisely, let be a group, and let and be subgroups. Let act on by left multi ...
decomposition of G: :G=\bigsqcup_^t \langle x\rangle g_jH It was this cycle decomposition form of the transfer homomorphism which was given by E. Artin in his original 1929 paper.


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 x\in G, and there exists the quotient group G/H of order n. For an element x\in G , we let f:= \mathrm (xH) denote the order of the coset xH in G/H, and we let (g_1,\ldots,g_t) be a left transversal of the subgroup \langle x,H\rangle in G, where t=n/f. Theorem. Then the image of x\in G under the Artin transfer T_ is given by: :(14)\quad T_(x)=\prod_^t g_j^x^fg_j\cdot H'. \langle xH\rangle is a cyclic subgroup of order f in G/H, and a left transversal (g_1,\ldots,g_t) of the subgroup \langle x,H\rangle in G, where t=n/f and G=\sqcup_^t g_j\langle x,H\rangle is the corresponding disjoint left coset decomposition, can be refined to a left transversal g_jx^k (1\le j\le t,\ 0\le k\le f-1) with disjoint left coset decomposition: :(15)\quad G=\sqcup_^t \sqcup_^ g_jx^kH of H in G. Hence, the formula for the image of x under the Artin transfer T_ in the previous section takes the particular shape :T_(x)=\prod_^t g_j^x^fg_j\cdot H' with exponent f independent of j. Corollary. In particular, the inner transfer of an element x\in H is given as a symbolic power: :(16)\quad T_(x)=x^\cdot H' with the trace element :(17)\quad \mathrm_G(H)=\sum_^t g_j\in\Z /math> of H in G as symbolic exponent. The other extreme is the outer transfer of an element x\in G\setminus H which generates G/H, that is G=\langle x,H\rangle. It is simply an nth power :(18)\quad T_(x)=x^n\cdot H'. The inner transfer of an element x\in H, whose coset xH=H is the principal set in G/H of order f=1, is given as the symbolic power :T_(x)=\prod_^t g_j^xg_j\cdot H'=\prod_^t x^\cdot H'=x^\cdot H' with the trace element :\mathrm_G(H)=\sum_^t g_j\in\Z /math> of H in G as symbolic exponent. The outer transfer of an element x\in G\setminus H which generates G/H, that is G=\langle x,H \rangle, whence the coset xH is generator of G/H with orderf=n, is given as the nth power :T_(x)=\prod_^1 1^\cdot x^n\cdot 1\cdot H'=x^n\cdot H'. 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 G'\le H\le G between G and G'. For these intermediate groups we have the following lemma. Lemma. All subgroups containing the commutator subgroup are normal. Let G'\le H\le G. If H were not a normal subgroup of G, then we had x^Hx\not\subseteq H for some element x\in G\setminus H. This would imply the existence of elements h\in H and y\in G\setminus H such that x^hx=y, and consequently the commutator ,x h^x^hx =h^y would be an element in G\setminus H in contradiction to G'\le H. 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 H_1, \ldots, H_ 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 G'\supset G^p, and thus we have \Phi(G)=G^p\cdot G'=G'. For each 1\le i\le p+1, let T_i: G\to H_i/H_i' 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 x^p,y^p\in G'. For each of the maximal subgroups H_i, which are also normal we need a generator h_i with respect to G', and a generator t_i of a transversal (1,t_i,t_i^2,\ldots,t_i^) such that :\begin H_i &= \langle h_i,G' \rangle \\ G &= \langle t_i,H_i\rangle=\bigsqcup_^ t_i^jH_i \end A convenient selection is given by :(19)\quad \begin h_1=y \\ t_1=x \\ h_i=xy^ & 2\le i\le p+1 \\ t_i=y & 2\le i\le p+1 \end Then, for each 1\le i\le p+1 we use equations (16) and (18) to implement the inner and outer transfers: :\begin (20)\quad T_i(h_i) &= h_i^\cdot H_i'=h_i^\cdot H_i' = h_i\cdot \left ( t_i^h_it_i \right )\cdot \left ( t_i^h_it_i^2\right ) \cdots \left ( t_i^h_it_i^\right ) \cdot H_i'= \left (h_it_i^ \right )^p t_i^p\cdot H_i' \\ (21)\quad T_i(t_i) &= t_i^p\cdot H_i' \end, The reason is that in G/H_i, \mathrm(h_iH_i)=1 and \mathrm(t_iH_i)=p. The complete specification of the Artin transfers T_i also requires explicit knowledge of the derived subgroups H_i'. Since G' is a normal subgroup of index p in H_i, a certain general reduction is possible by H_i'= _i,H_i ',H_i(G')^, but a presentation of G must be known for determining generators of G'=\langle s_1, \ldots, s_n\rangle, whence :(22)\quad H_i'=(G')^=\langle s_1,h_i\ldots, _n,h_irangle.


Abelianization of type (''p''2,''p'')

Let G be a ''p''-group with abelianization G/G' of non-elementary abelian type (p^2,p). Then G has p+1 maximal subgroups H_1, \ldots, H_ of index p and p+1 subgroups U_1, \ldots, U_ of index p^2. For each i \in \ let :\begin T_: G &\to H_i/H_i' \\ T_: G &\to U_i/U_i' \end be the Artin transfer homomorphisms. Burnside's basis theorem asserts that the group G can be generated by two elements x,y such that x^,y^p\in G'. We begin by considering the first layer of subgroups. For each of the normal subgroups H_i, we select a generator :(23)\quad h_i=xy^ such that H_i=\langle h_i,G'\rangle. These are the cases where the factor group H_i/G' is cyclic of order p^2. However, for the distinguished maximal subgroup H_, for which the factor group H_/G' is bicyclic of type (p,p), we need two generators: :(24)\quad \begin h_=y \\ h_0=x^p \end such that H_=\langle h_,h_0,G'\rangle. Further, a generator t_i of a transversal must be given such that G=\langle t_i,H_i\rangle, for each 1\le i\le p+1. It is convenient to define :(25)\quad \begin t_i=y & 1\le i\le p \\ t_=x \end Then, for each 1\le i\le p+1, we have inner and outer transfers: :\begin (26)\quad T_(h_i) &=h_i^\cdot H_i'=h_i^\cdot H_i' = \left (h_it_i^ \right )^pt_i^p\cdot H_i' \\ (27)\quad T_(t_i) &=t_i^p\cdot H_i' \end since \mathrm(h_iH_i)=1 and \mathrm(t_iH_i)=p. Now we continue by considering the second layer of subgroups. For each of the normal subgroups U_i, we select a generator :(28)\quad \begin u_1=y \\ u_i=x^py^ & 2\le i\le p \\ u_=x^p \end such that U_i=\langle u_i,G'\rangle. Among these subgroups, the Frattini subgroup U_=\langle x^p, G' \rangle =G^p\cdot G' is particularly distinguished. A uniform way of defining generators t_i,w_i of a transversal such that G=\langle t_i,w_i,U_i\rangle, is to set :(29)\quad \begin t_i=x & 1\le i\le p \\ w_i=x^p & 1\le i\le p \\ t_=x \\ w_=y \end Since \mathrm(u_iU_i)=1, but on the other hand \mathrm(t_iU_i)=p^2 and \mathrm(w_iU_i)= p, for 1\le i\le p+1, with the single exception that \mathrm(t_U_)=p, we obtain the following expressions for the inner and outer transfers :\begin (30)\quad T_(u_i) &= u_i^\cdot U_i'=u_i^\cdot U_i' =\prod_^ \prod_^ (w_i^jt_i^k)^u_iw_i^jt_i^k\cdot U_i' \\ (31)\quad T_(t_i) &= t_i^\cdot U_i' \end exceptionally :\begin &(32)\quad T_ \left (t_ \right ) = \left (t_^p \right )^\cdot U_' \\ &(33)\quad T_(w_i) = \left (w_i^p \right )^\cdot U_i' && 1\le i\le p+1 \end The structure of the derived subgroups H_i' and U_i' 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 (H_i)_ denotes the family of all subgroups which contain G' and are therefore necessarily normal, enumerated by a finite index set I. For each i\in I, let T_i:=T_ be the Artin transfer from G to the abelianization H_i/H_i'. Definition. The family of normal subgroups \varkappa_H(G)=(\ker(T_i))_ is called the transfer kernel type (TKT) of G with respect to (H_i)_, and the family of abelianizations (resp. their abelian type invariants) \tau_H(G)=(H_i/H_i')_ is called the transfer target type (TTT) of G with respect to (H_i)_. 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 H_1, \ldots, H_ of index p. For i \in \ let T_i: G\to H_i/H_i' denote the Artin transfer homomorphism. Definition. The family of normal subgroups \varkappa_H(G)=(\ker(T_i))_ is called the transfer kernel type (TKT) of G with respect to H_1,\ldots,H_. Remark. For brevity, the TKT is identified with the multiplet (\varkappa(i))_, whose integer components are given by :\varkappa(i)=\begin0 & \ker(T_i)=G\\ j & \ker(T_i)=H_j \text 1\le j\le p+1\end Here, we take into consideration that each transfer kernel \ker(T_i) must contain the commutator subgroup G' of G, since the transfer target H_i/H_i' is abelian. However, the minimal case \ker(T_i)=G' cannot occur. Remark. A renumeration of the maximal subgroups K_i=H_ and of the transfers V_i=T_ by means of a permutation \pi\in S_ gives rise to a new TKT \lambda_K(G)=(\ker(V_i))_ with respect to K_1,\ldots,K_, identified with (\lambda(i))_, where :\lambda(i)=\begin0 & \ker(V_i)=G\\j & \ker(V_i)=K_j \text 1\le j\le p+1\end It is adequate to view the TKTs \lambda_K(G)\sim\varkappa_H(G) as equivalent. Since we have :K_ = \ker(V_i) = \ker(T_) = H_ = K_, the relation between \lambda and \varkappa is given by \lambda = \tilde^ \circ \varkappa \circ \pi. Therefore, \lambda is another representative of the orbit \varkappa^ of \varkappa under the action (\pi,\mu)\mapsto\tilde^\circ\mu\circ\pi of the symmetric group S_ on the set of all mappings from \ \to \, where the extension \tilde\in S_ of the permutation \pi\in S_ is defined by \tilde(0)=0, and formally H_0=G, K_0=G. Definition. The orbit \varkappa(G)=\varkappa^ of any representative \varkappa is an invariant of the ''p''-group G and is called its transfer kernel type, briefly TKT. Remark. Let \#\mathcal_0(G):=\#\ denote the counter of total transfer kernels \ker(T_i)=G, which is an invariant of the group G. In 1980, S. M. Chang and R. Foote proved that, for any odd prime p and for any integer 0\le n\le p+1, there exist metabelian ''p''-groups G having abelianization G/G' of type (p,p) such that \#\mathcal_0(G)=n. However, for p=2, there do not exist non-abelian 2-groups G with G/G'\simeq (2,2), which must be metabelian of maximal class, such that \#\mathcal_0(G)\ge 2. Only the elementary abelian 2-group G=C_2\times C_2 has \#\mathcal_0(G)=3. See Figure 5. In the following concrete examples for the counters \#\mathcal_0(G), and also in the remainder of this article, we use
identifiers An identifier is a name that identifies (that is, labels the identity of) either a unique object or a unique ''class'' of objects, where the "object" or class may be an idea, physical countable object (or class thereof), or physical noncountable ...
of finite ''p''-groups in the SmallGroups Library by H. U. Besche, B. Eick and E. A. O'Brien. For p=3, we have * \#\mathcal_0(G)=0 for the extra special group G=\langle 27,4\rangle of exponent 9 with TKT \varkappa=(1111) (Figure 6), * \#\mathcal_0(G)=1 for the two groups G\in\ with TKTs \varkappa\in\ (Figures 8 and 9), * \#\mathcal_0(G)=2 for the group G=\langle 243,3\rangle with TKT \varkappa=(0043) (Figure 4 in the article on descendant trees), * \#\mathcal_0(G)=3 for the group G=\langle 81,7\rangle with TKT \varkappa=(2000) (Figure 6), * \#\mathcal_0(G)=4 for the extra special group G=\langle 27,3\rangle of exponent 3 with TKT \varkappa=(0000) (Figure 6).


Abelianization of type (''p''2,''p'')

Let G be a ''p''-group with abelianization G/G' of non-elementary abelian type (p^2,p). Then G possesses p+1 maximal subgroups H_1, \ldots, H_ of index p and p+1 subgroups U_1, \ldots, U_ of index p^2. Assumption. Suppose :H_=\prod_^ U_j is the distinguished maximal subgroup and :U_=\bigcap_^ H_j is the distinguished subgroup of index p^2 which as the intersection of all maximal subgroups, is the Frattini subgroup \Phi(G) of G.


First layer

For each 1\le i\le p+1, let T_: G\to H_i/H_i' denote the Artin transfer homomorphism. Definition. The family \varkappa_(G)=(\ker(T_))_^ is called the first layer transfer kernel type of G with respect to H_1,\ldots,H_ and U_1,\ldots,U_, and is identified with (\varkappa_1(i))_^, where :\varkappa_1(i)=\begin0 & \ker(T_)=H_,\\j & \ker(T_)=U_j \text 1\le j\le p+1.\end Remark. Here, we observe that each first layer transfer kernel is of exponent p with respect to G' and consequently cannot coincide with H_j for any 1\le j\le p, since H_j/G' is cyclic of order p^2, whereas H_/G' is bicyclic of type (p,p).


Second layer

For each 1\le i\le p+1, let T_: G\to U_i/U_i' be the Artin transfer homomorphism from G to the abelianization of U_i. Definition. The family \varkappa_(G)=(\ker(T_))_^ is called the second layer transfer kernel type of G with respect to U_1,\ldots,U_ and H_1,\ldots,H_, and is identified with (\varkappa_2(i))_^, where :\varkappa_2(i)=\begin0 & \ker(T_)=G,\\j & \ker(T_)=H_j \text 1\le j\le p+1.\end


Transfer kernel type

Combining the information on the two layers, we obtain the (complete) transfer kernel type \varkappa_(G)=(\varkappa_(G);\varkappa_(G)) of the ''p''-group G with respect to H_1,\ldots,H_ and U_1,\ldots,U_. Remark. The distinguished subgroups H_ and U_=\Phi(G) are unique invariants of G and should not be renumerated. However, independent renumerations of the remaining maximal subgroups K_i=H_ (1\le i\le p) and the transfers V_=T_ by means of a permutation \tau\in S_p, and of the remaining subgroups W_i=U_ (1\le i\le p) of index p^2 and the transfers V_=T_ by means of a permutation \sigma\in S_p, give rise to new TKTs \lambda_(G)=(\ker(V_))_^ with respect to K_1,\ldots,K_ and W_1, \ldots, W_, identified with (\lambda_1(i))_^, where :\lambda_1(i)=\begin0 & \ker(V_)=K_,\\j & \ker(V_)=W_j \text 1\le j\le p+1,\end and \lambda_(G)=(\ker(V_))_^ with respect to W_1,\ldots,W_ and K_1,\ldots,K_, identified with (\lambda_2(i))_^, where :\lambda_2(i)=\begin0 & \ker(V_)=G,\\j & \ker(V_)=K_j \text 1\le j\le p+1.\end It is adequate to view the TKTs \lambda_(G)\sim\varkappa_(G) and \lambda_(G)\sim \varkappa_ (G) as equivalent. Since we have :\begin W_ &=\ker(V_)=\ker(T_)=U_=W_ \\ K_ &=\ker(V_)=\ker(T_)=H_=K_ \end the relations between \lambda_1 and \varkappa_1, and \lambda_2 and \varkappa_2, are given by :\lambda_1=\tilde^\circ\varkappa_1\circ\hat :\lambda_2=\tilde^ \circ\varkappa_2\circ\hat Therefore, \lambda=(\lambda_1,\lambda_2) is another representative of the orbit \varkappa^ of \varkappa=(\varkappa_1,\varkappa_2) under the action: :((\sigma,\tau),(\mu_1,\mu_2))\mapsto \left (\tilde^\circ\mu_1\circ\hat\tau, \tilde^\circ \mu_2\circ \hat\sigma \right ) of the product of two symmetric groups S_p\times S_p on the set of all pairs of mappings \ \to \, where the extensions \hat\in S_ and \tilde\in S_ of a permutation \pi\in S_p are defined by \hat(p+1)=\tilde(p+1)=p+1 and \tilde(0)=0, and formally H_0=K_0=G, K_=H_, U_0=W_0=H_, and W_=U_=\Phi(G). Definition. The orbit \varkappa(G)=\varkappa^ of any representative \varkappa=(\varkappa_1, \varkappa_2) is an invariant of the ''p''-group G and is called its transfer kernel type, briefly TKT.


Connections between layers

The Artin transfer T_: G\to U_i/U_i' is the composition T_=\tilde_\circ T_ of the induced transfer \tilde_: H_j/H_j'\to U_i/U_i' from H_j to U_i and the Artin transfer T_: G\to H_j/H_j'. There are two options regarding the intermediate subgroups * For the subgroups U_1,\ldots,U_p only the distinguished maximal subgroup H_ is an intermediate subgroup. * For the Frattini subgroup U_=\Phi(G) all maximal subgroups H_1,\ldots,H_ are intermediate subgroups. :This causes restrictions for the transfer kernel type \varkappa_2(G) of the second layer, since ::\ker(T_)=\ker(\tilde_\circ T_)\supset\ker(T_), :and thus ::\forall i \in \: \qquad \ker(T_)\supset\ker(T_). :But even ::\ker(T_)\supset \left \langle\bigcup_^ \ker(T_) \right \rangle. :Furthermore, when G=\langle x,y\rangle with x^p\notin G', y^p\in G', an element xy^ (1\le k\le p) of order p^2 with respect to G', can belong to \ker(T_) only if its pth power is contained in \ker(T_), for all intermediate subgroups U_i, and thus: xy^\in\ker(T_), for certain 1\le i,k\le p, enforces the first layer TKT singulet \varkappa_1(p+1)=p+1, but xy^\in\ker(T_), for some 1\le k\le p, even specifies the complete first layer TKT multiplet \varkappa_1=((p+1)^), that is \varkappa_1(j)=p+1, for all 1\le j\le p+1.


Inheritance from quotients

The common feature of all parent-descendant relations between finite ''p''-groups is that the parent \pi(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 \phi: G \to \tilde with \ker(\phi) = N. Then the group \tilde=\phi(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 \phi: G\to A is a homomorphism. Let \omega: G\to G/G' denote the canonical projection map. Then there exists a unique homomorphism \tilde: G/G'\to A such that \phi=\tilde\circ\omega and \ker(\tilde)=\ker(\phi)/G' (See Figure 1). Proof. This statement is a consequence of the second Corollary in the article on the
induced homomorphism In mathematics, especially in algebraic topology, an induced homomorphism is a homomorphism derived in a canonical way from another map. For example, a continuous map from a topological space ''X'' to a topological space ''Y'' induces a group homom ...
. Nevertheless, we give an independent proof for the present situation: the uniqueness of \tilde is a consequence of the condition \phi= \tilde\circ\omega, which implies for any x\in G we have: :\tilde(xG')=\tilde(\omega(x))=(\tilde\circ\omega)(x)=\phi(x), \tilde is a homomorphism, let x,y\in G be arbitrary, then: :\begin \tilde \left (xG'\cdot yG' \right ) &= \tilde((xy)G')=\phi(xy)=\phi(x)\cdot\phi(y)=\tilde(xG') \cdot \tilde(xG') \\ \phi( ,y &=\phi \left (x^y^xy \right )=\phi(x^)\phi(y^)\phi(x)\phi(y)= phi(x),\phi(y)1 && A \text \end Thus, the commutator subgroup G' \subset \ker(\phi), and this finally shows that the definition of \tilde is independent of the coset representative, :\begin xG'=yG' &\Longrightarrow y^x\in G'\subset \ker(\phi) \\ &\Longrightarrow 1 = \phi(y^x) = \tilde(y^xG')= \tilde(yG')^\cdot\tilde(xG')\\ &\Longrightarrow \tilde(xG')=\tilde(yG') \end


TTT singulets

:Proposition. Assume G, \tilde, \phi are as above and \tilde=\phi(H) is the image of a subgroup H. The commutator subgroup of \tilde is the image of the commutator subgroup of H. Therefore, \phi induces a unique epimorphism \tilde: H/H' \to \tilde/ \tilde', and thus \tilde/\tilde' is a quotient of H/H'. Moreover, if \ker(\phi)\le H', then the map \tilde is an isomorphism (See Figure 2). Proof. This claim is a consequence of the Main Theorem in the article on the
induced homomorphism In mathematics, especially in algebraic topology, an induced homomorphism is a homomorphism derived in a canonical way from another map. For example, a continuous map from a topological space ''X'' to a topological space ''Y'' induces a group homom ...
. Nevertheless, an independent proof is given as follows: first, the image of the commutator subgroup is :\phi(H')=\phi( H,H=\phi(\langle u,v, u,v\in H\rangle)=\langle \phi(u),\phi(v)mid u,v\in H\rangle= \phi(H),\phi(H)\phi(H)'=\tilde'. Second, the epimorphism \phi can be restricted to an epimorphism \phi, _H: H\to\tilde. According to the previous section, the composite epimorphism (\omega_\circ\phi, _H): H\to\tilde/\tilde' factors through H/H' by means of a uniquely determined epimorphism \tilde: H/H'\to\tilde/\tilde' such that \tilde\circ\omega_H=\omega_\circ\phi, _H. Consequently, we have \tilde/\tilde'\simeq (H/H')/\ker(\tilde). Furthermore, the kernel of \tilde is given explicitly by \ker(\tilde)=(H'\cdot\ker(\phi))/H'. Finally, if \ker(\phi)\le H', then \tilde is an isomorphism, since \ker (\tilde) =H'/H'=1. Definition. 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 \tilde/\tilde'\preceq H/H', when \tilde/\tilde'\simeq (H/H')/\ker(\tilde), and \tilde/\tilde'=H/H', when \tilde/\tilde'\simeq H/H'.


TKT singulets

:Proposition. Assume G, \tilde, \phi are as above and \tilde=\phi(H) is the image of a subgroup of finite index n. Let T_: G \to H/H' and T_ : \tilde \to \tilde/\tilde' be Artin transfers. If \ker(\phi)\le H, then the image of a left transversal of H in G is a left transversal of \tilde in \tilde, and \phi(\ker(T_)) \subset \ker(T_). Moreover, if \ker(\phi)\le H' then \phi(\ker(T_)) = \ker (T_) (See Figure 3). Proof. Let (g_1,\ldots,g_n) be a left transversal of H in G. Then we have a disjoint union: :G=\bigsqcup_^n g_iH. Consider the image of this disjoint union, which is not necessarily disjoint, :\phi(G)=\bigcup_^n \phi(g_i)\phi(H), and let j,k \in \. We have: :\begin \phi(g_j)\phi(H)=\phi(g_k)\phi(H) &\Longleftrightarrow \phi(H)=\phi(g_j)^ \phi(g_k)\phi(H)= \phi(g_j^g_k)\phi(H) \\ &\Longleftrightarrow \phi(g_j^g_k)=\phi(h) && \text h \in H \\ &\Longleftrightarrow \phi(h^g_j^g_k)=1 \\ &\Longleftrightarrow h^g_j^g_k \in \ker(\phi) \subset H \\ &\Longleftrightarrow g_j^g_k \in H \\ &\Longleftrightarrow j=k \\ \end Let \tilde: H/H'\to\tilde/\tilde' be the epimorphism from the previous proposition. We have: :\tilde(T_(x))=\tilde \left (\prod_^n g_^xg_i\cdot H' \right )=\prod_^n \phi \left (g_ \right )^\phi(x)\phi(g_i)\cdot\phi(H'). Since \phi(H')=\phi(H)'=\tilde', the right hand side equals T_(\phi(x)), if (\phi(g_1),\ldots,\phi(g_n)) is a left transversal of \tilde in \tilde, which is true when \ker(\phi)\subset H. Therefore, \tilde\circ T_=T_\circ\phi. Consequently, \ker(\phi)\subset H implies the inclusion :\phi(\ker(T_))\subset \ker(T_). Finally, if \ker(\phi)\subset H', then by the previous proposition \tilde is an isomorphism. Using its inverse we get T_=\tilde^\circ T_\circ\phi, which proves :\phi^ \left (\ker(T_) \right )\subset \ker(T_). Combining the inclusions we have: :\begin \begin \phi(\ker(T_))\subset \ker(T_) \\ \phi^ \left (\ker(T_) \right )\subset \ker(T_)\end &\Longrightarrow \begin \phi(\ker(T_))\subset \ker(T_) \\ \phi \left (\phi^ \left (\ker(T_) \right ) \right )\subset \phi(\ker(T_))\end \\ pt&\Longrightarrow \phi \left (\phi^ \left (\ker(T_) \right ) \right )\subset \phi(\ker(T_)) \subset \ker(T_) \\ pt&\Longrightarrow \ker(T_) \subset \phi(\ker(T_)) \subset \ker(T_) \\ pt&\Longrightarrow \phi(\ker(T_))=\ker(T_) \end Definition. In view of the results in the present section, we are able to define a partial order of transfer kernels by setting \ker(T_)\preceq\ker(T_), when \phi(\ker(T_)) \subset \ker(T_).


TTT and TKT multiplets

Assume G, \tilde, \phi are as above and that G/G' and \tilde/\tilde' are isomorphic and finite. Let (H_i)_ denote the family of all subgroups containing G' (making it a finite family of normal subgroups). For each i\in I let: :\begin \tilde &:= \phi (H_i) \\ T_i &:= T_: G \to H_i/H_i' \\ \tilde &:= T_: \tilde \to \tilde /\tilde' \end Take J be any non-empty subset of I. Then it is convenient to define \varkappa_H(G)=(\ker(T_j))_, called the (partial) transfer kernel type (TKT) of G with respect to (H_j)_, and \tau_H(G)=(H_j/H_j')_, called the (partial) transfer target type (TTT) of G with respect to (H_j)_. 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(\phi)\le \cap_ H_j, then \tau_(\tilde)\preceq\tau_H(G), in the sense that \tilde/\tilde'\preceq H_j/H_j', for each j\in J, and \varkappa_H(G) \preceq \varkappa_ (\tilde), in the sense that \ker(T_j)\preceq\ker(\tilde), for each j\in J. :Inheritance Law II. If \ker(\phi)\le \cap_ H_j', then \tau_(\tilde)=\tau_H(G), in the sense that \tilde/\tilde'=H_j/H_j', for each j\in J, and \varkappa_H(G)=\varkappa_(\tilde), in the sense that \ker(T_j)=\ker(\tilde), for each j\in J.


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, \tilde, \phi are as above and \sigma\in\mathrm(G). If \sigma (\ker(\phi)) \subset\ker(\phi) then there exists a unique epimorphism \tilde: \tilde \to \tilde such that \phi\circ\sigma=\tilde\circ\phi. If \sigma (\ker(\phi))= \ker(\phi), then \tilde \in\mathrm(\tilde). Proof. Using the isomorphism \tilde=\phi(G)\simeq G/\ker(\phi) we define: :\begin \tilde: \tilde \to \tilde \\ \tilde(g\ker(\phi)) := \sigma(g) \ker(\phi) \end First we show this map is well-defined: :\begin g\ker(\phi)=h\ker(\phi) &\Longrightarrow h^g\in\ker(\phi) \\ &\Longrightarrow \sigma(h^g)\in \sigma (\ker(\phi)) \\ &\Longrightarrow \sigma(h^g)\in \ker(\phi) && \sigma (\ker(\phi)) \subset \ker(\phi) \\ &\Longrightarrow \sigma(h^)\sigma(g)\in \ker(\phi) \\ &\Longrightarrow \sigma(g) \ker(\phi) =\sigma(h)\ker(\phi) \end The fact that \tilde is surjective, a homomorphism and satisfies \phi\circ\sigma=\tilde\circ\phi are easily verified. And if \sigma(\ker(\phi))=\ker(\phi), then injectivity of \tilde is a consequence of :\begin \tilde(g\ker(\phi)) = \ker(\phi) &\Longrightarrow \sigma(g)\ker(\phi)=\ker(\phi) \\ &\Longrightarrow \sigma(g)\in\ker(\phi) \\ &\Longrightarrow \sigma^(\sigma(g))\in \sigma^(\ker(\phi)) \\ &\Longrightarrow g \in \sigma^(\ker(\phi)) \\ &\Longrightarrow g \in \ker(\phi) && \sigma^(\ker(\phi))\subset \ker(\phi) \\ &\Longrightarrow g \ker(\phi) = \ker(\phi) \end Let \omega: G\to G/G' be the canonical projection then there exists a unique induced automorphism \bar\in\mathrm(G/G') such that \omega\circ\sigma =\bar \circ \omega, that is, :\forall g \in G: \qquad \bar(gG')=\bar(\omega(g))=\omega(\sigma(g))=\sigma(g)G', The reason for the injectivity of \bar is that :\sigma(g)G'=\bar(gG')=G' \Rightarrow \sigma(g)\in G' \Rightarrow g=\sigma^(\sigma(g))\in G', since G' is a characteristic subgroup of G. Definition. G is called a ''σ''−group, if there exists \sigma\in\mathrm(G) such that the induced automorphism acts like the inversion on G/G', that is for all :g \in G: \qquad \sigma(g)G'=\bar(gG')=g^G' \Longleftrightarrow \sigma(g)g\in G'. The Inheritance Law III asserts that, if G is a ''σ''−group and \sigma (\ker(\phi)) =\ker(\phi), then \tilde is also a ''σ''−group, the required automorphism being \tilde. This can be seen by applying the epimorphism \phi to the equation \sigma(g)G'=\bar(gG')=g^G' which yields :\forall x=\phi(g)\in\phi(G)=\tilde: \qquad \tilde(x)\tilde'=\tilde(\phi(g))\tilde' =\phi (\sigma(g))\phi(G') =\phi(g^) \phi(G')= \phi(g)^\tilde'=x^\tilde'.


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 \pi(G) of a group G is the quotient \pi(G)=G/N of G by the last non-trivial term N=\gamma_c(G)\triangleleft G of the lower central series of G, where c denotes the nilpotency class of G. The corresponding epimorphism \pi from G onto \pi(G)=G/\gamma_c(G) is the canonical projection, whose kernel is given by \ker(\pi)=\gamma_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=\mathrm(G)\ge 2. Then the TTT and the TKT of G and of its parent \pi(G) are comparable in the sense that \tau(\pi(G))\preceq\tau(G) and \varkappa(G)\preceq\varkappa(\pi(G)). The simple reason for this fact is that, for any subgroup G'\le H\le G, we have \ker(\pi)=\gamma_c(G) \le\gamma_2(G)=G'\le H, since c\ge 2. 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 \mathrm(G)=1 and of nilpotency class c=\mathrm(G)\ge 3 shares the last p components of the TTT \tau(G) and of the TKT \varkappa(G) with its parent \pi(G). More explicitly, for odd primes p\ge 3, we have \tau(G)_i=(p,p) and \varkappa(G)_i=0 for 2\le i\le p+1. This criterion is due to the fact that c\ge 3 implies \ker(\pi)=\gamma_c(G)\le\gamma_3(G)=H_i', for the last p maximal subgroups H_2,\ldots,H_ of G. The condition c\ge 3 is indeed necessary for the partial stabilization criterion. For odd primes p\ge 3, the extra special p-group G=G^3_0(0,1) of order p^3 and exponent p^2 has nilpotency class c=2 only, and the last p components of its TKT \varkappa=(1^) are strictly smaller than the corresponding components of the TKT \varkappa=(0^) of its parent \pi(G) which is the elementary abelian p-group of type (p,p). For p=2, both extra special 2-groups of coclass 1 and class c=2, the ordinary quaternion group G=G^3_0(0,1) with TKT \varkappa=(123) and the dihedral group G=G^3_0(0,0) with TKT \varkappa=(023), have strictly smaller last two components of their TKTs than their common parent \pi(G)=C_2\times C_2 with TKT \varkappa=(000). Total stabilization for maximal class and positive defect. A metabelian ''p''-group G of coclass \mathrm(G)=1 and of nilpotency class c=m-1=\mathrm(G)\ge 4, that is, with index of nilpotency m\ge 5, shares all p+1 components of the TTT \tau(G) and of the TKT \varkappa(G) with its parent \pi(G), provided it has positive defect of commutativity k=k(G)\ge 1. Note that k\ge 1 implies p\ge 3, and we have \varkappa(G)_i=0 for all 1\le i\le p+1. This statement can be seen by observing that the conditions m\ge 5 and k\ge 1 imply \ker(\pi)=\gamma_(G)\le\gamma_(G)\le H_i', for all the p+1 maximal subgroups H_1,\ldots,H_ of G. The condition k\ge 1 is indeed necessary for total stabilization. To see this it suffices to consider the first component of the TKT only. For each nilpotency class c\ge 4, there exist (at least) two groups G=G^_0(0,1) with TKT \varkappa=(10^p) and G=G^_0(1,0) with TKT \varkappa=(20^p), both with defect k=0, where the first component of their TKT is strictly smaller than the first component of the TKT \varkappa=(0^) of their common parent \pi(G)=G^c_0(0,0). Partial stabilization for non-maximal class. Let p=3 be fixed. A metabelian 3-group G with abelianization G/G'\simeq (3,3), coclass \mathrm(G)\ge 2 and nilpotency class c=\mathrm(G)\ge 4 shares the last two (among the four) components of the TTT \tau(G) and of the TKT \varkappa(G) with its parent \pi(G). This criterion is justified by the following consideration. If c\ge 4, then \ker(\pi)=\gamma_c(G)\le\gamma_4(G)\le H_i' for the last two maximal subgroups H_3,H_4 of G. The condition c\ge 4 is indeed unavoidable for partial stabilization, since there exist several 3-groups of class c=3, for instance those with SmallGroups
identifiers An identifier is a name that identifies (that is, labels the identity of) either a unique object or a unique ''class'' of objects, where the "object" or class may be an idea, physical countable object (or class thereof), or physical noncountable ...
G\in\, such that the last two components of their TKTs \varkappa\in\ are strictly smaller than the last two components of the TKT \varkappa=(0000) of their common parent \pi(G)=G^3_0(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'\simeq (3,3), coclass \mathrm(G)\ge 2, nilpotency class c=\mathrm(G)\ge 4 and cyclic centre \zeta_1(G) shares all four components of the TTT \tau(G) and of the TKT \varkappa(G) with its parent \pi(G). The reason is that, due to the cyclic centre, we have \ker(\pi)=\gamma_c(G)=\zeta_1(G)\le H_i' for all four maximal subgroups H_1,\ldots,H_4 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 \gamma_c(G)=\zeta_1(G) is also bicyclic, whence \gamma_c(G) is never contained in H_2', or \gamma_c(G)<\zeta_1(G) is cyclic but is never contained in H_1'. 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 In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ...
and in
algebraic number theory Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic ob ...
.


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 \mathcal(7). The initial pre-period consists of branches \mathcal(5) and \mathcal(6) with exceptional structure. Branches \mathcal(7) and \mathcal(8) form the primitive period such that \mathcal(j)\simeq\mathcal(7), for odd j\ge 9, and \mathcal(j)\simeq\mathcal(8), for even j\ge 10. The root of the tree is the metabelian 3-group with
identifier An identifier is a name that identifies (that is, labels the identity of) either a unique object or a unique ''class'' of objects, where the "object" or class may be an idea, physical countable object (or class thereof), or physical noncountable ...
R=\langle 243,6\rangle, that is, a group of order , R, =3^5=243 and with counting number 6. This root is not coclass settled, whence its entire descendant tree \mathcal(R) is of considerably higher complexity than the coclass-2 subtree \mathcal^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) \varkappa, and the vertical ordinate is labelled with a single component \tau(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 \tau= A(3,c),(3,3,3),(9,3),(9,3)/math> with varying first component \tau(1)=A(3,c), the nearly homocyclic abelian 3-group of order 3^c, and fixed further components \tau(2)=(3,3,3)\hat(1^3) and \tau(3)=\tau(4)=(9,3)\hat(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 3^n and the nilpotency class is given by c=n-2.


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 \sigma-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 \sigma-groups in Figure 4 nor to eliminate all groups with TKT \varkappa=(0122). In Figure 4, the big double contour rectangle surrounds the pruned coclass tree \mathcal^2_(R), where the numerous vertices with TKT \varkappa=(2122) are completely eliminated. This would, for instance, be useful for searching a \sigma-group with TKT \varkappa=(1122) and first component \tau(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 tried to determine the Galois group G=\mathrm_3^(K)=\mathrm(\mathrm_3^(K), K) of the Hilbert 3-class field tower, that is the maximal unramified pro-3 extension \mathrm_3^(K), of the complex quadratic number field K=\Q(\sqrt). They actually succeeded in finding the maximal metabelian quotient Q=G/G''=\mathrm_3^2(K)=\mathrm(\mathrm_3^2(K), K) of G, that is the Galois group of the second Hilbert 3-class field \mathrm_3^2(K) of K. However, it needed 78 years until M. R. Bush and D. C. Mayer, in 2012, provided the first rigorous proof that the (potentially infinite) 3-tower group G=\mathrm_3^(K) coincides with the finite 3-group \mathrm_3^3(K)=\mathrm(\mathrm_3^3(K), K) of derived length \mathrm(G)=3, and thus the 3-tower of K has exactly three stages, stopping at the third Hilbert 3-class field \mathrm_3^3(K) of K. The search is performed with the aid of the ''p''-group generation algorithm by M. F. Newman and E. A. O'Brien. 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=r_3(K)=d(\mathrm_3(K)) is given by the 3-class rank of the quadratic field K. Secondly, the abelian type invariants of the 3-class group \mathrm_3(K)\simeq (1^2) 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 An identifier is a name that identifies (that is, labels the identity of) either a unique object or a unique ''class'' of objects, where the "object" or class may be an idea, physical countable object (or class thereof), or physical noncountable ...
\langle 9,2\rangle, and to construct the descendant tree \mathcal(\langle 9,2\rangle). 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 \varkappa\in\ (exactly two fixed points and no transposition) and \tau= (21)(32)(21)(21)/math>. Further, any quotient of G must be a \sigma-group, enforced by number theoretic requirements for the quadratic field K. The root \langle 9,2\rangle has only a single capable descendant \langle 27,3\rangle of type (1^2). In terms of the nilpotency class, \langle 9,2\rangle is the class-1 quotient G/\gamma_2(G) of G and \langle 27,3\rangle is the class-2 quotient G/\gamma_3(G) of G. Since the latter has nuclear rank two, there occurs a bifurcation \mathcal(\langle 27,3\rangle)=\mathcal^1(\langle 27,3\rangle)\sqcup\mathcal^2(\langle 27,3\rangle), where the former component \mathcal^1(\langle 27,3\rangle) can be eliminated by the stabilization criterion \varkappa=(\ast 000) for the TKT of all 3-groups of maximal class. Due to the inheritance property of TKTs, only the single capable descendant \langle 243,8\rangle qualifies as the class-3 quotient G/\gamma_4(G) of G. There is only a single capable \sigma-group \langle 729,54\rangle among the descendants of \langle 243,8\rangle. It is the class-4 quotient G/\gamma_5(G) of G and has nuclear rank two. This causes the essential bifurcation \mathcal(\langle 729,54\rangle)=\mathcal^2(\langle 729,54\rangle)\sqcup\mathcal^3(\langle 729,54\rangle) in two subtrees belonging to different coclass graphs \mathcal(3,2) and \mathcal(3,3). The former contains the metabelian quotient Q=G/G'' of G with two possibilities Q\in\, 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 \sigma-groups \langle 729,54\rangle-\#2;2 and \langle 729,54\rangle-\#2;6 with r=2=d. Finally the termination criterion is reached at the capable vertices \langle 2187,303\rangle-\#1;1\in\mathcal(3,2) and \langle 729,54\rangle-\#2;3-\#1;1\in\mathcal(3,3), since the TTT \tau= (21)(3^2)(21)(21) (21)(32)(21)(21)/math> is too big and will even increase further, never returning to (21)(32)(21)(21)/math>. The complete search process is visualized in Table 1, where, for each of the possible successive ''p''-quotients P_c=G/\gamma_(G) of the 3-tower group G=\mathrm_3^(K) of K=\Q(\sqrt), the nilpotency class is denoted by c=\mathrm(P_c), the nuclear rank by \nu=\nu(P_c), and the ''p''-multiplicator rank by \mu=\mu(P_c).


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: \beginG^(z,w)= & \langle x,y,s_2,t_3,s_3,\ldots,s_c \mid \\ & x^3=s_c^w,\ y^3=s_3^2s_4s_c^z,\ s_j^3=s_^2s_\text2\le j\le c-3,\ s_^3=s_c^2,\ t_3^3=1,\\ & s_2= y,x\ t_3= s_2,y\ s_j= s_,xtext3\le j\le c\rangle,\end where c\ge 5 is the nilpotency class, 3^n with n=c+2 is the order, and 0\le w\le 1, -1\le z\le 1 are parameters. The transfer target type (TTT) of the group G=G^(z,w) depends only on the nilpotency class c, is independent of the parameters w,z, and is given uniformly by \tau= A(3,c),(3,3,3),(9,3),(9,3)/math>. This phenomenon is called a polarization, more precisely a uni-polarization, at the first component. The transfer kernel type (TKT) of the group G=G^(z,w) is independent of the nilpotency class c, but depends on the parameters w,z, and is given by c.18, \varkappa=(0122), for w=z=0 (a mainline group), H.4, \varkappa=(2122), for w=0,z=\pm 1 (two capable groups), E.6, \varkappa=(1122), for w=1,z=0 (a terminal group), and E.14, \varkappa\in\, for w=1,z=\pm 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,x1 for a\in\ and a,y1 for a\in\, which shows that the bicyclic centre is given by \zeta_1(G)=\langle s_c,t_3\rangle. By means of the right product rule a,xy a,ycdot a,xcdot a,xy] and the right power rule a,y^2 a,y, we obtain s_2,xys_3t_3, s_2,xy^2s_3t_3^2, and s_j,xy s_j,xy^2 s_j,xs_, for j\ge 3. The maximal subgroups of G are taken in a similar way as in the section on the computational implementation, namely :\begin H_1 &=\langle y,G'\rangle \\ H_2 &=\langle x,G'\rangle \\ H_3 &=\langle xy,G'\rangle \\ H_4 &=\langle xy^2,G'\rangle \\ \end Their derived subgroups are crucial for the behavior of the Artin transfers. By making use of the general formula H_i'=(G')^, where H_i=\langle h_i,G'\rangle, and where we know that G'=\langle s_2, t_3, s_3, \ldots, s_c\rangle in the present situation, it follows that :\begin H_1' &=\left \langle s_2^ \right \rangle= \left \langle t_3 \right \rangle \\ H_2' &=\left \langle s_2^,\ldots,s_^\right \rangle=\left \langle s_3,\ldots,s_c\right \rangle \\ H_3' &=\left \langle s_2^,\ldots,s_^\right \rangle=\left \langle s_3t_3,s_4,\ldots,s_c\right \rangle \\ H_4' &=\left \langle s_2^,\ldots,s_^\right \rangle=\left \langle s_3t_3^2,s_4,\ldots,s_c \right \rangle \end Note that H_1 is not far from being abelian, since H_1'=\langle t_3\rangle is contained in the centre \zeta_1(G)=\langle s_c,t_3\rangle. As the first main result, we are now in the position to determine the abelian type invariants of the derived quotients: :H_1/H_1'=\langle y,s_2,\ldots,s_c\rangle H_1'/H_1'\simeq A(3,c), the unique quotient which grows with increasing nilpotency class c, since \mathrm(y)=\mathrm(s_2) =3^m for even c=2m and \mathrm(y)=3^,\mathrm(s_2)=3^m for odd c=2m+1, :\begin H_2/H_2' &=\langle x,s_2,t_3\rangle H_2'/H_2'\simeq (3,3,3) \\ H_3/H_3' &=\langle xy,s_2,t_3\rangle H_3'/H_3'\simeq (9,3) \\ H_4/H_4' &=\langle xy^2,s_2,t_3\rangle H_4'/H_4'\simeq (9,3) \end since generally \mathrm(s_2)=\mathrm(t_3)=3, but \mathrm(x)=3 for H_2, whereas \mathrm(xy)=\mathrm(xy^2)=9 for H_3 and H_4. Now we come to the kernels of the Artin transfer homomorphisms T_i: G\to H_i/H_i'. It suffices to investigate the induced transfers \tilde_i: G/G'\to H_i/H_i' and to begin by finding expressions for the images \tilde_i(gG') of elements gG'\in G/G', which can be expressed in the form :g\equiv x^j y^ \pmod, \qquad j, \ell \in \. First, we exploit outer transfers as much as possible: :\begin x \notin H_1 &\Rightarrow \tilde_1(xG')=x^3H_1'=s_c^wH_1' \\ y \notin H_2 &\Rightarrow \tilde_2(yG')=y^3H_2'=s_3^2s_4s_c^zH_2'=1\cdot H_2' \\ x,y \notin H_3,H_4 &\Rightarrow \begin \tilde_i(xG')=x^3H_i'=s_c^wH_i'=1\cdot H_i' \\ \tilde_i(yG') =y^3H_i'=s_3^2s_4s_c^zH_i'=s_3^2H_i'\end && 3\le i\le 4 \end Next, we treat the unavoidable inner transfers, which are more intricate. For this purpose, we use the polynomial identity :X^2+X+1=(X-1)^2+3(X-1)+3 to obtain: :\begin y\in H_1 &\Rightarrow \tilde_1(yG')=y^H_1'=y^H_1'=y^3\cdot y,x3\cdot y,xx.html" ;"title="y,xx">y,xxH_1' = s_3^2s_4s_c^zs_2^3s_3H_1'=s_2^3s_3^3s_4s_c^zH_1'=s_c^zH_1' \\ x\in H_2 &\Rightarrow \tilde_2(xG')=x^H_2'=x^H_2'=x^3\cdot x,y3\cdot x,yy] H_2'=s_c^ws_2^t_3^H_2'=t_3^H_2' \end Finally, we combine the results: generally :\tilde_i(gG')=\tilde_i(xG')^j\tilde_i(yG')^, and in particular, :\begin \tilde_1(gG') &=s_c^H_1' \\ \tilde_2(gG') &=t_3^H_2' \\ \tilde_i(gG') &=s_3^H_i' && 3\le i\le 4 \end To determine the kernels, it remains to solve the equations: :\begin s_c^H_1'=H_1' &\Rightarrow \begin \text j, \ell \text w=z=0 \\ \ell=0, \text j \text w=0,z=\pm 1 \\ j=0, \text \ell \text w=1,z=0 \\ j=\mp \ell, w=1,z=\pm 1 \end \\ t_3^H_2'=H_2' &\Rightarrow j=0 \text \ell \\ s_3^H_i'=H_i' &\Rightarrow \ell=0 \text j && 3\le i\le 4 \end The following equivalences, for any 1\le i\le 4, finish the justification of the statements: * j,\ell both arbitrary \Leftrightarrow \ker(T_i)=\langle x,y,G'\rangle=G \Leftrightarrow \varkappa(i)=0. * j=0 with arbitrary \ell \Leftrightarrow \ker(T_i)=\langle y,G'\rangle=H_1 \Leftrightarrow \varkappa(i)=1, * \ell=0 with arbitrary j \Leftrightarrow \ker(T_i)=\langle x,G'\rangle=H_2 \Leftrightarrow \varkappa(i)=2, * j=\ell \Leftrightarrow \ker(T_i)=\langle xy,G'\rangle=H_3 \Leftrightarrow \varkappa(i)=3, * j=-\ell \Leftrightarrow \ker(T_i)=\langle xy^,G'\rangle=H_4 \Leftrightarrow \varkappa(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\in\. The trees are arranged according to increasing coclass r\ge 1 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, :* \sigma-groups. We refrain from giving justifications for invariants, since the way how invariants are derived from presentations was demonstrated exemplarily in the section on Artin transfer (group theory)#Commutator calculus, commutator calculus


Coclass 1

For each prime p\in\, the unique tree of ''p''-groups of maximal class is endowed with information on TTTs and TKTs, that is, \mathcal^1(\langle 4,2\rangle) for p=2, \mathcal^1(\langle 9,2\rangle) for p=3, and \mathcal^1 (\langle 25,2\rangle) 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. \beginG^(z,w)= & \langle x,y,s_2,\ldots,s_c\mid \\ & x^2=s_c^w,\ y^2=s_c^z,\ s_j^2=s_s_\text2\le j\le c-2,\ s_^2=s_c,\\ & s_2= y,x\ s_j= s_,x s_,ytext3\le j\le c\rangle,\end where the nilpotency class is c\ge 3, the order is 2^n 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 \tau= 1^2),(1^2),A(2,c)/math>, only dependent on c and with cyclic A(2,c). The TKT depends on the parameters and is \varkappa=(210) for the dihedral mainline vertices with w=z=0, \varkappa=(213) for the terminal generalized quaternion groups with w=z=1, and \varkappa=(211) for the terminal semi dihedral groups with w=1,z=0. There are two exceptions, the abelian root with \tau= (1),(1),(1)/math> and \varkappa=(000), and the usual quaternion group with \tau= (2),(2),(2)/math> and \varkappa=(123). 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. \beginG^_a(z,w)= & \langle x,y,s_2,t_3,s_3,\ldots,s_c\mid \\ & x^3=s_c^w,\ y^3=s_3^2s_4s_c^z,\ t_3=s_c^a,\ s_j^3=s_^2s_\text2\le j\le c-3,\ s_^3=s_c^2,\\ & s_2= y,x\ t_3= s_2,y\ s_j= s_,xtext3\le j\le c\rangle,\end where the nilpotency class is c\ge 5, the order is 3^n 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 \tau= A(3,c-a),(1^2),(1^2),(1^2)/math>, only dependent on c and a. The TKT depends on the parameters and is \varkappa=(0000) for the mainline vertices with a=w=z=0, \varkappa=(1000) for the terminal vertices with a=0,w=1,z=0, \varkappa=(2000) for the terminal vertices with a=w=0,z=\pm 1, and \varkappa=(0000) for the terminal vertices with a=1,w\in\,z=0. There exist three exceptions, the abelian root with \tau= (1),(1),(1),(1)/math>, the extra special group of exponent 9 with \tau= (1^2),(2),(2),(2)/math> and \varkappa=(1111), and the Sylow 3-subgroup of the alternating group A_9 with \tau= (1^3),(1^2),(1^2),(1^2)/math>. Mainline vertices and vertices on odd branches are \sigma-groups. 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. \beginG^_a(z,w)= & \langle x,y,s_2,t_3,s_3,\ldots,s_c\mid \\ & x^5=s_c^w,\ y^5=s_c^z,\ t_3=s_c^a,\\ & s_2= y,x\ t_3= s_2,y\ s_j= s_,xtext3\le j\le c\rangle,\end where the nilpotency class is c\ge 3, the order is 5^n 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 \tau= A(5,c-k),(1^2)^5/math>, only dependent on c and the defect of commutativity k. The TKT depends on the parameters and is \varkappa=(0^6) for the mainline vertices with a=w=z=0, \varkappa=(10^5) for the terminal vertices with a=0,w=1,z=0, \varkappa=(20^5) for the terminal vertices with a=w=0, z\ne 0, and \varkappa=(0^6) for the vertices with a\ne 0. There exist three exceptions, the abelian root with \tau= 1)^6/math>, the extra special group of exponent 25 with \tau= 1^2),(2)^5/math> and \varkappa=(1^6), and the group \langle 15625,631\rangle with \tau= (1^5),(1^2)^5/math>. Mainline vertices and vertices on odd branches are \sigma-groups.


Coclass 2


Abelianization of type (''p'',''p'')

Three coclass trees, \mathcal^2(\langle 243,6\rangle), \mathcal^2(\langle 243,8\rangle) and \mathcal^2(\langle 729,40\rangle) for p=3, are endowed with information concerning TTTs and TKTs. On the tree \mathcal^2(\langle 243,6\rangle), the 3-groups of coclass 2 with bicyclic centre in Figure 8 can be defined by the following parametrized polycyclic pc-presentation. \beginG^(z,w)= & \langle x,y,s_2,t_3,s_3,\ldots,s_c\mid \\ & x^3=s_c^w,\ y^3=s_3^2s_4s_c^z,\ s_j^3=s_^2s_\text2\le j\le c-3,\ s_^3=s_c^2,\ t_3^3=1,\\ & s_2= y,x\ t_3= s_2,y\ s_j= s_,xtext3\le j\le c\rangle,\end where the nilpotency class is c\ge 5, the order is 3^n 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 \tau= A(3,c),(1^3),(21),(21)/math>, only dependent on c. The TKT depends on the parameters and is \varkappa=(0122) for the mainline vertices with w=z=0, \varkappa=(2122) for the capable vertices with w=0,z=\pm 1, \varkappa=(1122) for the terminal vertices with w=1,z=0, and \varkappa=(3122) for the terminal vertices with w=1,z=\pm 1. Mainline vertices and vertices on even branches are \sigma-groups. On the tree \mathcal^2(\langle 243,8\rangle), the 3-groups of coclass 2 with bicyclic centre in Figure 9 can be defined by the following parametrized polycyclic pc-presentation. \beginG^(z,w)= & \langle x,y,t_2,s_3,t_3,\ldots,t_c\mid \\ & y^3=s_3t_c^w,\ x^3=t_3t_4^2t_5t_c^z,\ t_j^3=t_^2t_\text2\le j\le c-3,\ t_^3=t_c^2,\ s_3^3=1,\\ & t_2= y,x\ s_3= t_2,x\ t_j= t_,ytext3\le j\le c\rangle,\end where the nilpotency class is c\ge 6, the order is 3^n 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 \tau= (21),A(3,c),(21),(21)/math>, only dependent on c. The TKT depends on the parameters and is \varkappa=(2034) for the mainline vertices with w=z=0, \varkappa=(2134) for the capable vertices with w=0,z=\pm 1, \varkappa=(2234) for the terminal vertices with w=1,z=0, and \varkappa=(2334) for the terminal vertices with w=1,z=\pm 1. Mainline vertices and vertices on even branches are \sigma-groups.


Abelianization of type (''p''2,''p'')

\mathcal^2(\langle 16,3\rangle) and \mathcal^2(\langle 16,4\rangle) for p=2, \mathcal^2(\langle 243,15\rangle) and \mathcal^2(\langle 243,17\rangle) for p=3.


Abelianization of type (''p'',''p'',''p'')

\mathcal^2(\langle 16,11\rangle) for p=2, and \mathcal^2(\langle 81,12\rangle) for p=3.


Coclass 3


Abelianization of type (''p''2,''p'')

\mathcal^3(\langle 729,13\rangle), \mathcal^3(\langle 729,18\rangle) and \mathcal^3(\langle 729,21\rangle) for p=3.


Abelianization of type (''p'',''p'',''p'')

\mathcal^3(\langle 32,35\rangle) and \mathcal^3(\langle 64,181\rangle) for p=2, \mathcal^3(\langle 243,38\rangle) and \mathcal^3(\langle 243,41\rangle) for p=3.


Arithmetical applications

In
algebraic number theory Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic ob ...
and
class field theory In mathematics, class field theory (CFT) is the fundamental branch of algebraic number theory whose goal is to describe all the abelian Galois extensions of local and global fields using objects associated to the ground field. Hilbert is credit ...
, 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 F^2_p(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 G^2_p(K)=\mathrm(F^2_p(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 G^_p(K)=\mathrm(F^_p(K), K) of the maximal unramified pro-''p'' extension F^_p(K) of K. Given a sequence of algebraic number fields K with fixed signature (r_1,r_2), ordered by the absolute values of their discriminants d=d(K), a suitable structured coclass tree (SCT) \mathcal, or also the finite sporadic part \mathcal_0(p,r) of a coclass graph \mathcal(p,r), whose vertices are entirely or partially realized by second ''p''-class groups G^2_p(K) of the fields K is endowed with additional arithmetical structure when each realized vertex V\in\mathcal, resp. V\in\mathcal_0(p,r), is mapped to data concerning the fields K such that V=G^2_p(K).


Example

To be specific, let p=3 and consider complex quadratic fields K(d)=\Q(\sqrt) with fixed signature (0,1) having 3-class groups with type invariants (3,3). See OEIS A24286

Their second 3-class groups G^2_3(K) have been determined by D. C. Mayer for the range -10^6, and, most recently, by N. Boston, M. R. Bush and F. Hajir for the extended range -10^8. Let us firstly select the two structured coclass trees (SCTs) \mathcal^2(\langle 243,6\rangle) and \mathcal^2 (\langle 243,8\rangle), 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\ which gives the minimal absolute discriminant such that V is realized by the second 3-class group G^2_3(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. See OEIS A24287

Concerning the periodicity of occurrences of second 3-class groups G^2_3(K(d)) of complex quadratic fields, it was proved 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 \mathcal(6) and continues with higher excited states (ES) on the branches \mathcal(j) with even j\ge 8. This periodicity phenomenon is underpinned by three sequences with fixed TKTs * E.14 \varkappa=(3122), OEIS A24769

* E.6 \varkappa=(1122), OEIS A24769

* H.4 \varkappa=(2122), OEIS A24769

on the ASCT \mathcal^2(\langle 243,6\rangle), and by three sequences with fixed TKTs * E.9 \varkappa=(2334), OEIS A24769

* E.8 \varkappa=(2234), OEIS A24769

* G.16 \varkappa=(2134),OEIS A24769

on the ASCT \mathcal^2(\langle 243,8\rangle). Up to now, the ground state and three excited states are known for each of the six sequences, and for TKT E.9 \varkappa=(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, 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. In contrast, let us secondly select the sporadic part \mathcal_0(3,2) of the coclass graph \mathcal(3,2) for demonstrating that another way of attaching additional ''arithmetical structure'' to descendant trees is to display the counter \#\ of hits of a realized vertex V by the second 3-class group G^2_3(K(d)) of fields with absolute discriminants below a given upper bound b, for instance b=10^8. With respect to the total counter 276 375 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 \mathcal_0(3,2) of \mathcal(3,2) are populated by second 3-class groups G^2_3(K(d)): * \langle 243,5\rangle, OEIS A24768

* \langle 243,7\rangle, OEIS A24769

* \langle 729,45\rangle, OEIS A24287

* \langle 729,57\rangle, OEIS A24768


Comparison of various primes

Now let p\in\ and consider complex quadratic fields K(d)=\Q(\sqrt) 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 p^5 of the sporadic part \mathcal_0(p,2) of the coclass graph \mathcal(p,2), which belong to the stem of P. Hall's isoclinism family \Phi_6, or their immediate descendants of order p^6. For primes p>3, the stem of \Phi_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 \Phi_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 \Phi_6 which are partially roots of coclass trees. However, here we focus on the sporadic vertices which are either isolated Schur \sigma-groups (2 for p=3 and p+1 for p>3) or roots of finite trees within \mathcal_0(p,2) (2 for each p\ge 3). For p>3, the TKT of Schur \sigma-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'' \mathcal_0(p,2) (a finite union of descendant trees) with additional ''arithmetical structure'' by attaching the ''minimal absolute discriminant'' \min\ to each ''realized'' vertex V\in\mathcal_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

{{Reflist Group theory Class field theory