Skip to content

\(\mathrm{M}_{10} = A_6.2_3\) as a subgroup of Mathieu group M11

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 14 milliseconds. The animation shows its progress, with the number of active nodes and the proportion of defined edges.

Progress of the Todd–Coxeter computation.

Claim

If

\[ H = \langle (ab)^{-4}a(ab)^4,\ (ab^2)^{-2}(abababbab)(ab^2)^2 \rangle \cong \mathrm{M}_{10} = A_6.2_3, \]

then

\[ [\mathrm{M}_{11}:H] = 11. \]

We verify the claimed index, but not the claimed isomorphism type.

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

p = Presentation("abAB")
p.contains_empty_word(True)
presentation.add_inverse_rules(p, "ABab")

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)^6"), "")
presentation.add_rule(p, parse_relations("ababaBabab^2aBabaBaB"), "")

# M10 = A6.2_3, order 720, expected index 11.
# Generators: (ab)^-4 a (ab)^4, (ab^2)^-2 (abababbab) (ab^2)^2.
# Source: https://brauer.maths.qmul.ac.uk/Atlas/spor/M11/words/M11G1-max1W1
# Upper-case letters denote inverses.
tc = ToddCoxeter(congruence_kind.onesided, p)
for word in ("(BA)^4a(ab)^4", "(BBA)^2abababbab(abb)^2"):
    tc.add_generating_pair(parse_relations(word), "")

tc.report_every(timedelta(milliseconds=0.1))

actual_index = tc.number_of_classes()
print(f"The index of M10 is {actual_index}")
if actual_index != 11:
    raise RuntimeError(f"expected index 11, got {actual_index}")

The output

Truncated output from the Python script
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 START (strategy() = hlt)
#0: ToddCoxeter: |A| = 4, |R| = 9, |u| + |v| ∈ [2, 22], ∑(|u| + |v|) = 73
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: HLT 0.0 START
#0: ToddCoxeter: HLT 0.0.0        |       active |          killed |         defined
#0: ToddCoxeter: nodes            |           36 |               0 |              36
#0: ToddCoxeter:                  |       active |         missing |      % complete
#0: ToddCoxeter: edges            |           37 |             107 |           25.7%
#0: ToddCoxeter: time             | run 0 = 29µs | all runs = 29µs | elapsed = 223µs
++++++++++++++++++++++++++++++++
#1: ToddCoxeter: HLT 0.0.1         |        active |           killed |         defined
[... lines omitted ...]
#1: ToddCoxeter:                  |       active |         missing |     % complete
#1: ToddCoxeter: edges            |           44 |               0 |         100.0%
#1: ToddCoxeter: diff 0.1.101     |           +0 |              +0 |          +0.0%
#1: ToddCoxeter: diff 0.1.0       |           +7 |            -107 |         +74.3%
#1: ToddCoxeter: phase 0.1 = 14ms | run 0 = 14ms | all runs = 14ms | elapsed = 14ms
++++++++++++++++++++++++++++++++
#0: ToddCoxeter: RUN 0 STOP (finished)
#0: ToddCoxeter: run 0                |    lookahead |      lookbehind |            hlt |       felsch
#0: ToddCoxeter: num. phases          |            0 |               0 |              1 |            0
#0: ToddCoxeter: time spent in phases |       - (0%) |          - (0%) |     13ms (92%) |       - (0%)
#0: ToddCoxeter: phase 0.1 = 14ms     | run 0 = 14ms | all runs = 14ms | elapsed = 14ms
The index of M10 is 11

The computed index is the claimed index: \(11\).

Note

The output and timings may vary between machines, but the final result should be the same.