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

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

primitive element of an ideal

<p><p>

<h3>
Syntax:
</h3>
<pre>e:=IdealPrimeElt(I);</pre>

<p>

<table>
<tr>
<td>algebraic number</td>
<td><pre>  e  </pre></td>
<td></td>
</tr>
<tr>
<td>Ideal</td>
<td><pre>  I  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
An element of an ideal is called primitive if it is not contained
in the square of the ideal. Once computed, the primitve element is
stored in the ideal data structure so it will not be recomputed.

This function is implemented only for absolute ideals.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>

kash> O := OrderMaximal(Order(Poly(Zx, [1, 6, 6, 6])));;
kash> Lp := Factor(6*O);
[ [ <2, [0, 1, 0]>, 3 ], [ <3, [0, 1, 0]>, 3 ] ]
kash> I := Lp[1][1]*Lp[2][1];
<
[6 0 0]
[0 1 0]
[0 0 1]
>

kash> IdealPrimeElt(I);
> [0, 1, 35]

</pre>

<p>


<hr>

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