KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesCongruence-Distributive and Congruence-Modular VarietiesEngineering · Engineering MathematicsLesson 106/887← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AICongruence-Distributive and Congruence-Modular Varieties

KEVOS knowledge first · trusted web sources when needed

Varieties, Free Algebras and Equational Logic

Congruence-Distributive and Congruence-Modular Varieties

Varieties in which every congruence lattice is distributive or modular, the term conditions characterising them, and the structure theory each unlocks.

Category Engineering / MathematicsSource II.12Pages 87-90Reading 3 minReviewed 2026-08-07

Learning objectives

  • Define congruence-distributive and congruence-modular varieties
  • State the Jónsson and Day term characterisations
  • Compare what each condition delivers structurally
On this page
  1. The two conditions
  2. Term characterisations
  3. What congruence-distributivity delivers
  4. What congruence-modularity delivers

The two conditions

Definition — Congruence-distributive variety

A variety in which Con A is a distributive lattice for every member A.

Definition — Congruence-modular variety

A variety in which Con A is modular for every member A.

Where standard varieties sit
VarietyPermutableDistributiveModular
GroupsYesNoYes
RingsYesNoYes
R-modulesYesNoYes
LatticesNoYesYes
Distributive latticesNoYesYes
Boolean algebrasYesYesYes
Heyting algebrasNoYesYes
SemigroupsNoNoNo
SemilatticesNoNoNo
Boolean algebras are arithmetical

A variety both congruence-permutable and congruence-distributive is called arithmetical. Boolean algebras and all discriminator varieties are arithmetical, and Pixley's theorem characterises the condition by a single ternary term.

Term characterisations

Jónsson's characterisation

A variety is congruence-distributive if and only if for some n there are ternary terms t0,…,tn satisfying t0(x,y,z) ≈ x, tn(x,y,z) ≈ z, ti(x,y,x) ≈ x for all i, and the alternating conditions ti(x,x,z) ≈ ti+1(x,x,z) for even i and ti(x,z,z) ≈ ti+1(x,z,z) for odd i.

Day's characterisation

A variety is congruence-modular if and only if there is a finite chain of quaternary Day terms satisfying an analogous system of identities.

The pattern

Both characterisations replace a lattice condition on all congruences of all members by the existence of finitely many terms. The number of terms needed is a genuine invariant — lattices need three Jónsson terms; some varieties need many more.

What congruence-distributivity delivers

Distributivity is by some margin the stronger and more useful of the two.

Jónsson's lemmaSubdirectly irreducibles of V(K) lie in HSPU(K)
Finitely generated caseOnly finitely many subdirect irreducibles, all finite
Baker's theoremA finitely generated congruence-distributive variety has a finite equational basis
Subvariety latticeFinite for a finitely generated congruence-distributive variety

None of these has an analogue for congruence-modular varieties in general. The gap between the two conditions is where much of the difficulty of modern universal algebra lies.

What congruence-modularity delivers

Modularity is weaker but covers groups, rings and modules — the varieties of most interest to mainstream algebra. What it buys is a commutator.

A commutator operation

In any congruence-modular variety there is a binary operation [θ, φ] on congruences generalising the group commutator, with the expected monotonicity and additivity properties.

Abelian, nilpotent, solvable

The commutator supports the full hierarchy, and an abelian algebra in a congruence-modular variety is polynomially equivalent to a module.

Krull–Schmidt

Uniqueness of direct decomposition into indecomposables holds for finite algebras in congruence-modular varieties.

Commutator theory is mostly post-1981

The source's Chapter II §13 develops the centre of an algebra and points toward this theory. The general commutator for congruence-modular varieties was developed largely afterwards, by Freese, McKenzie, Gumm and Hagemann–Herrmann, and it is one of the principal developments the source's closing chapter anticipates.

Frequently asked questions

Does congruence-distributive imply congruence-modular?

Yes, since every distributive lattice is modular. The converse fails — groups are modular but not distributive.

Can a variety be congruence-distributive without being permutable?

Yes. Lattices are congruence-distributive and not congruence-permutable. The two conditions are independent, and having both is arithmeticity.

Related pages

  • Mal'cev Conditions and Congruence Permutability
  • The Center of an Algebra
  • Jónsson's Lemma for Congruence-Distributive Varieties
  • Modular Lattices and the Modular Law

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.12, book pages 87-90.

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 Congruence-Distributive and Congruence-Modular Varieties. 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 Congruence-Distributive and Congruence-Modular Varieties as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—varieties, term, conditions, delivers, congruence-distributive—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 Congruence-Distributive and Congruence-Modular Varieties?

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 varieties 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 — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.

Continue learning

The Congruence Extension PropertyGuide · Engineering MathematicsNEXT LESSON →Arithmetical Varieties and Pixley TermsGuide · Engineering MathematicsSizes of Subdirectly Irreducible AlgebrasGuide · Engineering MathematicsMatricesGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®