KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesHomomorphisms, Kernels and the First Isomorphism TheoremEngineering · Engineering MathematicsLesson 110/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIHomomorphisms, Kernels and the First Isomorphism Theorem

KEVOS knowledge first · trusted web sources when needed

Core Structure Theory

Homomorphisms, Kernels and the First Isomorphism Theorem

Homomorphisms as structure-preserving maps, kernels as congruences, and the first isomorphism theorem in the generality where it belongs.

Category Engineering / MathematicsSource II.6Pages 47-51Reading 2 minReviewed 2026-08-07

Learning objectives

  • Define homomorphism and verify examples
  • Prove that kernels are congruences and every congruence is a kernel
  • State and apply the first isomorphism theorem
On this page
  1. Homomorphisms
  2. Kernels
  3. The first isomorphism theorem
  4. The familiar instances

Homomorphisms

Definition — Homomorphism

A map α: A → B between algebras of the same type is a homomorphism if for every n-ary operation symbol f and all a1,…,an in A: α(fA(a1,…,an)) = fB(α(a1),…,α(an)).

For nullary operations the condition reads α(cA) = cB: constants map to constants.

Term operations are preserved automatically

By induction on term structure, a homomorphism preserves every term operation, not merely the basic ones. Consequently a homomorphism preserves the truth of every identity: if A satisfies p ≈ q then its homomorphic images do too.

Kernels

Kernels are congruences

For a homomorphism α: A → B, the relation ker(α) = {⟨a, b⟩ : α(a) = α(b)} is a congruence on A.

It is clearly an equivalence relation. For the substitution property, suppose α(ai) = α(bi) for each i. Then α(f(a)) = f(α(a)) = f(α(b)) = α(f(b)).

Every congruence is a kernel

For any congruence θ, the natural map νθ has kernel θ. So congruences and kernels of homomorphisms are the same thing.

Homomorphism αhas kernel ker(α), a congruence
Congruence θis the kernel of νθ
ConclusionCon(A) classifies all homomorphic images of A up to isomorphism

The first isomorphism theorem

First isomorphism theorem

Let α: A → B be a homomorphism. Then A/ker(α) is isomorphic to the image α(A), which is a subalgebra of B. The isomorphism sends a/ker(α) to α(a).

If α is surjective the conclusion reads A/ker(α) ≅ B. Every homomorphism thus factors as a surjection onto a quotient followed by an embedding.

The canonical factorisation

α = ι ∘ β ∘ νker(α), where ν is the natural surjection onto A/ker(α), β is an isomorphism onto the image, and ι is the inclusion of the image into B.

The familiar instances

First isomorphism theorem specialised
SettingStatement
GroupsG/ker(α) ≅ im(α), with ker(α) the normal subgroup mapping to the identity
RingsR/I ≅ im(α), with I the ideal mapping to zero
ModulesM/N ≅ im(α)
Vector spacesV/ker ≅ im — the rank–nullity theorem
LatticesL/θ ≅ im(α)
One theorem, many corollaries

Each row is normally proved separately in a first course. In universal algebra they are a single theorem instantiated at different types. This is the clearest single demonstration of what the generalisation buys.

Frequently asked questions

Is a bijective homomorphism always an isomorphism?

For algebras, yes — the inverse of a bijective homomorphism is automatically a homomorphism. This differs from topology, where a continuous bijection need not have continuous inverse, and from categories generally.

Why is the image a subalgebra?

Because the image is closed under the operations: applying an operation to images gives the image of the operation applied to preimages, by the homomorphism property.

Related pages

  • The Congruence Extension Property
  • The Second and Third Isomorphism Theorems
  • Lattice Homomorphisms and Order Preservation

Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section II.6, book pages 47-51.

This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Homomorphisms, Kernels and the First Isomorphism Theorem. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Homomorphisms, Kernels and the First Isomorphism Theorem as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—homomorphisms, kernels, isomorphism, theorem, structure-preserving—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Homomorphisms, Kernels and the First Isomorphism Theorem?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about homomorphisms would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
  • The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.

Continue learning

Manufacturing Data AnalysisGuide · Engineering MathematicsNEXT LESSON →The Center of an AlgebraGuide · Engineering MathematicsThe First Two Finite Basis TheoremsGuide · Engineering MathematicsThe Congruence Extension PropertyGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®