---
title: "Perfect Forms and Normalizers"
canonical: "https://docs.magma-maths.org/v2.30-1/FiniteGroups/MatrixGroupsOverQAndZ/Normalizer.html"
source: "https://docs.magma-maths.org/v2.30-1/FiniteGroups/MatrixGroupsOverQAndZ/Normalizer.md"
part: "Finite Groups"
chapter: "Matrix Groups over Q and Z"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Finite Groups", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/index-finite-groups.md"}
  - {"title": "Matrix Groups over Q and Z", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/MatrixGroupsOverQAndZ/index-matrix-groups-over-qand-z.md"}
prev: {"title": "New Groups From Others", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/MatrixGroupsOverQAndZ/Others.md"}
next: {"title": "Conjugacy", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/MatrixGroupsOverQAndZ/Conjugacy.md"}
intrinsics:
  - {"name": "PerfectForms", "signature": "PerfectForms(G): GrpMat[RngInt] -> SeqEnum"}
  - {"name": "NormalizerGLZ", "signature": "NormalizerGLZ(G): GrpMat[RngInt] -> GrpMat[RngInt]"}
  - {"name": "CentralizerGLZ", "signature": "CentralizerGLZ(G): GrpMat[RngInt] -> GrpMat[RngInt]"}
---

# Perfect Forms and Normalizers

<a id="function-perfectforms-grpmat-rngint"></a>
## `PerfectForms(G): GrpMat[RngInt] -> SeqEnum`

```magma
Limit: RngIntElt                    Default: Infinity()
```

A positive definite symmetric $G$-invariant form $F$ is called $G$-perfect if for every nonzero symmetric $G$-invariant form $F'$ there exists some shortest vector $x$ of $F$ such that $F'x^{tr}x$ has nonzero trace.

The normalizer of the Bravais group of $G$ in ${\operatorname{GL}}_n({\mathbb{Z}})$ acts on the set of integral $G$-perfect forms whose entries have GCD $1$ and the number of orbits is finite. This function returns a sequence of representatives of these orbits.

If `Limit` is set to a positive integer $m$, then the algorithm stops after $m$ orbits have been enumerated.

<a id="function-normalizerglz-grpmat-rngint"></a>
## `NormalizerGLZ(G): GrpMat[RngInt] -> GrpMat[RngInt]`

<a id="function-centralizerglz-grpmat-rngint"></a>
## `CentralizerGLZ(G): GrpMat[RngInt] -> GrpMat[RngInt]`

```magma
IsBravais: BoolElt                    Default: false
```

Given a finite subgroup $G$ of ${\operatorname{GL}}_n({\mathbb{Z}})$, returns the normalizer or centralizer of $G$ in ${\operatorname{GL}}_n({\mathbb{Z}})$.

If $G$ is known to be equal to its Bravais group, one can set `IsBravais` to `true` to speed up the computation.

The algorithm employed is a variation of Opgenorth’s normalizer algorithm [[Opg01](https://docs.magma-maths.org/v2.30-1/references.md#cite-opgenorth)].
