---
title: "Basic Group Properties"
canonical: "https://docs.magma-maths.org/v2.30-1/FiniteGroups/FiniteSolubleGroups/group-properties.html"
source: "https://docs.magma-maths.org/v2.30-1/FiniteGroups/FiniteSolubleGroups/group-properties.md"
part: "Finite Groups"
chapter: "Finite Soluble Groups"
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": "Finite Soluble Groups", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/FiniteSolubleGroups/index-finite-soluble-groups.md"}
prev: {"title": "Creation of a Group", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/FiniteSolubleGroups/definition.md"}
next: {"title": "Homomorphisms", "source": "https://docs.magma-maths.org/v2.30-1/FiniteGroups/FiniteSolubleGroups/homomorphisms.md"}
intrinsics:
  - {"name": ".", "signature": "G . i: GrpPC, RngIntElt -> GrpPCElt"}
  - {"name": "Generators", "signature": "Generators(G): GrpPC -> SetEnum"}
  - {"name": "NumberOfGenerators", "signature": "NumberOfGenerators(G): GrpPC -> RngIntElt"}
  - {"name": "Ngens", "signature": "Ngens(G): GrpPC -> RngIntElt"}
  - {"name": "PCGenerators", "signature": "PCGenerators(G): GrpPC -> SetIndx"}
  - {"name": "NumberOfPCGenerators", "signature": "NumberOfPCGenerators(G): GrpPC -> RngIntElt"}
  - {"name": "NPCGenerators", "signature": "NPCGenerators(G): GrpPC -> RngIntElt"}
  - {"name": "NPCgens", "signature": "NPCgens(G): GrpPC -> RngIntElt"}
  - {"name": "PCPrimes", "signature": "PCPrimes(G): GrpPC -> [RngIntElt]"}
  - {"name": "Order", "signature": "Order(G): GrpPC -> RngIntElt"}
  - {"name": "#", "signature": "# G: GrpPC -> RngIntElt"}
  - {"name": "FactoredOrder", "signature": "FactoredOrder(G): GrpPC -> [<RngIntElt, RngIntElt>]"}
  - {"name": "Exponent", "signature": "Exponent(G): GrpPC -> RngIntElt"}
  - {"name": "IsAbelian", "signature": "IsAbelian(G): GrpPC -> BoolElt"}
  - {"name": "IsCyclic", "signature": "IsCyclic(G): GrpPC -> BoolElt"}
  - {"name": "IsElementaryAbelian", "signature": "IsElementaryAbelian(G): GrpPC -> BoolElt"}
  - {"name": "IsNilpotent", "signature": "IsNilpotent(G): GrpPC -> BoolElt"}
  - {"name": "IsPerfect", "signature": "IsPerfect(G): GrpPC -> BoolElt"}
  - {"name": "IsSimple", "signature": "IsSimple(G): GrpPC -> BoolElt"}
  - {"name": "IsSoluble", "signature": "IsSoluble(G): GrpPC -> BoolElt"}
  - {"name": "IsSolvable", "signature": "IsSolvable(G): GrpPC -> BoolElt"}
  - {"name": "IsTrivial", "signature": "IsTrivial(G): GrpPC -> BoolElt"}
  - {"name": "IsSpecial", "signature": "IsSpecial(G): GrpPC -> BoolElt"}
  - {"name": "IsExtraSpecial", "signature": "IsExtraSpecial(G): GrpPC -> BoolElt"}
examples:
  - "ex-e86fe2"
---

# Basic Group Properties

## Infrastructure

The functions described here provide access to basic information stored for a pc-group $G$.

<a id="operation-operation-grppc-rngintelt-grppcelt"></a>
### `G . i: GrpPC, RngIntElt -> GrpPCElt`

The $i$-th pc-generator for $G$. A negative subscript indicates that the inverse of the generator is to be created. $G.0$ is `Identity(G)`.

<a id="function-generators-grppc"></a>
### `Generators(G): GrpPC -> SetEnum`

A set containing the defining generators for $G$. If $G$ is a $p$-group, this is guaranteed to be a minimal set of generators. For non-$p$-groups, this will be the set of pc-generators.

<a id="function-numberofgenerators-grppc"></a>
### `NumberOfGenerators(G): GrpPC -> RngIntElt`

<a id="function-ngens-grppc"></a>
### `Ngens(G): GrpPC -> RngIntElt`

The number of defining generators for $G$.

<a id="function-pcgenerators-grppc"></a>
### `PCGenerators(G): GrpPC -> SetIndx`

An indexed set containing the pc-generators for $G$.

<a id="function-numberofpcgenerators-grppc"></a>
### `NumberOfPCGenerators(G): GrpPC -> RngIntElt`

<a id="function-npcgenerators-grppc"></a>
### `NPCGenerators(G): GrpPC -> RngIntElt`

<a id="function-npcgens-grppc"></a>
### `NPCgens(G): GrpPC -> RngIntElt`

The number of pc-generators for $G$.

<a id="function-pcprimes-grppc"></a>
### `PCPrimes(G): GrpPC -> [RngIntElt]`

A sequence [$p_1,\ldots,p_n$] containing the primes associated with the pc-generators of $G$. The $i$-th term of the sequence contains the prime associated with generator $a_i$ of $G$ for $i = 1,\ldots,n$.

## Numerical Invariants

Magma has built-in functions to compute the order and exponent of a group.

<a id="function-order-grppc"></a>
### `Order(G): GrpPC -> RngIntElt`

<a id="operation-operation-grppc-rngintelt"></a>
### `# G: GrpPC -> RngIntElt`

The order of the group $G$, returned as an ordinary integer.

<a id="function-factoredorder-grppc"></a>
### `FactoredOrder(G): GrpPC -> [<RngIntElt, RngIntElt>]`

The factored order of the group $G$.

<a id="function-exponent-grppc"></a>
### `Exponent(G): GrpPC -> RngIntElt`

The exponent of the group $G$.

## Predicates

Magma has built-in functions to check standard group properties.

<a id="function-isabelian-grppc"></a>
### `IsAbelian(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is abelian, `false` otherwise.

<a id="function-iscyclic-grppc"></a>
### `IsCyclic(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is cyclic, `false` otherwise.

<a id="function-iselementaryabelian-grppc"></a>
### `IsElementaryAbelian(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is elementary abelian, `false` otherwise.

<a id="function-isnilpotent-grppc"></a>
### `IsNilpotent(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is nilpotent, `false` otherwise.

<a id="function-isperfect-grppc"></a>
### `IsPerfect(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is perfect, `false` otherwise. A soluble group $G$ is perfect only if it is trivial.

<a id="function-issimple-grppc"></a>
### `IsSimple(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is simple, `false` otherwise.

<a id="function-issoluble-grppc"></a>
### `IsSoluble(G): GrpPC -> BoolElt`

<a id="function-issolvable-grppc"></a>
### `IsSolvable(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ is soluble, `false` otherwise. It always returns the value `true` for a pc-group.

<a id="function-istrivial-grppc"></a>
### `IsTrivial(G): GrpPC -> BoolElt`

Returns `true` if the group $G$ has order 1, `false` otherwise.

<a id="function-isspecial-grppc"></a>
### `IsSpecial(G): GrpPC -> BoolElt`

Given a $p$-group $G$, return `true` if $G$ is special, `false` otherwise.

<a id="function-isextraspecial-grppc"></a>
### `IsExtraSpecial(G): GrpPC -> BoolElt`

Given a $p$-group $G$, return `true` if $G$ is extra-special, `false` otherwise.

<a id="example-ex-e86fe2"></a>
### `Example: Basic Properties of Pc-Groups (ex-e86fe2)`

We use a presentation to define an extraspecial 3-group of exponent 9.

```magma
> E := PolycyclicGroup<a1,a2,b1,b2,z|a1^3,a2^3,b1^3=z,b2^3=z,
>   z^3,b1^a1=b1*z,b2^a2=b2*z>;
```

The sequence of base, exponent pairs from `FactoredOrder` shows us that the group has order $3^5$.

```magma
> FactoredOrder(E);
[ <3, 5> ]
> Exponent(E);
9
```

As well as with the `Order` function, one can get the size of a group by using the `#` shorthand.

```magma
> D3 := DihedralGroup(GrpPC, 3);
> #D3;
6
> IsNilpotent(D3);
false
```
