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

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

Embeds one or more ideals into a given order.

<p><p>

<h3>
Syntax:
</h3>
<pre>I2 := IdealMove(I1, o);</pre>

<p>

<table>
<tr>
<td>same type as I1</td>
<td><pre>  I2  </pre></td>
<td></td>
</tr>
<tr>
<td>ideal | list of ideals</td>
<td><pre>  I1  </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#EltMove">EltMove</a>

<p>

<h3>
Description:
</h3>
If <tt> I1</tt> is an ideal, it is moved into <tt> o</tt>. This is done
via a 2-element representation of the ideal. We assume that KASH
already knows an embedding of the coeficient order of <tt> I1</tt>
into <tt> o</tt>.

If <tt> I1</tt> is a (factor) list of ideals all ideals contained are
moved.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>
We will create an order O, search (and find) an order o
created by a better polynomial (smaller index or coefficients),
factor 2 in o where it is no index divisor and move it to O.
<pre>

kash> O := OrderMaximal(Order(x^6 - 9*x^4 - 4*x^3 + 27*x^2 - 36*x - 23));;
kash> o := OrderShort(O);;
kash> IdealMove(2*o, O);
<2>
kash> IdealMove(Factor(2*o), O);
> [ [ <2, [1, -2, 2, 1, 4, -4]>, 6 ] ]

</pre>

<p>


<hr>

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