Class Operators H, S, P and the Definition of a Variety
Six operators, one composite. HSP is a closure operator, and the class it produces is the variety generated — which by Birkhoff's theorem is exactly the equational class.
Engineering · Mathematics10 min readKV-MATH-0218
Learning objectives
Define each class operator and compute simple composites.
State the standard inclusions such as SH ≤ HS and PH ≤ HP.
Show HSP is idempotent and hence a closure operator.
Identify varieties as the classes closed under H, S and P.
Anticipate the HSP theorem's identification of varieties with equational classes.
01The operators
Class operators on classes of algebras of a fixed type
Operator
Meaning
I(K)
all isomorphic copies of members of K
S(K)
all subalgebras of members of K
H(K)
all homomorphic images of members of K
P(K)
all direct products of families of members of K
PS(K)
all subdirect products of families of members of K
PU(K)
all ultraproducts of families of members of K
Each operator is extensive and monotone. I is idempotent trivially; so are S, H and P individually. The interest lies entirely in how they compose, because a class closed under all three is a variety and the composite that produces such closure is not obvious a priori.
02Composition relations
The operators do not commute, but they satisfy inclusions that let any composite be reduced to the canonical form HSP.
SH ≤ HS PH ≤ HP PS ≤ SP PS ≤ SP
Read: a subalgebra of a homomorphic image is a homomorphic image of a subalgebra, and so on. Each inclusion is proved by an explicit construction.
Key resultHSP absorbs everything
Using the inclusions repeatedly, any composite of I, S, H and P is contained in HSP. In particular HSP is idempotent: HSP(HSP(K)) = HSP(K). An extensive, monotone, idempotent operator is a closure operator, so HSP is the closure operator whose closed classes are the varieties.
03Proving SH ≤ HS
ProcedureA subalgebra of a homomorphic image is a homomorphic image of a subalgebra
in: C ∈ SH(K) → out: C ∈ HS(K)
input: surjective homomorphism α : A → B, subalgebra C ≤ B
form the preimage D := α⁻¹(C) ⊆ A
D is a subuniverse: operations applied within D land in α⁻¹ of C, which is D
restrict α to D, giving α|D : D → C
α|D is surjective because α is surjective onto B and C ⊆ B
therefore C ∈ H(S({A})) whenever C ∈ S(H({A}))
The preimage construction is the whole proof. Caveat: the reverse inclusion HS ≤ SH is false — a homomorphic image of a subalgebra need not embed in a homomorphic image of the whole, so the order in HSP is not arbitrary.
The asymmetry is worth internalising. HSP works; SPH does not, and there is no rearrangement that makes it work. The canonical order is forced by the direction of the inclusions.
04Varieties
A variety is a class of algebras of a fixed type closed under H, S and P. Equivalently, a class K with HSP(K) = K.
Closure
Under three operators
H, S and P. Closure under I is implied by closure under S, since isomorphic copies are subalgebras up to identification.
Generation
V(K) = HSP(K)
The variety generated by a class is the smallest variety containing it, and equals HSP(K) by idempotency.
Trivial members
Always present
Any variety contains the one-element algebra, since it is a homomorphic image of any member, and the empty product is the one-element algebra.
Varieties are proper classes, as noted in the preliminaries. They are also closed under the formation of free algebras, which is what makes the equational theory available and is developed in the next stream.
05Towards the HSP theorem
One direction is easy
An equationally defined class is closed under H, S and P, because satisfaction of an identity is preserved by all three constructions. This is a direct verification.
The converse is the theorem
If K is closed under H, S and P then K is defined by the set of equations holding in K. The proof uses free algebras: a free algebra for the equational theory of K must itself lie in K.
The bridge is the free algebra
Constructing F_K(X) as a quotient of the term algebra by the congruence of K-identities, and showing it lies in K, is the crux.
Consequence
Varieties and equational classes coincide exactly. Syntax and closure are the same notion viewed from two sides — a Galois connection, as set up in the closure operator page.
NoteWhere this goes next
The Terms, Free Algebras and Equational Logic stream constructs term algebras and free algebras and completes this proof. The present page establishes only that HSP is the right closure operator; that its closed classes are the equational ones is the theorem to come.
Frequently asked
Is P(K) closed under taking the empty product?
By convention yes, and the empty product is the one-element algebra. This is why every variety contains a trivial algebra, and it is occasionally a nuisance in statements that would prefer to exclude it. Some texts define P to exclude the empty index set; check before comparing results.
Why is the canonical order HSP rather than PSH?
Because the inclusions run SH ≤ HS and PH ≤ HP and PS ≤ SP, all pushing H leftwards and P rightwards. Composing in the order HSP therefore absorbs any other composite. The reverse inclusions are false, so no other canonical order exists.
Is a quasivariety the same as a variety?
No. A quasivariety is defined by implications between conjunctions of equations rather than by equations alone, and is closed under S, P and ultraproducts but not necessarily under H. Fields form a quasivariety-like class that is not a variety. Deciding whether a given quasivariety happens to be a variety is itself a studied and non-trivial question.
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 Class Operators H, S, P and the Definition of a Variety. 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 Class Operators H, S, P and the Definition of a Variety as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—operators, class, variety, relations, closure—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 Class Operators H, S, P and the Definition of a Variety?
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 operators 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.
