The trivial subgroup of the Mathieu group M22
The presentation comes from the ATLAS of Group Representations. Enumerating over the trivial subgroup computes the order of the group.
The computation
The recorded run took about 9.392 seconds. The animation shows its progress, with the number of active nodes and the proportion of defined edges.
Claim
Let \(H\) be the trivial subgroup. We verify that the presentation of M22 defines a group of order
\[
[\mathrm{M}_{22}:H] = |\mathrm{M}_{22}| = 443,520.
\]
The code
The following script includes the full presentation and can be run on its own.
Code
from datetime import timedelta
from libsemigroups_pybind11 import (
Presentation,
ToddCoxeter,
congruence_kind,
presentation,
)
from libsemigroups_pybind11.words import parse_relations
# Enable the empty word and inverses so the presentation defines a group.
p = Presentation("abAB")
p.contains_empty_word(True)
presentation.add_inverse_rules(p, "ABab")
# Add the defining relations
presentation.add_rule(p, parse_relations("a^2"), "")
presentation.add_rule(p, parse_relations("b^4"), "")
presentation.add_rule(p, parse_relations("(ab)^11"), "")
presentation.add_rule(p, parse_relations("(ab^2)^5"), "")
# [a, bab] = a^-1 (bab)^-1 a (bab).
presentation.add_rule(p, parse_relations("(ABABabab)^3"), "")
presentation.add_rule(p, parse_relations("(ababaB)^5"), "")
tc = ToddCoxeter(congruence_kind.twosided, p)
tc.report_every(timedelta(milliseconds=125))
tc.run_for(timedelta(seconds=30))
if not tc.finished():
raise RuntimeError("The enumeration did not finish within 30 seconds")
actual_order = tc.number_of_classes()
print(f"The size of the group defined by the presentation is {actual_order}")
if actual_order != 443520:
raise RuntimeError(f"expected order 443520, got {actual_order}")
The output
Truncated output from the Python script
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: running for approx. 30.000s
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 START (strategy() = hlt)
#0: ToddCoxeter: |A| = 4, |R| = 10, |u| + |v| ∈ [2, 30], ∑(|u| + |v|) = 105
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: HLT 0.0 START
#0: ToddCoxeter: HLT 0.0.0 | active | killed | defined
#0: ToddCoxeter: nodes | 1 | 0 | 1
#0: ToddCoxeter: | active | missing | % complete
#0: ToddCoxeter: edges | 0 | 4 | 0.0%
#0: ToddCoxeter: time | run 0 = 19µs | all runs = 19µs | elapsed = 78µs
[... lines omitted ...]
#1: ToddCoxeter: | active | missing | % complete
#1: ToddCoxeter: edges | 1,774,080 | 0 | 100.0%
#1: ToddCoxeter: diff 0.15.3 | +0 | +0 | +0.0%
#1: ToddCoxeter: diff 0.15.0 | +0 | +0 | +0.0%
#1: ToddCoxeter: phase 0.15 = 175ms | run 0 = 9.349s | all runs = 9.349s | elapsed = 9.349s
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 STOP (finished)
#0: ToddCoxeter: run 0 | lookahead | lookbehind | hlt | felsch
#0: ToddCoxeter: num. phases | 7 | 0 | 8 | 0
#0: ToddCoxeter: time spent in phases | 8.202s (87%) | - (0%) | 1.055s (11%) | - (0%)
#0: ToddCoxeter: phase 0.15 = 217ms | run 0 = 9.392s | all runs = 9.392s | elapsed = 9.392s
The size of the group defined by the presentation is 443520
The computed order is the claimed order: \(443,520\).
Note
The output and timings may vary between machines, but the final result should be the same.