KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe M5 and N5 Forbidden-Sublattice TheoremsEngineering · Engineering MathematicsLesson 73/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIThe M5 and N5 Forbidden-Sublattice Theorems

KEVOS knowledge first · trusted web sources when needed

Lattice Theory Foundations

The M5 and N5 Forbidden-Sublattice Theorems

Two five-element lattices decide modularity and distributivity by exclusion. These theorems convert conditions stated as identities into a finite, checkable structural test.

Category Engineering / MathematicsSource I.3Pages 13-16Reading 2 minReviewed 2026-08-07

Learning objectives

  • Describe M5 and N5 precisely
  • State both forbidden-sublattice theorems
  • Use the theorems to settle modularity and distributivity in examples
On this page
  1. The two lattices
  2. The theorems
  3. Why these theorems are valuable
  4. Applications

The two lattices

<em>N</em><sub>5</sub> — the pentagon

Five elements: 0 < a < b < 1 forming a three-element chain between bottom and top, plus a single element c with 0 < c < 1, incomparable to both a and b.

<em>M</em><sub>5</sub> — the diamond

Five elements: bottom 0, top 1, and three pairwise incomparable elements a, b, c strictly between. Any two of the middle elements meet at 0 and join at 1.

In N5, modularity fails: a ≤ b, yet a ∨ (c ∧ b) = a ∨ 0 = a, while (a ∨ c) ∧ b = 1 ∧ b = b. Since a ≠ b, the modular law is violated.

In M5, modularity holds but distributivity fails: a ∧ (b ∨ c) = a ∧ 1 = a, while (a ∧ b) ∨ (a ∧ c) = 0 ∨ 0 = 0.

The theorems

Modularity criterion

A lattice is modular if and only if it has no sublattice isomorphic to N5.

Distributivity criterion

A lattice is distributive if and only if it has no sublattice isomorphic to either M5 or N5.

Combining the two gives a clean trichotomy: a lattice is distributive when it excludes both; modular but not distributive when it excludes N5 but contains M5; and non-modular when it contains N5.

Why these theorems are valuable

From universal quantification to a finite search

Distributivity as stated quantifies over all triples of elements — an infinite check in an infinite lattice. The forbidden-sublattice form replaces this with a search for two specific five-element configurations. In a finite lattice the search is finite and mechanical; in an infinite one it is often settled by a structural argument.

Given a latticeLook for five elements in the pentagon pattern
Found?Not modular, hence not distributive — done
Not foundModular. Now look for the diamond pattern
Found?Modular but not distributive
NeitherDistributive

Applications

Settling examples by the criteria
LatticeContains N5?Contains M5?Verdict
Subgroup lattice of S3Yes—Not modular
Subgroup lattice of the Klein four-groupNoYesModular, not distributive
Subspace lattice of a planeNoYesModular, not distributive
Power set of any setNoNoDistributive
Any chainNoNoDistributive
Divisors of n under lcm, gcdNoNoDistributive
The pattern in geometry

The subspace lattice of a vector space of dimension at least two always contains M5: take three distinct lines through the origin in a plane. This is why projective geometry lives in the modular but not distributive world, and it is the origin of the theory of modular geometric lattices.

Frequently asked questions

Does 'sublattice' matter here, or would sub-poset do?

It matters entirely. The theorems require a genuine sublattice — a subset closed under the ambient join and meet. A sub-poset shaped like N5 whose joins are computed differently in the ambient lattice proves nothing.

Are there analogous criteria for other lattice conditions?

Yes, for several. Many lattice properties admit characterisation by excluded sublattices or excluded quotients, though the excluded sets are generally larger and less memorable than these two.

Related pages

  • Modular Lattices and the Modular Law
  • Complete Lattices and Completeness Criteria

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 I.3, book pages 13-16.

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 M5 and N5 Forbidden-Sublattice Theorems. 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 M5 and N5 Forbidden-Sublattice Theorems as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—theorems, lattices, forbidden-sublattice, five-element, decide—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 M5 and N5 Forbidden-Sublattice Theorems?

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

Needs AssessmentGuide · Engineering MathematicsNEXT LESSON →Irredundant Bases and the Irredundant Basis TheoremGuide · Engineering MathematicsTerm Operations and Polynomial OperationsGuide · Engineering MathematicsApplied Universal Algebra: a SynthesisGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®