---
title: "Properties of a Rewrite Group"
canonical: "https://docs.magma-maths.org/v2.30-1/FinitelyPresentedGroups/GroupsDefinedByRewriteSystems/properties.html"
source: "https://docs.magma-maths.org/v2.30-1/FinitelyPresentedGroups/GroupsDefinedByRewriteSystems/properties.md"
part: "Finitely Presented Groups"
chapter: "Groups Defined by Rewrite Systems"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Finitely Presented Groups", "source": "https://docs.magma-maths.org/v2.30-1/FinitelyPresentedGroups/index-finitely-presented-groups.md"}
  - {"title": "Groups Defined by Rewrite Systems", "source": "https://docs.magma-maths.org/v2.30-1/FinitelyPresentedGroups/GroupsDefinedByRewriteSystems/index-groups-defined-by-rewrite-systems.md"}
prev: {"title": "Constructing Confluent Presentations", "source": "https://docs.magma-maths.org/v2.30-1/FinitelyPresentedGroups/GroupsDefinedByRewriteSystems/creation.md"}
next: {"title": "Arithmetic with Words", "source": "https://docs.magma-maths.org/v2.30-1/FinitelyPresentedGroups/GroupsDefinedByRewriteSystems/arithmetic.md"}
intrinsics:
  - {"name": "IsConfluent", "signature": "IsConfluent(G): GrpRWS -> BoolElt"}
  - {"name": "IsFinite", "signature": "IsFinite(G): GrpRWS -> BoolElt, RngIntElt"}
  - {"name": "Order", "signature": "Order(G): GrpRWS -> RngIntElt"}
  - {"name": "#", "signature": "# G: GrpRWS -> RngIntElt"}
examples:
  - "ex-40c60a"
  - "ex-174016"
---

# Properties of a Rewrite Group

<a id="function-isconfluent-grprws"></a>
## `IsConfluent(G): GrpRWS -> BoolElt`

Returns `true` if $G$ is confluent, `false` otherwise.

<a id="function-isfinite-grprws"></a>
## `IsFinite(G): GrpRWS -> BoolElt, RngIntElt`

Given a confluent group $G$ return `true` if $G$ has finite order and `false` otherwise. If $G$ does have finite order also return the order of $G$.

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

<a id="operation-operation-grprws-rngintelt"></a>
## `# G: GrpRWS -> RngIntElt`

The order of the group $G$ as an integer. If the order of $G$ is known to be infinite, the symbol $\infty$ is returned.

<a id="example-ex-40c60a"></a>
## `Example: Confluence of the Weyl Group E8 (ex-40c60a)`

We construct the Weyl group $E_8$.

```magma
> FG<a,b,c,d,e,f,g,h> := FreeGroup(8);
> Q := quo< FG | a^2=1, b^2=1, c^2=1, d^2=1, e^2=1, f^2=1, g^2=1,
>     h^2=1, b*a*b=a*b*a, c*a=a*c, d*a=a*d, e*a=a*e, f*a=a*f,
>     g*a=a*g, h*a=a*h, c*b*c=b*c*b, d*b=b*d, e*b=b*e, f*b=b*f,
>     g*b=b*g, h*b=b*h, d*c*d=c*d*c, e*c*e=c*e*c, f*c=c*f,
>     g*c=c*g, h*c=c*h, e*d=d*e, f*d=d*f, g*d=d*g, h*d=d*h,
>     f*e*f=e*f*e, g*e=e*g, h*e=e*h, g*f*g=f*g*f, h*f=f*h,
>     h*g*h=g*h*g>;
> G := RWSGroup(Q);
> IsConfluent(G);
true
> IsFinite(G);
true 696729600
```

So the group is finite of order $696,729,600$.

<a id="example-ex-174016"></a>
## `Example: Order of an Infinite Rewrite Group (ex-174016)`

We construct a $2$-generator $2$-relator group and use the order function to show that the group is infinite. The symbol `Infinity`, returned by `Order`, indicates that the group has infinite order.

```magma
> G := Group< x, y | x^2 = y^2, x*y*x = y*x*y >;
> R := RWSGroup(G);
> print Order(G);
Infinity
```
