[back] [prev] [next] [index] [root]

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="OrderIsMaximal"></a>
OrderIsMaximal
</h2>

Tests whether the given order is known to be maximal or not.

<p><p>

<h3>
Syntax:
</h3>
<pre>B := OrderIsMaximal(o);</pre>

<p>

<table>
<tr>
<td>boolean</td>
<td><pre>  B  </pre></td>
<td></td>
</tr>
<tr>
<td>order</td>
<td><pre>  o  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#OrderSetMaximal">OrderSetMaximal</a>

<p>

<h3>
Description:
</h3>
This function checks if the given order o is known to be maximal
according to the OrderIsMaximal flag.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>
The order {\Bbb Z}[\alpha] with a^4 + 73\alpha^2- 280 \alpha - 2399
= 0 is not known to be maximal. 
<pre>

kash> o := Order (Poly(Zx,[1,0,73,-280,-2399]));;
kash> OrderIsMaximal (o);
false
kash> O := OrderMaximal (o);
   F[1]
    |
   F[2]
  /
 /
Q
F  [ 1]     Given by transformation matrix
F  [ 2]     x^4 + 73*x^2 - 280*x - 2399
Discriminant: -997975 

kash> OrderIsMaximal (O);
> true

</pre>

<p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]