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

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

Computes a relative representation of the given orders.

<p><p>

<h3>
Syntax:
</h3>
<pre>Or := OrderRelativeOrder(O, o);</pre>

<p>

<table>
<tr>
<td>order</td>
<td><pre>  Or  </pre></td>
<td></td>
</tr>
<tr>
<td>order</td>
<td><pre>  O  </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#OrderAbs">OrderAbs</a>

<p>

<h3>
Description:
</h3>
This function computes a relative representation for <tt> O</tt> and <tt> o</tt>
where <tt> o</tt> is a suborder of <tt> O</tt>. The homomorphisms are installed.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>
A simple example
<pre>

kash> O:=Order(x^4-4*x^2+1);
Generating polynomial: x^4 - 4*x^2 + 1

kash> o:=OrderSubfield(O)[2];
Generating polynomial: x^2 - 2

kash> Or:=OrderRelativeOrder(O, o);
>       F[1]
        /
       /
   E1[1]
  /
 /
Q
F  [ 1]     x^2 + [0, 1]*x - 1
E 1[ 1]     x^2 - 2


</pre>

<p>


<hr>

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