---
title: "Ideals"
canonical: "https://docs.magma-maths.org/v2.30-1/GlobalFields/EtaleAlgebras/ideals.html"
source: "https://docs.magma-maths.org/v2.30-1/GlobalFields/EtaleAlgebras/ideals.md"
part: "Global Fields"
chapter: "Étale Algebras"
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": "Étale Algebras", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/EtaleAlgebras/index-etale-algebras.md"}
prev: {"title": "Orders of Algebras", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/EtaleAlgebras/orders.md"}
next: {"title": "Quotients", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/EtaleAlgebras/quotients.md"}
intrinsics:
  - {"name": "Ideal", "signature": "Ideal(S, gens): AlgEtQOrd, SeqEnum -> AlgEtQIdl"}
  - {"name": "Ideal", "signature": "Ideal(S, idls): AlgEtQOrd, Tup -> AlgEtQIdl"}
  - {"name": "Ideal", "signature": "Ideal(S, gen): AlgEtQOrd, Any -> AlgEtQIdl"}
  - {"name": "*", "signature": "S * gen: AlgEtQOrd, AlgEtQElt -> AlgEtQIdl"}
  - {"name": "*", "signature": "S * gen: AlgEtQOrd, RngIntElt -> AlgEtQIdl"}
  - {"name": "*", "signature": "S * gen: AlgEtQOrd, FldRatElt -> AlgEtQIdl"}
  - {"name": "*", "signature": "gen * S: AlgEtQElt, AlgEtQOrd -> AlgEtQIdl"}
  - {"name": "*", "signature": "gen * S: RngIntElt, AlgEtQOrd -> AlgEtQIdl"}
  - {"name": "*", "signature": "gen * S: FldRatElt, AlgEtQOrd -> AlgEtQIdl"}
  - {"name": "!!", "signature": "T !! I: AlgEtQOrd, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "Algebra", "signature": "Algebra(I): AlgEtQIdl -> AlgEtQ"}
  - {"name": "Order", "signature": "Order(I): AlgEtQIdl -> AlgEtQOrd"}
  - {"name": "ZBasis", "signature": "ZBasis(I): AlgEtQIdl -> SeqEnum[AlgEtQElt]"}
  - {"name": "Generators", "signature": "Generators(I): AlgEtQIdl -> SeqEnum[AlgEtQElt]"}
  - {"name": "eq", "signature": "I eq J: AlgEtQIdl, AlgEtQIdl -> BoolElt"}
  - {"name": "ne", "signature": "I ne J: AlgEtQIdl, AlgEtQIdl -> BoolElt"}
  - {"name": "eq", "signature": "I eq S: AlgEtQIdl, AlgEtQOrd -> BoolElt"}
  - {"name": "eq", "signature": "S eq I: AlgEtQOrd, AlgEtQIdl -> BoolElt"}
  - {"name": "AbsoluteCoordinates", "signature": "AbsoluteCoordinates(x, I): AlgEtQElt, AlgEtQIdl -> SeqEnum"}
  - {"name": "AbsoluteCoordinates", "signature": "AbsoluteCoordinates(seq, I): SeqEnum[AlgEtQElt], AlgEtQIdl -> SeqEnum"}
  - {"name": "in", "signature": "x in I: AlgEtQElt, AlgEtQIdl -> BoolElt"}
  - {"name": "in", "signature": "x in I: RngIntElt, AlgEtQIdl -> BoolElt"}
  - {"name": "in", "signature": "x in I: FldRatElt, AlgEtQIdl -> BoolElt"}
  - {"name": "subset", "signature": "S subset I: AlgEtQOrd, AlgEtQIdl -> BoolElt"}
  - {"name": "subset", "signature": "I subset S: AlgEtQIdl, AlgEtQOrd -> BoolElt"}
  - {"name": "subset", "signature": "I1 subset I2: AlgEtQIdl, AlgEtQIdl -> BoolElt"}
  - {"name": "Index", "signature": "Index(T): AlgEtQIdl -> FldRatElt"}
  - {"name": "Index", "signature": "Index(J, I): AlgEtQIdl, AlgEtQIdl -> Any"}
  - {"name": "Index", "signature": "Index(S, I): AlgEtQOrd, AlgEtQIdl -> Any"}
  - {"name": "OneIdeal", "signature": "OneIdeal(S): AlgEtQOrd -> AlgEtQIdl"}
  - {"name": "Conductor", "signature": "Conductor(O): AlgEtQOrd -> AlgEtQOrdIdl"}
  - {"name": "+", "signature": "I + J: AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "*", "signature": "I * J: AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "*", "signature": "I * x: AlgEtQIdl, AlgEtQElt -> AlgEtQIdl"}
  - {"name": "*", "signature": "I * x: AlgEtQIdl, RngIntElt -> AlgEtQIdl"}
  - {"name": "*", "signature": "I * x: AlgEtQIdl, FldRatElt -> AlgEtQIdl"}
  - {"name": "*", "signature": "x * I: AlgEtQElt, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "*", "signature": "x * I: RngIntElt, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "*", "signature": "x * I: FldRatElt, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "^", "signature": "I ^ n: AlgEtQIdl, RngIntElt -> AlgEtQIdl"}
  - {"name": "meet", "signature": "I meet S: AlgEtQIdl, AlgEtQOrd -> AlgEtQIdl"}
  - {"name": "meet", "signature": "S meet I: AlgEtQOrd, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "meet", "signature": "I meet J: AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "&+", "signature": "&+ seq: SeqEnum[AlgEtQIdl] -> AlgEtQIdl"}
  - {"name": "ColonIdeal", "signature": "ColonIdeal(I, J): AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "ColonIdeal", "signature": "ColonIdeal(O, J): AlgEtQOrd, AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "ColonIdeal", "signature": "ColonIdeal(I, O): AlgEtQIdl, AlgEtQOrd -> AlgEtQIdl"}
  - {"name": "IsInvertible", "signature": "IsInvertible(I): AlgEtQIdl -> BoolElt"}
  - {"name": "Inverse", "signature": "Inverse(I): AlgEtQIdl -> AlgEtQIdl"}
  - {"name": "MultiplicatorRing", "signature": "MultiplicatorRing(I): AlgEtQIdl -> AlgEtQOrd"}
  - {"name": "IsProductOfIdeals", "signature": "IsProductOfIdeals(I): AlgEtQIdl -> BoolElt, Tup"}
  - {"name": "Random", "signature": "Random(I, bd): AlgEtQIdl, RngIntElt -> AlgEtQElt"}
  - {"name": "Random", "signature": "Random(I): AlgEtQIdl -> AlgEtQElt"}
  - {"name": "IsCoprime", "signature": "IsCoprime(I, J): AlgEtQIdl, AlgEtQIdl -> BoolElt"}
  - {"name": "IsIntegral", "signature": "IsIntegral(I): AlgEtQIdl -> BoolElt"}
  - {"name": "MakeIntegral", "signature": "MakeIntegral(I): AlgEtQIdl -> AlgEtQIdl, RngIntElt"}
  - {"name": "MinimalInteger", "signature": "MinimalInteger(I): AlgEtQIdl -> RngIntElt"}
  - {"name": "CoprimeRepresentative", "signature": "CoprimeRepresentative(I, J): AlgEtQIdl, AlgEtQIdl -> AlgEtQElt, AlgEtQIdl"}
  - {"name": "ZBasisLLL", "signature": "ZBasisLLL(~S): AlgEtQOrd"}
  - {"name": "ZBasisLLL", "signature": "ZBasisLLL(~S): AlgEtQIdl"}
---

# Ideals

<a id="function-ideal-algetqord-seqenum"></a>
## `Ideal(S, gens): AlgEtQOrd, SeqEnum -> AlgEtQIdl`

Creates an ideal of the order $S$, generated by the elements of $gens$.

<a id="function-ideal-algetqord-tup"></a>
## `Ideal(S, idls): AlgEtQOrd, Tup -> AlgEtQIdl`

Given an order $S$ which is a product of orders $S_i$ in the number fields generating `Algebra(S)`, and a tuple of ideals $I_i$ of $S_i$, returns the $S$-ideal corresponding to the direct sum of the $I_i$.

<a id="function-ideal-algetqord-any"></a>
## `Ideal(S, gen): AlgEtQOrd, Any -> AlgEtQIdl`

<a id="operation-op-times-algetqord-algetqelt"></a>
## `S * gen: AlgEtQOrd, AlgEtQElt -> AlgEtQIdl`

<a id="operation-op-times-algetqord-rngintelt"></a>
## `S * gen: AlgEtQOrd, RngIntElt -> AlgEtQIdl`

<a id="operation-op-times-algetqord-fldratelt"></a>
## `S * gen: AlgEtQOrd, FldRatElt -> AlgEtQIdl`

<a id="operation-op-times-algetqelt-algetqord"></a>
## `gen * S: AlgEtQElt, AlgEtQOrd -> AlgEtQIdl`

<a id="operation-op-times-rngintelt-algetqord"></a>
## `gen * S: RngIntElt, AlgEtQOrd -> AlgEtQIdl`

<a id="operation-op-times-fldratelt-algetqord"></a>
## `gen * S: FldRatElt, AlgEtQOrd -> AlgEtQIdl`

Creates an ideal of $S$, generated by $gen$.

<a id="operation-op-algetqord-algetqidl"></a>
## `T !! I: AlgEtQOrd, AlgEtQIdl -> AlgEtQIdl`

Given an $S$-ideal $I$ and an order $T$, returns the extension $IT$ as a $T$-ideal. Note that if $T$ is a subset of $S$, then $IT=I$.

<a id="function-algebra-algetqidl"></a>
## `Algebra(I): AlgEtQIdl -> AlgEtQ`

Returns the étale algebra in which the ideal $I$ lives.

<a id="function-order-algetqidl"></a>
## `Order(I): AlgEtQIdl -> AlgEtQOrd`

Returns the order of definition of the ideal $I$.

<a id="function-zbasis-algetqidl"></a>
## `ZBasis(I): AlgEtQIdl -> SeqEnum[AlgEtQElt]`

Returns a ${{\Z}}$-basis of the ideal $I$.

<a id="function-generators-algetqidl"></a>
## `Generators(I): AlgEtQIdl -> SeqEnum[AlgEtQElt]`

Returns the generators of the ideal $I$.

<a id="operation-op-eq-algetqidl-algetqidl"></a>
## `I eq J: AlgEtQIdl, AlgEtQIdl -> BoolElt`

<a id="operation-op-ne-algetqidl-algetqidl"></a>
## `I ne J: AlgEtQIdl, AlgEtQIdl -> BoolElt`

Returns whether the ideals $I$ and $J$ are equal, respectively not equal.

Let $I$ a fractional $S$-ideal in an étale algebra over ${{\Q}}$. Let $P$ be the upper triangular Hermite normal form of the integer square matrix $d\cdot M$ where $M$ is the matrix whose rows are the coefficients of a ${{\Z}}$-basis of $I$ and $d$ is the least common denominator of its entries. The `Hash` of $I$ is defined to be the sequence consisting of the least common denominator of ${1\over d}\cdot P$ and the entries of the upper triangular part of ${1\over d}\cdot P$. This hashing method has no collisions and it is independent of the choice of ${{\Z}}$-basis from which we start the procedure.

<a id="operation-op-eq-algetqidl-algetqord"></a>
## `I eq S: AlgEtQIdl, AlgEtQOrd -> BoolElt`

<a id="operation-op-eq-algetqord-algetqidl"></a>
## `S eq I: AlgEtQOrd, AlgEtQIdl -> BoolElt`

Return whether $I$ is equal to $S$ when $I$ is an ideal of $S$.

<a id="function-absolutecoordinates-algetqelt-algetqidl"></a>
## `AbsoluteCoordinates(x, I): AlgEtQElt, AlgEtQIdl -> SeqEnum`

Given an element $x$ and an ideal $I$, returns the coordinates of $x$ with respect to the stored Z-basis of $I$.

<a id="function-absolutecoordinates-seqenum-algetqelt-algetqidl"></a>
## `AbsoluteCoordinates(seq, I): SeqEnum[AlgEtQElt], AlgEtQIdl -> SeqEnum`

Returns the coordinates of the elements in `seq` with respect to the stored Z-basis of $I$.

<a id="operation-op-in-algetqelt-algetqidl"></a>
## `x in I: AlgEtQElt, AlgEtQIdl -> BoolElt`

<a id="operation-op-in-rngintelt-algetqidl"></a>
## `x in I: RngIntElt, AlgEtQIdl -> BoolElt`

<a id="operation-op-in-fldratelt-algetqidl"></a>
## `x in I: FldRatElt, AlgEtQIdl -> BoolElt`

Returns whether the element $x$ is in the ideal $I$.

<a id="operation-op-subset-algetqord-algetqidl"></a>
## `S subset I: AlgEtQOrd, AlgEtQIdl -> BoolElt`

Given an ideal $I$ of an order $S$, return whether $S \subseteq I$.

<a id="operation-op-subset-algetqidl-algetqord"></a>
## `I subset S: AlgEtQIdl, AlgEtQOrd -> BoolElt`

Given an ideal $I$ of an order $S$, return whether $I \subseteq S$.

<a id="operation-op-subset-algetqidl-algetqidl"></a>
## `I1 subset I2: AlgEtQIdl, AlgEtQIdl -> BoolElt`

Checks if the ideal $I1$ is inside the ideal $I2$. The ideals need to be fractional.

<a id="function-index-algetqidl"></a>
## `Index(T): AlgEtQIdl -> FldRatElt`

Given an ideal $T$ computes its index with respect to the basis of the algebra of $T$ as a free ${{\Q}}$-module.

<a id="function-index-algetqidl-algetqidl"></a>
## `Index(J, I): AlgEtQIdl, AlgEtQIdl -> Any`

Given fractional ideals $J$ and $I$ defined over the same order returns $[J:I] = [J:J \cap I]/[I : J \cap I]$.

<a id="function-index-algetqord-algetqidl"></a>
## `Index(S, I): AlgEtQOrd, AlgEtQIdl -> Any`

Given an ideal $I$ of an order $S$ returns $[S:I] = [S:S \cap I]/[I : S \cap I]$.

<a id="function-oneideal-algetqord"></a>
## `OneIdeal(S): AlgEtQOrd -> AlgEtQIdl`

Given an order $S$ returns the ideal $1*S$ which will be cached.

<a id="function-conductor-algetqord"></a>
## `Conductor(O): AlgEtQOrd -> AlgEtQOrdIdl`

Computes the conductor of an order $O$, defined as the colon ideal $(O:O_K)$, where $O_K$ is the maximal order of the algebra.

<a id="operation-op-plus-algetqidl-algetqidl"></a>
## `I + J: AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl`

Returns the sum of two ideals.

<a id="operation-op-times-algetqidl-algetqidl"></a>
## `I * J: AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl`

Product of two ideals.

<a id="operation-op-times-algetqidl-algetqelt"></a>
## `I * x: AlgEtQIdl, AlgEtQElt -> AlgEtQIdl`

<a id="operation-op-times-algetqidl-rngintelt"></a>
## `I * x: AlgEtQIdl, RngIntElt -> AlgEtQIdl`

<a id="operation-op-times-algetqidl-fldratelt"></a>
## `I * x: AlgEtQIdl, FldRatElt -> AlgEtQIdl`

<a id="operation-op-times-algetqelt-algetqidl"></a>
## `x * I: AlgEtQElt, AlgEtQIdl -> AlgEtQIdl`

<a id="operation-op-times-rngintelt-algetqidl"></a>
## `x * I: RngIntElt, AlgEtQIdl -> AlgEtQIdl`

<a id="operation-op-times-fldratelt-algetqidl"></a>
## `x * I: FldRatElt, AlgEtQIdl -> AlgEtQIdl`

Returns $x*I$.

<a id="operation-op-pow-algetqidl-rngintelt"></a>
## `I ^ n: AlgEtQIdl, RngIntElt -> AlgEtQIdl`

Returns the $n$th power of an ideal.

<a id="operation-op-meet-algetqidl-algetqord"></a>
## `I meet S: AlgEtQIdl, AlgEtQOrd -> AlgEtQIdl`

<a id="operation-op-meet-algetqord-algetqidl"></a>
## `S meet I: AlgEtQOrd, AlgEtQIdl -> AlgEtQIdl`

Given an ideal $I$ of $S$, return $S \cap I$.

<a id="operation-op-meet-algetqidl-algetqidl"></a>
## `I meet J: AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl`

Given ideals $I$ and $J$, return $J \cap I$.

<a id="operation-operation-seqenum-algetqidl-algetqidl"></a>
## `&+ seq: SeqEnum[AlgEtQIdl] -> AlgEtQIdl`

Returns the sum of the fractional ideals in the sequence.

<a id="function-colonideal-algetqidl-algetqidl"></a>
## `ColonIdeal(I, J): AlgEtQIdl, AlgEtQIdl -> AlgEtQIdl`

Computes the colon ideal $(I:J)$ (as an $O$-ideal) of two $O$-ideals, which is the set of elements $x$ of the algebra such that $x \cdot J \subset I$.

<a id="function-colonideal-algetqord-algetqidl"></a>
## `ColonIdeal(O, J): AlgEtQOrd, AlgEtQIdl -> AlgEtQIdl`

Computes the colon ideal $(1 \cdot O:J)$ (as an $O$-ideal).

<a id="function-colonideal-algetqidl-algetqord"></a>
## `ColonIdeal(I, O): AlgEtQIdl, AlgEtQOrd -> AlgEtQIdl`

Computes the colon ideal $(I:1 \cdot O)$ (as an $O$-ideal).

<a id="function-isinvertible-algetqidl"></a>
## `IsInvertible(I): AlgEtQIdl -> BoolElt`

Checks if the ideal $I$ is invertible in its order of definition $O$.

<a id="function-inverse-algetqidl"></a>
## `Inverse(I): AlgEtQIdl -> AlgEtQIdl`

Computes the inverse of an invertible ideal $I$.

<a id="function-multiplicatorring-algetqidl"></a>
## `MultiplicatorRing(I): AlgEtQIdl -> AlgEtQOrd`

Given a fractional ideal $I$ computes its multiplicator ring $(I:I)$.

<a id="function-isproductofideals-algetqidl"></a>
## `IsProductOfIdeals(I): AlgEtQIdl -> BoolElt, Tup`

Return if the ideal $I$ is a product of ideals in the number fields defining the algebra. If so, it returns also the sequence of these ideals (in the appropriate orders). Note: we require `Order(I)` to be `MultiplicatorRing(I)`.

<a id="function-random-algetqidl-rngintelt"></a>
## `Random(I, bd): AlgEtQIdl, RngIntElt -> AlgEtQElt`

```magma
ZeroDivisorsAllowed: BoolElt                    Default: false
```

Returns a random element of the ideal $I$. The coefficients are bounded by the positive integer $bd$. One can allow zero-divisors using the optional parameter `ZeroDivisorsAllowed`, which by default is set to `false`.

<a id="function-random-algetqidl"></a>
## `Random(I): AlgEtQIdl -> AlgEtQElt`

```magma
CoeffRange         : RngIntElt                    Default: 3
ZeroDivisorsAllowed: BoolElt                      Default: false
```

Returns a random (small coefficient) element of the ideal $I$. The range of the random coefficients can be increased by giving the optional parameter `CoeffRange`. One can allow zero-divisors using the optional parameter `ZeroDivisorsAllowed`, which by default is set to `false`.

<a id="function-iscoprime-algetqidl-algetqidl"></a>
## `IsCoprime(I, J): AlgEtQIdl, AlgEtQIdl -> BoolElt`

Given two integral ideals $I$ and $J$ of an order $S$, returns whether $I+J=R$.

<a id="function-isintegral-algetqidl"></a>
## `IsIntegral(I): AlgEtQIdl -> BoolElt`

Returns whether the ideal $I$ of $S$ is integral, that is $I \subseteq S$.

<a id="function-makeintegral-algetqidl"></a>
## `MakeIntegral(I): AlgEtQIdl -> AlgEtQIdl, RngIntElt`

Given a fractional $S$ ideal $I$, returns the ideal $d \cdot I, d$ when $d$ is the smallest integer such that $d \cdot I$ is integral in $S$. Compare with [`SmallRepresentative`](https://docs.magma-maths.org/v2.30-1/GlobalFields/EtaleAlgebras/short_elt_small_rep.md#function-smallrep).

<a id="function-minimalinteger-algetqidl"></a>
## `MinimalInteger(I): AlgEtQIdl -> RngIntElt`

Returns the smallest integer contained in the ideal $I$.

<a id="function-coprimerepresentative-algetqidl-algetqidl"></a>
## `CoprimeRepresentative(I, J): AlgEtQIdl, AlgEtQIdl -> AlgEtQElt, AlgEtQIdl`

Returns an element $x$ such that $x \cdot I$ is an integral ideal coprime with $J$, together with the product $x \cdot I$. The first ideal must be invertible and the second should be integral.

<a id="procedure-zbasislll-algetqord-ref"></a>
## `ZBasisLLL(~S): AlgEtQOrd`

<a id="procedure-zbasislll-algetqidl-ref"></a>
## `ZBasisLLL(~S): AlgEtQIdl`

A procedure that replaces the ZBasis with an LLL-reduced one. Note: the attribute inclusion matrix, which depends on the ${{\Z}}$-Basis is modified as well.
