---
title: "Invariants"
canonical: "https://docs.magma-maths.org/v2.30-1/GlobalFields/ClassFieldTheory/invariants.html"
source: "https://docs.magma-maths.org/v2.30-1/GlobalFields/ClassFieldTheory/invariants.md"
part: "Global Fields"
chapter: "Class Field Theory"
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": "Class Field Theory", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/ClassFieldTheory/index-class-field-theory.md"}
prev: {"title": "Conversion to Number Fields", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/ClassFieldTheory/conversion.md"}
next: {"title": "Automorphisms", "source": "https://docs.magma-maths.org/v2.30-1/GlobalFields/ClassFieldTheory/automorphisms.md"}
intrinsics:
  - {"name": "Discriminant", "signature": "Discriminant(A): FldAb -> RngOrdIdl, [RngIntElt]"}
  - {"name": "AbsoluteDiscriminant", "signature": "AbsoluteDiscriminant(A): FldAb -> RngIntElt"}
  - {"name": "Conductor", "signature": "Conductor(A): FldAb -> RngOrdIdl, [RngIntElt]"}
  - {"name": "Degree", "signature": "Degree(A): FldAb -> RngIntElt"}
  - {"name": "AbsoluteDegree", "signature": "AbsoluteDegree(A): FldAb -> RngIntElt"}
  - {"name": "CoefficientRing", "signature": "CoefficientRing(A): FldAb -> Fld"}
  - {"name": "CoefficientField", "signature": "CoefficientField(A): FldAb -> Fld"}
  - {"name": "BaseField", "signature": "BaseField(A): FldAb -> Fld"}
  - {"name": "BaseRing", "signature": "BaseRing(A): FldAb -> Rng"}
  - {"name": "CoefficientRing", "signature": "CoefficientRing(A): FldAb -> Rng"}
  - {"name": "NormGroup", "signature": "NormGroup(A): FldAb -> Map, RngOrdIdl, [RngIntElt]"}
  - {"name": "DecompositionField", "signature": "DecompositionField(p, A): RngOrdIdl, FldAb -> FldAb"}
  - {"name": "DecompositionField", "signature": "DecompositionField(p, A): PlcNumElt, FldAb -> FldAb"}
  - {"name": "DecompositionGroup", "signature": "DecompositionGroup(p, A): RngIntElt, FldAb -> GrpAb"}
  - {"name": "DecompositionGroup", "signature": "DecompositionGroup(p, A): RngOrdIdl, FldAb -> GrpAb"}
  - {"name": "DecompositionGroup", "signature": "DecompositionGroup(p, A): PlcNumElt, FldAb -> GrpAb"}
  - {"name": "DecompositionType", "signature": "DecompositionType(A, p): FldAb, RngOrdIdl -> [Tpl]"}
  - {"name": "DecompositionType", "signature": "DecompositionType(A, p): FldAb, PlcNumElt -> [Tpl]"}
  - {"name": "DecompositionType", "signature": "DecompositionType(A, p): FldAb, RngIntElt -> [Tpl]"}
  - {"name": "DecompositionTypeFrequency", "signature": "DecompositionTypeFrequency(A, l): FldAb, [ ] -> Mset"}
  - {"name": "DecompositionTypeFrequency", "signature": "DecompositionTypeFrequency(A, a, b): FldAb, RngIntElt, RngIntElt -> Mset"}
---

# Invariants

Several invariants of an abelian extension can easily be obtained from the ideal groups without first computing defining equations for the field.

<a id="function-discriminant-fldab"></a>
## `Discriminant(A): FldAb -> RngOrdIdl, [RngIntElt]`

Let $A$ be an abelian extension. Based on the conductor-discriminant relation made explicit by [[Coh00](https://docs.magma-maths.org/v2.30-1/references.md#cite-cohen2), Section 3.5.2], the discriminant of the class field $A$ is computed. This does not involve the computation of defining equations. The second return value is the signature of the resulting field.

<a id="function-absolutediscriminant-fldab"></a>
## `AbsoluteDiscriminant(A): FldAb -> RngIntElt`

The absolute discriminant of $A$ as a number field over ${\mathbb{Q}}$.

<a id="function-fldab-conductor"></a>
## `Conductor(A): FldAb -> RngOrdIdl, [RngIntElt]`

Computes the conductor of the abelian extension $A$, i.e. the smallest ideal and the smallest set of infinite places that are necessary to define $A$. The algorithm used is based on [[HPP97](https://docs.magma-maths.org/v2.30-1/references.md#cite-pau2), [Pau96](https://docs.magma-maths.org/v2.30-1/references.md#cite-pau1)].

<a id="function-degree-fldab"></a>
## `Degree(A): FldAb -> RngIntElt`

The degree of the abelian extension $A$.

<a id="function-absolutedegree-fldab"></a>
## `AbsoluteDegree(A): FldAb -> RngIntElt`

The degree of the abelian extension $A$ over ${\mathbb{Q}}$.

<a id="function-coefficientring-fldab"></a>
## `CoefficientRing(A): FldAb -> Fld`

<a id="function-coefficientfield-fldab"></a>
## `CoefficientField(A): FldAb -> Fld`

<a id="function-basefield-fldab"></a>
## `BaseField(A): FldAb -> Fld`

The base field of the abelian extension $A$, that is `FieldOfFractions(BaseRing(A))`.

<a id="function-basering-fldab"></a>
## `BaseRing(A): FldAb -> Rng`

<a id="function-coefficientring-fldab-2"></a>
## `CoefficientRing(A): FldAb -> Rng`

The base ring of the abelian extension $A$, that is the maximal order used to define the underlying ray class group.

<a id="function-normgroup-fldab"></a>
## `NormGroup(A): FldAb -> Map, RngOrdIdl, [RngIntElt]`

The norm group (see the definition of [norm groups](https://docs.magma-maths.org/v2.30-1/GlobalFields/ClassFieldTheory/introduction.md#fldab-norm-group)) used to define the abelian extension $A$.

<a id="function-decompositionfield-rngordidl-fldab"></a>
## `DecompositionField(p, A): RngOrdIdl, FldAb -> FldAb`

The decomposition field of the finite prime $p$ in the abelian extension $A$ as an abelian (sub)extension.

<a id="function-decompositionfield-plcnumelt-fldab"></a>
## `DecompositionField(p, A): PlcNumElt, FldAb -> FldAb`

The decomposition field of the place $p$ in the abelian extension $A$ as an abelian extension.

<a id="function-decompositiongroup-rngintelt-fldab"></a>
## `DecompositionGroup(p, A): RngIntElt, FldAb -> GrpAb`

<a id="function-decompositiongroup-rngordidl-fldab"></a>
## `DecompositionGroup(p, A): RngOrdIdl, FldAb -> GrpAb`

The decomposition group of the finite prime $p$ in the abelian extension $A$. The abelian group returned is a subgroup of the norm group.

<a id="function-decompositiongroup-plcnumelt-fldab"></a>
## `DecompositionGroup(p, A): PlcNumElt, FldAb -> GrpAb`

The decomposition group of the place $p$ in the abelian extension $A$. The abelian group returned is a subgroup of the `NormGroup`.

<a id="function-decompositiontype-fldab-rngordidl"></a>
## `DecompositionType(A, p): FldAb, RngOrdIdl -> [Tpl]`

The “type” of the decomposition of the finite prime ideal $p$ in the abelian extension $A$ as a sequence of pairs $\langle f, e\rangle$ giving the degrees and the ramification indices.

<a id="function-decompositiontype-fldab-plcnumelt"></a>
## `DecompositionType(A, p): FldAb, PlcNumElt -> [Tpl]`

The “type” of the decomposition of the place $p$ in the abelian extension $A$ as a sequence of pairs $\langle f, e\rangle$ giving the degrees and the ramification indices.

<a id="function-decompositiontype-fldab-rngintelt"></a>
## `DecompositionType(A, p): FldAb, RngIntElt -> [Tpl]`

```magma
Normal: BoolElt                    Default: false
```

The “type” of the decomposition over ${\mathbb{Q}}$ of the prime number $p$ in the abelian extension $A$ as a sequence of pairs $\langle f, e\rangle$ giving the degrees and the ramification indices. If `Normal` is set to `true` then the algorithm assumes that the base field of $A$ is normal. This is used to speed up the computations.

<a id="function-decompositiontypefrequency-fldab"></a>
## `DecompositionTypeFrequency(A, l): FldAb, [ ] -> Mset`

```magma
Normal: BoolElt                    Default: false
```

Computes the decomposition type of all elements in $l$ and returns them as a multi-set. The list $l$ must only contain objects for which `DecompositionType` is defined. If `Normal eq true` then the underlying `DecompositionType` function must be able to deal with it too. If `Normal` is set to `true` then the algorithm assumes that the base field of the abelian extension $A$ is normal. This is used to speed up the computations.

<a id="function-decompositiontypefrequency-fldab-rngintelt-rngintelt"></a>
## `DecompositionTypeFrequency(A, a, b): FldAb, RngIntElt, RngIntElt -> Mset`

```magma
Normal: BoolElt                    Default: false
```

Computes the decomposition type over ${\mathbb{Q}}$ in the abelian extension $A$ of all prime numbers $a \leq p \leq b$ and returns them as a multi set.

If `Normal` is set to `true` then the algorithm assumes that the base field of $A$ is normal. This is used to speed up the computations.
