KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Second and Third Isomorphism TheoremsEngineering · Engineering MathematicsLesson 113/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIThe Second and Third Isomorphism Theorems

KEVOS knowledge first · trusted web sources when needed

Core Structure Theory

The Second and Third Isomorphism Theorems

The remaining isomorphism theorems in their general algebraic form, and the hypotheses each requires — including the one that fails without congruence permutability.

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

Learning objectives

  • State the second and third isomorphism theorems for algebras
  • Identify where congruence permutability is needed
  • Apply the theorems to recover the familiar group-theoretic versions
On this page
  1. The third isomorphism theorem
  2. The second isomorphism theorem
  3. Where permutability enters
  4. Summary of hypotheses

The third isomorphism theorem

Third isomorphism theorem

Let θ ⊆ φ be congruences on A. Then φ/θ = {⟨a/θ, b/θ⟩ : ⟨a, b⟩ ∈ φ} is a congruence on A/θ, and

(A/θ) / (φ/θ) ≅ A/φ

This holds in complete generality — no permutability, no modularity, no extra hypothesis. It is the “quotient of a quotient” theorem, and for groups it reads (G/N)/(M/N) ≅ G/M for normal subgroups N ⊆ M.

The second isomorphism theorem

Second isomorphism theorem

Let B be a subalgebra of A and θ a congruence on A. Let Bθ denote the union of the θ-classes meeting B. Then, under suitable hypotheses, B/(θ↾B) ≅ Bθ/(θ↾Bθ).

This one needs hypotheses

In full generality Bθ need not be a subuniverse of A. The theorem requires either that it happen to be one, or a structural hypothesis guaranteeing it — congruence permutability suffices. This is the point at which the general theory departs from the group-theoretic template.

For groups the statement is the familiar BN/N ≅ B/(B ∩ N), and the product set BN is a subgroup precisely because normal subgroups permute with subgroups. Take away permutability and the analogous set need not be closed.

Where permutability enters

General algebrasBθ may fail to be a subuniverse
Congruence-permutableθ ∘ φ = φ ∘ θ forces closure
Groups, rings, modulesPermutable — the classical statements hold
Lattices, semigroupsNot permutable — the statement needs care
Diagnostic value

The fact that the second isomorphism theorem needs a hypothesis while the first and third do not is itself informative. It shows that the classical isomorphism theorems are not a uniform package: two are consequences of quotients alone, while the third depends on a genuine structural property that groups happen to possess.

Summary of hypotheses

What each theorem requires
TheoremStatementHypothesis
FirstA/ker(α) ≅ im(α)None
SecondB/(θ↾B) ≅ Bθ/(θ↾Bθ)Bθ a subuniverse; permutability suffices
Third(A/θ)/(φ/θ) ≅ A/φNone
CorrespondenceCongruences above θ ↔ congruences on A/θNone
The pattern

Theorems about quotients alone need no hypotheses. Theorems relating subalgebras to quotients need permutability or an equivalent. That division runs throughout the subject.

Frequently asked questions

Why is the third theorem hypothesis-free when the second is not?

Because the third involves only congruences on a single algebra and its quotients — no interaction between a subalgebra and a congruence. It is the interaction that requires permutability.

Is B^θ ever a subuniverse without permutability?

Often, in particular cases. The point is that it is not guaranteed, so it must be checked or secured by hypothesis rather than assumed.

Related pages

  • Homomorphisms, Kernels and the First Isomorphism Theorem
  • The Correspondence Theorem for Algebras

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 51-54.

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 The Second and Third Isomorphism Theorems. 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 The Second and Third Isomorphism Theorems as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—isomorphism, second, third, theorems, hypotheses—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 The Second and Third Isomorphism Theorems?

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 isomorphism 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

NEXT LESSON →Equational Logic and the Rules of DeductionGuide · Engineering MathematicsSkew-Free Algebras and IndependenceGuide · Engineering MathematicsBaker's Finite Basis TheoremGuide · Engineering MathematicsManufacturing Data AnalysisGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®