\(L_3(4)\) as a subgroup of Mathieu group M22
The presentation comes from the ATLAS of Group Representations. The subgroup generators come from the corresponding ATLAS program.
The computation
The recorded run took about 509 milliseconds. The animation shows its progress, with the number of active nodes and the proportion of defined edges.
Claim
Let \(u\) and \(v\) be the two subgroup words listed in the code below. If
\[
H = \langle u,v \rangle \cong L_3(4),
\]
then
\[
[\mathrm{M}_{22}:H] = 22.
\]
We verify the claimed index, but not the claimed isomorphism type. In the code,
uppercase letters denote inverses, so A represents \(a^{-1}\) and B
represents \(b^{-1}\).
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"), "")
# L3(4), order 20160, expected index 22.
# Source: https://brauer.maths.qmul.ac.uk/Atlas/spor/M22/words/M22G1-max1W1
# ATLAS output words simplified using a^2 = b^4 = 1; B denotes b^-1.
tc = ToddCoxeter(congruence_kind.onesided, p)
for word in (
"a",
"bbaBabbaBaBaBaBababababababbababb",
):
tc.add_generating_pair(word, "")
tc.report_every(timedelta(milliseconds=5))
actual_index = tc.number_of_classes()
print(f"The index of L3(4) is {actual_index}")
if actual_index != 22:
raise RuntimeError(f"expected index 22, got {actual_index}")
The output
Truncated output from the Python script
++++++++++++++++++++++++++++++++
#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 | 33 | 0 | 33
#0: ToddCoxeter: | active | missing | % complete
#0: ToddCoxeter: edges | 34 | 98 | 25.8%
#0: ToddCoxeter: time | run 0 = 27µs | all runs = 27µs | elapsed = 80µs
++++++++++++++++++++++++++++++++
#1: ToddCoxeter: HLT 0.0.1 | active | killed | defined
[... lines omitted ...]
#1: ToddCoxeter: | active | missing | % complete
#1: ToddCoxeter: edges | 88 | 0 | 100.0%
#1: ToddCoxeter: diff 0.3.6 | +0 | +0 | +0.0%
#1: ToddCoxeter: diff 0.3.0 | +0 | +0 | +0.0%
#1: ToddCoxeter: phase 0.3 = 27ms | run 0 = 507ms | all runs = 507ms | elapsed = 507ms
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 STOP (finished)
#0: ToddCoxeter: run 0 | lookahead | lookbehind | hlt | felsch
#0: ToddCoxeter: num. phases | 1 | 0 | 2 | 0
#0: ToddCoxeter: time spent in phases | 333ms (65%) | - (0%) | 146ms (29%) | - (0%)
#0: ToddCoxeter: phase 0.3 = 28ms | run 0 = 508ms | all runs = 508ms | elapsed = 509ms
The index of L3(4) is 22
The computed index is the claimed index: \(22\).
Note
The output and timings may vary between machines, but the final result should be the same.