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

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

Computes the valuation of an ideal at a prime ideal.

<p><p>

<h3>
Syntax:
</h3>
<pre>val := IdealValuation(p, I);</pre>

<p>

<table>
<tr>
<td>ideal</td>
<td><pre>  P  </pre></td>
<td>must be prime</td>
</tr>
<tr>
<td>ideal </td>
<td><pre>  I  </pre></td>
<td></td>
</tr>
<tr>
<td>integer </td>
<td><pre>  val  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Consider the factorization of <tt> I</tt> in prime ideals. This function
returns the exponent of <tt> P</tt> in the factorization
(possibly 0). The prime ideal must not be an index divisor.

The ideal may be fractional, see <tt> IdealFactor</tt> for
interpretation.

This function is only implemented for ideals over absolute
orders.

<p><p>

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

<pre>

kash> O := OrderMaximal (Order (Poly (Zx,[1,6,6,6])));
Generating polynomial: x^3 + 6*x^2 + 6*x + 6
Discriminant: -1836 

kash> P := Factor(5*O)[1][1];
<5, [1, 1, 0]>
kash> IdealValuation (P, Elt (O, [5,5,5])*O);
1
kash> P := Factor(2*O)[1][1];
<2, [0, 1, 0]>
kash> IdealValuation (P, Elt (O, [8,8,8])*O);
9
kash> IdealValuation (P, 2*O);
> 3

</pre>

<p>


<hr>

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