Explore relationships

Modular lattice

In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular lawa ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ bwhere x, a, b are arbitrary elements in the lattice, ≤ is the partial order, and ∨ and ∧ (called join and meet respectively) are the operations of the lattice.

Use + to expand a branch. Click a topic name to open its summary.