← LibrarySemisimple and Directly Representable VarietiesEngineering · MathematicsLesson 116/497← PrevNext →
ArticlePublished 7 Aug 20263 min readBy Kevin Jogin

Boolean Constructions and Discriminator Varieties

Semisimple and Directly Representable Varieties

Varieties whose subdirectly irreducible members are all simple, and those whose finite members are all direct products from a fixed finite list.

Category Engineering / MathematicsSource IV.12-13Pages 207-216Reading 2 minReviewed 2026-08-07

Learning objectives

Semisimple varieties

Definition — Semisimple variety

A variety in which every subdirectly irreducible member is simple.

By Birkhoff's theorem, every member of a semisimple variety is a subdirect product of simple algebras — the strongest form of subdirect decomposition.

Semisimplicity across varieties
VarietySemisimple?Subdirect irreducibles
Boolean algebrasYesOnly 2, which is simple
Distributive latticesYesThe two-element chain
K-vector spacesYesThe one-dimensional space
Any discriminator varietyYesSimple by the discriminator argument
Abelian groupsNoThe Prüfer groups are irreducible, not simple
GroupsNoCp2 is irreducible, not simple
LatticesNoMany non-simple irreducibles
Why semisimplicity is valuable

Simple algebras admit no proper quotients, so a subdirect representation into simple factors cannot be refined further. The decomposition is terminal, and classifying the variety reduces to classifying its simple members.

Characterisation attempts

Semisimplicity is not a Mal'cev condition and has no term characterisation in general. What is known relates it to congruence conditions.

Directly representable varieties

Definition — Directly representable variety

A variety in which every finite member is isomorphic to a direct product of algebras from a fixed finite list of finite algebras.

This is a very strong finiteness condition. It says the finite members are completely classified by a finite amount of data plus multiplicity.

Direct representability
VarietyDirectly representable?The finite list
Boolean algebrasYes{2}
K-vector spaces, K finiteYesThe one-dimensional space
V(A) for primal AYes{A}
Abelian groupsNoInfinitely many indecomposable finite abelian groups
Distributive latticesNoFinite distributive lattices are not products of a bounded list
Why distributive lattices fail

Every finite Boolean algebra is a power of 2, but not every finite distributive lattice is — the three-element chain is directly indecomposable and not a product of two-element chains. Direct representability requires the indecomposables to be finite in number, and distributive lattices have infinitely many.

The relationship between the two

Directly representableFinite members are products from a finite list
⇒ The indecomposable finite members are finite in number
SemisimpleSubdirect irreducibles are simple
Neither implies the otherDistributive lattices are semisimple but not directly representable

Directly representable varieties are rare and strongly constrained. The source treats them in §13 as the final and most restrictive class in the chapter's hierarchy of well-behaved varieties.

The chapter's arc

Chapter IV moves through progressively narrower and better-understood classes: all Boolean algebras, then algebras with Boolean product representations, then discriminator varieties, then quasiprimal and primal cases, and finally the semisimple and directly representable conditions. Each step trades generality for structural completeness.

Frequently asked questions

Does semisimple imply congruence-distributive?

No. Vector spaces over a fixed field are semisimple but congruence-modular rather than congruence-distributive. The two conditions are independent.

Is direct representability decidable for a given finitely generated variety?

The general question is difficult. For congruence-distributive varieties generated by finite algebras, Jónsson's lemma bounds the candidates and makes the question more tractable, but no general decision procedure is claimed in the source.

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 IV.12-13, book pages 207-216.

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.

Continue learning

Engineering EconomicsArticle · MathematicsThe Correspondence Theorem for AlgebrasArticle · MathematicsFully Invariant Congruences and CompletenessArticle · MathematicsNEXT LESSON →Semantic Embeddings and UndecidabilityArticle · Mathematics