KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesVarieties and the Variety Generated by a ClassEngineering · Engineering MathematicsLesson 58/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIVarieties and the Variety Generated by a Class

KEVOS knowledge first · trusted web sources when needed

Varieties, Free Algebras and Equational Logic

Varieties and the Variety Generated by a Class

Varieties as classes closed under H, S and P, the variety generated by a class, and the lattice of subvarieties.

Category Engineering / MathematicsSource II.9Pages 66-67Reading 2 minReviewed 2026-08-07

Learning objectives

  • Define variety and verify closure in examples
  • Compute V(K) = HSP(K)
  • Describe the lattice of subvarieties of a given variety
On this page
  1. Definition
  2. Examples of varieties
  3. The lattice of subvarieties
  4. Why varieties and not something else

Definition

Definition — Variety

A class of algebras of a fixed type closed under homomorphic images, subalgebras and direct products. Equivalently, a class K with H(K) = S(K) = P(K) = K.

Definition — Variety generated by KV(K) = HSP(K), the smallest variety containing K.

The one-element algebra lies in every variety, as the empty product. So every variety is non-empty, and the smallest variety of a given type is the class of all trivial algebras.

Examples of varieties

Varieties and their generators
VarietyGenerated byNotes
Boolean algebras2One finite generator
Distributive latticesThe two-element chainOne finite generator
Abelian groupsThe class of cyclic groupsNot finitely generated
All groups—Not generated by any set of finite algebras
K-vector spacesK as a one-dimensional spaceOne generator
SemilatticesThe two-element semilatticeOne finite generator
Modular lattices—Not generated by finitely many finite lattices
Locally finite varieties

A variety generated by a finite algebra is locally finite: every finitely generated member is finite. This follows because the free algebra on n generators embeds in a power of the generating algebra and is therefore finite. Boolean algebras and distributive lattices are locally finite; groups are not.

The lattice of subvarieties

The subvarieties of a variety V, ordered by inclusion, form a complete lattice. Meets are intersections; joins are the varieties generated by unions.

Subvariety lattices of familiar varieties
VarietyLattice of subvarieties
Boolean algebrasTwo elements: trivial and all
Distributive latticesThree elements: trivial, one-element chains, all
LatticesContinuum many subvarieties
GroupsA proper class-sized problem; extremely complicated
Abelian groupsIsomorphic to the divisibility lattice of the natural numbers extended by ∞
Abelian groups as the clean case

The subvarieties of abelian groups are exactly the classes defined by nx ≈ 0 for each n, together with the whole variety. The lattice is therefore the divisor lattice of the naturals with a top element added — a rare instance of a completely determined subvariety lattice.

Why varieties and not something else

The choice of H, S and P as the defining closures is not arbitrary. Birkhoff's theorem shows they characterise exactly the equationally definable classes, which is the strongest possible justification.

Closed under H, S, PBy Birkhoff, defined by identities
Closed under S, P, P<sub>U</sub>Quasivariety — defined by quasi-identities
Closed under P<sub>U</sub>, IElementary class — first-order axiomatisable
HierarchyVarieties ⊂ quasivarieties ⊂ elementary classes

Each level up trades structural strength for generality. Varieties have free algebras and the full weight of the HSP machinery; quasivarieties retain free algebras but lose closure under quotients; elementary classes retain neither.

Frequently asked questions

Is the intersection of two varieties a variety?

Yes. Each closure condition is preserved by intersection, so arbitrary intersections of varieties are varieties — which is why the subvarieties form a complete lattice.

Can a variety be generated by a single infinite algebra?

Yes, and often only by one. The variety of all groups is generated by a single infinite group — for instance a free group of countable rank.

Related pages

  • Class Operators H, S, P and their Composition
  • Terms and the Term Algebra T(X)

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.9, book pages 66-67.

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 Varieties and the Variety Generated by a Class. 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 Varieties and the Variety Generated by a Class as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—varieties, variety, generated, class, lattice—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 Varieties and the Variety Generated by a Class?

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 — 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.

Continue learning

GeometryGuide · Engineering MathematicsModels, Methods & ArtifactsGuide · Engineering MathematicsNotation and ConventionsGuide · Engineering MathematicsDistributive Lattices and their CharacterisationGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®