##  [Modular Lattice](/modular-lattice-0) 

 Definition

A modular lattice is a lattice satisfying the modular identity: for all x, y, z with x ≤ z, x ∨ (y ∧ z) = (x ∨ y) ∧ z. This condition is weaker than distributivity but stronger than arbitrary lattice axioms, and it controls how join and meet interact when one element is below another.

 

 

 

 

 

 





## Principle

Principle

Impose a one-sided compatibility between join and meet that prevents certain pathological configurations while allowing many algebraic lattices (such as subspace lattices) to be included; modularity captures a balanced relaxation of distributivity suited to linear-like structures.

 

 

 

 

 





## Demonstration

Demonstration

The lattice of subspaces of a vector space is modular: if U ⊆ W are subspaces and V is any subspace, then U + (V ∩ W) = (U + V) ∩ W, which is the modular identity in linear algebraic terms. Many lattices arising from module theory are modular.

 

 

 

 

## Misapplication

Misapplication

Treating modularity as equivalent to distributivity leads to errors: for example, assuming that modular lattices admit the same decomposition into join of irreducibles as distributive lattices is false, and conclusions relying on distributive identities will not hold.

 

 

 

 

 





## Consequence

Consequence

Modularity allows dimension-like arguments and many structural theorems (e.g., refinement of chains, Jordan–Hölder style decompositions in modular contexts) while remaining broad enough to encompass subspace lattices and lattices of modules.

 

 

 

 

## Reversal

Reversal

Dropping modularity returns to general lattices with fewer constraints; enforcing full distributivity gives a strictly smaller class with stronger decomposition and representation properties.

 

 

 

 

 





## Boundary

Boundary

Modularity is a condition about triples with an order relation x ≤ z; it does not imply distributivity, complementation, or atomicity. There exist modular lattices that are not distributive and distributive lattices that are modular; the properties are independent except in restricted classes.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Modularity sits between general lattices and distributive lattices: it is often the correct hypothesis in linear-algebraic contexts where distributivity fails but a controlled interaction between sums and intersections persists; distinguishing modular from distributive is crucial when applying representation theorems.

 

 

 

 

 





## Synthesis

Synthesis

A modular lattice is a lattice with a one-sided distributivity constraint (the modular law) that formalizes the tame interaction of join and meet when elements are ordered, capturing many linear and module-theoretic lattices while allowing behaviors forbidden by full distributivity.