Finite groups of order n #
This file introduces the number of non-isomorphic groups of order n.
Implementation notes #
We implement two definitions for the sequence and prove they agree. First, we define
the non-isomorphic groups of order n directly using objects in the category Grp
from Mathlib. Then, we define the non-isomorphic subgroups of order n of S_n, the
symmetric group on n letters, defined as Equiv.Perm (Fin n), following
Mathlib. The key point in showing the equivalence is
Cayley's theorem.
Main results #
NonIsoGrpOfOrder n: counts the number of non-isomorphic groups of ordern.NonIsoSubgroupsSymmOfOrder n: counts the number of non-isomorphic subgroups ofS_nof ordern.NonIsoGrpOfOrder_eq_NonIsoSubgroupsSymmOfOrder: both sequences above coincide.- The first values are 0, 1.
Two groups are related if they are isomorphic in the category Grp.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Classes of isomorphism of groups of order n.
Equations
Instances For
The number of non-isomorphic finite groups of order n.
Equations
Instances For
OEIS sequence offset
Equations
Instances For
Finite groups as subgroups of the Symmetric Group #
Subgroups of $S_n$ of order n.
Equations
- Sequence.SubgroupsSymmOfOrder n = {H : Subgroup (SymmetricGroup n) | Nat.card ↥H = n}
Instances For
Two subgroups of $S_n$ are related if they are isomorphic as groups.
Equations
- Sequence.SubgroupsSymmSetoid n = { r := fun (G H : ↑(Sequence.SubgroupsSymmOfOrder n)) => Nonempty (↥↑G ≃* ↥↑H), iseqv := ⋯ }
Instances For
Classes of isomorphism of subgroups of order n of $S_n$.
Equations
Instances For
The number of non-isomorphic subgroups of S_n of order n.
Equations
Instances For
OEIS sequence offset