KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Subalgebra Lattice Sub(A) is AlgebraicEngineering · Engineering MathematicsLesson 65/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIThe Subalgebra Lattice Sub(A) is Algebraic

KEVOS knowledge first · trusted web sources when needed

Core Structure Theory

The Subalgebra Lattice Sub(A) is Algebraic

The theorem that the subuniverses of any algebra form an algebraic lattice, and the converse showing that every algebraic lattice arises this way.

Category Engineering / MathematicsSource II.3Pages 33-34Reading 2 minReviewed 2026-08-07

Learning objectives

  • Prove that Sub(A) is a complete lattice and identify its operations
  • Identify the compact elements as the finitely generated subuniverses
  • State the representation theorem for algebraic lattices
On this page
  1. The lattice
  2. Algebraicity
  3. The representation theorem
  4. Worked examples

The lattice

Sub(A) is a complete lattice

The subuniverses of A, ordered by inclusion, form a complete lattice Sub(A) in which the meet of a family is its intersection and the join is Sg of its union.

Completeness follows from the one-sided criterion: A is the greatest subuniverse, and arbitrary intersections of subuniverses are subuniverses, so all infima exist. That is enough.

Join is not union

The join of two subuniverses is Sg of their union, not the union itself. For subgroups of a group this is the familiar fact that a union of two subgroups is a subgroup only when one contains the other. The asymmetry between meet and join is permanent and is the main source of difficulty in computing these lattices.

Algebraicity

Sub(A) is algebraic

Every element of Sub(A) is the join of the compact elements below it, and the compact elements are precisely the finitely generated subuniverses.

Sg is algebraicMembership in Sg(X) is witnessed by a finite subset of X
HenceSg(Y) for finite Y is a compact element
HenceEvery subuniverse is the directed join of its finitely generated subuniverses
ConclusionSub(A) is algebraic

The converse of compactness also holds: a compact element of Sub(A) must be finitely generated, since it is the join of the finitely generated subuniverses below it and compactness forces one of them to suffice.

The representation theorem

Birkhoff–Frink

Every algebraic lattice is isomorphic to Sub(A) for some algebra A.

The construction takes the compact elements of the given lattice as generators and introduces, for each finite join relation among them, an operation witnessing it. The resulting algebra has the prescribed lattice of subuniverses.

Two representation theorems, one theme

Birkhoff–Frink for Sub and Grätzer–Schmidt for Con both say the same thing: algebraicity is the only constraint. Neither lattice carries hidden structure beyond being algebraic, which is a strong and slightly deflating result — it says these invariants are as unconstrained as they could be.

Worked examples

Sub(A) for small algebras
Algebra<strong>Sub</strong>(<strong>A</strong>)Notes
Cyclic group of order pTwo-element chainOnly the trivial subgroup and the whole group
Cyclic group of order pnChain of length n+1Subgroups are linearly ordered
Klein four-groupM5Three subgroups of order two, pairwise meeting trivially
Vector space of dimension 2Modular, not distributiveContains M5 from any three distinct lines
Free semigroup on one generatorComplicatedSubsemigroups of the positive integers under addition
A useful diagnostic

Because the Klein four-group's subgroup lattice is M5, and M5 is modular but not distributive, no group with that subgroup lattice can have a distributive subgroup lattice. Ore's theorem sharpens this: a group has a distributive subgroup lattice exactly when it is locally cyclic.

Frequently asked questions

Is Sub(A) ever distributive?

Yes — for cyclic groups, and more generally for locally cyclic groups by Ore's theorem. But it is not distributive in general, and not even modular in general.

Does Sub(A) determine A?

No. Many non-isomorphic algebras share a subalgebra lattice; the two-element chain arises from every simple algebra with no proper non-trivial subalgebras.

Related pages

  • Subuniverses and the Generation Operator Sg
  • Irredundant Bases and the Irredundant Basis Theorem
  • Algebraic Lattices and Compact Elements

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.3, book pages 33-34.

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 The Subalgebra Lattice Sub(A) is Algebraic. 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 The Subalgebra Lattice Sub(A) is Algebraic as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—lattice, algebraic, theorem, subalgebra, subuniverses—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 The Subalgebra Lattice Sub(A) is Algebraic?

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 lattice 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

Business Analysis & Its 6 DomainsGuide · Engineering MathematicsModular Lattices and the Modular LawGuide · Engineering MathematicsNEXT LESSON →Terms and the Term Algebra T(X)Guide · Engineering MathematicsThe Syntactic Monoid and Kleene's TheoremGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®