Subgroups, Direct Products, Cosets and Finite-Group Counting

Executive summary

Groups rarely need to be analysed all at once. Subgroups isolate internally complete pieces, direct products build larger groups from known ones, and cosets compare the size of a subgroup with the size of the ambient group. The source develops these tools through symmetry and cyclic examples, then derives a central finite-group counting theorem: the order of a subgroup divides the order of the finite group. This result constrains possible element orders and subgroup sizes and later supports classification and normality arguments. The key idea is that left cosets of a subgroup partition the group into equally sized blocks.

What this handbook page teaches

Apply efficient necessary-and-sufficient tests for a subset to be a subgroup.
Construct the direct product of two groups and calculate its order.
Form left and right cosets and understand why cosets partition the group.
Derive the finite-order divisibility rule from equal-sized cosets.
Use divisibility to constrain element orders and possible subgroup structures.

Core concepts

objects→ operation→ structure→ invariants

The recurring method is to replace the physical meaning of the objects by the rules governing how they combine.

Subgroups

A subgroup is a subset that is itself a group under the same operation. A practical test is closure under products, inclusion of the identity and closure under inverses. The identity and inverse inherited from the ambient group are automatically the subgroup identity and inverses. A compact alternative for non-empty subsets is to check that ab^-1 stays in the subset for arbitrary members.

Every element generates a cyclic subgroup consisting of all its integer powers. Intersections of subgroups are also subgroups, which gives a natural way to construct the smallest subgroup satisfying several constraints.

Direct products

For groups G and H, the direct product G×H consists of ordered pairs (g,h) with component-wise multiplication. The identity is (e_G,e_H) and the inverse of (g,h) is (g^-1,h^-1). Associativity follows component by component.

If G and H are finite of orders m and n, their direct product has mn elements. Direct products preserve commutativity and later preserve solubility, making them a controlled way to combine group structures.

Cosets and counting

Given a subgroup H of G, the left coset gH is the set of all gh as h ranges over H. Two left cosets are either identical or disjoint, and every element of G belongs to exactly one. Multiplication by g is a bijection from H onto gH, so every coset has the same number of elements as H.

If a finite group has |G| elements, a subgroup has |H|, and there are k left cosets, then |G|=k|H|. Thus subgroup order divides group order. The same counting applies to right cosets, although the actual left and right cosets need not coincide.

Working method

Use the following sequence as a repeatable analysis workflow. The steps are ordered to separate definitions and admissibility checks from structural conclusions, so a result can be audited without relying on intuition or an unverified diagram.

Start with a candidate subset and apply the subgroup test under the operation inherited from the ambient group.
For a direct product, keep component operations separate; never multiply a G component with an H component.
For cosets, choose one representative g and compute gH. If a new representative lies in an existing coset, it generates that same coset.
Use the equal-size property to count: number of cosets equals |G|/|H| for finite groups.
Apply the divisibility result to cyclic subgroups <a>. The order of any element in a finite group divides the group order.
Use prime-order consequences: a group of prime order has no non-trivial proper subgroup and every non-identity element generates the whole group.

Cosets in a six-element symmetry group

Suppose a six-element group contains a three-element rotation subgroup H={e,r,r²}. The left coset generated by any reflection s is sH={s,sr,sr²}. No element of this coset can lie in H; otherwise multiplying appropriately by an inverse would force s into H. Therefore the group is partitioned into exactly two left cosets, each containing three elements.

The count 6=2×3 is not an accident of the example. The same bijection h↦gh proves that all left cosets have the subgroup's size. This counting argument establishes the general divisibility theorem for finite groups.

The example also prepares the idea of normality. Here the three-element rotation subgroup has index two, and any subgroup of index two is normal. That fact later allows the set of cosets itself to carry a well-defined group operation.

Technical reasoning and deeper connections

The subgroup-order divisibility result should be understood as a partition theorem rather than as a mysterious number-theoretic fact. Once the group is tiled by equal-sized cosets, divisibility is unavoidable. This viewpoint makes it easier to reconstruct the proof and to adapt the argument in unfamiliar settings.

Left and right cosets have equal cardinality but can be different subsets. Their equality for every representative is exactly what later characterises normal subgroups. Therefore cosets are not only a counting device; they are the bridge from subgroup theory to quotient groups.

Direct products and cosets serve opposite structural purposes. A direct product assembles a new group from known pieces. A quotient, developed later, compresses a group by treating each coset of a normal subgroup as a single element. Understanding both operations makes extension arguments about soluble groups much clearer.

The order of an element equals the size of its generated cyclic subgroup. Combining this with the subgroup divisibility theorem immediately shows that element order divides finite group order. This is one of the quickest consistency checks in small finite-group problems.

Quick-reference matrix

Tool	Input	Output or constraint
Subgroup test	Subset of a group	Decides whether inherited operation makes a group.
Direct product	Groups `G,H`	Group of ordered pairs with order `\|G\|\|H\|` when finite.
Left cosets	Subgroup `H`	Partition of `G` into blocks of size `\|H\|`.
Order divisibility	Finite `G` and subgroup `H`	`\|H\|` divides `\|G\|`.
Element-order test	Element `a∈G`	`ord(a)` divides `\|G\|`.

Common mistakes

Assuming a subset is a subgroup because it contains the identity.
Forgetting to verify inverses or using inverses from a different operation.
Treating a direct product as an ordinary product of element values.
Assuming different coset representatives always produce different cosets.
Assuming left and right cosets are identical in every group.
Using subgroup-order divisibility as a sufficient condition: a divisor of the group order need not occur as a subgroup order in every group.

Verification checklist

Before accepting a solution or proof, confirm each item below. These checks are intentionally practical: they catch the most common category errors, missing hypotheses and structure mismatches.

Subgroup closure and inverse conditions are checked for arbitrary members.
Coset calculations use the correct left or right convention consistently.
Every element is accounted for in exactly one coset when forming a partition.
Finite counts reconcile to |G|=[G:H]|H|.
Element-order claims agree with the order of the generated cyclic subgroup.
Direct-product structure is checked component-wise.

Frequently asked questions

Does every divisor of a finite group's order give a subgroup?

No. The divisibility theorem gives a necessary condition, not a general sufficient condition.

Why do all cosets have the same size?

Multiplication by a fixed group element is a bijection between the subgroup and its coset.

Can a subgroup be the whole group?

Yes. Both the identity-only subgroup and the whole group are always subgroups.

What is the index of a subgroup?

For a finite group it is the number of cosets, equal to |G|/|H|. The concept also extends to infinite groups.

Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 1.6, 1.7, 1.8. It paraphrases the supplied material and does not reproduce source artwork or long source passages. Historical names, publisher details and personal details have been intentionally omitted.