gap> ######################### BEGIN COPYRIGHT MESSAGE #########################
GBNP - computing Gröbner bases of noncommutative polynomials
Copyright 2001-2010 by Arjeh M. Cohen, Dié A.H. Gijsbers, Jan Willem
Knopper, Chris Krook. Address: Discrete Algebra and Geometry (DAM) group
at the Department of Mathematics and Computer Science of Eindhoven
University of Technology.
For acknowledgements see the manual. The manual can be found in several
formats in the doc subdirectory of the GBNP distribution. The
acknowledgements formatted as text can be found in the file chap0.txt.
GBNP is free software; you can redistribute it and/or modify it under
the terms of the Lesser GNU General Public License as published by the
Free Software Foundation (FSF); either version 2.1 of the License, or
(at your option) any later version. For details, see the file 'LGPL' in
the doc subdirectory of the GBNP distribution or see the FSF's own site: https://www.gnu.org/licenses/lgpl.html
gap> ########################## END COPYRIGHT MESSAGE ##########################
gap> ### filename = "example20.g"
gap> ### author Knopper
gap> ### amc last edited 25 May 2007 problem with GBNP(y[1]+y[2])
<#GAPDoc Label="Example20">
<Section Label="Example20"><Heading>The dihedral group on a non-cyclic module</Heading>
In this example (Example 3 from Linton <Cite Key="MR94k:20022"/>),
the two-sided relations give the group algebra of
the group with presentation
<M>\langle a,b\mid a^4=b^2=(ab)^2=1\rangle</M>, the dihedral group of order 8.
The module under construction is a non-cyclic module,
obtained by taking two copies of the
representation of Example <Ref Sect="Example18"/> and fusing
their one-dimensional submodules.
<P/>
Load the package and set the standard infolevel <Ref
InfoClass="InfoGBNP" Style="Text"/> to 1 and the time infolevel <Ref
Func="InfoGBNPTime" Style="Text"/> to 1 (for more information about the info
level, see Chapter <Ref Chap="Info"/>).
First the relations are converted into NP format (see <Ref Sect="NP"/>) with
the function <Ref Func="GP2NPList" Style="Text"/>.
They are printed in raw form and subsequently
in a more legible format.
Next the function
<Ref Func="SGrobnerModule" Style="Text"/> is called to calculate a Gröbner basis
record (see <Ref Sect="GBR"/>).
<Listing><![CDATA[
gap> GBR:=SGrobnerModule(modrelsNP,GP2NPList(twosidrels));;
#I number of entered polynomials is 3
#I number of polynomials after reduction is 3
#I End of phase I
#I End of phase II
#I End of phase III
#I End of phase IV
#I The computation took 0 msecs.
#I number of entered polynomials is 9
#I number of polynomials after reduction is 9
#I End of phase I
#I End of phase II
#I End of phase III
#I End of phase IV
#I The computation took 0 msecs.
]]></Listing>
The record <C>GBR</C> has two members: the two-sided relations <C>GBR.ts</C>
and the prefix relations <C>GBR.p</C>. It is possible to print these using
the function <Ref Func="PrintNPList" Style="Text"/>:
<Listing><![CDATA[
gap> PrintNPList(GBR.ts);
b^2 - 1
aba - b
ba^2 - a^2b
bab - a^3
a^4 - 1
a^3b - ba
gap> PrintNPList(GBR.p);
[ 0, b - 1 ]
[ b - 1 , 0]
[ ab + a^2 + a + 1 , - ab - a^2 - a - 1 ]
[ 0, a^3 - ab ]
[ 0, a^2b - a^2 ]
[ a^3 + a^2 + a + 1 , - ab - a^2 - a - 1 ]
[ a^2b - a^2 , 0]
]]></Listing>
It is now possible to calculate the standard basis of the quotient module
with the function <Ref Func="BaseQM" Style="Text"/>. This function has as
arguments the Gröbner basis record <C>GBR</C>, the number of generators of
the algebra (in this case 2),
the number of generators of
the module (in this case 2), and a variable <C>maxno</C> for returning
partial bases (0 means full basis).
It is also possible to convert each member of the list <C>B</C> of
polynomials in NP form to GAP polynomials to do further calculations within
the algebra or module. This can be done with the function <Ref
Func="NP2GPList" Style="Text"/>.
<Listing><![CDATA[
gap> NP2GPList(B,D);
[ [ <zero> of ..., (1)*<identity ...> ], [ (1)*<identity ...>, <zero> of ... ]
, [ <zero> of ..., (1)*a ], [ (1)*a, <zero> of ... ],
[ <zero> of ..., (1)*a^2 ], [ <zero> of ..., (1)*a*b ],
[ (1)*a^2, <zero> of ... ] ]
]]></Listing>
Individual GAP polynomials can be
obtained from polynomials in NP form
with the function <Ref Func="NP2GP" Style="Text"/>.
This also holds for elements of the free module <C>D</C>
in NP form.
<Listing><![CDATA[
gap> Display(NP2GP(B[Length(B)],D));
[ (1)*a^2, <zero> of ... ]
]]></Listing>
Next we write down the matrices for the right action of the generators
on the module by means of
<Ref Func="MatrixQA" Style="Text"/>.
In order to compute the image of the vector <M>2y[1]+3y[2]</M> of the two standard generators of the module
under the action of the element <M>aab</M>, we use
<Ref Func="StrongNormalFormNPM" Style="Text"/>. Its first argument will be the vector
and its second the Gröbner basis.
The transformation <Ref Func="GP2NP" Style="Text"/> to the NP format
needs to be applied to the vector
before it can be used as an argument.
<Listing><![CDATA[
gap> v:=StrongNormalFormNPM(GP2NP((y[1]*2+y[2]*3)*a*a*b), GBR);;
gap> PrintNP(v);
[ 2a^2 , 3a^2 ]
]]></Listing>
</Section>
<#/GAPDoc>
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
