Math 2.0

Order, lattices, ordered algebraic structures Modular and complemented lattices Concept

Modular lattice

Summary

A modular lattice is a lattice that satisfies the modular law: if a≤ba \le b, then a∨(x∧b)=(a∨x)∧ba \vee (x \wedge b) = (a \vee x) \wedge b for every xx. The lattices of subspaces of a vector space, of submodules of a module and of normal subgroups of a group are modular. Every distributive lattice is modular, but not conversely. Modularity is what makes dimension and length behave well, as in the Jordan–Hölder theorem for modular lattices.

Where this leads

10 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Modular_lattice
About this page