1 Definition and basic construction

A quotient group is obtained by taking a group and identifying elements that differ by multiplication with an element of a chosen normal subgroup. The resulting object, often called a factor group, retains enough of the original structure to reflect how the larger group is built, while collapsing the chosen subgroup to the identity.

1.1 Groups and subgroups

A group is a set equipped with an associative binary operation, an identity element, and inverses for all elements. A subgroup is a subset that is itself a group under the same operation. Subgroups provide the natural starting point for quotient constructions because they represent internal pieces of a group that may be “divided out” in a controlled way.

1.2 Normal subgroups

Not every subgroup can be used to form a quotient group. The subgroup must be normal, meaning it is invariant under conjugation by elements of the parent group. This condition ensures that the group structure survives after elements are grouped into classes.

1.3 Cosets

Cosets are the basic building blocks of quotient groups. Given a subgroup, one can form sets by multiplying a fixed group element by every element of the subgroup. These sets partition the group into disjoint blocks.

1.3.1 Left cosets

A left coset of a subgroup H in a group G is a set of the form gH, consisting of all products gh with h in H. Left cosets group together elements that differ by multiplication on the right by an element of H.

1.3.2 Right cosets

A right coset has the form Hg, consisting of all products hg with h in H. In general, left and right cosets need not coincide, but they do agree when the subgroup is normal.

1.4 Formation of the quotient group

The quotient group G/H is formed by treating each left coset of H as a single element. The collection of all such cosets becomes a new group once an appropriate multiplication is defined.

1.4.1 Equivalence classes under coset partition

The subgroup H determines an equivalence relation on G: two elements are equivalent if they lie in the same coset. This partitions G into mutually disjoint equivalence classes, each of which corresponds to one element of the quotient group.

1.4.2 Group operation on cosets

The product of two cosets is defined by multiplying representatives: (gH)(kH) = (gk)H. When H is normal, this rule produces another coset and matches the intended group structure on the quotient.

1.5 Well-definedness of the operation

To form a valid quotient group, the product of cosets must not depend on which representatives are chosen. Normality guarantees this well-definedness, so that different choices of g and k from the same cosets lead to the same resulting coset.

2 Properties

Quotient groups preserve several familiar features of groups while simplifying their structure. They are often smaller than the original group and can reveal hidden patterns that are difficult to see directly.

2.1 Order of a quotient group

If a group G is finite and H is a subgroup, then the size of G/H is the number of distinct cosets of H in G. This number equals the index of H in G. When G is finite, the order of G/H is therefore the order of G divided by the order of H.

2.2 Identity and inverses

The identity element of the quotient group is the coset H itself. The inverse of a coset gH is the coset g⁻¹H. These operations mirror those of the original group, but with each coset treated as a single unit.

2.3 Abelian and non-abelian cases

If the parent group is abelian, then every subgroup is normal, so quotient groups are easy to form. In non-abelian groups, normality becomes a real restriction, and quotient groups may still be abelian even when the original group is not. The quotient often captures the commutative part of a more complicated group.

2.4 Relationship to the parent group

The quotient group compresses the original group by identifying all elements of the normal subgroup with the identity. In this sense, it describes the parent group modulo the chosen subgroup, preserving structure that remains visible after the collapse.

3 Normality and why it is required

Normality is the condition that makes quotient groups possible. It prevents the coset multiplication rule from depending on arbitrary representative choices and ensures that the quotient inherits a consistent group law.

3.1 Failure for non-normal subgroups

If H is not normal, then the product of two cosets may vary with the chosen representatives. As a result, there may be no consistent way to define multiplication on the set of cosets, and the quotient construction breaks down.

3.2 Left and right coset comparison

When H is normal, left and right cosets coincide. This symmetry is a useful way to recognize normality: the subgroup sits in the group in a balanced manner rather than favoring one side of multiplication over the other.

3.3 Criterion for normality

A subgroup H is normal if and only if gHg⁻¹ = H for every g in G. Equivalent criteria include the equality of left and right cosets for all group elements. These formulations are central in verifying whether a quotient group can be formed.

4 Examples

Concrete examples show how quotient groups translate abstract definitions into familiar arithmetic and symmetry structures.

4.1 Integers modulo n

The group of integers under addition has the subgroup nZ consisting of all multiples of n. The quotient group Z/nZ has n elements and is the standard model for arithmetic modulo n. Its elements are residue classes, such as 0, 1, ..., n−1.

4.2 Cyclic groups

A cyclic group often has quotient groups that are again cyclic. If a cyclic group has a subgroup generated by a divisor of its order, then the quotient reflects the remaining factor. This makes cyclic groups especially transparent examples of quotient behavior.

4.3 Symmetric groups

In the symmetric group on n objects, the alternating group is a normal subgroup. The quotient by this subgroup has two elements and records whether a permutation is even or odd. This example shows how quotient groups can capture a broad structural feature in a compact form.

4.4 Matrix groups

In matrix groups, quotients often arise from subgroups consisting of matrices with special determinant or triangular conditions. Such examples are important in linear algebra and Lie theory, where quotient constructions simplify families of transformations by collapsing a recognizable normal subgroup.

4.5 Modular arithmetic interpretations

Quotient groups provide the group-theoretic framework behind congruence classes. In additive settings, the quotient corresponds to reducing numbers modulo a chosen integer. This interpretation connects abstract algebra with the familiar arithmetic of remainders.

5 Homomorphisms and the first isomorphism theorem

Quotient groups are closely tied to homomorphisms, which preserve group operations. The kernel of a homomorphism identifies exactly the part of the group that disappears under the map.

5.1 Kernel of a homomorphism

The kernel of a homomorphism is the set of elements mapped to the identity in the target group. Kernels are always normal subgroups, making them natural candidates for quotient constructions.

5.2 Quotient by the kernel

If a homomorphism sends elements of G to another group, then all elements in the same coset of the kernel have the same image. This observation explains why the map can be viewed as acting on the quotient group G/ker(f).

5.3 Statement of the first isomorphism theorem

The first isomorphism theorem states that the quotient of a group by the kernel of a homomorphism is isomorphic to the image of that homomorphism. In symbols, G/ker(f) ≅ im(f). This theorem is one of the central links between quotient groups and group mappings.

5.4 Consequences for group structure

The theorem shows that every homomorphic image can be understood as a quotient of the original group. It provides a standard method for studying groups through their homomorphisms and for recognizing when two groups have the same essential structure.

6 Universal properties and categorical viewpoint

Beyond explicit calculations, quotient groups can be described by a universal property. This formulation explains their role as canonical objects through which compatible maps must pass.

6.1 Canonical projection map

The canonical projection from G to G/H sends each element to its coset. This map is surjective, and its kernel is exactly H. It is the standard bridge from the original group to the quotient.

6.2 Factorization through quotient groups

Any homomorphism from G to another group that kills H, meaning sends every element of H to the identity, factors uniquely through the quotient G/H. In practice, this means the quotient is the most efficient way to encode the information retained after H has been collapsed.

6.3 Universal mapping property

The universal mapping property characterizes the quotient group by how maps out of it behave. Rather than focusing only on the set of cosets, this viewpoint emphasizes the quotient as the canonical recipient of all homomorphisms that are constant on H-cosets.

Quotient groups are part of a broader family of quotient-like operations across algebra. They often appear alongside constructions that refine or generalize the same idea of identifying elements according to a rule.

7.1 Factor groups

The terms quotient group and factor group are commonly used interchangeably. Both describe the group formed by collapsing a normal subgroup to a single identity coset.

7.2 Quotients by subgroup chains

If a group contains a chain of normal subgroups, successive quotients can be formed in stages. Such layered constructions help analyze a group step by step and are useful in structural decompositions.

7.3 Direct products and quotient behavior

Quotients interact naturally with direct products, often allowing normal subgroups to be taken componentwise. This compatibility makes quotient groups useful in building and simplifying larger composite groups.

7.4 Quotients in other algebraic structures

Analogous quotient constructions appear in rings, modules, vector spaces, and other algebraic systems. In each case, one identifies elements according to a suitable substructure, producing a simpler object that preserves the relevant operations.

8 Applications

Quotient groups are used throughout mathematics to reduce complexity, isolate invariants, and compare structures. Their versatility makes them one of the central tools of abstract algebra.

8.1 Classification of groups

Quotient groups help classify groups by separating internal components and examining the resulting simpler pieces. They are especially useful in studying composition series, extensions, and solvable structures.

8.2 Symmetry reduction

In problems involving symmetry, quotienting by a normal subgroup removes a specified layer of symmetry and leaves a reduced symmetry group. This approach is common when one wishes to focus on the essential transformations rather than every detail.

8.3 Galois theory

In Galois theory, quotient groups arise naturally from groups of field automorphisms. They help describe how field extensions are organized and how intermediate fields correspond to subgroups of symmetry.

8.4 Topological and geometric analogues

Quotient ideas also appear in topology and geometry, where spaces are formed by identifying points according to an equivalence relation. Although the setting differs, the guiding principle is the same: collapse a chosen structure and study the simpler object that remains.