Group Homomorphisms and Quotient Groups
A group records a symmetry, but symmetries almost never live alone: one symmetry group maps onto another by forgetting some structure while keeping the multiplication law intact. The device that captures "keeps the multiplication law" is the group homomorphism, a map φ:G→H with φ(g₁g₂)=φ(g₁)φ(g₂). Once such a map exists, two complementary questions organize everything — what does it crush to the identity, and what does it reach — and the answers are the kernel and the image. The central discovery of elementary group theory is that these are rigidly linked: the source, divided by everything the map forgets, is isomorphic to everything the map hits. That single sentence is the First Isomorphism Theorem, G/ker φ ≅ im φ, the workhorse this article is built around. To divide a group we need a quotient, and to form a quotient the subgroup we factor out must be normal — invariant under conjugation, gNg⁻¹=N. The quiet miracle is that the subgroups arising as kernels are exactly the normal subgroups. Normality, which can look like a technical hypothesis, is revealed here as the precise condition for the coset space G/N to carry a well-defined multiplication. In physics this language is not optional: a linear representation is literally a homomorphism into a matrix group, the determinant and the permutation sign are one-dimensional homomorphisms, and the spin double cover SU(2)→SO(3) is a two-to-one homomorphism whose kernel {±I} is why a 2π rotation flips the sign of an electron's wavefunction. The running theme is that a homomorphism is a controlled loss of information — the kernel measures what is lost, the quotient repackages the source so the loss is undone, and the image is what survives. Mastering that triangle is the prerequisite for character theory, the classification of Lie groups, and the representation theory of particle physics.
- A group homomorphism φ:G→H satisfies φ(g₁g₂)=φ(g₁)φ(g₂); it automatically sends identity to identity and inverses to inverses.
- The kernel ker φ (everything mapped to the identity) is always a normal subgroup of G; the image im φ is a subgroup of H.
- Kernels and normal subgroups are the same objects: every normal N is the kernel of its projection π:G→G/N, and the coset product (aN)(bN)=(ab)N is well-defined precisely because N is normal.
- The First Isomorphism Theorem, G/ker φ ≅ im φ, reads off a quotient concretely; for finite groups it forces |G| = |ker φ|·|im φ|.
- Representations are homomorphisms ρ:G→GL(V); quotients explain covering maps like SU(2)→SO(3) and the 4π periodicity of spinors.
- Key idea: a homomorphism's kernel is a normal subgroup, its image is a subgroup, and quotienting by the kernel recovers the image — G/ker φ ≅ im φ — so normal subgroups and kernels are one and the same class of objects.
A homomorphism's kernel is a normal subgroup and its image is a subgroup, and the quotient by the kernel is isomorphic to the image: G/ker φ ≅ im φ. Normal subgroups and kernels are exactly the same class of objects.
Where this lives today
The kernel–image–quotient triangle is the daily language of anywhere symmetry meets physics. A linear representation is a homomorphism ρ:G→GL(V), and which elements act trivially — the kernel — decides whether a field is a faithful representation of the gauge group or secretly a representation of a quotient. The Standard Model's electroweak gauge group is such a quotient, . The double cover SU(2)→SO(3), and its relativistic parent Spin(3,1)→SO(3,1), are why fermions exist as spinor fields and why a neutron interferometer shows a measurable phase reversal after a 2π rotation — first observed in 1975, a laboratory sighting of the kernel element −I. In condensed matter and cosmology, when a symmetry group breaks to the vacuum manifold is the coset space , whose topology classifies defects: vortices in superfluid helium, disclinations in liquid crystals, cosmic strings and monopoles in grand unified theories. The three-line theorem Noether polished a century ago is, quite literally, still doing physics.
The physical picture
Think of a homomorphism as a lossy compression of a symmetry: it keeps the multiplication structure — products go to products — but may blur distinct elements together. The set blurred all the way down onto the identity is the kernel, the "resolution" the map throws away. Everything in a single coset of the kernel is sent to one image element, so the cosets are the fibers of the map. Counting those fibers is the whole content of the First Isomorphism Theorem: the number of kernel cosets equals the size of the image, and the coset arithmetic is literally the same group as the image. The first figure makes this fibration concrete with real numbers.
Normality is the geometric fine print. The kernel must look the same no matter where you stand in the group — gNg⁻¹=N — because conjugation by g is the group's own way of "changing viewpoint," and a subgroup whose blurring is consistent across every viewpoint is exactly one that can be quotiented out. Everything physical about representations lives between two extremes: a faithful representation has trivial kernel and stores the whole group, while one with a nontrivial kernel is secretly a faithful representation of the smaller quotient. The most consequential physical example is a two-to-one map, drawn next.
The core equations
The starting point is the defining property. A homomorphism respects multiplication — it need not be one-to-one, onto, or size-preserving, only structure-preserving. Everything else in this article is squeezed out of this one line.
where: — a map between two groups; — elements of the source group ; juxtaposition — the group product (in on the left, in on the right). Reading: the image of the product equals the product of the images, so multiplication before or after applying gives the same answer. Two facts that look like extra axioms are in fact forced by (1) alone: a homomorphism carries identity to identity and inverses to inverses — you never have to require φ(e)=e.
where: — the identity elements of and ; — the inverse of in . Reading: identity and inverse structure survive the map automatically, so the image is again a genuine group. The preimage of the identity is the kernel, and it is never just any subgroup — it is always a normal one, closed under conjugation by every element of . This is the fact that ties homomorphisms to the previous article's normal subgroups.
where: — the kernel, the set sent to ; — "is a normal subgroup of." Reading: the kernel measures exactly what the map forgets, and its normality (Derivation A) makes the quotient below possible. Dually, the set of values actually attained is the image, a subgroup of the target — generally a proper one, since need not be onto.
where: — the image of ; — "is a subgroup of." Reading: what survives the compression is itself a group, so we may legitimately compare it to . Given a normal subgroup , cosets multiply representative-by-representative, and the answer does not depend on which representatives you pick. This product turns the set of cosets into a group — the quotient group.
where: — a normal subgroup; — left cosets, the elements of the quotient ; — the product of representatives in . Reading: multiply the labels and read off the coset of the product — well-defined precisely because is normal (Derivation A). Every normal subgroup is realized as a kernel by the map that sends each element to its own coset. This canonical projection is the universal homomorphism out of that kills exactly .
where: — the canonical (quotient) projection; — the coset of , an element of . Reading: because for every normal , kernels and normal subgroups are the same class of objects. The First Isomorphism Theorem is the payoff. Quotienting the source by what the map forgets reproduces, on the nose, what the map sees.
where: — a group isomorphism (a bijective homomorphism). Reading: the abstract quotient and the concrete subgroup are the same group; this is how quotients are identified in practice (Derivation B). For finite groups, taking sizes in (7) and combining with Lagrange's theorem gives a rigid counting law relating the orders of the three players.
where: — the order (number of elements) of a finite group. Reading: the image order and the kernel order multiply to , so both must divide — a fast consistency check on any proposed homomorphism (Derivation B, final step). Two companions round out the toolkit: the Second Isomorphism Theorem, , and the Third, for , which says a quotient of a quotient is again a single quotient — the fact that keeps iterated symmetry breaking and composition series well-behaved.
The goal is to prove the two structural facts that make quotient groups exist at all: first, that ker φ is a subgroup and is conjugation-invariant, so it is normal; and second, that the coset multiplication (aN)(bN)=(ab)N gives the same answer regardless of which representatives are chosen — and that this holds exactly when N is normal, not merely a subgroup. Together these show that "kernel of a homomorphism" and "normal subgroup" are one and the same class of objects, and that normality is the precise price of admission to a well-defined quotient.
Step 1. Take . Then , so ; by the one-step subgroup criterion the kernel is a subgroup. Why: closure under "multiply-by-inverse" is all a nonempty subset needs to be a subgroup, and it follows straight from (1) and (2).
Step 2. Take any and . Then , so ; hence for every , the definition of a normal subgroup. Why: conjugation cannot move an element out of the kernel because conjugates the identity to itself — normality is automatic, never an extra hypothesis.
Step 3. Now let and suppose and , so and with . Compute , inserting between the two factors. Why: to test whether the product of cosets depends on the representatives, we must express the "primed" product in terms of the original ab times something we hope lands in N.
Step 4. Normality says , so and hence . Thus : the coset product is independent of representatives. Why: the lone place normality is used is to slide past and keep it inside N — for a non-normal subgroup escapes N and the product (5) is genuinely ill-defined, the whole reason only normal subgroups can be quotiented.
Go deeper · Derivation B · 1 minThe First Isomorphism Theorem
The goal is to construct an explicit isomorphism from the quotient by the kernel onto the image, proving G/ker φ ≅ im φ. Given φ:G→H we define a candidate map on cosets, then verify the four things an isomorphism demands: well-defined (independent of representative), a homomorphism, injective, and surjective onto the image. The construction also yields the finite counting law |G| = |ker φ|·|im φ| as a corollary through Lagrange's theorem.
Step 1. Write and define by . If then with , so . Why: the value must depend only on the coset, not on the label we picked for it; the kernel absorbs the ambiguity because everything in it maps to .
Step 2. For cosets , , so is a homomorphism. Why: the quotient multiplication (5) was defined precisely so that projecting and then multiplying agrees with multiplying and then projecting — simply inherits (1).
Step 3. Suppose . Then , so , hence , the identity coset. The only coset in the kernel of is the trivial one, so is injective. Why: injectivity of a homomorphism is equivalent to a trivial kernel, and G/K is arranged so that everything φ forgot has already been divided out.
Step 4. Every element of is , so is onto its codomain. Being a bijective homomorphism, it is an isomorphism: . Taking orders for finite , , and Lagrange gives . Why: surjectivity is true by construction, and the order relation (8) drops out for free — the index of the kernel is the size of the image.
Go deeper · Derivation C · 2 minThe spin double cover SU(2) to SO(3)
The goal is to build, by hand, a surjective homomorphism Φ:SU(2)→SO(3) whose kernel is exactly {+I, −I}, then feed it to the First Isomorphism Theorem to conclude SU(2)/{±I} ≅ SO(3). The construction identifies a real three-vector with a traceless Hermitian 2×2 matrix and lets SU(2) act by conjugation; because conjugation preserves the determinant, which is minus the squared length of the vector, the action is a rotation. This one homomorphism is the algebraic reason spin-½ states have 4π periodicity and a 2π rotation multiplies a spinor by −1.
Step 1. Map a vector to with the Pauli matrices . This is traceless and Hermitian, and . Why: encoding the vector as a matrix turns its length into the algebraic invariant , which the group action will preserve.
Step 2. For define the action . The result is again traceless (trace is cyclic) and Hermitian, and since . So the action sends vectors to vectors of the same length, defining a rotation ; continuity from (where ) forces , so . Why: preserving is exactly the statement that is orthogonal, and connectedness pins down the proper (determinant ) branch.
Step 3. The map is a homomorphism: , so . Why: conjugation by a product is the composition of conjugations, so the matrix action respects multiplication and is a genuine homomorphism, not just a map of sets.
Step 4. means for every traceless Hermitian , so commutes with every matrix; by Schur's argument , and forces , so and . Why: only the two scalar matrices act trivially, which makes the map two-to-one — every rotation has exactly two SU(2) preimages differing by a sign.
Step 5. is surjective (every rotation is for some ), so the First Isomorphism Theorem gives . Since a rotation corresponds to , a spinor transforms as , returning to only after . Why: the nontrivial kernel element projects to the identity rotation yet acts as on spinors — the observable 4π periodicity of spin-½.
Limiting cases
The extremes and special cases sharpen what the kernel, image, and quotient actually measure. Each row is a homomorphism whose kernel or image is pushed to a boundary.
| Case | Result | Meaning |
|---|---|---|
| Injective (faithful) | No information lost; is one-to-one and . A faithful representation stores the entire group. | |
| Surjective (onto) | Then , so is realized concretely as a quotient of by a normal subgroup. | |
| Trivial homomorphism | Kernel is all of , image is a point; . The maximally lossy map — the trivial representation. | |
| Isomorphism | Both injective and surjective: , a perfect dictionary translating one group into the other. | |
| Abelian target | Any map to an abelian kills all commutators, so it factors through the abelianization — the largest abelian quotient. |
Worked examples
1 · The sign homomorphism on S₃ (confidence builder)
Let send each permutation to if it is even and if it is odd. Identify the kernel and image, form the quotient, and verify the counting law explicitly.
Step 1. List the six elements of with their parities: the identity (even), the three transpositions (odd), and the two 3-cycles (even). So sends and ; it is a homomorphism because parity adds under composition.
Step 2. The kernel is the set mapped to , namely , the alternating group, of order 3. The image is , of order 2. As guaranteed, — it has index 2, and every index-2 subgroup is normal.
Step 3. The quotient has two cosets: itself (the even permutations) and its complement (the odd permutations). Multiplying cosets follows even·even = even, even·odd = odd, odd·odd = even — exactly the table. So , matching the First Isomorphism Theorem .
Step 4. Check the counting law (8): . Kernel A₃ of order 3, image ℤ₂ of order 2, and S₃/A₃ ≅ ℤ₂ with 6 = 3 × 2. Physically this is the exchange-statistics dichotomy in miniature: the sign character's two values and are the bosonic and fermionic behaviours under particle exchange.
2 · Reduction modulo n: Z/nZ ≅ Zₙ
Let send an integer to its remainder , where under addition mod . Find the kernel and apply the First Isomorphism Theorem.
Step 1. is a homomorphism of additive groups: , and it is surjective since every residue is hit.
Step 2. The kernel is the set of integers with remainder 0, the multiples of : — automatically normal since is abelian.
Step 3. The First Isomorphism Theorem gives : it proves that the abstract quotient of the infinite group by the subgroup is the finite cyclic group . Setting recovers clock arithmetic — the hours form , and " o'clock" is the coset identity . The infinite source collapses onto the n-element image, and the kernel nℤ is exactly what is divided out.
3 · Constraining a homomorphism by orders
A homomorphism has and . What is , and which image orders are even possible for a group of order 12?
Step 1. By the counting law (8), . So the kernel is a normal subgroup of order 3 — necessarily cyclic, — and is a group of order 4.
Step 2. Since with the kernel a subgroup, the image order must divide 12 — it can only be . An image of order 5 or 7 is impossible for any homomorphism out of a group of order 12, a one-line sanity check. The endpoints are the familiar extremes: order 12 means a trivial kernel (faithful, ), order 1 means the whole group is the kernel (trivial map), and our case sits strictly between. |ker φ| = 3, and the image order must be one of 1, 2, 3, 4, 6, 12.
Physics of the portrait
The homomorphism theorems reached their clean modern form with Emmy Noether, who insisted that the right objects of study are not a group's elements but the maps between groups.
Origins · 1 minEmmy Noether and how this was discovered
Emmy Noether is remembered by physicists chiefly for Noether's theorem — every continuous symmetry yields a conservation law — but her deeper legacy is the abstract, map-centered style of algebra that makes this article possible. Working at Göttingen in the 1920s, often without salary or an official position because she was a woman, she reorganized group and ring theory around homomorphisms and their kernels rather than explicit elements and generators. The isomorphism theorems, in the crisp form G/ker φ ≅ im φ and its companions, are essentially her formulation; van der Waerden's influential 1930–31 textbook Moderne Algebra, which taught the subject to a generation, was built from her lectures. The seeds are older — Évariste Galois had introduced normal subgroups around 1831, and Jordan and Hölder had proved the composition-series theorem using the quotient construction — but it was Noether who made "pass to the quotient by the kernel" a reflex rather than a trick, and who saw that the same three-line theorem governs abelian groups, matrix groups, rings, and modules alike. The physics payoff is everywhere her algebra is: a representation is a homomorphism, a superselection rule is a kernel, a broken symmetry leaves a quotient group, and the spinor sign that puzzled the founders of quantum mechanics is the nontrivial element of a kernel {±I}. Einstein, writing after her death, called her the most significant creative mathematical genius produced since the higher education of women began.
Going further
Texts. Stone & Goldbart, Mathematics for Physics, group-theory chapter · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed., group-theory chapter · Hassani, Mathematical Physics, 2nd ed., group theory · Riley, Hobson & Bence, Mathematical Methods for Physics and Engineering, 3rd ed., Ch. 28 · Tinkham, Group Theory and Quantum Mechanics, Ch. 3 · Hamermesh, Group Theory and Its Application to Physical Problems. Key results throughout: from the homomorphism property (1); the kernel is closed under and conjugation, and the coset product is well-defined iff (Derivation A); the four-part construction establishes with corollary (Derivation B); and (Derivation C). Worked numbers: has , image order 2, and ; ; and .
Prerequisites. Groups, Subgroups, and Cosets · Conjugacy Classes and Normal Subgroups. Leads to. Group Representations · Schur's Lemmas · SU(2) and the Spin Double Cover · Lie Groups.
Ask the tutor: Ask me to walk through why a non-normal subgroup like {e, (12)} in S₃ fails to form a quotient, or to trace the spinor sign flip through the SU(2)→SO(3) kernel step by step.
What exactly is the difference between a homomorphism and an isomorphism?
A homomorphism is any map φ:G→H that preserves multiplication, φ(g₁g₂)=φ(g₁)φ(g₂); it may lose information by sending several elements to one, and it need not reach all of H. An isomorphism is the special case that loses nothing and misses nothing — both injective (trivial kernel) and surjective (image all of H), so it is a bijection whose inverse is also a homomorphism. In kernel–image language, φ is an isomorphism exactly when ker φ = {e} and im φ = H. An isomorphism means G and H are "the same group with different labels"; a general homomorphism only means H contains a compressed copy of G, the quotient G/ker φ.
Why must the subgroup be normal to form a quotient — what actually breaks otherwise?
The elements of the quotient are the cosets, and you multiply them through representatives: (aN)(bN)=(ab)N. For this to define anything, the answer must not depend on which representatives you chose. Replacing a by an₁ and b by bn₂ (same cosets), the product becomes ab·(b⁻¹n₁b)·n₂, and you need the middle factor b⁻¹n₁b to stay inside N — precisely the normality condition b⁻¹Nb=N. Without it, two people writing the same two cosets could multiply them and get different "products," so the operation is not a function and there is no group. Cosets of a non-normal subgroup still partition G, but only as a set, never as a group.
How can two different groups have the same kernel structure yet not be isomorphic?
Because the isomorphism type of G is fixed by both the kernel and the image together, glued by an extension. Knowing that a normal subgroup of order 3 sits inside G with quotient of order 4 tells you |G|=12, but not which group of order 12 you have — the cyclic , the dihedral , and the alternating can share such data yet differ. The First Isomorphism Theorem reconstructs the image from G and the kernel, not G from the kernel and image; rebuilding G needs extra "extension data" describing how the quotient acts on the kernel. So the kernel–image pair constrains G tightly but does not always determine it.
Is the image of a homomorphism ever a normal subgroup of the target?
Not in general. The kernel is always normal in the source, but the image is only guaranteed to be a subgroup of the target, and it can be a decidedly non-normal one — embedding into gives a non-normal image. The image is normal in two common situations: when φ is surjective (the image is all of H), and when the target is abelian (every subgroup is normal). Keeping the asymmetry straight — kernel normal in G, image merely a subgroup of H — prevents a great many false steps.
What does it mean physically when a representation has a nontrivial kernel?
It means the representation cannot tell certain group elements from the identity — they act as the identity operator on every state. The representation is then not faithful, and by the First Isomorphism Theorem it is really a faithful representation of the smaller quotient G/ker ρ. A physical example: the integer-spin (tensor) representations of SU(2) all contain −I in their kernel, so they are genuine representations of the quotient SU(2)/{±I}=SO(3), while half-integer-spin (spinor) representations have −I acting as −1 and so are faithful for SU(2) and only projective for SO(3). The kernel is thus the precise bookkeeping of which symmetries a given field can actually feel.
Why do physicists care about SU(2)/{±I} ≅ SO(3) rather than just using SO(3)?
Because nature uses the covering group, not the rotation group, whenever spin is half-integer. SO(3) is the group of physical rotations, but its representations exclude the spin-½ states electrons demonstrably occupy — those require the double cover SU(2), where a 2π rotation is the distinct element −I rather than the identity. The quotient statement SU(2)/{±I}≅SO(3) says SU(2) carries exactly one extra bit beyond ordinary rotations, the sign −I, and that bit is measured directly in neutron interferometry, where a spin-½ beam rotated by 2π returns 180° out of phase with an unrotated reference. Working in SU(2) and tracking the kernel {±I} is the only way to describe both bosons and fermions with one symmetry group.