Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Modular lattice
Summary
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) ∧ b
where 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. This phrasing emphasizes an interpretation in terms of projection onto the sublattice [a, b], a fact known as the diamond isomorphism theorem. An alternative but equivalent condition stated as an equation (see below) emphasizes that modular lattices form a variety in the sense of universal algebra.
Modular lattices arise naturally in algebra and in many other areas of mathematics. In these scenarios, modularity is an abstraction of the 2nd Isomorphism Theorem. For example, the subspaces of a vector space (and more generally the submodules of a module over a ring) form a modular lattice.
In a not necessarily modular lattice, there may still be elements b for which the modular law holds in connection with arbitrary elements x and a (for a ≤ b). Such an element is called a modular element. Even more generally, the modular law may hold for any a and a fixed pair (x, b). Such a pair is called a modular pair, and there are various generalizations of modularity related to this notion and to semimodularity.
Modular lattices are sometimes called Dedekind lattices after Richard Dedekind, who discovered the modular identity in several motivating examples.
The modular law can be seen as a restricted associative law that connects the two lattice operations similarly to the way in which the associative law λ(μx) = (λμ)x for vector spaces connects multiplication in the field and scalar multiplication.
The restriction a ≤ b is clearly necessary, since it follows from a ∨ (x ∧ b) = (a ∨ x) ∧ b. In other words, no lattice with more than one element satisfies the unrestricted consequent of the modular law.
It is easy to see that a ≤ b implies a ∨ (x ∧ b) ≤ (a ∨ x) ∧ b in every lattice.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.