The trivial subgroup of Mathieu group M23 (Presentation 2)
The presentation comes from the ATLAS of Group Representations.
The script includes the additional relation \([a,b]^6 = 1\), which does not appear in the presentation displayed on the ATLAS page. We do not verify that this relation is redundant here.
The computation
The recorded run took about 4 minutes 35 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. Including the additional relation described above, the presentation used by the script defines a group of order
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^2)^6"), "")
# [a,b] = a^-1 b^-1 a b.
presentation.add_rule(p, parse_relations("(ABab)^6"), "")
presentation.add_rule(p, parse_relations("(abaBab^2)^4"), "")
presentation.add_rule(p, parse_relations("abababaBab^2abaBabaBabababaBaBaB"), "")
presentation.add_rule(
p, parse_relations("abab^2abab^2abab^2ab^2aBab^2aBabab^2abaBab^2"), ""
)
presentation.add_rule(
p,
parse_relations("abab^2ab^2abab^2ab^2abab^2ab^2abab^2ab^2aBab^2ab^2aBab^2ab^2"),
"",
)
presentation.add_rule(
p, parse_relations("ababababab^2abaBabab^2ababaBab^2abab^2ab^2abaBaBabab^2"), ""
)
tc = ToddCoxeter(congruence_kind.twosided, p)
tc.strategy(ToddCoxeter.options.strategy.felsch)
tc.report_every(timedelta(seconds=3))
actual_order = tc.number_of_classes()
print(f"The size of the group defined by the presentation is {actual_order}")
if actual_order != 10200960:
raise RuntimeError(f"expected order 10200960, got {actual_order}")
The output
Truncated output from the Python script
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 START (strategy() = felsch)
#0: ToddCoxeter: |A| = 4, |R| = 13, |u| + |v| ∈ [2, 48], ∑(|u| + |v|) = 248
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: FELSCH 0.0 START
#0: ToddCoxeter: FELSCH 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 = 20µs | all runs = 20µs | elapsed = 80µs
++++++++++++++++++++++++++++++++
#1: ToddCoxeter: FELSCH 0.0.1 | active | killed | defined
[... lines omitted ...]
#0: ToddCoxeter: | active | missing | % complete
#0: ToddCoxeter: edges | 40,803,840 | 0 | 100.0%
#0: ToddCoxeter: diff 0.2.19 | +0 | +0 | +0.0%
#0: ToddCoxeter: diff 0.2.0 | +0 | +0 | +0.0%
#0: ToddCoxeter: phase 0.2 = 53.555s | run 0 = 4min35s | all runs = 4min35s | elapsed = 4min35s
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 STOP (finished)
#0: ToddCoxeter: run 0 | lookahead | lookbehind | hlt | felsch
#0: ToddCoxeter: num. phases | 1 | 0 | 0 | 1
#0: ToddCoxeter: time spent in phases | 53.555s (19%) | - (0%) | - (0%) | 3min41s (80%)
#0: ToddCoxeter: phase 0.2 = 53.873s | run 0 = 4min35s | all runs = 4min35s | elapsed = 4min35s
The size of the group defined by the presentation is 10200960
The computed order is the claimed order: \(10,200,960\).
Note
The output and timings may vary between machines, but the final result should be the same.