Quelle CHAP002.htm Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/unipot/htm/CHAP002.htm

<html><head><title>[unipot] 2 The GAP Package Unipot</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP001.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]
<h1>2 The GAP Package Unipot</h1>

<H3>Sections</H3>
<oL>
<li> <A HREF="CHAP002.htm#SECT001">General functionality</a>
<li> <A HREF="CHAP002.htm#SECT002">Unipotent subgroups of Chevalley groups</a>
<li> <A HREF="CHAP002.htm#SECT003">Elements of unipotent subgroups of Chevalley groups</a>
<li> <A HREF="CHAP002.htm#SECT004">Symbolic computation</a>
</ol>

This chapter describes the package Unipot. Mainly, the package
provides the ability to compute with elements of unipotent subgroups of
Chevalley groups, but also some properties of this groups.

In this chapter we will refer to unipotent subgroups of Chevalley groups
as ``unipotent subgroups'' and to elements of unipotent subgroups as
``unipotent elements''. Specifically, we only consider unipotent
subgroups generated by all positive root elements.


<h2><a name="SECT001">2.1 General functionality</a></h2>

In this section we will describe the general functionality provided by
this package.

<a name = "SSEC001.1"></a>
<li><code>UnipotChevInfo V</code>

<code>UnipotChevInfo</code> is an <code>InfoClass</code> used in this package. <code>InfoLevel</code> of
this <code>InfoClass</code> is set to 1 by default and can be changed to any level
by <code>SetInfoLevel( UnipotChevInfo, </code><var>n</var><code> )</code>.

Following levels are used throughout the package:
<dl compact>
<ol type=1>
<li>
 ---
<li>
 When calculating the order of a finite unipotent subgroup, the power
 presentation of this number is printed.
 (See <a href="CHAP002.htm#SSEC002.5">Size!for `UnipotChevSubGr' for an example)
<li>
 When comparing unipotent elements, output, for which of them the
 canonical form must be computed.
 (See <a href="CHAP002.htm#SSEC003.11">Equality!for UnipotChevElem</a> for an example)
<li>
 ---
<li>
 While calculating the canonical form, output the different steps.
<li>
 The process of calculating the Chevalley commutator constants is
 printed on the screen
</dl></dl>


<h2><a name="SECT002">2.2 Unipotent subgroups of Chevalley groups</a></h2>

In this section we will describe the functionality for unipotent
subgroups provided by this package.

<a name = "SSEC002.1"></a>
<li><code>IsUnipotChevSubGr( </code><var>grp</var><code> ) C</code>

Category for unipotent subgroups.

<a name = "SSEC002.2"></a>
<li><code>UnipotChevSubGr( </code><var>type</var><code>, </code><var>n</var><code>, </code><var>F</var><code> ) F</code>

<code>UnipotChevSubGr</code> returns the unipotent subgroup U of the Chevalley
group of type <var>type</var>, rank <var>n</var> over the ring <var>F</var>.

<var>type</var> must be one of <code>"A"</code>, <code>"B"</code>, <code>"C"</code>, <code>"D"</code>, <code>"E"</code>, <code>"F"</code>, <code>"G"</code>.

For the type <code>"A"</code>, <var>n</var> must be a positive integer.

For the types <code>"B"</code> and <code>"C"</code>, <var>n</var> must be a positive integer ≥ 2.

For the type <code>"D"</code>, <var>n</var> must be a positive integer ≥ 4.

For the type <code>"E"</code>, <var>n</var> must be one of 6, 7, 8.

For the type <code>"F"</code>, <var>n</var> must be 4.

For the type <code>"G"</code>, <var>n</var> must be 2.

<pre>
gap> U_G2 := UnipotChevSubGr("G", 2, Rationals);
<Unipotent subgroup of a Chevalley group of type G2 over Rationals>
gap> IsUnipotChevSubGr(U_G2);
true
</pre>
<pre>
gap> UnipotChevSubGr("E", 3, Rationals);
Error, <n> must be one of 6, 7, 8 for type E called from
UnipotChevFamily( type, n, F ) called from
<function>( <arguments> ) called from read-eval-loop
Entering break read-eval-print loop ...
you can 'quit;' to quit to outer loop, or
you can 'return;' to continue
brk>
</pre>

<a name = "SSEC002.3"></a>
<li><code>PrintObj( </code><var>U</var><code> ) M</code>
<a name = "SSEC002.3"></a>
<li><code>ViewObj( </code><var>U</var><code> ) M</code>

Special methods for unipotent subgroups. (see GAP Reference Manual,
section <a href="../../../doc/ref/chap6.html#X8074A8387C9DB9A8">View and Print</a> for general information on <code>View</code> and
<code>Print</code>)

<pre>
gap> Print(U_G2);
UnipotChevSubGr( "G", 2, Rationals )gap> View(U_G2);
<Unipotent subgroup of a Chevalley group of type G2 over Rationals>gap>
</pre>

<a name = "SSEC002.4"></a>
<li><code>One( </code><var>U</var><code> ) M</code>
<a name = "SSEC002.4"></a>
<li><code>OneOp( </code><var>U</var><code> ) M</code>

Special methods for unipotent subgroups. Return the identity
element of the group <var>U</var>. The returned element has
representation <code>UNIPOT_DEFAULT_REP</code> (see <a href="CHAP002.htm#SSEC003.3">UNIPOT_DEFAULT_REP</a>).

<a name = "SSEC002.5"></a>
<li><code>Size( </code><var>U</var><code> ) M</code>

<code>Size</code> returns the order of a unipotent subgroup. This is a
special method for unipotent subgroups using the result in
Carter <a href="biblio.htm#Car72"><cite>Car72</cite></a>, Theorem 5.3.3 (ii).

<pre>
gap> SetInfoLevel( UnipotChevInfo, 2 );
gap> Size( UnipotChevSubGr("E", 8, GF(7)) );
#I The order of this group is 7^120 which is
25808621098934927604791781741317238363169114027609954791128059842592785343731\
7437263620645695945672001
gap> SetInfoLevel( UnipotChevInfo, 1 );
</pre>

<a name = "SSEC002.6"></a>
<li><code>RootSystem( </code><var>U</var><code> ) M</code>

This method is similar to the method <code>RootSystem</code> for semisimple Lie
algebras (see Section <a href="../../../doc/ref/chap64.html#X83F829017D46C544">Semisimple Lie Algebras and Root Systems</a> in
the GAP Reference Manual for further information).

<code>RootSystem</code> returns the underlying root system of the unipotent subgroup
<var>U</var>. The returned object is from the category <code>IsRootSystem</code>:

<pre>
gap> R_G2 := RootSystem(U_G2);
<root system of rank 2>
gap> IsRootSystem(last);
true
gap> SimpleSystem(R_G2);
[ [ 2, -1 ], [ -3, 2 ] ]
gap>
</pre>

Additionally to the properties and attributes described in the Reference
Manual, following attributes are installed for the Root Systems by the
package Unipot:

<a name = "SSEC002.7"></a>
<li><code>PositiveRootsFC( </code><var>R</var><code> ) A</code>
<a name = "SSEC002.7"></a>
<li><code>NegativeRootsFC( </code><var>R</var><code> ) A</code>

The list of positive resp. negative roots of the root system <var>R</var>. Every
root is represented as a list of coefficients of the linear combination
in fundamental roots. E.g. let r=∑i=1l kiri, where r1, ..., rl are the fundamental roots, then r is represented as the
list [k1, ..., kl].

<pre>
gap> U_E6 := UnipotChevSubGr("E",6,GF(2));
<Unipotent subgroup of a Chevalley group of type E6 over GF(2)>
gap> R_E6 := RootSystem(U_E6);
<root system of rank 6>
gap> PositiveRoots(R_E6){[1..6]};
[ [ 2, 0, -1, 0, 0, 0 ], [ 0, 2, 0, -1, 0, 0 ], [ -1, 0, 2, -1, 0, 0 ],
 [ 0, -1, -1, 2, -1, 0 ], [ 0, 0, 0, -1, 2, -1 ], [ 0, 0, 0, 0, -1, 2 ] ]
gap> PositiveRootsFC(R_E6){[1..6]};
[ [ 1, 0, 0, 0, 0, 0 ], [ 0, 1, 0, 0, 0, 0 ], [ 0, 0, 1, 0, 0, 0 ],
 [ 0, 0, 0, 1, 0, 0 ], [ 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, 1 ] ]
gap>
gap> PositiveRootsFC(R)[Length(PositiveRootsFC(R_E6))]; # the highest root
[ 1, 2, 2, 3, 2, 1 ]
</pre>

<a name = "SSEC002.8"></a>
<li><code>GeneratorsOfGroup( </code><var>U</var><code> ) M</code>

This is a special Method for unipotent subgroups of finite Chevalley
groups.

<a name = "SSEC002.9"></a>
<li><code>Representative( </code><var>U</var><code> ) M</code>

This method returns an element of the unipotent subgroup <var>U</var> with
indeterminates instead of ring elements. Such an element could be used
for symbolic computations (see <a href="CHAP002.htm#SECT004">Symbolic Computation</a>). The returned
element has representation <code>UNIPOT_DEFAULT_REP</code> (see
<a href="CHAP002.htm#SSEC003.3">UNIPOT_DEFAULT_REP</a>).

<pre>
gap> Representative(U_G2);
x_{1}( t_1 ) * x_{2}( t_2 ) * x_{3}( t_3 ) * x_{4}( t_4 ) *
x_{5}( t_5 ) * x_{6}( t_6 )
</pre>

<a name = "SSEC002.10"></a>
<li><code>CentralElement( </code><var>U</var><code> ) M</code>

This method returns the representative of the center of <var>U</var> without
calculating the center.


<h2><a name="SECT003">2.3 Elements of unipotent subgroups of Chevalley groups</a></h2>

In this section we will describe the functionality for unipotent elements
provided by this package.

<a name = "SSEC003.1"></a>
<li><code>IsUnipotChevElem( </code><var>elm</var><code> ) C</code>

Category for elements of a unipotent subgroup.

<a name = "SSEC003.2"></a>
<li><code>IsUnipotChevRepByRootNumbers( </code><var>elm</var><code> ) R</code>
<a name = "SSEC003.2"></a>
<li><code>IsUnipotChevRepByFundamentalCoeffs( </code><var>elm</var><code> ) R</code>
<a name = "SSEC003.2"></a>
<li><code>IsUnipotChevRepByRoots( </code><var>elm</var><code> ) R</code>

<code>IsUnipotChevRepByRootNumbers</code>, <code>IsUnipotChevRepByFundamentalCoeffs</code> and
<code>IsUnipotChevRepByRoots</code> are different representations for unipotent
elements.

Roots of elements with representation <code>IsUnipotChevRepByRootNumbers</code> are
represented by their numbers (positions) in
<code>PositiveRoots(RootSystem(</code><var>U</var><code>))</code>.

Roots of elements with representation
<code>IsUnipotChevRepByFundamentalCoeffs</code> are represented by elements of
<code>PositiveRootsFC(RootSystem(</code><var>U</var><code>))</code>.

Roots of elements with representation <code>IsUnipotChevRepByRoots</code> are
represented by roots themself, i.e. elements of
<code>PositiveRoots(RootSystem(</code><var>U</var><code>))</code>.

(See <a href="CHAP002.htm#SSEC003.4">UnipotChevElemByRootNumbers</a>, <a href="CHAP002.htm#SSEC003.5">UnipotChevElemByFundamentalCoeffs</a>
and <a href="CHAP002.htm#SSEC003.6">UnipotChevElemByRoots</a> for examples.)

<a name = "SSEC003.3"></a>
<li><code>UNIPOT_DEFAULT_REP V</code>

This variable contains the default representation for newly created
elements, e.g. created by <code>One</code> or <code>Random</code>. When Unipot is loaded,
the default representation is <code>IsUnipotChevRepByRootNumbers</code> and can be
changed by assigning a new value to <code>UNIPOT_DEFAULT_REP</code>.

<pre>
gap> UNIPOT_DEFAULT_REP := IsUnipotChevRepByFundamentalCoeffs;;
</pre>

Note that Unipot doesn't check the type of this value, i.e. you may
assign any value to <code>UNIPOT_DEFAULT_REP</code>, which may result in errors in
following commands:

<pre>
gap> UNIPOT_DEFAULT_REP := 3;;
gap> One( U_G2 );
... Error message ...
</pre>

<a name = "SSEC003.4"></a>
<li><code>UnipotChevElemByRootNumbers( </code><var>U</var><code>, </code><var>roots</var><code>, </code><var>felems</var><code> ) O</code>
<li><code>UnipotChevElemByRootNumbers( </code><var>U</var><code>, </code><var>root</var><code>, </code><var>felem</var><code> ) O</code>
<a name = "SSEC003.4"></a>
<li><code>UnipotChevElemByRN( </code><var>U</var><code>, </code><var>roots</var><code>, </code><var>felems</var><code> ) O</code>
<li><code>UnipotChevElemByRN( </code><var>U</var><code>, </code><var>root</var><code>, </code><var>felem</var><code> ) O</code>

<code>UnipotChevElemByRootNumbers</code> returns an element of a unipotent subgroup
<var>U</var> with representation <code>IsUnipotChevRepByRootNumbers</code> (see
<a href="CHAP002.htm#SSEC003.2">IsUnipotChevRepByRootNumbers</a>).

<var>roots</var> should be a list of root numbers, i.e. integers from the range 1,
..., <code>Length(PositiveRoots(RootSystem(</code><var>U</var><code>)))</code>. And <var>felems</var> a list of
corresponding ring elements or indeterminates over that ring (see GAP
Reference Manual, <a href="../../../doc/ref/chap66.html#X79D0380D7FA39F7D">Indeterminate</a> for general information on
indeterminates or section <a href="CHAP002.htm#SECT004">Symbolic computation</a> of this manual for
examples).

The second variant of <code>UnipotChevElemByRootNumbers</code> is an abbreviation
for the first one if <var>roots</var> and <var>felems</var> contain only one element.

<code>UnipotChevElemByRN</code> is just a synonym for <code>UnipotChevElemByRootNumbers</code>.

<pre>
gap> IsIdenticalObj( UnipotChevElemByRN, UnipotChevElemByRootNumbers );
true
gap> y := UnipotChevElemByRootNumbers(U_G2, [1,5], [2,7] );
x_{1}( 2 ) * x_{5}( 7 )
gap> x := UnipotChevElemByRootNumbers(U_G2, 1, 2);
x_{1}( 2 )
</pre>

In this example we create two elements: xr1( 2 ) ·xr5( 7 ) and
xr1( 2 ), where ri, i = 1, ..., 6 are the positive roots in
<code>PositiveRoots(RootSystem(</code><var>U</var><code>))</code> and xri(t), i = 1, ..., 6 the
corresponding root elements.

<a name = "SSEC003.5"></a>
<li><code>UnipotChevElemByFundamentalCoeffs( </code><var>U</var><code>, </code><var>roots</var><code>, </code><var>felems</var><code> ) O</code>
<li><code>UnipotChevElemByFundamentalCoeffs( </code><var>U</var><code>, </code><var>root</var><code>, </code><var>felem</var><code> ) O</code>
<a name = "SSEC003.5"></a>
<li><code>UnipotChevElemByFC( </code><var>U</var><code>, </code><var>roots</var><code>, </code><var>felems</var><code> ) O</code>
<li><code>UnipotChevElemByFC( </code><var>U</var><code>, </code><var>root</var><code>, </code><var>felem</var><code> ) O</code>

<code>UnipotChevElemByFundamentalCoeffs</code> returns an element of a unipotent
subgroup <var>U</var> with representation <code>IsUnipotChevRepByFundamentalCoeffs</code>
(see <a href="CHAP002.htm#SSEC003.2">IsUnipotChevRepByFundamentalCoeffs</a>).

<var>roots</var> should be a list of elements of
<code>PositiveRootsFC(RootSystem(</code><var>U</var><code>))</code>. And <var>felems</var> a list of
corresponding ring elements or indeterminates over that ring (see GAP
Reference Manual, <a href="../../../doc/ref/chap66.html#X79D0380D7FA39F7D">Indeterminate</a> for general information on
indeterminates or section <a href="CHAP002.htm#SECT004">Symbolic computation</a> of this manual for
examples).

The second variant of <code>UnipotChevElemByFundamentalCoeffs</code> is an
abbreviation for the first one if <var>roots</var> and <var>felems</var> contain only one
element.

<code>UnipotChevElemByFC</code> is just a synonym for
<code>UnipotChevElemByFundamentalCoeffs</code>.

<pre>
gap> PositiveRootsFC(RootSystem(U_G2));
[ [ 1, 0 ], [ 0, 1 ], [ 1, 1 ], [ 2, 1 ], [ 3, 1 ], [ 3, 2 ] ]
gap> y1 := UnipotChevElemByFundamentalCoeffs( U_G2, [[ 1, 0 ], [ 3, 1 ]], [2,7] );
x_{[ 1, 0 ]}( 2 ) * x_{[ 3, 1 ]}( 7 )
gap> x1 := UnipotChevElemByFundamentalCoeffs( U_G2, [ 1, 0 ], 2 );
x_{[ 1, 0 ]}( 2 )
</pre>

In this example we create the same two elements as in
<a href="CHAP002.htm#SSEC003.4">UnipotChevElemByRootNumbers</a>: x[ 1, 0 ]( 2 ) ·x[ 3, 1 ]( 7 )
and x[ 1, 0 ]( 2 ), where [ 1, 0 ] = 1r1 + 0r2 = r1 and [ 3, 1 ] = 3r1 + 1r2=r5 are the first and the fifth positive roots of
<code>PositiveRootsFC(RootSystem(</code><var>U</var><code>))</code> respectively.

<a name = "SSEC003.6"></a>
<li><code>UnipotChevElemByRoots( </code><var>U</var><code>, </code><var>roots</var><code>, </code><var>felems</var><code> ) O</code>
<li><code>UnipotChevElemByRoots( </code><var>U</var><code>, </code><var>root</var><code>, </code><var>felem</var><code> ) O</code>
<a name = "SSEC003.6"></a>
<li><code>UnipotChevElemByR( </code><var>U</var><code>, </code><var>roots</var><code>, </code><var>felems</var><code> ) O</code>
<li><code>UnipotChevElemByR( </code><var>U</var><code>, </code><var>root</var><code>, </code><var>felem</var><code> ) O</code>

<code>UnipotChevElemByRoots</code> returns an element of a unipotent subgroup <var>U</var>
with representation <code>IsUnipotChevRepByRoots</code> (see
<a href="CHAP002.htm#SSEC003.2">IsUnipotChevRepByRoots</a>).

<var>roots</var> should be a list of elements of <code>PositiveRoots(
or indeterminates over that ring (see GAP Reference Manual,
"ref:Indeterminate" for general information on indeterminates or section
"Symbolic computation" of this manual for examples).

The second variant of `UnipotChevElemByRoots</code> is an abbreviation for the
first one if <var>roots</var> and <var>felems</var> contain only one element.

<code>UnipotChevElemByR</code> is just a synonym for <code>UnipotChevElemByRoots</code>.

<pre>
gap> PositiveRoots(RootSystem(U_G2));
[ [ 2, -1 ], [ -3, 2 ], [ -1, 1 ], [ 1, 0 ], [ 3, -1 ], [ 0, 1 ] ]
gap> y2 := UnipotChevElemByRoots( U_G2, [[ 2, -1 ], [ 3, -1 ]], [2,7] );
x_{[ 2, -1 ]}( 2 ) * x_{[ 3, -1 ]}( 7 )
gap> x2 := UnipotChevElemByRoots( U_G2, [ 2, -1 ], 2 );
x_{[ 2, -1 ]}( 2 )
</pre>

In this example we create again the two elements as in previous examples:
x[ 2, −1 ]( 2 ) ·x[ 3, −1 ]( 7 ) and x[ 2, −1 ]( 2 ), where
[ 2, −1 ] = r1 and [ 3, −1 ] = r5 are the first and the fifth
positive roots of <code>PositiveRoots(RootSystem( </code><var>U</var><code>))</code> respectively.

<a name = "SSEC003.7"></a>
<li><code>UnipotChevElemByRootNumbers( </code><var>x</var><code> ) O</code>
<a name = "SSEC003.7"></a>
<li><code>UnipotChevElemByFundamentalCoeffs( </code><var>x</var><code> ) O</code>
<a name = "SSEC003.7"></a>
<li><code>UnipotChevElemByRoots( </code><var>x</var><code> ) O</code>

These three methods are provided for converting a unipotent element to
the respective representation.

If <var>x</var> has already the required representation, then <var>x</var> itself is
returned. Otherwise a new element with the required representation is
generated.

<pre>
gap> x;
x_{1}( 2 )
gap> x1 := UnipotChevElemByFundamentalCoeffs( x );
x_{[ 1, 0 ]}( 2 )
gap> IsIdenticalObj(x, x1); x = x1;
false
true
gap> x2 := UnipotChevElemByFundamentalCoeffs( x1 );;
gap> IsIdenticalObj(x1, x2);
true
</pre>

Note: If some attributes of <var>x</var> are known (e.g <code>Inverse</code> (see
<a href="CHAP002.htm#SSEC003.15">Inverse!for `UnipotChevElem') or CanonicalForm (see
<a href="CHAP002.htm#SSEC003.8">CanonicalForm</a>)), then they are ``converted'' to the new representation,
too.

<code> UnipotChevElemByRootNumbers( </code><var>U</var><code>, </code><var>list</var><code> ) O</code>
 <code> UnipotChevElemByRoots( </code><var>U</var><code>, </code><var>list</var><code> ) O</code>
 <code> UnipotChevElemByFundamentalCoeffs( </code><var>U</var><code>, </code><var>list</var><code> ) O</code>

DEPRECATED These are old versions of <code>UnipotChevElemByXX</code> (from
Unipot 1.0 and 1.1). They are deprecated now and exist for
compatibility only. They may be removed at any time.

<a name = "SSEC003.8"></a>
<li><code>CanonicalForm( </code><var>x</var><code> ) A</code>

<code>CanonicalForm</code> returns the canonical form of <var>x</var>. For more information
on the canonical form see Carter <a href="biblio.htm#Car72"><cite>Car72</cite></a>, Theorem 5.3.3 (ii). It
says:

Each element of a unipotent subgroup U of a Chevalley group with root
system Φ is uniquely expressible in the form
 <table border="0" width="100%"><tr><td><table align="center" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> </td><td nowrap="nowrap" align="center"> ∏ ri ∈ Φ+ </td><td nowrap="nowrap" align="center">xri(ti), </td></tr></table></td></tr></table>
where the product is taken over all positive roots in increasing order.

<pre>
gap> z := UnipotChevElemByFC( U_G2, [[0,1], [1,0]], [3,2]);
x_{[ 0, 1 ]}( 3 ) * x_{[ 1, 0 ]}( 2 )
gap> CanonicalForm(z);
x_{[ 1, 0 ]}( 2 ) * x_{[ 0, 1 ]}( 3 ) * x_{[ 1, 1 ]}( 6 ) *
x_{[ 2, 1 ]}( 12 ) * x_{[ 3, 1 ]}( 24 ) * x_{[ 3, 2 ]}( -72 )
</pre>

So if we call the positive roots r1,...,r6, we have z = xr2(3)xr1(2) = xr1( 2 ) xr2( 3 ) xr3( 6 ) xr4( 12 ) xr5( 24 ) xr6( −72 ).

<a name = "SSEC003.9"></a>
<li><code>PrintObj( </code><var>x</var><code> ) M</code>
<a name = "SSEC003.9"></a>
<li><code>ViewObj( </code><var>x</var><code> ) M</code>

Special methods for unipotent elements. (see GAP Reference Manual,
section <a href="../../../doc/ref/chap6.html#X8074A8387C9DB9A8">View and Print</a> for general information on <code>View</code> and
<code>Print</code>). The output depends on the representation of <var>x</var>.

<pre>
gap> Print(x);
UnipotChevElemByRootNumbers( UnipotChevSubGr( "G", 2, Rationals ), \
[ 1 ], [ 2 ] )gap> View(x);
x_{1}( 2 )gap>
</pre>
<pre>
gap> Print(x1);
UnipotChevElemByFundamentalCoeffs( UnipotChevSubGr( "G", 2, Rationals ), \
[ [ 1, 0 ] ], [ 2 ] )gap> View(x1);
x_{[ 1, 0 ]}( 2 )gap>
</pre>

<a name = "SSEC003.10"></a>
<li><code>ShallowCopy( </code><var>x</var><code> ) M</code>

This is a special method for unipotent elements.

<code>ShallowCopy</code> creates a copy of <var>x</var>. The returned object is not
identical to <var>x</var> but it is equal to <var>x</var> w.r.t. the equality operator
<code>=</code>. Note that <code>CanonicalForm</code> and <code>Inverse</code> of <var>x</var> (if known) are
identical to <code>CanonicalForm</code> and <code>Inverse</code> of the returned object.

(See GAP Reference Manual, section <a href="../../../doc/ref/chap12.html#X786B942B82D684BD">Duplication of Objects</a> for
further information on copyability)

<a name = "SSEC003.11"></a>
<li><code></code><var>x</var><code> = </code><var>y</var><code> M</code>
<a name = "I0"></a>


Special method for unipotent elements. If <var>x</var> and <var>y</var> are identical or
are products of the same root elements then <code>true</code> is returned.
Otherwise <code>CanonicalForm</code> (see <a href="CHAP002.htm#SSEC003.8">CanonicalForm</a>) of both arguments must be
computed (if not already known), which may be expensive. If the canonical
form of one of the elements must be calculated and <code>InfoLevel</code> of
<code>UnipotChevInfo</code> is at least 3, the user is notified about this:

<pre>
gap> y := UnipotChevElemByRN( U_G2, [1,5], [2,7] );
x_{1}( 2 ) * x_{5}( 7 )
gap> z := UnipotChevElemByRN( U_G2, [5,1], [7,2] );
x_{5}( 7 ) * x_{1}( 2 )
gap> SetInfoLevel( UnipotChevInfo, 3 );
gap> y=z;
#I CanonicalForm for the 1st argument is not known.
#I computing it may take a while.
#I CanonicalForm for the 2nd argument is not known.
#I computing it may take a while.
true
gap> SetInfoLevel( UnipotChevInfo, 1 );
</pre>

<a name = "SSEC003.12"></a>
<li><code></code><var>x</var><code> < </code><var>y</var><code> M</code>
<a name = "I1"></a>


Special Method for <code>UnipotChevElem</code>

This is needed e.g. by <code>AsSSortetList</code>.

The ordering is computed in the following way:
Let x = xr1(s1) ·.·xrn(sn)
and y = xr1(t1) ·.·xrn(tn), then

 <table border="0" width="100%"><tr><td><table align="center" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> x < y ⇔ [ s1, ..., sn ] < [ t1, ..., tn ], </td></tr></table></td></tr></table>

where the lists are compared lexicographically.
e.g. for x = xr1(1)xr2(1) = xr1(1)xr2(1)xr3(0) (field elems: <code>[ 1, 1, 0 ]</code>)
 and y = xr1(1)xr3(1) = xr1(1)xr2(0)xr3(1) (field elems: <code>[ 1, 0, 1 ]</code>)
we have y < x (above lists ordered lexicographically).

<a name = "SSEC003.13"></a>
<li><code></code><var>x</var><code> * </code><var>y</var><code> M</code>
<a name = "I2"></a>


Special method for unipotent elements. The expressions in the form
xr(t)xr(u) will be reduced to xr(t+u) whenever possible.

<pre>
gap> y;z;
x_{1}( 2 ) * x_{5}( 7 )
x_{5}( 7 ) * x_{1}( 2 )
gap> y*z;
x_{1}( 2 ) * x_{5}( 14 ) * x_{1}( 2 )
</pre>

Note: The representation of the product will be always the
representation of the first argument.

<pre>
gap> x; x1; x=x1;
x_{1}( 2 )
x_{[ 1, 0 ]}( 2 )
true
gap> x * x1;
x_{1}( 4 )
gap> x1 * x;
x_{[ 1, 0 ]}( 4 )
</pre>

<a name = "SSEC003.14"></a>
<li><code>OneOp( </code><var>x</var><code> ) M</code>

Special method for unipotent elements. <code>OneOp</code> returns the multiplicative
neutral element of <var>x</var>. This is equal to <code></code><var>x</var><code>^0</code>.

<a name = "SSEC003.15"></a>
<li><code>Inverse( </code><var>x</var><code> ) M</code>
<a name = "SSEC003.15"></a>
<li><code>InverseOp( </code><var>x</var><code> ) M</code>

Special methods for unipotent elements. We are using the fact
 <table border="0" width="100%"><tr><td><table align="center" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> </td><td align="left" class="cl">⎛ ⎝</td><td nowrap="nowrap" align="center">xr1( t1) ···xrm(tm) </td><td align="left" class="cl">⎞ ⎠</td><td nowrap="nowrap" align="center">−1 </td><td nowrap="nowrap" align="center"> = xrm(−tm) ···xr1(−t1) . </td></tr></table></td></tr></table>

<a name = "SSEC003.16"></a>
<li><code>IsOne( </code><var>x</var><code> ) M</code>

Special method for unipotent elements. Returns <code>true</code> if and only if <var>x</var>
is equal to the identity element.

<a name = "SSEC003.17"></a>
<li><code></code><var>x</var><code> ^ </code><var>i</var><code> M</code>

Integral powers of the unipotent elements are calculated by the default
methods installed in GAP. But special (more efficient) methods are
instlled for root elements and for the identity.

<a name = "SSEC003.18"></a>
<li><code></code><var>x</var><code> ^ </code><var>y</var><code> M</code>

Conjugation of two unipotent elements, i.e. xy = y−1xy. The
representation of the result will be the representation of <var>x</var>.

<a name = "SSEC003.19"></a>
<li><code>Comm( </code><var>x</var><code>, </code><var>y</var><code> ) M</code>
<li><code>Comm( </code><var>x</var><code>, </code><var>y</var><code>, "canonical" ) M</code>

Special methods for unipotent elements.

<code>Comm</code> returns the commutator of <var>x</var> and <var>y</var>, i.e. x −1 ·y −1 ·x ·y . The second variant returns the canonical form of the
commutator. In some cases it may be more efficient than <code>CanonicalForm(
Comm( </code><var>x</var><code>, </code><var>y</var><code> ) )</code>

<a name = "SSEC003.20"></a>
<li><code>IsRootElement( </code><var>x</var><code> ) P</code>

<code>IsRootElement</code> returns <code>true</code> if and only if <var>x</var> is a root
element, i.e. x =xr(t) for some root r. We store this property
immediately after creating objects.

Note: the canonical form of <var>x</var> may be a root element even if <var>x</var> isn't
one.

<pre>
gap> x := UnipotChevElemByRN( U_G2, [1,5,1], [2,7,-2] );
x_{1}( 2 ) * x_{5}( 7 ) * x_{1}( -2 )
gap> IsRootElement(x);
false
gap> CanonicalForm(x); IsRootElement(CanonicalForm(x));
x_{5}( 7 )
true
</pre>

<a name = "SSEC003.21"></a>
<li><code>IsCentral( </code><var>U</var><code>, </code><var>z</var><code> )</code>

Special method for a unipotent subgroup and a unipotent element.


<h2><a name="SECT004">2.4 Symbolic computation</a></h2>

In some cases, calculation with explicite elements is not enough.
Unipot povides a way to do symbolic calculations with unipotent
elements for this purpose. This is done by using indeterminates (see
GAP Reference Manual, <a href="../../../doc/ref/chap66.html#X7A8FADCD875826DA">Indeterminates</a> for more information) over
the underlying field instead of the field elements.

<pre>
gap> U_G2 := UnipotChevSubGr("G", 2, Rationals);;
gap> a := Indeterminate( Rationals, "a" );
a
gap> b := Indeterminate( Rationals, "b", [a] );
b
gap> c := Indeterminate( Rationals, "c", [a,b] );
c
gap> x := UnipotChevElemByFC(U_G2, [ [3,1], [1,0], [0,1] ], [a,b,c] );
x_{[ 3, 1 ]}( a ) * x_{[ 1, 0 ]}( b ) * x_{[ 0, 1 ]}( c )
gap> CanonicalForm(x);
x_{[ 1, 0 ]}( b ) * x_{[ 0, 1 ]}( c ) * x_{[ 3, 1 ]}( a ) *
x_{[ 3, 2 ]}( a*c )
gap> CanonicalForm(x^-1);
x_{[ 1, 0 ]}( -b ) * x_{[ 0, 1 ]}( -c ) * x_{[ 1, 1 ]}( b*c ) *
x_{[ 2, 1 ]}( -b^2*c ) * x_{[ 3, 1 ]}( -a+b^3*c ) * x_{[ 3, 2 ]}( b^3*c^2 )
</pre>

[<a href = "chapters.htm">Up</a>] [<a href ="CHAP001.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]

<address>unipot manual July 2024
</address></body></html>

quality100%

¤ Dauer der Verarbeitung: 0.19 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

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.