Elements

Elements in orders have two representations: they can be viewed as elements in the $\mathbf Z^n$ giving the coefficients wrt to the order basis where they are elements in. On the other hand, as every order is in a field, they also have a representation as number field elements. Since, asymptotically, operations are more efficient in the field (due to fast polynomial arithmetic) than in the order, the primary representation is that as a field element.

Creation

Elements are constructed either as linear combinations of basis elements or via explicit coercion. Elements will be of type NfAbsOrdElem, the type if actually parametrized by the type of the surrounding field and the type of the field elements. E.g. the type of any element in any order of an absolute simple field will be NfAbsOrdElem{AnticNumberField,nf_elem}

# NfAbsOrd — Type.

  (O::NumFieldOrd)(a::IntegerUnion) -> NumFieldOrdElem

Given an element $a$ of type fmpz or Integer, this function coerces the element into $\mathcal O$.

source

  (O::NfAbsOrd)(arr::Vector{fmpz})

Returns the element of $\mathcal O$ with coefficient vector arr.

source

Basic properties

# parent — Method.

parent(a::NumFieldOrdElem) -> NumFieldOrd

Returns the order of which $a$ is an element.

source

# elem_in_nf — Method.

elem_in_nf(a::NumFieldOrdElem) -> NumFieldElem

Returns the element $a$ considered as an element of the ambient number field.

source

# coordinates — Method.

coordinates(a::NfAbsOrdElem) -> Vector{fmpz}

Returns the coefficient vector of $a$ with respect to the basis of the order.

source

# discriminant — Method.

discriminant(B::Vector{NumFieldOrdElem})

Returns the discriminant of the family $B$ of algebraic numbers, i.e. $det((tr(B[i]*B[j]))_{i, j})^2$.

source

discriminant(E::EllCrv{T}) -> T

Compute the discriminant of $E$.

source

discriminant(C::HypellCrv{T}) -> T

Compute the discriminant of $C$.

source

discriminant(O::AlgssRelOrd)

Returns the discriminant of $O$.

source

# == — Method.

==(x::NumFieldOrdElem, y::NumFieldOrdElem) -> Bool

Returns whether $x$ and $y$ are equal.

source

Arithmetic

All the usual arithmetic operatinos are defined:

• -(::NUmFieldOrdElem)
• +(::NumFieldOrdElem, ::NumFieldOrdElem)
• -(::NumFieldOrdElem, ::NumFieldOrdElem)
• *(::NumFieldOrdElem, ::NumFieldOrdElem)
• ^(::NumFieldOrdElem, ::Int)
• mod(::NfAbsOrdElem, ::Int)
• mod_sym(::NumFieldOrdElem, ::fmpz)
• powermod(::NfAbsOrdElem, ::fmpz, ::Int)

Miscellaneous

# representation_matrix — Method.

representation_matrix(a::NfAbsOrdElem) -> fmpz_mat

Returns the representation matrix of the element $a$.

source

# representation_matrix — Method.

representation_matrix(a::NfAbsOrdElem, K::AnticNumberField) -> FakeFmpqMat

Returns the representation matrix of the element $a$ considered as an element of the ambient number field $K$. It is assumed that $K$ is the ambient number field of the order of $a$.

source

# tr — Method.

tr(a::NumFieldOrdElem)

Returns the trace of $a$ as an element of the base ring.

source

# norm — Method.

norm(a::NumFieldOrdElem)

Returns the norm of $a$ as an element in the base ring.

source

# absolute_norm — Method.

absolute_norm(a::NumFieldOrdElem) -> fmpz

Return the absolute norm as an integer.

source

# absolute_tr — Method.

absolute_tr(a::NumFieldOrdElem) -> fmpz

Return the absolute trace as an integer.

source

# rand — Method.

rand(O::NfOrd, n::IntegerUnion) -> NfAbsOrdElem

Computes a coefficient vector with entries uniformly distributed in $\{-n,\dotsc,-1,0,1,\dotsc,n\}$ and returns the corresponding element of the order $\mathcal O$.

source

# minkowski_map — Method.

minkowski_map(a::NumFieldOrdElem, abs_tol::Int) -> Vector{arb}

Returns the image of $a$ under the Minkowski embedding. Every entry of the array returned is of type arb with radius less then 2^-abs_tol.

source

# conjugates_arb — Method.

conjugates_arb(x::NumFieldOrdElem, abs_tol::Int) -> Vector{acb}

Compute the conjugates of $x$ as elements of type acb. Recall that we order the complex conjugates $\sigma_{r+1}(x),...,\sigma_{r+2s}(x)$ such that $\sigma_{i}(x) = \overline{\sigma_{i + s}(x)}$ for $r + 2 \leq i \leq r + s$.

Every entry $y$ of the array returned satisfies radius(real(y)) < 2^-abs_tol, radius(imag(y)) < 2^-abs_tol respectively.

source

# conjugates_arb_log — Method.

conjugates_arb_log(x::NumFieldOrdElem, abs_tol::Int) -> Vector{arb}

Returns the elements $(\log(\lvert \sigma_1(x) \rvert),\dotsc,\log(\lvert\sigma_r(x) \rvert), \dotsc,2\log(\lvert \sigma_{r+1}(x) \rvert),\dotsc, 2\log(\lvert \sigma_{r+s}(x)\rvert))$ as elements of type arb radius less then 2^-abs_tol.

source

# t2 — Method.

t2(x::NumFieldOrdElem, abs_tol::Int = 32) -> arb

Return the $T_2$-norm of $x$. The radius of the result will be less than 2^-abs_tol.

source

# minpoly — Method.

minpoly(a::NfAbsOrdElem) -> fmpz_poly

The minimal polynomial of $a$.

source

# charpoly — Method.

charpoly(a::NfAbsOrdElem) -> fmpz_poly
charpoly(a::NfAbsOrdElem, FlintZZ) -> fmpz_poly

The characteristic polynomial of $a$.

source

# factor — Method.

factor(a::NfOrdElem) -> Fac{NfOrdElem}

Computes a factorization of $a$ into irreducible elements. The return value is a factorization fac, which satisfies a = unit(fac) * prod(p^e for (p, e) in fac).

The function requires that $a$ is non-zero and that all prime ideals containing $a$ are principal, which is for example satisfied if class group of the order of $a$ is trivial.

source

# denominator — Method.

denominator(a::NumFieldElem, O::NfOrd) -> fmpz

Returns the smallest positive integer $k$ such that $k \cdot a$ is contained in $\mathcal O$.

source

# discriminant — Method.

discriminant(B::Vector{NumFieldOrdElem})

Returns the discriminant of the family $B$ of algebraic numbers, i.e. $det((tr(B[i]*B[j]))_{i, j})^2$.

source

discriminant(E::EllCrv{T}) -> T

Compute the discriminant of $E$.

source

discriminant(C::HypellCrv{T}) -> T

Compute the discriminant of $C$.

source

discriminant(O::AlgssRelOrd)

Returns the discriminant of $O$.

source