A directly representable variety is built from finitely many finite algebras by direct products alone. McKenzie proved they are congruence-permutable, and their indecomposables are modular Abelian or functionally complete.
Engineering · Mathematics10 min readKV-MATH-0246
Learning objectives
Define direct representability.
State McKenzie's congruence-permutability theorem.
Describe the directly indecomposable members.
Relate the class to modular Abelian and discriminator varieties.
Explain the role in the decidability classification.
Identify the open problems the source records.
01The definition
A variety V is directly representable when there is a finite set of finite algebras such that every finite member of V is isomorphic to a direct product of members of that set.
V directly representable ⟺ ∃ finite K of finite algebras with every finite A ∈ V isomorphic to a direct product from K
Direct products only — no subalgebras, no quotients, no subdirect products. This is a much stronger demand than being generated by a finite set.
Key resultWhy the condition is strong
Most varieties generated by a finite algebra are not directly representable. Being closed under H and S means members typically arise that are not direct products of the generators at all. Direct representability asks that the direct product operation alone suffice for the finite members, which is a severe restriction.
02McKenzie's theorem
The main structural result is that direct representability forces congruence-permutability.
Key resultMcKenzie's theorem
Every directly representable variety is congruence-permutable. Moreover, in a directly representable variety every directly indecomposable algebra is either modular Abelian or functionally complete.
Permutability is derived, not assumed
The hypothesis is combinatorial — finite members factor as direct products — and the conclusion is a Mal'cev condition. That a counting-flavoured hypothesis yields a term condition is the striking part.
Hence modularity
Congruence-permutable implies congruence-modular, so the commutator theory and the centre are available for directly representable varieties.
The dichotomy on indecomposables
Each directly indecomposable member is modular Abelian — polynomially a module — or functionally complete, with every operation a polynomial operation. Two extremes and nothing between.
Structural reading
The variety is assembled from module-like pieces and discriminator-like pieces. This is the local form of the global decomposition below.
03The two kinds of indecomposable
Modular Abelian
Z(A) = ∇
Polynomially equivalent to a module over a ring. All the structure is linear; the centre is everything and the commutator is trivial.
Functionally complete
Z(A) = Δ, simple
Every operation is a polynomial operation. No linear structure at all; the centre is trivial. Discriminator-like behaviour.
The dichotomy is between maximal and minimal centre, with nothing intermediate permitted. That is characteristic of the commutator theory: the centre tends to be all or nothing in well-behaved settings, and the interesting varieties are those where both kinds coexist.
04The global decomposition
The local dichotomy has a global counterpart, and it is the organising result of the classification programme the source describes.
V = V₁ ∨ V₂ with V₁ a discriminator variety and V₂ modular Abelian written V = (discriminator) ⊗ (modular Abelian)
V is congruence-modular and is the join of the two subvarieties. Every algebra in V decomposes uniquely, up to isomorphism, as a product of one algebra from each.
Where the decomposition appears
Result
Statement
Burris and McKenzie, 1981
A decidable locally finite congruence-modular variety must be of this form.
Same
There is an algorithm deciding, for finite K of finite algebras of finite type, whether V(K) is of this form.
Same
If so, one can construct a finite ring R with 1 such that V(K) is decidable iff the variety of unitary left R-modules is.
Boolean representability
If V = IΓᵃ(K) for finitely many finite algebras, then V is of this form.
So the decomposition is simultaneously the answer to a decidability question and to a representability question. That coincidence is what made this class the focus of the research the source reports on.
05Why direct representability was studied
Structure theory
Complete description available
A directly representable variety is understood: finitely many finite building blocks, combined by direct products, with a classification of the blocks.
Decidability
Tracks the classification
The decidability results for locally finite congruence-modular varieties are stated in terms of the same decomposition.
Boolean constructions
The limit of the method
Directly representable varieties mark how far Boolean-style representation can be pushed. Beyond them the method does not reach.
The source presents this as the endpoint of Chapter IV: having built Boolean powers, Boolean products, discriminator varieties and the primality hierarchy, directly representable varieties are where the accumulated machinery gives a complete answer.
06Open problems recorded in the source
The source's closing survey lists three problems bearing directly on this material.
Problem 11
Bounded indecomposables
For which varieties does there exist a bound on the size of the directly indecomposable members?
Problem 12
Boolean product representations
For which varieties is every algebra a Boolean product of directly indecomposable algebras? Of subdirectly irreducible algebras? Of simple algebras? Posed by Krauss and Clark.
Problem 13
Directly representable module varieties
For which finite rings R with 1 is the variety of unitary left R-modules directly representable?
NoteStatus as at the source
All three were open when the source was written in 1981. The Research Frontier stream reports on the seventeen problems as a set and marks which have since been settled — material that necessarily postdates the text and is flagged as such.
Frequently asked
Is every finitely generated variety directly representable?
No, and most are not. Direct representability requires the finite members to be direct products of a fixed finite list, which fails as soon as H and S produce finite algebras outside that closure. It is a much stronger condition than finite generation.
Does direct representability imply congruence-distributivity?
No — it implies permutability, hence modularity, but not distributivity. Module varieties are directly representable in favourable cases and are permutable without being distributive. The discriminator half of the decomposition is distributive; the modular Abelian half is not.
What does the ⊗ notation mean exactly?
It denotes that the variety is congruence-modular and is the join of a discriminator subvariety and a modular Abelian subvariety, with every member factoring uniquely as a product of one algebra from each. It is not a tensor product in any standard sense — the notation is the source's shorthand for this specific decomposition.
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 Directly Representable 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 Directly Representable Varieties as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—directly, representable, varieties, mckenzie's, theorem—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 Directly Representable 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 directly 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.
