---
title: "Structure Operations"
canonical: "https://docs.magma-maths.org/v2.30-1/BasicRings/Rationals/operation.html"
source: "https://docs.magma-maths.org/v2.30-1/BasicRings/Rationals/operation.md"
part: "Basic Rings"
chapter: "Rational Field"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Basic Rings", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/index-basic-rings.md"}
  - {"title": "Rational Field", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/Rationals/index-rationals.md"}
prev: {"title": "Creation Functions", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/Rationals/creation.md"}
next: {"title": "Element Operations", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/Rationals/element.md"}
intrinsics:
  - {"name": "Category", "signature": "Category(Q): FldRat -> Cat"}
  - {"name": "Parent", "signature": "Parent(Q): FldRat -> PowerStructure"}
  - {"name": "PrimeField", "signature": "PrimeField(Q): FldRat -> FldRat"}
  - {"name": "IntegralBasis", "signature": "IntegralBasis(Q): FldRat -> [ FldRatElt ]"}
  - {"name": "MinimalField", "signature": "MinimalField(q): FldRatElt -> FldRat"}
  - {"name": "MinimalField", "signature": "MinimalField(S): SetEnum -> FldRat"}
  - {"name": "BaseField", "signature": "BaseField(Q): FldRat -> FldRat"}
  - {"name": "Basis", "signature": "Basis(Q): FldRat -> [FldRatElt]"}
  - {"name": "AbsoluteBasis", "signature": "AbsoluteBasis(Q): FldRat -> [FldRatElt]"}
  - {"name": "UnitGroup", "signature": "UnitGroup(Q): FldRat -> GrpAb, Map"}
  - {"name": "ClassGroup", "signature": "ClassGroup(Q): FldRat -> GrpAb, Map"}
  - {"name": "AutomorphismGroup", "signature": "AutomorphismGroup(Q): FldRat -> GrpPerm, PowMapAut, Map"}
  - {"name": "AutomorphismGroup", "signature": "AutomorphismGroup(Q, Q): FldRat, FldRat -> GrpPerm, PowMapAut, Map"}
  - {"name": "Algebra", "signature": "Algebra(Q, Q): FldRat, Fld -> AlgAss, Map"}
  - {"name": "VectorSpace", "signature": "VectorSpace(Q, Q): FldRat, Fld -> ModTupFld, Map"}
  - {"name": "Decomposition", "signature": "Decomposition(Q, p): FldRat, RngIntElt -> []"}
  - {"name": "Decomposition", "signature": "Decomposition(Q, p): FldRat, Infty -> []"}
  - {"name": "Characteristic", "signature": "Characteristic(Q): FldRat -> RngIntElt"}
  - {"name": "Conductor", "signature": "Conductor(Q): FldRat -> RngIntElt"}
  - {"name": "Degree", "signature": "Degree(Q): FldRat -> RngIntElt"}
  - {"name": "AbsoluteDegree", "signature": "AbsoluteDegree(Q): FldRat -> RngIntElt"}
  - {"name": "Discriminant", "signature": "Discriminant(Q): FldRat -> RngIntElt"}
  - {"name": "AbsoluteDiscriminant", "signature": "AbsoluteDiscriminant(Q): FldRat -> RngIntElt"}
  - {"name": "DefiningPolynomial", "signature": "DefiningPolynomial(Q): FldRat -> RngUPolElt"}
  - {"name": "Signature", "signature": "Signature(Q): FldRat -> RngIntElt, RngIntElt"}
  - {"name": "IsCommutative", "signature": "IsCommutative(Q): FldRat -> BoolElt"}
  - {"name": "IsUnitary", "signature": "IsUnitary(Q): FldRat -> BoolElt"}
  - {"name": "IsFinite", "signature": "IsFinite(Q): FldRat -> BoolElt"}
  - {"name": "IsOrdered", "signature": "IsOrdered(Q): FldRat -> BoolElt"}
  - {"name": "IsField", "signature": "IsField(Q): FldRat -> BoolElt"}
  - {"name": "IsEuclideanDomain", "signature": "IsEuclideanDomain(Q): FldRat -> BoolElt"}
  - {"name": "IsPID", "signature": "IsPID(Q): FldRat -> BoolElt"}
  - {"name": "IsUFD", "signature": "IsUFD(Q): FldRat -> BoolElt"}
  - {"name": "IsDivisionRing", "signature": "IsDivisionRing(Q): FldRat -> BoolElt"}
  - {"name": "IsEuclideanRing", "signature": "IsEuclideanRing(Q): FldRat -> BoolElt"}
  - {"name": "IsPrincipalIdealRing", "signature": "IsPrincipalIdealRing(Q): FldRat -> BoolElt"}
  - {"name": "IsDomain", "signature": "IsDomain(Q): FldRat -> BoolElt"}
  - {"name": "eq", "signature": "Q eq R: FldRat, FldRat -> BoolElt"}
  - {"name": "eq", "signature": "Q eq R: FldRat, RngInt -> BoolElt"}
  - {"name": "ne", "signature": "Q ne R: FldRat, FldRat -> BoolElt"}
  - {"name": "ne", "signature": "Q ne R: FldRat, RngInt -> BoolElt"}
---

# Structure Operations

## Related Structures

<a id="function-category-fldrat"></a>
### `Category(Q): FldRat -> Cat`

<a id="function-parent-fldrat"></a>
### `Parent(Q): FldRat -> PowerStructure`

<a id="function-primefield-fldrat"></a>
### `PrimeField(Q): FldRat -> FldRat`

<a id="function-integralbasis-fldrat"></a>
### `IntegralBasis(Q): FldRat -> [ FldRatElt ]`

An integral basis for $Q$ as a number field as a sequence of elements of $Q$ (giving the sequence containing 1 for the rational field).

<a id="function-minimalfield-fldratelt"></a>
### `MinimalField(q): FldRatElt -> FldRat`

Return the least cyclotomic field containing the cyclotomic field element $q$; if $q$ is rational this returns the rational field.

<a id="function-minimalfield-setenum"></a>
### `MinimalField(S): SetEnum -> FldRat`

Returns the minimal cyclotomic field containing the cyclotomic field elements in the enumerated set $S$; this will return the rational field if all elements of $S$ are rational numbers.

<a id="function-basefield-fldrat"></a>
### `BaseField(Q): FldRat -> FldRat`

In analogy to the number fields, returns the coefficient field of $Q$ which will be ${\mathbb{Q}}$.

<a id="function-basis-fldrat"></a>
### `Basis(Q): FldRat -> [FldRatElt]`

<a id="function-absolutebasis-fldrat"></a>
### `AbsoluteBasis(Q): FldRat -> [FldRatElt]`

A basis for $Q$ as a ${\mathbb{Q}}$-vector space, i.e. $[1]$.

<a id="function-unitgroup-fldrat"></a>
### `UnitGroup(Q): FldRat -> GrpAb, Map`

The unit group of the maximal order of ${\mathbb{Q}}$ (i.e. of ${\mathbb{Z}}$).

<a id="function-classgroup-fldrat"></a>
### `ClassGroup(Q): FldRat -> GrpAb, Map`

The class group of the ring of integers ${\mathbb{Z}}$ of ${\mathbb{Q}}$ (which is trivial).

<a id="function-automorphismgroup-fldrat"></a>
### `AutomorphismGroup(Q): FldRat -> GrpPerm, PowMapAut, Map`

<a id="function-automorphismgroup-fldrat-fldrat"></a>
### `AutomorphismGroup(Q, Q): FldRat, FldRat -> GrpPerm, PowMapAut, Map`

The group of ${\mathbb{Q}}$ automorphisms of ${\mathbb{Q}}$, ie. a trivial finitely presented group, the parent structure for ${\mathbb{Q}}$-automorphisms and a map from the group to actual field automorphisms. In this case, of course the only ${\mathbb{Q}}$-automorphism will be the identity.

<a id="function-algebra-fldrat-fld"></a>
### `Algebra(Q, Q): FldRat, Fld -> AlgAss, Map`

The rational numbers form canonically an algebra. This function returns an associative ${\mathbb{Q}}$-algebra isomorphic to ${\mathbb{Q}}$ and the map from the algebra to ${\mathbb{Q}}$.

<a id="function-vectorspace-fldrat-fld"></a>
### `VectorSpace(Q, Q): FldRat, Fld -> ModTupFld, Map`

The rational numbers form canonically a vector space. This function returns a ${\mathbb{Q}}$-vector space isomorphic to ${\mathbb{Q}}$ and the map from the vector space to ${\mathbb{Q}}$.

<a id="function-decomposition-fldrat-rngintelt"></a>
### `Decomposition(Q, p): FldRat, RngIntElt -> []`

<a id="function-decomposition-fldrat-infty"></a>
### `Decomposition(Q, p): FldRat, Infty -> []`

For a prime $p$ or for the “infinite prime” `Infinity()` compute the decomposition in ${\mathbb{Q}}$ as a number field. This returns a list of length one containing a 2-tuple describing the splitting behaviour: the first component contains $p$ and the second it’s ramification degree, ie. 1.

## Numerical Invariants

The functions below are defined for the rational field ${\mathbb{Q}}$ mainly because it often arises as a degenerate case of quadratic or cyclotomic field constructions. See the corresponding Chapters [Quadratic Fields](https://docs.magma-maths.org/v2.30-1/GlobalFields/QuadraticFields/index-quadratic-fields.md#chapfldquad) and [Cyclotomic Fields](https://docs.magma-maths.org/v2.30-1/GlobalFields/CyclotomicFields/index-cyclotomic-fields.md#chapfldcyc) for more.

<a id="function-characteristic-fldrat"></a>
### `Characteristic(Q): FldRat -> RngIntElt`

<a id="function-conductor-fldrat"></a>
### `Conductor(Q): FldRat -> RngIntElt`

The smallest positive integer $n$ such that $Q$ is contained in the cyclotomic field ${\mathbb{Q}}(\zeta_n)$. For the rational field this is $1$.

<a id="function-degree-fldrat"></a>
### `Degree(Q): FldRat -> RngIntElt`

<a id="function-absolutedegree-fldrat"></a>
### `AbsoluteDegree(Q): FldRat -> RngIntElt`

The degree of $Q$ as a number field (which is 1 for the rational field).

<a id="function-discriminant-fldrat"></a>
### `Discriminant(Q): FldRat -> RngIntElt`

<a id="function-absolutediscriminant-fldrat"></a>
### `AbsoluteDiscriminant(Q): FldRat -> RngIntElt`

The field discriminant of $Q$ (which is 1 for the rational field).

<a id="function-definingpolynomial-fldrat"></a>
### `DefiningPolynomial(Q): FldRat -> RngUPolElt`

An irreducible polynomial over ${\mathbb{Q}}$ a root of which generates $Q$ as a number field (for the rational field this returns the linear polynomial $x-1$).

<a id="function-signature-fldrat"></a>
### `Signature(Q): FldRat -> RngIntElt, RngIntElt`

The signature (number of real embeddings and pairs of complex embeddings) of ${\mathbb{Q}}$.

## Ring Predicates and Booleans

<a id="function-iscommutative-fldrat"></a>
### `IsCommutative(Q): FldRat -> BoolElt`

<a id="function-isunitary-fldrat"></a>
### `IsUnitary(Q): FldRat -> BoolElt`

<a id="function-isfinite-fldrat"></a>
### `IsFinite(Q): FldRat -> BoolElt`

<a id="function-isordered-fldrat"></a>
### `IsOrdered(Q): FldRat -> BoolElt`

<a id="function-isfield-fldrat"></a>
### `IsField(Q): FldRat -> BoolElt`

<a id="function-iseuclideandomain-fldrat"></a>
### `IsEuclideanDomain(Q): FldRat -> BoolElt`

<a id="function-ispid-fldrat"></a>
### `IsPID(Q): FldRat -> BoolElt`

<a id="function-isufd-fldrat"></a>
### `IsUFD(Q): FldRat -> BoolElt`

<a id="function-isdivisionring-fldrat"></a>
### `IsDivisionRing(Q): FldRat -> BoolElt`

<a id="function-iseuclideanring-fldrat"></a>
### `IsEuclideanRing(Q): FldRat -> BoolElt`

<a id="function-isprincipalidealring-fldrat"></a>
### `IsPrincipalIdealRing(Q): FldRat -> BoolElt`

<a id="function-isdomain-fldrat"></a>
### `IsDomain(Q): FldRat -> BoolElt`

<a id="operation-op-eq-fldrat-fldrat"></a>
### `Q eq R: FldRat, FldRat -> BoolElt`

<a id="operation-op-eq-fldrat-rngint"></a>
### `Q eq R: FldRat, RngInt -> BoolElt`

<a id="operation-op-ne-fldrat-fldrat"></a>
### `Q ne R: FldRat, FldRat -> BoolElt`

<a id="operation-op-ne-fldrat-rngint"></a>
### `Q ne R: FldRat, RngInt -> BoolElt`
