Subsections

• Ideal Arithmetic
• Two-Element Presentations
• Invariants
• Factorization and Primes
• Basis Representation
• Predicates on Ideals

The product IJ of the (fractional) ideals I and J, generated by the products of elements of I and elements of J.

The quotient of the (fractional) ideals I and J of an order O. This is the fractional ideal K of O with the property that J K=I.

The k-th power of the (fractional) ideal I (for an integer k).

Given an element x of (or coercible into) a number field K, and a (fractional) ideal I in an order of K, return the product of the ideal and the principal ideal generated by x.

Given a (fractional) ideal I of O, return two elements of O that generate I as an ideal.

Given a (fractional) ideal I of O, return two elements of the field of fractions of O that generate I as an ideal.

Given an integral ideal I of O, return two elements of the field of fractions of O that form a two-element normal presentation for I, as well as an integer g such that I is g-normal.

Currently this produces reliable results only when I is a prime ideal.

The denominator of the fractional ideal I. This is the smallest positive integer d such that dI is an integral ideal.

The index of the integral ideal I, when viewed as a sublattice of the order O. This is the same as the cardinality of the finite quotient ring O/I.

The norm of the fractional ideal I. This returns the index of the ideal if the ideal is integral, and defined on fractional ideals by multiplicativity (so that the norm of I^(-1) equals the reciprocal of the norm of I.

Given an ideal I this function returns the least positive integer m contained in I.

Returns, for a prime ideal P of an order O lying over the rational prime p, the maximal exponent e such that P^e divides the principal ideal pO.

Given a prime ideal I this function returns the residue class degree f of the ideal I.

Given a prime ideal I and an ideal J in an order O, return the valuation v_I(J) of J at I, that is, the number of factors I in the prime ideal decomposition of J. Note that, since the ideal J is allowed to be a fractional ideal, the returned value may be a negative integer.

Given a rational prime number p and an order O, return a sequence of tuples consisting of prime ideals and exponents, according to the decomposition of p in O.

Returns the prime ideal factorization of an integral I in an order O, as a sequence of two-tuples (prime ideal and integer exponent).

Given an order O as well as a positive integer bound B, return a sequence consisting of all prime ideals in O whose norm is a (rational) prime not exceeding the bound B.

Given an ideal I of an order O of the number field K, this function returns a Z-basis for I as a sequence of elements of K.

Returns the basis matrix for the ideal I of O. The basis matrix consists of the elements of a Z-basis for the ideal written as rows of rational coefficients with respect to the power basis of the number field K of which O is an order.

Returns the transformation matrix for the ideal I of O, as well as a denominator. The transformation matrix consists of the elements of a Z-basis for the ideal written as columns of coefficients with respect to the basis of the order O.

Returns the multiplicator ring of the ideal I of the order O, that is, the subring of elements of the field of fractions of O that multiply I into itself.

Returns the p-radical of an order O for a prime integer p, defined as the ideal consisting of elements of O for which some power lies in the principal ideal pO.

The predicates listed below allow fractional ideals as argument.

I eq J : RngOrdIdl, RngOrdIdl -> BoolElt

I ne J : RngOrdIdl, RngOrdIdl -> BoolElt

x in I : FldNumElt, RngOrdElt -> BoolElt

x notin I : FldNumElt, RngOrdElt -> BoolElt

True if and only if the fractional ideal I is integral.

True if and only if I is a prime ideal, and false otherwise. If I is not prime, the function also returns a proper divisor (ideal).

Currently this function becomes very slow for ideals with large norm.

Returns true if the fractional ideal I of the order O is a principal ideal, false otherwise. If I is principal, a generator (as an element of the field of fractions of O) is also returned.

Note that this function may take a very long time to return. This is partly due to the fact that IsPrincipal needs knowledge about units, and hence the calculation of the unit group will be triggered if necessary.

True if I is the zero ideal, false otherwise.

> function IdealFactorization(I)
>    primes := [Parent(I)|];
>    expts  := [Integers()|];
>    facts  := [I];
>    while not IsEmpty(facts) do
>       term := facts[1];
>       Remove( ~facts, 1 );
>       flag, divisor := IsPrime( term );
>       if flag then
>          pos := Index( primes, term );
>          if pos eq 0 then
>             Append( ~primes, term );
>             Append( ~expts, 1 );
>          else
>             expts[pos] +:= 1;
>          end if;
>       else
>          Append( ~facts, divisor );
>          Append( ~facts, I/divisor );
>        end if;
>    end while;
>    return [ <primes[i], expts[i]> : i in [1..#primes] ];
> end function;