---
title: "Element Operations"
canonical: "https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/operation-element.html"
source: "https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/operation-element.md"
part: "Global Fields"
chapter: "Number Fields"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Global Fields", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/index-global-fields.md"}
  - {"title": "Number Fields", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/index-number-fields.md"}
prev: {"title": "Fields with a Labelled Embedding", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/embedded-number-fields.md"}
next: {"title": "Class Group and Unit Group", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/class-unit-group.md"}
intrinsics:
  - {"name": "Parent", "signature": "Parent(a): FldNumElt -> FldNum"}
  - {"name": "Category", "signature": "Category(a): FldNumElt -> Cat"}
  - {"name": "Type", "signature": "Type(a): FldNumElt -> Cat"}
  - {"name": "ExtendedType", "signature": "ExtendedType(a): FldNumElt -> Cat"}
  - {"name": "+", "signature": "+ a: FldNumElt -> FldNumElt"}
  - {"name": "-", "signature": "- a: FldNumElt -> FldNumElt"}
  - {"name": "+", "signature": "a + b: FldNumElt, FldNumElt -> FldNumElt"}
  - {"name": "-", "signature": "a - b: FldNumElt, FldNumElt -> FldNumElt"}
  - {"name": "*", "signature": "a * b: FldNumElt, FldNumElt -> FldNumElt"}
  - {"name": "/", "signature": "a / b: FldNumElt, FldNumElt -> FldNumElt"}
  - {"name": "^", "signature": "a ^ k: FldNumElt, RngIntElt -> FldNumElt"}
  - {"name": "Sqrt", "signature": "Sqrt(a): FldNumElt -> FldNumElt"}
  - {"name": "SquareRoot", "signature": "SquareRoot(a): FldNumElt -> FldNumElt"}
  - {"name": "Root", "signature": "Root(a, n): FldNumElt, RngIntElt -> FldNumElt"}
  - {"name": "IsPower", "signature": "IsPower(a, k): FldNumElt, RngIntElt -> BoolElt, FldNumElt"}
  - {"name": "IsSquare", "signature": "IsSquare(a): FldNumElt -> BoolElt, FldNumElt"}
  - {"name": "Denominator", "signature": "Denominator(a): FldNumElt -> RngIntElt"}
  - {"name": "Numerator", "signature": "Numerator(a): FldNumElt -> RngIntElt"}
  - {"name": "Qround", "signature": "Qround(E, M): FldNumElt, RngIntElt -> FldNumElt"}
  - {"name": "eq", "signature": "a eq b: FldNumElt, FldNumElt -> BoolElt"}
  - {"name": "ne", "signature": "a ne b: FldNumElt, FldNumElt -> BoolElt"}
  - {"name": "in", "signature": "a in F: FldNumElt, FldNum -> BoolElt"}
  - {"name": "IsIntegral", "signature": "IsIntegral(a): FldNumElt -> BoolElt, RngIntElt"}
  - {"name": "IsPrimitive", "signature": "IsPrimitive(a): FldNumElt -> BoolElt"}
  - {"name": "IsTotallyPositive", "signature": "IsTotallyPositive(a): FldNumElt -> BoolElt"}
  - {"name": "IsZero", "signature": "IsZero(a): FldNumElt -> BoolElt"}
  - {"name": "IsOne", "signature": "IsOne(a): FldNumElt -> BoolElt"}
  - {"name": "IsMinusOne", "signature": "IsMinusOne(a): FldNumElt -> BoolElt"}
  - {"name": "IsUnit", "signature": "IsUnit(a): FldNumElt -> BoolElt"}
  - {"name": "IsNilpotent", "signature": "IsNilpotent(a): FldNumElt -> BoolElt"}
  - {"name": "IsIdempotent", "signature": "IsIdempotent(a): FldNumElt -> BoolElt"}
  - {"name": "IsZeroDivisor", "signature": "IsZeroDivisor(a): FldNumElt -> BoolElt"}
  - {"name": "IsRegular", "signature": "IsRegular(a): FldNumElt -> BoolElt"}
  - {"name": "IsIrreducible", "signature": "IsIrreducible(a): FldNumElt -> BoolElt"}
  - {"name": "IsPrime", "signature": "IsPrime(a): FldNumElt -> BoolElt"}
  - {"name": ".", "signature": "K . 1: FldNum -> FldNumElt"}
  - {"name": "PrimitiveElement", "signature": "PrimitiveElement(K): FldNum -> FldNumElt"}
  - {"name": "Generators", "signature": "Generators(K): FldNum -> {FldNumElt}"}
  - {"name": "GeneratorsOverBaseRing", "signature": "GeneratorsOverBaseRing(K): FldNum -> {FldNumElt}"}
  - {"name": "GeneratorsSequence", "signature": "GeneratorsSequence(K): FldNum -> [FldNumElt]"}
  - {"name": "GeneratorsSequenceOverBaseRing", "signature": "GeneratorsSequenceOverBaseRing(K): FldNum -> [FldNumElt]"}
  - {"name": "Generators", "signature": "Generators(K, k): FldAlg, FldAlg -> [FldAlgElt]"}
  - {"name": "Generators", "signature": "Generators(K, Q): FldAlg, FldRat -> [FldAlgElt]"}
  - {"name": "Norm", "signature": "Norm(a): FldNumElt -> FldNumElt"}
  - {"name": "Norm", "signature": "Norm(a, R): FldNumElt, Rng -> RngElt"}
  - {"name": "AbsoluteNorm", "signature": "AbsoluteNorm(a): FldNumElt -> FldRatElt"}
  - {"name": "NormAbs", "signature": "NormAbs(a): FldNumElt -> FldRatElt"}
  - {"name": "Trace", "signature": "Trace(a): FldNumElt -> FldNumElt"}
  - {"name": "Trace", "signature": "Trace(a): FldNumElt -> FldRatElt"}
  - {"name": "Trace", "signature": "Trace(a, R): FldNumElt, Rng -> RngElt"}
  - {"name": "AbsoluteTrace", "signature": "AbsoluteTrace(a): FldNumElt -> FldRatElt"}
  - {"name": "TraceAbs", "signature": "TraceAbs(a): FldNumElt -> FldRatElt"}
  - {"name": "CharacteristicPolynomial", "signature": "CharacteristicPolynomial(a): FldNumElt -> RngUPolElt"}
  - {"name": "CharacteristicPolynomial", "signature": "CharacteristicPolynomial(a, R): FldNumElt, Rng -> RngUPolElt"}
  - {"name": "AbsoluteCharacteristicPolynomial", "signature": "AbsoluteCharacteristicPolynomial(a): FldNumElt -> RngUPolElt"}
  - {"name": "MinimalPolynomial", "signature": "MinimalPolynomial(a): FldNumElt -> RngUPolElt"}
  - {"name": "MinimalPolynomial", "signature": "MinimalPolynomial(a, R): FldNumElt, Rng -> RngUPolElt"}
  - {"name": "AbsoluteMinimalPolynomial", "signature": "AbsoluteMinimalPolynomial(a): FldNumElt -> RngUPolElt"}
  - {"name": "RepresentationMatrix", "signature": "RepresentationMatrix(a): FldNumElt -> NumMatElt"}
  - {"name": "RepresentationMatrix", "signature": "RepresentationMatrix(a, R): FldNumElt, Rng -> NumMatElt"}
  - {"name": "AbsoluteRepresentationMatrix", "signature": "AbsoluteRepresentationMatrix(a): FldNumElt -> NumMatElt"}
  - {"name": "ElementToSequence", "signature": "ElementToSequence(a): FldNumElt -> [ FldNumElt ]"}
  - {"name": "Eltseq", "signature": "Eltseq(a): FldNumElt -> [ FldNumElt ]"}
  - {"name": "Eltseq", "signature": "Eltseq(E, k): FldNumElt, FldNum -> [RngElt]"}
  - {"name": "Eltseq", "signature": "Eltseq(E, k): FldNumElt, Rng -> [RngElt]"}
  - {"name": "Flat", "signature": "Flat(e): FldNumElt -> [ FldRatElt]"}
  - {"name": "a[i]", "signature": "a[i]: FldNumElt, RngIntElt -> FldRatElt"}
  - {"name": "a[i]", "signature": "a[i]: FldNumElt, RngIntElt -> FldNumElt"}
  - {"name": "ProductRepresentation", "signature": "ProductRepresentation(a): FldNumElt -> [ FldNumElt ], [ RngIntElt ]"}
  - {"name": "ProductRepresentation", "signature": "ProductRepresentation(P, E): [ FldNumElt ], [ RngIntElt ] -> FldNumElt"}
  - {"name": "PowerProduct", "signature": "PowerProduct(P, E): [FldNumElt], [RngIntElt] -> FldNumElt"}
examples:
  - "ex-441d85"
---

<a id="operation-element"></a>
<a id="fldnum-elt-ops"></a>
# Element Operations

## Parent and Category

<a id="function-parent-fldnumelt"></a>
### `Parent(a): FldNumElt -> FldNum`

<a id="function-category-fldnumelt"></a>
### `Category(a): FldNumElt -> Cat`

<a id="function-type-fldnumelt"></a>
### `Type(a): FldNumElt -> Cat`

<a id="function-extendedtype-fldnumelt"></a>
### `ExtendedType(a): FldNumElt -> Cat`

## Arithmetic

The table below lists the generic arithmetic functions on number field elements. Note that automatic coercion ensures that the binary operations `+`, `-`, `*`, and `/` may be applied to an element of a number field and an element of one of its orders; the result will be a number field element.

<a id="operation-operation-fldnumelt-fldnumelt"></a>
### `+ a: FldNumElt -> FldNumElt`

<a id="operation-operation-fldnumelt-fldnumelt-2"></a>
### `- a: FldNumElt -> FldNumElt`

<a id="operation-op-plus-fldnumelt-fldnumelt"></a>
### `a + b: FldNumElt, FldNumElt -> FldNumElt`

<a id="operation-op-minus-fldnumelt-fldnumelt"></a>
### `a - b: FldNumElt, FldNumElt -> FldNumElt`

<a id="operation-op-times-fldnumelt-fldnumelt"></a>
### `a * b: FldNumElt, FldNumElt -> FldNumElt`

<a id="operation-op-div-fldnumelt-fldnumelt"></a>
### `a / b: FldNumElt, FldNumElt -> FldNumElt`

<a id="operation-op-pow-fldnumelt-rngintelt"></a>
### `a ^ k: FldNumElt, RngIntElt -> FldNumElt`

<a id="function-sqrt-fldnumelt"></a>
### `Sqrt(a): FldNumElt -> FldNumElt`

<a id="function-squareroot-fldnumelt"></a>
### `SquareRoot(a): FldNumElt -> FldNumElt`

Returns the square root of the number field element $a$ if it exists in the field containing $a$.

<a id="function-root-fldnumelt-rngintelt"></a>
### `Root(a, n): FldNumElt, RngIntElt -> FldNumElt`

Returns the $n$-th root of the number field element $a$ if it exists in the field containing $a$.

<a id="function-ispower-fldnumelt-rngintelt"></a>
### `IsPower(a, k): FldNumElt, RngIntElt -> BoolElt, FldNumElt`

<a id="function-issquare-fldnumelt"></a>
### `IsSquare(a): FldNumElt -> BoolElt, FldNumElt`

Return `true` if the number field element $a$ is a $k$th power, (respectively square) and the root if so.

<a id="function-denominator-fldnumelt"></a>
### `Denominator(a): FldNumElt -> RngIntElt`

Returns the denominator of the number field element $a$, that is the least common multiple of the denominators of the coefficients of $a$.

<a id="function-numerator-fldnumelt"></a>
### `Numerator(a): FldNumElt -> RngIntElt`

Returns the numerator of the number field element $a$, that is the element multiplied by its denominator.

<a id="function-qround-fldnumelt-rngintelt"></a>
### `Qround(E, M): FldNumElt, RngIntElt -> FldNumElt`

```magma
ContFrac: BoolElt                    Default: true
```

Finds an approximation of the number field element $E$ where the denominator is bounded by the integer $M$. If `ContFrac` is `true`, the approximation is computed by applying the continued fraction algorithm to the coefficients of $E$ viewed over $Q$.

## Equality and Membership

Elements may also be tested for whether they lie in an ideal of an order. See Section [Predicates on Ideals](https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFieldsAndOrders/ideal.md#rngordidl-in).

<a id="operation-op-eq-fldnumelt-fldnumelt"></a>
### `a eq b: FldNumElt, FldNumElt -> BoolElt`

<a id="operation-op-ne-fldnumelt-fldnumelt"></a>
### `a ne b: FldNumElt, FldNumElt -> BoolElt`

<a id="operation-op-in-fldnumelt-fldnum"></a>
### `a in F: FldNumElt, FldNum -> BoolElt`

## Predicates on Elements

In addition to the generic predicates `IsMinusOne`, `IsZero`, and `IsOne`, the predicates `IsIntegral` and `IsPrimitive` are defined on elements of number fields.

<a id="function-isintegral-fldnumelt"></a>
### `IsIntegral(a): FldNumElt -> BoolElt, RngIntElt`

Returns `true` if the element $a$ of a number field $F$ is contained in the ring of integers of $F$, `false` otherwise. We use the minimal polynomial to determine the answer, which means that the calculation of the maximal order is *not* triggered if it is not known yet. A denominator $d$ such that $d*a$ is integral is also returned on request.

<a id="function-isprimitive-fldnumelt"></a>
### `IsPrimitive(a): FldNumElt -> BoolElt`

Returns `true` if the element $a$ of the number field $F$ generates $F$ over its coefficient field.

<a id="function-istotallypositive-fldnumelt"></a>
### `IsTotallyPositive(a): FldNumElt -> BoolElt`

Returns `true` iff all real embeddings of the number field element $a$ are positive. For elements in absolute fields this is equivalent to all real conjugates being positive.

<a id="function-iszero-fldnumelt"></a>
### `IsZero(a): FldNumElt -> BoolElt`

<a id="function-isone-fldnumelt"></a>
### `IsOne(a): FldNumElt -> BoolElt`

<a id="function-isminusone-fldnumelt"></a>
### `IsMinusOne(a): FldNumElt -> BoolElt`

<a id="function-isunit-fldnumelt"></a>
### `IsUnit(a): FldNumElt -> BoolElt`

<a id="function-isnilpotent-fldnumelt"></a>
### `IsNilpotent(a): FldNumElt -> BoolElt`

<a id="function-isidempotent-fldnumelt"></a>
### `IsIdempotent(a): FldNumElt -> BoolElt`

<a id="function-iszerodivisor-fldnumelt"></a>
### `IsZeroDivisor(a): FldNumElt -> BoolElt`

<a id="function-isregular-fldnumelt"></a>
### `IsRegular(a): FldNumElt -> BoolElt`

<a id="function-isirreducible-fldnumelt"></a>
### `IsIrreducible(a): FldNumElt -> BoolElt`

<a id="function-isprime-fldnumelt"></a>
### `IsPrime(a): FldNumElt -> BoolElt`

## Field Generators

<a id="operation-operation-fldnum-fldnumelt"></a>
### `K . 1: FldNum -> FldNumElt`

Return the image $\alpha$ of $x$ in $G[x]/f$ where $f$ is the first defining polynomial of the number field $K$ and $G$ is the base field of $K$.

In case of simple extensions this will be a primitive element.

<a id="function-primitiveelement-fldnum"></a>
### `PrimitiveElement(K): FldNum -> FldNumElt`

Returns a primitive element for the simple number field $K$, that is an element whose minimal polynomial has the same degree as the field. For a simple number field $K$ this is $K.1$ , while for non-simple fields a random element with this property is returned.

<a id="function-generators-fldnum"></a>
### `Generators(K): FldNum -> {FldNumElt}`

The set of generators of the number field $K$ over its coefficient field, that is a set containing a root of each defining polynomial is returned.

<a id="function-generatorsoverbasering-fldnum"></a>
### `GeneratorsOverBaseRing(K): FldNum -> {FldNumElt}`

A set of generators of the number field $K$ over ${\mathbb{Q}}$.

<a id="function-generatorssequence-fldnum"></a>
### `GeneratorsSequence(K): FldNum -> [FldNumElt]`

The sequence of generators of the number field $K$ over its coefficient field, that is a sequence containing a root of each defining polynomial is returned.

<a id="function-generatorssequenceoverbasering-fldnum"></a>
### `GeneratorsSequenceOverBaseRing(K): FldNum -> [FldNumElt]`

A sequence of generators of the number field $K$ over ${\mathbb{Q}}$.

<a id="function-generators-fldalg-fldalg"></a>
### `Generators(K, k): FldAlg, FldAlg -> [FldAlgElt]`

<a id="function-generators-fldalg-fldrat"></a>
### `Generators(K, Q): FldAlg, FldRat -> [FldAlgElt]`

A sequence of generators of the number field $K$ over $k$ is returned. That is a sequence containing a root of each defining polynomial for $K$ and its subfield down to the level of $k$ is returned.

## Real and Complex Embeddings

See Chapter [Number Fields and Orders](https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFieldsAndOrders/index-number-fields-and-orders.md#rngord-main) (on number fields and orders).

## Heights

See Chapter [Number Fields and Orders](https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFieldsAndOrders/index-number-fields-and-orders.md#rngord-main) (on number fields and orders).

## Norm, Trace, and Minimal Polynomial

The norm, trace, and minimal polynomial of number field elements can be calculated both with respect to the coefficient ring and to $\Z$ or $\Q$.

<a id="function-fldnum-norm"></a>
### `Norm(a): FldNumElt -> FldNumElt`

<a id="function-norm-fldnumelt-rng"></a>
### `Norm(a, R): FldNumElt, Rng -> RngElt`

The relative norm $\rm N_{L/F}(a)$ over $F$ of the element $a$ of the number field $L$ where $F$ is the field over which $L$ is defined as an extension. If $R$ is given the norm is calculated over $R$. In this case, $R$ must occur as a coefficient ring somewhere in the tower under $L$.

<a id="function-absolutenorm-fldnumelt"></a>
### `AbsoluteNorm(a): FldNumElt -> FldRatElt`

<a id="function-normabs-fldnumelt"></a>
### `NormAbs(a): FldNumElt -> FldRatElt`

The absolute norm $\rm N_{L/{\mathbb{Q}}}(a)$ over ${\mathbb{Q}}$ of the element $a$ of the number field $L$.

<a id="function-fldnum-trace"></a>
### `Trace(a): FldNumElt -> FldNumElt`

<a id="function-trace-fldnumelt"></a>
### `Trace(a): FldNumElt -> FldRatElt`

<a id="function-trace-fldnumelt-rng"></a>
### `Trace(a, R): FldNumElt, Rng -> RngElt`

The relative trace ${\operatorname{Tr}}_{L/F}(a)$ over $F$ of the element $a$ of the number field $L$ where $F$ is the field over which $L$ is defined as an extension. If $R$ is given the trace is computed over $R$. In this case, $R$ must occur as a coefficient ring somewhere in the tower under $L$.

<a id="function-absolutetrace-fldnumelt"></a>
### `AbsoluteTrace(a): FldNumElt -> FldRatElt`

<a id="function-traceabs-fldnumelt"></a>
### `TraceAbs(a): FldNumElt -> FldRatElt`

The absolute trace ${\operatorname{Tr}}_{L/{\mathbb{Q}}}(a)$ over ${\mathbb{Q}}$ of the element $a$ of the number field $L$.

<a id="function-characteristicpolynomial-fldnumelt"></a>
### `CharacteristicPolynomial(a): FldNumElt -> RngUPolElt`

<a id="function-characteristicpolynomial-fldnumelt-rng"></a>
### `CharacteristicPolynomial(a, R): FldNumElt, Rng -> RngUPolElt`

Given an element $a$ from a number field $L$, returns the characteristic polynomial of the element over $R$ if given or the subfield $F$ otherwise where $F$ is the field over which $L$ is defined as an extension.

<a id="function-absolutecharacteristicpolynomial-fldnumelt"></a>
### `AbsoluteCharacteristicPolynomial(a): FldNumElt -> RngUPolElt`

Given an element $a$ from a number field, this function returns the characteristic polynomial of $a$ over ${\mathbb{Q}}$.

<a id="function-minimalpolynomial-fldnumelt"></a>
### `MinimalPolynomial(a): FldNumElt -> RngUPolElt`

<a id="function-minimalpolynomial-fldnumelt-rng"></a>
### `MinimalPolynomial(a, R): FldNumElt, Rng -> RngUPolElt`

Given an element $a$ from a number field $L$, returns the minimal polynomial of the element over $R$ if given otherwise the subfield $F$ where $F$ is the field over which $L$ is defined as an extension.

<a id="function-absoluteminimalpolynomial-fldnumelt"></a>
### `AbsoluteMinimalPolynomial(a): FldNumElt -> RngUPolElt`

Given an element $a$ from a number field, this function returns the minimal polynomial of the element as a polynomial over ${\mathbb{Q}}$.

<a id="function-representationmatrix-fldnumelt"></a>
### `RepresentationMatrix(a): FldNumElt -> NumMatElt`

<a id="function-representationmatrix-fldnumelt-rng"></a>
### `RepresentationMatrix(a, R): FldNumElt, Rng -> NumMatElt`

Return the representation matrix of the number field element $a$, that is, the matrix which represents the linear map wrt to the field basis, given by multiplication by $a$. The $i$th row of the representation matrix gives the coefficients of $aw_i$ with respect to the basis $w_1, \ldots, w_n$.

If $R$ is given the matrix is over $R$ and with respect to the basis of the order or field over $R$.

<a id="function-absoluterepresentationmatrix-fldnumelt"></a>
### `AbsoluteRepresentationMatrix(a): FldNumElt -> NumMatElt`

Return the representation matrix of the number field element $a$ relative to the ${\mathbb{Q}}$-basis of the field constructed using products of the basis elements, where $a$ is an element of the relative number field $L$.

Let $L_i := \sum L_{i-1} \omega_{i,j}$, $L := L_n$, and $L_0 := \Q$. Then the representation matrix is computed with respect to the $\Q$-basis $(\prod_j \omega_{i_j,j})_{i \in I}$ consisting of products of basis elements of the different levels.

<a id="example-ex-441d85"></a>
### `Example: Norm, Trace, and Minimal Polynomial (ex-441d85)`

We create the norm, trace, minimal polynomial, and representation matrix of the element $\alpha/2$ in the quartic field $\Q(\alpha)$.

```magma
> R<x> := PolynomialRing(Integers());
> K<y> := NumberField(x^4-420*x^2+40000);
> z := y/2;
> Norm(z), Trace(z);
2500 0
> MinimalPolynomial(z);
$.1^4 - 105*$.1^2 + 2500
> RepresentationMatrix(z);
[     0    1/2      0      0]
[     0      0    1/2      0]
[     0      0      0    1/2]
[-20000      0    210      0]
```

The awkwardness of the printing of the minimal polynomial above can be overcome by providing a parent for the polynomial, keeping in mind that it is a univariate polynomial over the rationals:

```magma
> P<t> := PolynomialRing(RationalField());
> MinimalPolynomial(z);
t^4 - 105*t^2 + 2500
```

## Other Functions

Elements can be represented by sequences and have a product representation.

<a id="function-elementtosequence-fldnumelt"></a>
### `ElementToSequence(a): FldNumElt -> [ FldNumElt ]`

<a id="function-fldnum-eltseq"></a>
### `Eltseq(a): FldNumElt -> [ FldNumElt ]`

For an element $a$ of a number field $F$, a sequence of coefficients of length degree of $F$ with respect to the basis is returned.

<a id="function-eltseq-fldnumelt-fldnum"></a>
### `Eltseq(E, k): FldNumElt, FldNum -> [RngElt]`

<a id="function-eltseq-fldnumelt-rng"></a>
### `Eltseq(E, k): FldNumElt, Rng -> [RngElt]`

For an algebraic number $E\in K$ and a ring $k$ which occurs somewhere in the defining tower for $K$, return the list of coefficients of $E$ over $k$, that is, apply `Eltseq` to $E$ and to its coefficients until the list is over $k$.

<a id="function-flat-fldnumelt"></a>
### `Flat(e): FldNumElt -> [ FldRatElt]`

The coefficients of the number field element $e$ wrt. to the canonical $Q$ basis for its field. This is performed by iterating [`Eltseq`](https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/operation-element.md#function-fldnum-eltseq) until the coefficients are rational numbers. The coefficients obtained match the coefficients wrt. to [`AbsoluteBasis`](https://docs.magma-maths.org/v2.30-1/GlobalFields/NumberFields/operation.md#function-fldnum-absolutebasis).

<a id="literal-literal-a-i-fldnumelt-rngintelt-fldratelt"></a>
### `a[i]: FldNumElt, RngIntElt -> FldRatElt`

<a id="literal-literal-a-i-fldnumelt-rngintelt-fldnumelt"></a>
### `a[i]: FldNumElt, RngIntElt -> FldNumElt`

The coefficient of the $i$th basis element in the number field element $a$.

<a id="function-productrepresentation-fldnumelt"></a>
### `ProductRepresentation(a): FldNumElt -> [ FldNumElt ], [ RngIntElt ]`

Return sequences $P$ and $E$ such that the product of elements in $P$ to the corresponding exponents in $E$ is the algebraic number $a$.

<a id="function-productrepresentation-fldnumelt-rngintelt"></a>
### `ProductRepresentation(P, E): [ FldNumElt ], [ RngIntElt ] -> FldNumElt`

<a id="function-powerproduct-fldnumelt-rngintelt"></a>
### `PowerProduct(P, E): [FldNumElt], [RngIntElt] -> FldNumElt`

Return the number field element $a$ of the universe of the sequence $P$ such that $a$ is the product of elements of $P$ to the corresponding exponents in the sequence $E$.
