Skip to main content
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2020 Jun 6;12097:131–140. doi: 10.1007/978-3-030-52200-1_13

The GAP Package LiePRing

Bettina Eick 13,, Michael Vaughan-Lee 14
Editors: Anna Maria Bigatti8, Jacques Carette9, James H Davenport10, Michael Joswig11, Timo de Wolff12
PMCID: PMC7340899

Abstract

A symbolic Lie p-ring defines a family of Lie rings with Inline graphic elements for infinitely many different primes p and a fixed positive integer n. Symbolic Lie p-rings are used to describe the classification of isomorphism types of nilpotent Lie rings of order Inline graphic for all primes p and all Inline graphic. This classification is available as the LiePRing package of the computer algebra system GAP. We give a brief description of this package, including an approach towards computing the automorphism group of a symbolic Lie p-ring.

Keywords: Lie ring, Automorphism group, Finite p-group

Introduction

A Lie ring is an additive abelian group with a multiplication, denoted by [., .], that is bilinear, alternating and satisfies the Jacobi identity. A Lie p-ring is a nilpotent Lie ring with Inline graphic elements for some prime power Inline graphic. Such a Lie p-ring of order Inline graphic can be described by a presentation P(A) on n generators Inline graphic with coefficients Inline graphic, so that Inline graphic and Inline graphic are integers in the range Inline graphic and the following relations hold:

graphic file with name M12.gif

We generalize this type of presentation so that it defines a family of Lie p-rings for various different primes. For this purpose let p be an indeterminate, let Inline graphic be a polynomial ring in Inline graphic commuting variables and let Inline graphic and Inline graphic in R. In some (rare) cases it is convenient to allow some of the coefficients Inline graphic and Inline graphic to be rational functions over R; note that we use this only for coefficients Inline graphic or Inline graphic if Inline graphic so that Inline graphic is an element of order p.

If a fixed prime P and integers Inline graphic are given, then we specify the a polynomial Inline graphic at these values by choosing W to be the smallest primitive root mod P and evaluating Inline graphic in Inline graphic. We specify a rational function a/b with Inline graphic by specifying the polynomials a and b to Inline graphic and Inline graphic in Inline graphic, and then we determine Inline graphic where Inline graphic satisfies Inline graphic. Note that only choices of Inline graphic with Inline graphic are valid.

Let Inline graphic be an infinite set of primes, let Inline graphic and for Inline graphic let

graphic file with name M39.gif

Then the presentation P(A) defines a symbolic Lie p-ring with respect to Inline graphic and Inline graphic if for each Inline graphic and each Inline graphic the presentation P(A) specified at these points is a finite Lie p-ring of order Inline graphic.

A symbolic Lie p-ring describes a family of finite Lie p-rings: for each Inline graphic this contains Inline graphic members. Symbolic Lie p-rings are used to describe the complete classification up to isomorphism of all Lie p-rings of order dividing Inline graphic for Inline graphic as obtained by Newman, O’Brien and Vaughan-Lee [6, 7]. This is available in computational form in the LiePRing package [4] of the computer algebra system GAP [9]. The following exhibits an example.

Example 1

We consider the symbolic Lie p-ring Inline graphic with generators Inline graphic and the (non-trivial) relations

graphic file with name M51.gif

Let Inline graphic be the set of all primes and let

graphic file with name M53.gif

Then Inline graphic defines a family of Inline graphic Lie p-rings of order Inline graphic for each Inline graphic.

The LiePRing package allows symbolic computations with symbolic Lie p-rings Inline graphic. “Symbolic computations” means that it computes with Inline graphic as if computing with all Lie p-rings L in the family defined by Inline graphic simultaneously. For example, it allows us

  • to compute series of ideals such as the lower central series of L,

  • to describe the automorphism group of L, and

  • to determine the Schur multiplier of L, see [3].

Let P be a prime and let Inline graphic with Inline graphic. The Lazard correspondence [5] associates to each Lie p-ring L of order Inline graphic a group G(L) of order Inline graphic. This correspondence translates Lie ring isomorphisms to group isomorphisms and vice versa. Cicalo, de Graaf and Vaughan-Lee [2] determined an effective version of the Lazard correspondence and implemented this in the LieRing package [1] of GAP.

The following sections give a brief overview of some of the algorithms in the LiePRing package and they exhibit how the Lazard correspondence can be evaluated in GAP in this setting.

Elementary Computations

In this section we investigate computations with elements, subrings and ideals. Throughout, let Inline graphic be a symbolic Lie p-ring with respect to Inline graphic, let L be a finite Lie p-ring in the family defined by Inline graphic and let P be the prime of L. We write P(A) for the defining presentation in the finite and in the symbolic case. Thus depending on the context A is an integer matrix or a matrix over the ring Quot(R) of rational functions over the polynomial ring R.

Ring Invariants

The definition of Inline graphic can often be used for computations with Inline graphic. For example, if Inline graphic, then Inline graphic specifies to an invertible element in L and Inline graphic specifies to 0. Hence we can treat Inline graphic as a unit and Inline graphic as zero. The following example illustrates this for Inline graphic.graphic file with name 495991_1_En_13_Figa_HTML.jpg

The Word Problem

Consider the case of a finite Lie p-ring L and let a be an arbitrary word in the generators of P(A). Then the relations in P(A) readily allow us to rewrite a to a unique equivalent normal form

graphic file with name M76.gif

Now consider the case of a symbolic Lie p-ring Inline graphic and let a be a word in the generators of P(A). Then the relations and the zeros of Inline graphic allow us to translate this to an equivalent reduced form; that is, a linear combination of the form

graphic file with name M79.gif

where Inline graphic are reduced modulo the polynomials in zeros; that is, the polynomial division algorithm dividing Inline graphic by the polynomials in zeros yields only trivial quotients. If Inline graphic and Inline graphic, then Inline graphic is the depth of this reduced form and Inline graphic is its leading coefficient. We say that Inline graphic represents the element a.

Example 2

We continue Example 1.

  1. Consider the element Inline graphic. Using the relations of Inline graphic this reduces to Inline graphic. Note that a can be zero and non-zero in the Lie p-rings in the family defined by Inline graphic, depending on the choice of Inline graphic.

  2. Consider the element Inline graphic. Then Inline graphic and hence, since Inline graphic in Inline graphic, it follows that a is a non-zero element in each Lie p-ring in the family defined by Inline graphic.

Subrings, Ideals and Series

Let Inline graphic be a symbolic Lie p-ring, let Inline graphic be words in the generators Inline graphic of P(A) and let U be the subring of Inline graphic generated by these words. Our aim is to determine an echelon generating set for U; that is, a generating set Inline graphic so that each Inline graphic is a reduced form in the generators with leading coefficient 1, the depths satisfy Inline graphic and each element in U is a linear combination in Inline graphic with coefficients in Quot(R). This may require the distinction of finitely many cases, as the following example indicates.

Example 3

We continue Example 1.

  1. Let Inline graphic. As Inline graphic and Inline graphic with Inline graphic, it follows that Inline graphic in each Lie ring in the family defined by Inline graphic.

  2. Let Inline graphic. Then using the relations of Inline graphic it follows that Inline graphic. Hence Inline graphic if Inline graphic and Inline graphic otherwise. Thus a case distinction is necessary to determine an echelon generating set for U.

Ideals are subrings that are closed under multiplication and hence they can also be described via echelon generating sets (subject to a case distinction). In turn, this then allows us to determine series such as the lower central series and the derived series of Inline graphic. The following example illustrates the handling of case distinctions in GAP.graphic file with name 495991_1_En_13_Figb_HTML.jpg

Here the LiePRing package returns two new symbolic Lie p-rings S[1] and S[2]. These have different ring invariants and different bases:graphic file with name 495991_1_En_13_Figc_HTML.jpg

In particular, in S[2] the polynomial t is a unit and the rational function x/t turns up as coefficient for the basis element Inline graphic.

Automorphism Groups

Given a symbolic Lie p-ring Inline graphic, we show how to determine a generic description for Aut(L) for each finite Lie p-ring L in the family defined by Inline graphic. The following gives a first illustration.

Example 4

We continue Example 1.

We note that Inline graphic is generated by Inline graphic. This allows us to describe each automorphism of Inline graphic via its images of Inline graphic and the same holds for each finite Lie p-ring in the family defined by Inline graphic. Write Inline graphic for the image of Inline graphic. Then Inline graphic for certain integers Inline graphic. We say that the automorphism is represented by the Inline graphic matrix Inline graphic. Note that different matrices may represent the same automorphism for a finite Lie p-ring L; for example, if P is the prime of L, then Inline graphic has order P and Inline graphic and Inline graphic give the same automorphism. We expand on this below.

Our algorithm determines that each automorphism of Inline graphic corresponds to a matrix of the form

graphic file with name M136.gif

with Inline graphic and Inline graphic arbitrary otherwise. If P is prime and L is a finite Lie p-ring over P, then we can choose Inline graphic for Inline graphic and thus Aut(L) has order Inline graphic.

Given a finite Lie p-ring L with prime P, we define its radical R(L) as the ideal of L generated by Inline graphic. The additive group of L/R(L) is an elementary abelian group of order Inline graphic, say, and the Lie ring multiplication of L/R(L) is trivial. Burnside’s Basis theorem (for example, see [8, page 140]) for finite p-groups translates readily to the following.

Lemma 1

Let L be a finite Lie p-ring and let Inline graphic the natural ring homomorphism.

  1. R(L) is the intersection of all maximal Lie subrings of L.

  2. Each minimal generating set of L has d elements and maps under Inline graphic onto a minimal generating set of L/R(L).

  3. Each list of preimages under Inline graphic of a minimal generating set of L/R(L) is a minimal generating set of L.

Next, let P(A) be the presentation for the finite Lie p-ring L with generators Inline graphic so that Inline graphic. Then Inline graphic is a minimal generating set of L. Thus each automorphism Inline graphic of L is defined by its images on Inline graphic. These have the general form

graphic file with name M152.gif

with integer coefficients Inline graphic. For Inline graphic we note that Inline graphic. This allows us to write Inline graphic as a word in the ideal generators Inline graphic and Inline graphic of R(L) and that, in turn, allows us to determine the image Inline graphic in the form

graphic file with name M160.gif

where Inline graphic is a word in Inline graphic.

Theorem 1

The matrix Inline graphic defines an automorphism Inline graphic of L if and only if

  1. Inline graphic, where Inline graphic, and

  2. the images Inline graphic satisfy the relations of L.

Proof

First recall that a map Inline graphic for Inline graphic with Inline graphic extends to a Lie ring homomorphism Inline graphic if and only if Inline graphic satisfy the defining relations of L. This is von Dyck’s theorem (for example, see [8, page 51]) in the case of finitely presented groups and it translates readily to other algebraic objects such as Lie rings.

Inline graphic: Suppose that the coefficients Inline graphic define an automorphism Inline graphic. Then Inline graphic induces an automorphism Inline graphic. As Inline graphic with trivial multiplication, it follows that Inline graphic. Hence Inline graphic so (a) follows. (b) follows from von Dyck’s theorem.

Inline graphic: Suppose that (a) and (b) hold. As (b) holds, von Dyck’s theorem asserts that Inline graphic is a Lie ring homomorphism. As Inline graphic. it follows that the images of Inline graphic generate L as Lie ring. Hence Inline graphic is surjective. Since L is finite, it follows that Inline graphic is also injective and hence an automorphism.

This allows us to determine a generic description for Aut(L). Suppose that we have an automorphism given by indeterminates Inline graphic and write Inline graphic for Inline graphic. For Inline graphic write Inline graphic as a word Inline graphic in the generators Inline graphic and use this to determine Inline graphic. Evaluate the defining relations Inline graphic of L in Inline graphic. For each relation Inline graphic this leads to an expression

graphic file with name M198.gif

with Inline graphic a polynomial in the indeterminates Inline graphic.

Lemma 2

Let P be a prime and k minimal with Inline graphic for Inline graphic. If Inline graphic for all ij and if Inline graphic, then the matrix Inline graphic defines an automorphism.

Proof

The generators that appear in the relations Inline graphic all lie in the radical, and so Inline graphic ensures that Inline graphic for all ij. Hence the conditions of Theorem 1 are satisfied and the matrix Inline graphic defines an automorphism.

The integer Inline graphic in Lemma 2 is called the characteristic of R(L). If Inline graphic, then the conditions in Lemma 2 clearly determine all automorphisms of L. If Inline graphic, then the conditions in Lemma 2 may miss some automorphisms and there are examples where

graphic file with name M213.gif

but some of the summands Inline graphic are non-zero. So it seems possible that restricting our search to integer matrices Inline graphic which satisfy the equations Inline graphic could miss some automorphisms in some cases. In practice, we have not found a case where this happens.

Example 5

We continue Example 1 for a specific prime P.

Since the radical has characteristic P our method shows that the matrix

graphic file with name M217.gif

gives an automorphism if and only if Inline graphic. Let Inline graphic. Then

graphic file with name M220.gif

gives an automorphism. There was no need in this case to look for solutions to Inline graphic, but it is easy to “lift” B to a matrix Inline graphic which gives the same automorphism as B, but where Inline graphic. The first row of the matrix B represents the element Inline graphic. Now Inline graphic and so the vector Inline graphic also represents Inline graphic. Similarly the vector Inline graphic represents the same element of L as the third row of B. So

graphic file with name M229.gif

gives the same automorphism as B, but the (1, 1) entry in C satisfies the equation Inline graphic. Note that B gives an automorphism, but does not have the form specified in Example 4, whereas C gives the same automorphism as B, but does have the form specified.

More generally, in every case of Lie p-rings from our database that we have examined, we can show that if B is an integer matrix which gives an automorphism of L for some prime P, and if k is any positive integer, then B can be “lifted” to an integer matrix Inline graphic which gives the same automorphism as B but where the entries Inline graphic satisfy all the equations Inline graphic. So in every case that we have examined our method finds the full automorphism group.

We do not have a proof that our method always finds the full automorphism group. But there are several general criteria (such as the radical having characteristic P) which imply that our method does not miss any automorphisms. So in most cases our program is able to issue a “certificate of correctness”. In some cases it may be necessary to examine the output from our program to prove that it has found the full automorphism group.

Example 6

We consider the symbolic Lie p-ring Inline graphic on 7 generators with the non-trivial relations

graphic file with name M235.gif

Then Inline graphic and each Lie p-ring L in the family of Inline graphic is generated by Inline graphic. We define

graphic file with name M239.gif

Next, we write Inline graphic as words in Inline graphic. It can be read off from the defining relations that Inline graphic. Using this, we expand the mapping defined by Inline graphic to the remaining generators Inline graphic. For example, for Inline graphic this yields

graphic file with name M246.gif

We now evaluate the defining relations of Inline graphic in Inline graphic. For example Inline graphic evaluates to

graphic file with name M250.gif

Note that the coefficient of Inline graphic in this relation is zero. More generally, if Inline graphic is any of the relations then

graphic file with name M253.gif

and Inline graphic all have order p. So we obtain an automorphism at the prime P if and only if Inline graphic (Inline graphic) for all relations Inline graphic.

Now let L be a finite Lie p-ring in the family defined by Inline graphic and let P be its prime. If the integer coefficients Inline graphic define an automorphism of L, then det(G) is coprime to P. Hence, examining the coefficient of Inline graphic in the relation above we see that

graphic file with name M261.gif

is equivalent to Inline graphic. In turn, this can now be used to simplify the remaining coefficients. Using Inline graphic now yields

graphic file with name M264.gif

As Inline graphic via Inline graphic, it follows that Inline graphic is coprime to P and Inline graphic. We now iterate this approach. Introducing another indeterminate D with Inline graphic we finally obtain that

graphic file with name M270.gif

evaluate to 0 modulo P. We use this to eliminate indeterminates in the descriptions of Inline graphic; for example, we can replace Inline graphic by 0. We obtain

graphic file with name 495991_1_En_13_Equ24_HTML.gif

subject to the additional condition that the polynomials

graphic file with name M273.gif

must evaluate to Inline graphic. This is the resulting description of the automorphism groups of the Lie p-rings L in the family defined by Inline graphic. It implies that Inline graphic, where Inline graphic. The precise value of k depends on the two parameters xy. When Inline graphic, if Inline graphic then Inline graphic; if Inline graphic and Inline graphic then Inline graphic; if Inline graphic and Inline graphic then Inline graphic; finally if Inline graphic then Inline graphic. When Inline graphic then Inline graphic or 2.

The Lazard Correspondence

The final example of this abstract illustrates how the Lazard correspondent G(L) to a finite Lie p-ring L can be determined using the LieRing package [1].graphic file with name 495991_1_En_13_Figd_HTML.jpg

Contributor Information

Anna Maria Bigatti, Email: bigatti@dima.unige.it.

Jacques Carette, Email: carette@mcmaster.ca.

James H. Davenport, Email: j.h.davenport@bath.ac.uk

Michael Joswig, Email: joswig@math.tu-berlin.de.

Timo de Wolff, Email: t.de-wolff@tu-braunschweig.de.

Bettina Eick, Email: beick@tu-bs.de, http://www.iaa.tu-bs.de/beick/.

Michael Vaughan-Lee, Email: michael.vaughan-lee@chch.ox.ac.uk, http://users.ox.ac.uk/~vlee.

References

  • 1.Cicalò, S., de Graaf, W.A.: Liering, a GAP 4 package, see [9] (2010)
  • 2.Cicalò S, de Graaf WA, Vaughan-Lee MR. An effective version of the lazard correspondence. J. Algebra. 2012;352:430–450. doi: 10.1016/j.jalgebra.2011.11.031. [DOI] [Google Scholar]
  • 3.Eick, B., Jalaleean, T.: Computing the Schur multiplier of a symbolic lie ring (2020, submitted)
  • 4.Eick, B., Vaughan-Lee, M.: LiePRing version 2.5, : a GAP 4 package, see [9]. Version 2, 5 (2020). http://www.iaa.tu-bs.de/beick/soft/liepring
  • 5.Lazard M. Sur les groupes nilpotents et les anneaux de Lie. Ann. Sci. Ecole Norm. Sup. 1954;3(71):101–190. doi: 10.24033/asens.1021. [DOI] [Google Scholar]
  • 6.Newman MF, O’Brien EA, Vaughan-Lee MR. Groups and nilpotent Lie rings whose order is the sixth power of a prime. J. Alg. 2003;278:383–401. doi: 10.1016/j.jalgebra.2003.11.012. [DOI] [Google Scholar]
  • 7.O’Brien EA, Vaughan-Lee MR. The groups with order Inline graphic for odd prime Inline graphic J. Algebra. 2005;292(1):243–258. doi: 10.1016/j.jalgebra.2005.01.019. [DOI] [Google Scholar]
  • 8.Robinson DJS. A Course in the Theory of Groups. Graduate Texts in Math. New York: Springer; 1982. [Google Scholar]
  • 9.The GAP Group: GAP - Groups, Algorithms and Programming, Version 4.10 (2019). http://www.gap-system.org

Articles from Mathematical Software – ICMS 2020 are provided here courtesy of Nature Publishing Group

RESOURCES