KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesIdentities, Satisfaction and Equational ClassesEngineering · Engineering MathematicsLesson 90/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIIdentities, Satisfaction and Equational Classes

KEVOS knowledge first · trusted web sources when needed

Varieties, Free Algebras and Equational Logic

Identities, Satisfaction and Equational Classes

Identities as pairs of terms, what it means for an algebra to satisfy one, and the Galois connection between classes of algebras and sets of identities.

Category Engineering / MathematicsSource II.11Pages 77-79Reading 2 minReviewed 2026-08-07

Learning objectives

  • Define satisfaction of an identity
  • Describe the operators Id and M and the Galois connection they form
  • Define equational class and relate it to variety
On this page
  1. Identities and satisfaction
  2. The Galois connection
  3. The three closure properties
  4. Examples of equational definitions

Identities and satisfaction

Definition — Identity

A formal expression p ≈ q where p and q are terms over a variable set X.

Definition — SatisfactionA ⊧ p ≈ q means that pA and qA are the same function — equivalently, that p and q take equal values under every assignment of elements of A to the variables.

Satisfaction is implicitly universally quantified. The identity x · y ≈ y · x asserts commutativity for all elements, not the existence of a commuting pair.

⊧ is overloaded

In Chapter II the double turnstile relates an algebra to an identity. In Chapter V it relates a structure to an arbitrary first-order sentence. The second generalises the first, but the notation is reused across a large gap in the text.

The Galois connection

Id<sub><em>K</em></sub>(<em>X</em>)
the set of identities over X satisfied by every member of K
<em>M</em>(&Sigma;)
the class of all algebras satisfying every identity in Σ

These two operators reverse inclusion and form a Galois connection between classes of algebras and sets of identities:

Larger class <em>K</em>Fewer identities Id(K)
Larger set &Sigma;Smaller class M(Σ)
<em>M</em>Id(<em>K</em>)The closure of K — a variety
Id<em>M</em>(&Sigma;)The closure of Σ — an equational theory
Definition — Equational class

A class of the form M(Σ) for some set of identities Σ. Equivalently, a class closed under the operator MId.

Definition — Equational theory

A set of identities of the form Id(K) — equivalently, a set closed under the operator IdM.

The three closure properties

Identities are preserved by H, S and P

If every member of K satisfies p ≈ q, then so does every homomorphic image, every subalgebra and every direct product of members of K.

Why each closure holds
OperatorReason
HHomomorphisms preserve term operations, so an identity holding upstairs holds in the image
SA subalgebra's term operations are restrictions of the ambient ones; an identity holding on all of A holds on any subset
POperations act coordinatewise, so an identity holding in every factor holds in the product
Half of Birkhoff's theorem

These three facts show every equational class is a variety. The converse — every variety is equational — is the substantial half, and it requires free algebras.

Examples of equational definitions

Standard classes as M(Σ)
ClassDefining identities
Commutative semigroupsassociativity, xy ≈ yx
Bandsassociativity, xx ≈ x
Abelian groups of exponent ngroup axioms, commutativity, xn ≈ e
Boolean algebraslattice axioms, distributivity, complement laws, bounds
Nilpotent groups of class 2group axioms plus [[x,y],z] ≈ e
Rings satisfying x2 ≈ xring axioms plus idempotence — the Boolean rings

Frequently asked questions

Can an equational class be defined by infinitely many identities?

Yes, and sometimes it must be. Whether a finitely axiomatisable class exists is the finite basis problem, and Chapter V devotes a section to when the answer is yes.

Is satisfaction decidable?

For a fixed finite algebra and a given identity, yes — check all assignments. For a variety and an arbitrary identity, it depends: the equational theory of a variety may be undecidable, which is one theme of Chapter V §5.

Related pages

  • Free Algebras and the Universal Mapping Property
  • Birkhoff's HSP Theorem
  • Satisfaction and the Tarski Truth Definition

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.11, book pages 77-79.

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 Identities, Satisfaction and Equational Classes. 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 Identities, Satisfaction and Equational Classes as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—identities, satisfaction, equational, classes, galois—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 Identities, Satisfaction and Equational Classes?

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

Continue learning

Solution of TrianglesGuide · Engineering MathematicsTraceability & Solution EvaluationGuide · Engineering MathematicsEquivalence Relations and the Partition Lattice Eq(A)Guide · Engineering MathematicsQuotient Algebras and the Natural MapGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®