A single ternary term decides whether congruences permute across an entire variety. Mal'cev's theorem converts an infinitary lattice condition into a finite syntactic check.
Engineering · Mathematics11 min readKV-MATH-0224
Learning objectives
State the Mal'cev term condition for congruence permutability.
Prove that a Mal'cev term implies permutability.
Exhibit Mal'cev terms for groups, rings, modules and quasigroups.
Show lattices have no Mal'cev term.
Explain what makes a condition a Mal'cev condition.
Relate permutability to modularity and to direct decomposition.
01The problem Mal'cev conditions solve
Congruence permutability is a condition on every pair of congruences on every member of a variety — a statement quantifying over a proper class. Checking it directly is impossible. Mal'cev's insight is that it is equivalent to the existence of a single term satisfying two identities.
Key resultMal'cev's theorem
A variety V is congruence-permutable if and only if there is a ternary term p in the language of V such that V satisfies p(x, y, y) ≈ x and p(x, x, y) ≈ y.
The right-hand condition is finite, syntactic and checkable. Since a variety is generated by any of its generating algebras, one can even search for the term in a single finite algebra.
02From the term to permutability
ProcedureA Mal'cev term forces congruences to permute
in: Mal'cev term p → out: θ ∘ φ = φ ∘ θ for all congruences
input: variety V with term p satisfying p(x,y,y) ≈ x and p(x,x,y) ≈ y
take A ∈ V, congruences θ, φ ∈ Con A, and ⟨a, c⟩ ∈ θ ∘ φ
so there is b with ⟨a,b⟩ ∈ θ and ⟨b,c⟩ ∈ φ
consider the element d := p(a, b, c)
⟨a, d⟩ = ⟨p(a,b,b), p(a,b,c)⟩ ∈ φ since ⟨b,c⟩ ∈ φ and p is compatible
(using p(a,b,b) ≈ a)
⟨d, c⟩ = ⟨p(a,b,c), p(c,c,c)⟩... more directly:
⟨d, c⟩ = ⟨p(a,b,c), p(b,b,c)⟩ ∈ θ since ⟨a,b⟩ ∈ θ
(using p(b,b,c) ≈ c)
so ⟨a, c⟩ ∈ φ ∘ θ; by symmetry θ ∘ φ = φ ∘ θ
The element p(a, b, c) is the 'detour' witnessing the reversed composite. For groups p(a,b,c) = a·b⁻¹·c and the construction is the familiar coset argument. Caveat: the converse direction — permutability implies a term — uses the free algebra on three generators and is the harder half.
The converse is proved by working in F_V(x, y, z): permutability of two specific congruences on the free algebra produces exactly the required element, which is a term in three variables. This pattern — deduce the term from the free algebra — is how every Mal'cev-type characterisation is proved.
03Mal'cev terms in practice
Terms for standard varieties
Variety
Mal'cev term
Check
Groups
p(x,y,z) = x·y⁻¹·z
p(x,y,y)=x·y⁻¹·y=x; p(x,x,y)=x·x⁻¹·y=y
Rings
p(x,y,z) = x − y + z
immediate
Modules
p(x,y,z) = x − y + z
same as the additive group
Quasigroups
p built from left and right division
uses both division operations
Heyting algebras
none
congruence-distributive but not permutable
Lattices
none
see below
Semigroups
none in general
some subvarieties do have one
The group case explains why quotient arguments in group theory feel effortless: permutability makes θ ∨ φ = θ ∘ φ, so joins of congruences are single compositions and the second isomorphism theorem takes its familiar concrete form.
04Why lattices have no Mal'cev term
Suppose p were a Mal'cev term for lattices. Evaluate in the two-element lattice, where every term operation is monotone in each argument. Set the arguments to make p(x, y, y) ≈ x and p(x, x, y) ≈ y both hold and derive a contradiction from monotonicity.
CautionMonotonicity obstructs permutability
Every lattice term operation is monotone in each variable. A Mal'cev term must decrease in its middle argument in one identity and depend on it critically in the other, which monotone functions on the two-element lattice cannot do. So no Mal'cev term exists, and lattice congruence joins genuinely require unbounded alternating composites.
Lattices are nonetheless congruence-distributive, which is a different and in some ways stronger structural property. The two conditions are independent: neither implies the other, and their conjunction is arithmeticity.
05What makes a condition a Mal'cev condition
A Mal'cev condition is a property of varieties expressible as: there exist terms satisfying a prescribed finite set of identities. A weak Mal'cev condition allows a countable disjunction of such statements.
Strong Mal'cev condition
One finite term system
Permutability is of this kind: a single ternary term and two identities. Checking reduces to a finite search.
Weak Mal'cev condition
A chain of conditions
Congruence-distributivity is of this kind: for some n, there exist Jónsson terms d₀,…,dₙ. The n is not bounded in advance.
Mal'cev conditions are preserved by H, S and P and are inherited by subvarieties, so they are genuine properties of varieties rather than of individual algebras. That is what makes them the right classification tool.
06Consequences of permutability
Modularity is free
Congruence-permutable implies congruence-modular. So groups, rings and modules all have modular congruence lattices without further argument.
Direct decomposition simplifies
Factor congruences are exactly complementary pairs, since permutability is automatic. The factor congruences form a Boolean sublattice of Con A.
The commutator becomes available
Smith's commutator was defined first for congruence-permutable varieties, giving solvability, nilpotence and the centre by analogy with group theory.
Arithmeticity is within reach
Adding congruence-distributivity gives an arithmetical variety, which is the setting for the discriminator theory in the Boolean Constructions stream.
Frequently asked
Can a variety have more than one Mal'cev term?
Yes, and typically does. Any term provably equal to a Mal'cev term is another. The existence of the term is what matters, not its identity — the characterisation is about solvability of the identity system, not uniqueness of the solution.
Is congruence-permutability decidable for a finite algebra?
Yes. Since the condition is a strong Mal'cev condition, one searches for a ternary term operation on the finite algebra satisfying the two identities. The search space is finite, so the question is decidable, though the search can be expensive. UACalc implements exactly this.
Does permutability of a single algebra imply it for the variety it generates?
Not directly — but if the algebra's variety has a Mal'cev term then all members are permutable, and Mal'cev's theorem says a permutable variety has such a term. So for the generated variety, checking the generator suffices in the sense that the term found there works everywhere. An individual algebra can have permuting congruences without generating a permutable variety.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
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 Mal'cev Conditions I: Congruence Permutability. 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 Mal'cev Conditions I: Congruence Permutability as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—mal'cev, permutability, term, conditions, congruence—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
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
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.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope 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 Mal'cev Conditions I: Congruence Permutability?
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 mal'cev 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.
