Distributive lattice

In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set union and intersection. Indeed, these lattices of sets describe the scenery completely: every distributive lattice is—up to isomorphism—given as such a lattice of sets.

Definition

As in the case of arbitrary lattices, one can choose to consider a distributive lattice L either as a structure of order theory or of universal algebra. Both views and their mutual correspondence are discussed in the article on lattices. In the present situation, the algebraic description appears to be more convenient.

A lattice (L,∨,∧) is distributive if the following additional identity holds for all x, y, and z in L: x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z). Viewing lattices as partially ordered sets, this says that the meet operation preserves non-empty finite joins. It is a basic fact of lattice theory that the above condition is equivalent to its dual: x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z)   for all x, y, and z in L. In every lattice, if one defines the order relation p≤q as usual to mean p∧q=p, then the inequality x ∧ (y ∨ z) ≥ (x ∧ y) ∨ (x ∧ z) and its dual x ∨ (y ∧ z) ≤ (x ∨ y) ∧ (x ∨ z) are always true.

A lattice is distributive if one of the converse inequalities holds, too. More information on the relationship of this condition to other distributivity conditions of order theory can be found in the article Distributivity (order theory).

Sholander (1951) gives a simplified characterization of distributive lattices only utilizing a \wedge (a \vee b) = a and a \wedge (b \vee c) = (c\wedge a)\vee (b\wedge a) . (x \wedge y) \vee (y \wedge z) \vee (z \wedge x) = (x \vee y) \wedge (y \vee z) \wedge (z \vee x). Similarly, L is distributive if and only if x \wedge z = y \wedge z and x \vee z = y \vee z always imply x = y. The simplest non-distributive lattices are M 3 , the "diamond lattice", and N 5 , the "pentagon lattice". A lattice is distributive if and only if none of its sublattices is isomorphic to M 3 or N 5 ; a sublattice is a subset that is closed under the meet and join operations of the original lattice.

Note that this is not the same as being a subset that is a lattice under the original order (but possibly with different join and meet operations). Further characterizations derive from the representation theory in the next section.

An alternative way of stating the same fact is that every distributive lattice is a subdirect product of copies of the two-element chain, or that the only subdirectly irreducible member of the class of distributive lattices is the two-element chain. As a corollary, every Boolean lattice has this property as well. Finally distributivity entails several other pleasant properties.

For example, an element of a distributive lattice is meet-prime if and only if it is meet-irreducible, though the latter is in general a weaker property. By duality, the same is true for join-prime and join-irreducible elements. If a lattice is distributive, its covering relation forms a median graph.

Furthermore, every distributive lattice is also modular.

See also

Completely distributive lattice — a lattice in which infinite joins distribute over infinite meets Duality theory for distributive lattices Spectral space

Text derived from https://en.wikipedia.org/w/index.php?oldid=1353478499 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

5 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.