How this calculation works
First validate the whole group. Starting from the identity and chosen generators, repeatedly add products until the set stops growing. Compute both cosets for every representative, count unique sets and compare gH with Hg to determine normality.
H = ⟨generators⟩; gH = {g⋆h}; Hg = {h⋆g}; [G:H] = |G|/|H|A worked example
In addition modulo 6, generator 2 gives H = {0,2,4}. The two distinct cosets are {0,2,4} and {1,3,5}, and the subgroup index is 2.
Good to know
Finite exact operations only, with at most 24 elements. Custom tables must supply every product and pass all group axioms. For dihedral groups n means polygon sides and the order is 2n; for modular models n is the modulus. This does not infer an abstract group from an arbitrary symbolic presentation. Generates one specified subgroup, not an enumeration of all subgroups. Duplicate cosets are shown by representative so the partition can be inspected.
Reference: Judson: Abstract Algebra, groups, permutations and cosets (opens in a new tab) ↗
Generators specify a process, rather than a finished list
In addition modulo 6, entering generator 2 starts with 0 and 2. Repeated addition also produces 4, after which no new elements appear. The generated subgroup is {0,2,4}. Entering both 2 and 3 generates the entire group because their combinations reach all six residues.
This calculator closes the supplied generators under the operation. It does not interpret the input as a proposed subgroup that must already contain every product. To study a subgroup you know, you may enter all its elements, but that is not necessary when a smaller generating set is available.
For a custom operation, the full group table is validated before any subgroup calculation. This prevents a coset-shaped collection of sets from being presented as a group-theoretic result when the original operation is not a group.
An operation table defines every product needed to generate the subgroup and its cosets; the result depends on that operation, not only the element labels. The ideal and quotient ring calculator adds ring multiplication to a separate integer-ring coset construction.
Compare cosets as sets, not as ordered lists
For H = {0,2,4} in addition modulo 6, the coset represented by 1 is {1,3,5}. Representatives 1, 3 and 5 give the same set, so they do not count as three different cosets. The output deliberately shows every representative to make that repetition visible.
Left and right cosets always have the same size as H. The distinct left cosets partition G, and their count is the index [G:H]. Here six elements divide into two sets of size three. This is a useful check on both the operation and the generated subgroup.
For a noncommutative example, select the dihedral model with n = 3 and generator r0s. The subgroup contains the identity and one reflection, but some left and right cosets differ. Normality requires gH = Hg for every g; equal counts of left and right cosets alone are not enough. Only a normal subgroup supports the usual quotient-group multiplication on its cosets.
A few questions, answered
Does this enumerate every subgroup?
No. It computes the single subgroup generated by the labels you enter, then analyzes its cosets. Enumerating all subgroups is a different task.
Can the identity be the only generator?
Yes. It generates the one-element trivial subgroup. Every element then represents a singleton coset, and the index equals the group order.
Why are repeated cosets listed?
The table answers the question for each representative. The separate distinct-coset counts remove duplicates by set equality.