Quelle chap5_mj.html Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/polenta/doc/chap5_mj.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<script type="text/javascript"
  src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (Polenta) - Chapter 5: Information Messages</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap5"  onload="jscontent()">

<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap4_mj.html">[Previous Chapter]</a>    <a href="chapBib_mj.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chap5.html">[MathJax off]</a></p>
<p><a id="X85677704855596EB" name="X85677704855596EB"></a></p>
<div class="ChapSects"><a href="chap5_mj.html#X85677704855596EB">5 <span class="Heading">Information Messages</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap5_mj.html#X7EBFC26F83EB9F72">5.1 <span class="Heading">Info Class</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5_mj.html#X809F2CFB87393CE0">5.1-1 InfoPolenta</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap5_mj.html#X85861B017AEEC50B">5.2 <span class="Heading">Example</span></a>
</span>
</div>
</div>

<h3>5 <span class="Heading">Information Messages</span></h3>

<p>It is possible to get informations about the status of the computation of the functions of Chapter <a href="chap2_mj.html#X829BA50B82FEC109"><span class="RefLink">2</span></a> of this manual.</p>

<p><a id="X7EBFC26F83EB9F72" name="X7EBFC26F83EB9F72"></a></p>

<h4>5.1 <span class="Heading">Info Class</span></h4>

<p><a id="X809F2CFB87393CE0" name="X809F2CFB87393CE0"></a></p>

<h5>5.1-1 InfoPolenta</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ InfoPolenta</code></td><td class="tdright">( info class )</td></tr></table></div>
<p>is the Info class of the <strong class="pkg">Polenta</strong> package (for more details on the Info mechanism see Section <a href="../../../doc/ref/chap7_mj.html#X7A9C902479CB6F7C"><span class="RefLink">Reference: Info Functions</span></a> of the <strong class="pkg">GAP</strong> Reference Manual). With the help of the function <code class="code">SetInfoLevel(InfoPolenta,<var class="Arg">level</var>)</code> you can change the info level of <code class="code">InfoPolenta</code>.</p>

<ul>
<li><p>If <code class="code">InfoLevel( InfoPolenta )</code> is equal to 0 then no information messages are displayed.</p>

</li>
<li><p>If <code class="code">InfoLevel( InfoPolenta )</code> is equal to 1 then basic informations about the process are provided. For further background on the displayed informations we refer to <a href="chapBib_mj.html#biBAssmann">[Ass03]</a> (publicly available via the Internet address <span class="URL"><a href="http://www.icm.tu-bs.de/ag_algebra/software/assmann/diploma.pdf">http://www.icm.tu-bs.de/ag_algebra/software/assmann/diploma.pdf</a></span>).</p>

</li>
<li><p>If <code class="code">InfoLevel( InfoPolenta )</code> is equal to 2 then, in addition to the basic information, the generators of computed subgroups and module series are displayed.</p>

</li>
</ul>
<p><a id="X85861B017AEEC50B" name="X85861B017AEEC50B"></a></p>

<h4>5.2 <span class="Heading">Example</span></h4>

<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">SetInfoLevel( InfoPolenta, 1 );</span>

<span class="GAPprompt">gap></span> <span class="GAPinput">PcpGroupByMatGroup( PolExamples(11) );</span>
#I  Determine a constructive polycyclic sequence
    for the input group ...
#I
#I  Chosen admissible prime: 3
#I
#I  Determine a constructive polycyclic sequence
    for the image under the p-congruence homomorphism ...
#I  finished.
#I  Finite image has relative orders [ 3, 2, 3, 3, 3 ].
#I
#I  Compute normal subgroup generators for the kernel
    of the p-congruence homomorphism ...
#I  finished.
#I
#I  Compute the radical series ...
#I  finished.
#I  The radical series has length 4.
#I
#I  Compute the composition series ...
#I  finished.
#I  The composition series has length 5.
#I
#I  Compute a constructive polycyclic sequence
    for the induced action of the kernel to the composition series ...
#I  finished.
#I  This polycyclic sequence has relative orders [  ].
#I
#I  Calculate normal subgroup generators for the
    unipotent part ...
#I  finished.
#I
#I  Determine a constructive polycyclic  sequence
    for the unipotent part ...
#I  finished.
#I  The unipotent part has relative orders
#I  [ 0, 0, 0 ].
#I
#I  ... computation of a constructive
    polycyclic sequence for the whole group finished.
#I
#I  Compute the relations of the polycyclic
    presentation of the group ...
#I  Compute power relations ...
#I  ... finished.
#I  Compute conjugation relations ...
#I  ... finished.
#I  Update polycyclic collector ...
#I  ... finished.
#I  finished.
#I
#I  Construct the polycyclic presented group ...
#I  finished.
#I
Pcp-group with orders [ 3, 2, 3, 3, 3, 0, 0, 0 ]

<span class="GAPprompt">gap></span> <span class="GAPinput">SetInfoLevel( InfoPolenta, 2 );</span>

<span class="GAPprompt">gap></span> <span class="GAPinput">PcpGroupByMatGroup( PolExamples(11) );</span>
#I  Determine a constructive polycyclic sequence
    for the input group ...
#I
#I  Chosen admissible prime: 3
#I
#I  Determine a constructive polycyclic sequence
    for the image under the p-congruence homomorphism ...
#I  finished.
#I  Finite image has relative orders [ 3, 2, 3, 3, 3 ].
#I
#I  Compute normal subgroup generators for the kernel
    of the p-congruence homomorphism ...
#I  finished.
#I  The normal subgroup generators are
#I  [ [ [ 1, -3/2, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 0, 0, 24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3, 3, 15 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3, 3, 9 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3/2, 3/2, 3/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3/2, 9/2, -69/2 ], [ 0, 1, 0, 9 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ]
    , [ [ 1, 0, 0, -24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, -3, -15 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3/2, -3/2, -9/2 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ]
     ],
  [ [ 1, -3, -3, -12 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3, -3/2, -21 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3/2, 3/2, 9/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ] ]
#I
#I  Compute the radical series ...
#I  finished.
#I  The radical series has length 4.
#I  The radical series is
#I  [ [ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ], [ [ 0, 0, 0, 1 ] ],
  [  ] ]
#I
#I  Compute the composition series ...
#I  finished.
#I  The composition series has length 5.
#I  The composition series is
#I  [ [ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ], [ [ 0, 0, 0, 1 ] ], [  ] ]
#I
#I  Compute a constructive polycyclic sequence
    for the induced action of the kernel to the composition series ...
#I  finished.
#I  This polycyclic sequence has relative orders [  ].
#I
#I  Calculate normal subgroup generators for the
    unipotent part ...
#I  finished.
#I  The normal subgroup generators for the unipotent part are
#I  [ [ [ 1, -3/2, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 0, 0, 24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3, 3, 15 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3, 3, 9 ], [ 0, 1, 0, 6 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3/2, 3/2, 3/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3/2, 9/2, -69/2 ], [ 0, 1, 0, 9 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ] ]
    , [ [ 1, 0, 0, -24 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, -3, -15 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, -3, -9 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3, 0, 9 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, -3/2, -3/2, -9/2 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, 3 ], [ 0, 0, 0, 1 ]
     ],
  [ [ 1, -3, -3, -12 ], [ 0, 1, 0, -6 ], [ 0, 0, 1, 6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3, -3/2, -21 ], [ 0, 1, 0, -3 ], [ 0, 0, 1, -6 ], [ 0, 0, 0, 1 ] ],
  [ [ 1, 3/2, 3/2, 9/2 ], [ 0, 1, 0, 3 ], [ 0, 0, 1, -3 ], [ 0, 0, 0, 1 ] ] ]
#I
#I  Determine a constructive polycyclic  sequence
    for the unipotent part ...
#I  finished.
#I  The unipotent part has relative orders
#I  [ 0, 0, 0 ].
#I
#I  ... computation of a constructive
    polycyclic sequence for the whole group finished.
#I
#I  Compute the relations of the polycyclic
    presentation of the group ...
#I  Compute power relations ...
.....
#I  ... finished.
#I  Compute conjugation relations ...
..............................................
#I  ... finished.
#I  Update polycyclic collector ...
#I  ... finished.
#I  finished.
#I
#I  Construct the polycyclic presented group ...
#I  finished.
#I
Pcp-group with orders [ 3, 2, 3, 3, 3, 0, 0, 0 ]
</pre></div>

<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap4_mj.html">[Previous Chapter]</a>    <a href="chapBib_mj.html">[Next Chapter]</a>   </div>

<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>

<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

quality96%

¤ Dauer der Verarbeitung: 0.13 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.