Lattice (order)

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (May 2009) (Learn how and when to remove this message)

Transitive binary relations v t e
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Total, Semiconnex Anti- reflexive Equivalence relation Y ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Preorder (Quasiorder) ✗ ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Partial order ✗ Y ✗ ✗ ✗ ✗ Y ✗ ✗ Total preorder ✗ ✗ Y ✗ ✗ ✗ Y ✗ ✗ Total order ✗ Y Y ✗ ✗ ✗ Y ✗ ✗ Prewellordering ✗ ✗ Y Y ✗ ✗ Y ✗ ✗ Well-quasi-ordering ✗ ✗ ✗ Y ✗ ✗ Y ✗ ✗ Well-ordering ✗ Y Y Y ✗ ✗ Y ✗ ✗ Lattice ✗ Y ✗ ✗ Y Y Y ✗ ✗ Join-semilattice ✗ Y ✗ ✗ Y ✗ Y ✗ ✗ Meet-semilattice ✗ Y ✗ ✗ ✗ Y Y ✗ ✗ Strict partial order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict weak order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict total order ✗ Y Y ✗ ✗ ✗ ✗ Y Y Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Definitions, for all ${\displaystyle a,b}$ and ${\displaystyle S\neq \varnothing :}$ ${\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}}$ ${\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}}$ ${\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}}$ ${\displaystyle aRa}$ ${\displaystyle {\text{not }}aRa}$ ${\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}$
Y indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by Y in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. All definitions tacitly require the homogeneous relation ${\displaystyle R}$ be transitive: for all ${\displaystyle a,b,c,}$ if ${\displaystyle aRb}$ and ${\displaystyle bRc}$ then ${\displaystyle aRc.}$ A term's definition may require additional properties that are not listed in this table.

Algebraic structures
Group-like Group Semigroup / Monoid Rack and quandle Quasigroup and loop Abelian group Magma Lie group Group theory
Ring-like Ring Rng Semiring Near-ring Commutative ring Domain Integral domain Field Division ring Lie ring Ring theory
Lattice-like Lattice Semilattice Complemented lattice Total order Heyting algebra Boolean algebra Map of lattices Lattice theory
Module-like Module Group with operators Vector space Linear algebra
Algebra-like Algebra Associative Non-associative Composition algebra Lie algebra Graded Bialgebra Hopf algebra
v t e

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor.

Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These lattice-like structures all admit order-theoretic as well as algebraic descriptions.

The sub-field of abstract algebra that studies lattices is called lattice theory.

A lattice can be defined either order-theoretically as a partially ordered set, or as an algebraic structure.

A partially ordered set (poset) ${\displaystyle (L,\leq )}$ is called a lattice if it is both a join- and a meet-semilattice, i.e. each two-element subset ${\displaystyle \{a,b\}\subseteq L}$ has a join (i.e. least upper bound, denoted by ${\displaystyle a\vee b}$) and dually a meet (i.e. greatest lower bound, denoted by ${\displaystyle a\wedge b}$). This definition makes ${\displaystyle \,\wedge \,}$ and ${\displaystyle \,\vee \,}$ binary operations. Both operations are monotone with respect to the given order: ${\displaystyle a_{1}\leq a_{2}}$ and ${\displaystyle b_{1}\leq b_{2}}$ implies that ${\displaystyle a_{1}\vee b_{1}\leq a_{2}\vee b_{2}}$ and ${\displaystyle a_{1}\wedge b_{1}\leq a_{2}\wedge b_{2}.}$

It follows by an induction argument that every non-empty finite subset of a lattice has a least upper bound and a greatest lower bound. With additional assumptions, further conclusions may be possible; see Completeness (order theory) for more discussion of this subject. That article also discusses how one may rephrase the above definition in terms of the existence of suitable Galois connections between related partially ordered sets—an approach of special interest for the category theoretic approach to lattices, and for formal concept analysis.

Given a subset of a lattice, ${\displaystyle H\subseteq L,}$ meet and join restrict to partial functions – they are undefined if their value is not in the subset ${\displaystyle H.}$ The resulting structure on ${\displaystyle H}$ is called a partial lattice. In addition to this extrinsic definition as a subset of some other algebraic structure (a lattice), a partial lattice can also be intrinsically defined as a set with two partial binary operations satisfying certain axioms.^[1]

A lattice is an algebraic structure ${\displaystyle (L,\vee ,\wedge )}$, consisting of a set ${\displaystyle L}$ and two binary, commutative and associative operations ${\displaystyle \vee }$ and ${\displaystyle \wedge }$ on ${\displaystyle L}$ satisfying the following axiomatic identities for all elements ${\displaystyle a,b\in L}$ (sometimes called absorption laws): $${\displaystyle a\vee (a\wedge b)=a}$$ $${\displaystyle a\wedge (a\vee b)=a}$$

The following two identities are also usually regarded as axioms, even though they follow from the two absorption laws taken together.^[2] These are called idempotent laws. $${\displaystyle a\vee a=a}$$ $${\displaystyle a\wedge a=a}$$

These axioms assert that both ${\displaystyle (L,\vee )}$ and ${\displaystyle (L,\wedge )}$ are semilattices. The absorption laws, the only axioms above in which both meet and join appear, distinguish a lattice from an arbitrary pair of semilattice structures and assure that the two semilattices interact appropriately. In particular, each semilattice is the dual of the other. The absorption laws can be viewed as a requirement that the meet and join semilattices define the same partial order.

An order-theoretic lattice gives rise to the two binary operations ${\displaystyle \vee }$ and ${\displaystyle \wedge .}$ Since the commutative, associative and absorption laws can easily be verified for these operations, they make ${\displaystyle (L,\vee ,\wedge )}$ into a lattice in the algebraic sense.

The converse is also true. Given an algebraically defined lattice ${\displaystyle (L,\vee ,\wedge ),}$ one can define a partial order ${\displaystyle \leq }$ on ${\displaystyle L}$ by setting $${\displaystyle a\leq b{\text{ if }}a=a\wedge b,{\text{ or }}}$$ $${\displaystyle a\leq b{\text{ if }}b=a\vee b,}$$ for all elements ${\displaystyle a,b\in L.}$ The laws of absorption ensure that both definitions are equivalent: $${\displaystyle a=a\wedge b{\text{ implies }}b=b\vee (b\wedge a)=(a\wedge b)\vee b=a\vee b}$$ and dually for the other direction.

One can now check that the relation ${\displaystyle \leq }$ introduced in this way defines a partial ordering within which binary meets and joins are given through the original operations ${\displaystyle \vee }$ and ${\displaystyle \wedge .}$

Since the two definitions of a lattice are equivalent, one may freely invoke aspects of either definition in any way that suits the purpose at hand.

A bounded lattice is a lattice that additionally has a greatest element (also called maximum, or top element, and denoted by ${\displaystyle 1,}$ or by ${\displaystyle \top }$) and a least element (also called minimum, or bottom, denoted by ${\displaystyle 0}$ or by ${\displaystyle \bot }$), which satisfy $${\displaystyle 0\leq x\leq 1\;{\text{ for every }}x\in L.}$$

A bounded lattice may also be defined as an algebraic structure of the form ${\displaystyle (L,\vee ,\wedge ,0,1)}$ such that ${\displaystyle (L,\vee ,\wedge )}$ is a lattice, ${\displaystyle 0}$ (the lattice's bottom) is the identity element for the join operation ${\displaystyle \vee ,}$ and ${\displaystyle 1}$ (the lattice's top) is the identity element for the meet operation ${\displaystyle \wedge .}$ $${\displaystyle a\vee 0=a}$$ $${\displaystyle a\wedge 1=a}$$

A partially ordered set is a bounded lattice if and only if every finite set of elements (including the empty set) has a join and a meet. For every element ${\displaystyle x}$ of a poset it is vacuously true that ${\displaystyle {\text{ for all }}a\in \varnothing ,x\leq a}$ and ${\displaystyle {\text{ for all }}a\in \varnothing ,a\leq x,}$ and therefore every element of a poset is both an upper bound and a lower bound of the empty set. This implies that the join of an empty set is the least element ${\textstyle \bigvee \varnothing =0,}$ and the meet of the empty set is the greatest element ${\textstyle \bigwedge \varnothing =1.}$ This is consistent with the associativity and commutativity of meet and join: the join of a union of finite sets is equal to the join of the joins of the sets, and dually, the meet of a union of finite sets is equal to the meet of the meets of the sets, that is, for finite subsets ${\displaystyle A}$ and ${\displaystyle B}$ of a poset ${\displaystyle L,}$ $${\displaystyle \bigvee (A\cup B)=\left(\bigvee A\right)\vee \left(\bigvee B\right)}$$ and $${\displaystyle \bigwedge (A\cup B)=\left(\bigwedge A\right)\wedge \left(\bigwedge B\right)}$$ hold. Taking ${\displaystyle B}$ to be the empty set, $${\displaystyle \bigvee (A\cup \varnothing )=\left(\bigvee A\right)\vee \left(\bigvee \varnothing \right)=\left(\bigvee A\right)\vee 0=\bigvee A}$$ and $${\displaystyle \bigwedge (A\cup \varnothing )=\left(\bigwedge A\right)\wedge \left(\bigwedge \varnothing \right)=\left(\bigwedge A\right)\wedge 1=\bigwedge A,}$$ which is consistent with the fact that ${\displaystyle A\cup \varnothing =A.}$

Every lattice can be embedded into a bounded lattice by adding a greatest and a least element. Furthermore, every non-empty finite lattice is bounded, by taking the join (respectively, meet) of all elements, denoted by ${\textstyle 1=\bigvee L=a_{1}\lor \cdots \lor a_{n}}$ (respectively ${\textstyle 0=\bigwedge L=a_{1}\land \cdots \land a_{n}}$) where ${\displaystyle L=\left\{a_{1},\ldots ,a_{n}\right\}}$ is the set of all elements.

Lattices have some connections to the family of group-like algebraic structures. Because meet and join both commute and associate, a lattice can be viewed as consisting of two commutative semigroups having the same domain. For a bounded lattice, these semigroups are in fact commutative monoids. The absorption law is the only defining identity that is peculiar to lattice theory. A bounded lattice can also be thought of as a commutative rig without the distributive axiom.

By commutativity, associativity and idempotence one can think of join and meet as operations on non-empty finite sets, rather than on pairs of elements. In a bounded lattice the join and meet of the empty set can also be defined (as ${\displaystyle 0}$ and ${\displaystyle 1,}$ respectively). This makes bounded lattices somewhat more natural than general lattices, and many authors require all lattices to be bounded.

The algebraic interpretation of lattices plays an essential role in universal algebra.^{[citation needed]}

• 
  Pic. 1: Subsets of ${\displaystyle \{x,y,z\},}$ under set inclusion. The name "lattice" is suggested by the form of the Hasse diagram depicting it.
• 
  Pic. 2: Lattice of integer divisors of 60, ordered by "divides".
• 
  Pic. 3: Lattice of partitions of ${\displaystyle \{1,2,3,4\},}$ ordered by "refines".
• 
  Pic. 4: Lattice of positive integers, ordered by ${\displaystyle \,\leq ,}$
• 
  Pic. 5: Lattice of nonnegative integer pairs, ordered componentwise.

• For any set ${\displaystyle A,}$ the collection of all subsets of ${\displaystyle A}$ (called the power set of ${\displaystyle A}$) can be ordered via subset inclusion to obtain a lattice bounded by ${\displaystyle A}$ itself and the empty set. In this lattice, the supremum is provided by set union and the infimum is provided by set intersection (see Pic. 1).
• For any set ${\displaystyle A,}$ the collection of all finite subsets of ${\displaystyle A,}$ ordered by inclusion, is also a lattice, and will be bounded if and only if ${\displaystyle A}$ is finite.
• For any set ${\displaystyle A,}$ the collection of all partitions of ${\displaystyle A,}$ ordered by refinement, is a lattice (see Pic. 3).
• The positive integers in their usual order form an unbounded lattice, under the operations of "min" and "max". 1 is bottom; there is no top (see Pic. 4).
• The Cartesian square of the natural numbers, ordered so that ${\displaystyle (a,b)\leq (c,d)}$ if ${\displaystyle a\leq c{\text{ and }}b\leq d.}$ The pair ${\displaystyle (0,0)}$ is the bottom element; there is no top (see Pic. 5).
• The natural numbers also form a lattice under the operations of taking the greatest common divisor and least common multiple, with divisibility as the order relation: ${\displaystyle a\leq b}$ if ${\displaystyle a}$ divides ${\displaystyle b.}$ ${\displaystyle 1}$ is bottom; ${\displaystyle 0}$ is top. Pic. 2 shows a finite sublattice.
• Every complete lattice (also see below) is a (rather specific) bounded lattice. This class gives rise to a broad range of practical examples.
• The set of compact elements of an arithmetic complete lattice is a lattice with a least element, where the lattice operations are given by restricting the respective operations of the arithmetic lattice. This is the specific property that distinguishes arithmetic lattices from algebraic lattices, for which the compacts only form a join-semilattice. Both of these classes of complete lattices are studied in domain theory.

Further examples of lattices are given for each of the additional properties discussed below.

Most partially ordered sets are not lattices, including the following.

• A discrete poset, meaning a poset such that ${\displaystyle x\leq y}$ implies ${\displaystyle x=y,}$ is a lattice if and only if it has at most one element. In particular the two-element discrete poset is not a lattice.
• Although the set ${\displaystyle \{1,2,3,6\}}$ partially ordered by divisibility is a lattice, the set ${\displaystyle \{1,2,3\}}$ so ordered is not a lattice because the pair 2, 3 lacks a join; similarly, 2, 3 lacks a meet in ${\displaystyle \{2,3,6\}.}$
• The set ${\displaystyle \{1,2,3,12,18,36\}}$ partially ordered by divisibility is not a lattice. Every pair of elements has an upper bound and a lower bound, but the pair 2, 3 has three upper bounds, namely 12, 18, and 36, none of which is the least of those three under divisibility (12 and 18 do not divide each other). Likewise the pair 12, 18 has three lower bounds, namely 1, 2, and 3, none of which is the greatest of those three under divisibility (2 and 3 do not divide each other).

The appropriate notion of a morphism between two lattices flows easily from the above algebraic definition. Given two lattices ${\displaystyle \left(L,\vee _{L},\wedge _{L}\right)}$ and ${\displaystyle \left(M,\vee _{M},\wedge _{M}\right),}$ a lattice homomorphism from L to M is a function ${\displaystyle f:L\to M}$ such that for all ${\displaystyle a,b\in L:}$ $${\displaystyle f\left(a\vee _{L}b\right)=f(a)\vee _{M}f(b),{\text{ and }}}$$ $${\displaystyle f\left(a\wedge _{L}b\right)=f(a)\wedge _{M}f(b).}$$

Thus ${\displaystyle f}$ is a homomorphism of the two underlying semilattices. When lattices with more structure are considered, the morphisms should "respect" the extra structure, too. In particular, a bounded-lattice homomorphism (usually called just "lattice homomorphism") ${\displaystyle f}$ between two bounded lattices ${\displaystyle L}$ and ${\displaystyle M}$ should also have the following property: $${\displaystyle f\left(0_{L}\right)=0_{M},{\text{ and }}}$$ $${\displaystyle f\left(1_{L}\right)=1_{M}.}$$

In the order-theoretic formulation, these conditions just state that a homomorphism of lattices is a function preserving binary meets and joins. For bounded lattices, preservation of least and greatest elements is just preservation of join and meet of the empty set.

Any homomorphism of lattices is necessarily monotone with respect to the associated ordering relation; see Limit preserving function. The converse is not true: monotonicity by no means implies the required preservation of meets and joins (see Pic. 9), although an order-preserving bijection is a homomorphism if its inverse is also order-preserving.

Given the standard definition of isomorphisms as invertible morphisms, a lattice isomorphism is just a bijective lattice homomorphism. Similarly, a lattice endomorphism is a lattice homomorphism from a lattice to itself, and a lattice automorphism is a bijective lattice endomorphism. Lattices and their homomorphisms form a category.

Let ${\displaystyle \mathbb {L} }$ and ${\displaystyle \mathbb {L} '}$ be two lattices with 0 and 1. A homomorphism from ${\displaystyle \mathbb {L} }$ to ${\displaystyle \mathbb {L} '}$ is called 0,1-separating if and only if ${\displaystyle f^{-1}\{f(0)\}=\{0\}}$ (${\displaystyle f}$ separates 0) and ${\displaystyle f^{-1}\{f(1)\}=\{1\}}$ (${\displaystyle f}$ separates 1).

A sublattice of a lattice ${\displaystyle L}$ is a subset of ${\displaystyle L}$ that is a lattice with the same meet and join operations as ${\displaystyle L.}$ That is, if ${\displaystyle L}$ is a lattice and ${\displaystyle M}$ is a subset of ${\displaystyle L}$ such that for every pair of elements ${\displaystyle a,b\in M}$ both ${\displaystyle a\wedge b}$ and ${\displaystyle a\vee b}$ are in ${\displaystyle M,}$ then ${\displaystyle M}$ is a sublattice of ${\displaystyle L.}$^[3]

A sublattice ${\displaystyle M}$ of a lattice ${\displaystyle L}$ is a convex sublattice of ${\displaystyle L,}$ if ${\displaystyle x\leq z\leq y}$ and ${\displaystyle x,y\in M}$ implies that ${\displaystyle z}$ belongs to ${\displaystyle M,}$ for all elements ${\displaystyle x,y,z\in L.}$

We now introduce a number of important properties that lead to interesting special classes of lattices. One, boundedness, has already been discussed.

A poset is called a complete lattice if all its subsets have both a join and a meet. In particular, every complete lattice is a bounded lattice. While bounded lattice homomorphisms in general preserve only finite joins and meets, complete lattice homomorphisms are required to preserve arbitrary joins and meets.

Every poset that is a complete semilattice is also a complete lattice. Related to this result is the interesting phenomenon that there are various competing notions of homomorphism for this class of posets, depending on whether they are seen as complete lattices, complete join-semilattices, complete meet-semilattices, or as join-complete or meet-complete lattices.

"Partial lattice" is not the opposite of "complete lattice" – rather, "partial lattice", "lattice", and "complete lattice" are increasingly restrictive definitions.

A conditionally complete lattice is a lattice in which every nonempty subset that has an upper bound has a join (that is, a least upper bound). Such lattices provide the most direct generalization of the completeness axiom of the real numbers. A conditionally complete lattice is either a complete lattice, or a complete lattice without its maximum element ${\displaystyle 1,}$ its minimum element ${\displaystyle 0,}$ or both.^[4][5]

Since lattices come with two binary operations, it is natural to ask whether one of them distributes over the other, that is, whether one or the other of the following dual laws holds for every three elements ${\displaystyle a,b,c\in L,}$:

Distributivity of ${\displaystyle \vee }$ over ${\displaystyle \wedge }$

$${\displaystyle a\vee (b\wedge c)=(a\vee b)\wedge (a\vee c).}$$

Distributivity of ${\displaystyle \wedge }$ over ${\displaystyle \vee }$

$${\displaystyle a\wedge (b\vee c)=(a\wedge b)\vee (a\wedge c).}$$

A lattice that satisfies the first or, equivalently (as it turns out), the second axiom, is called a distributive lattice. The only non-distributive lattices with fewer than 6 elements are called M₃ and N₅;^[6] they are shown in Pictures 10 and 11, respectively. A lattice is distributive if and only if it does not have a sublattice isomorphic to M₃ or N₅.^[7] Each distributive lattice is isomorphic to a lattice of sets (with union and intersection as join and meet, respectively).^[8]

For an overview of stronger notions of distributivity that are appropriate for complete lattices and that are used to define more special classes of lattices such as frames and completely distributive lattices, see distributivity in order theory.

For some applications the distributivity condition is too strong, and the following weaker property is often useful. A lattice ${\displaystyle (L,\vee ,\wedge )}$ is modular if, for all elements ${\displaystyle a,b,c\in L,}$ the following identity holds: ${\displaystyle (a\wedge c)\vee (b\wedge c)=((a\wedge c)\vee b)\wedge c.}$ (Modular identity)
This condition is equivalent to the following axiom: ${\displaystyle a\leq c}$ implies ${\displaystyle a\vee (b\wedge c)=(a\vee b)\wedge c.}$ (Modular law)
A lattice is modular if and only if it does not have a sublattice isomorphic to N₅ (shown in Pic. 11).^[7] Besides distributive lattices, examples of modular lattices are the lattice of submodules of a module (hence modular), the lattice of two-sided ideals of a ring, and the lattice of normal subgroups of a group. The set of first-order terms with the ordering "is more specific than" is a non-modular lattice used in automated reasoning.

A finite lattice is modular if and only if it is both upper and lower semimodular. For a graded lattice, (upper) semimodularity is equivalent to the following condition on the rank function ${\displaystyle r\colon }$

${\displaystyle r(x)+r(y)\geq r(x\wedge y)+r(x\vee y).}$

Another equivalent (for graded lattices) condition is Birkhoff's condition:

for each ${\displaystyle x}$ and ${\displaystyle y}$ in ${\displaystyle L,}$ if ${\displaystyle x}$ and ${\displaystyle y}$ both cover ${\displaystyle x\wedge y,}$ then ${\displaystyle x\vee y}$ covers both ${\displaystyle x}$ and ${\displaystyle y.}$

A lattice is called lower semimodular if its dual is semimodular. For finite lattices this means that the previous conditions hold with ${\displaystyle \vee }$ and ${\displaystyle \wedge }$ exchanged, "covers" exchanged with "is covered by", and inequalities reversed.^[9]

In domain theory, it is natural to seek to approximate the elements in a partial order by "much simpler" elements. This leads to the class of continuous posets, consisting of posets where every element can be obtained as the supremum of a directed set of elements that are way-below the element. If one can additionally restrict these to the compact elements of a poset for obtaining these directed sets, then the poset is even algebraic. Both concepts can be applied to lattices as follows:

• A continuous lattice is a complete lattice that is continuous as a poset.
• An algebraic lattice is a complete lattice that is algebraic as a poset.

Both of these classes have interesting properties. For example, continuous lattices can be characterized as algebraic structures (with infinitary operations) satisfying certain identities. While such a characterization is not known for algebraic lattices, they can be described "syntactically" via Scott information systems.

Let ${\displaystyle L}$ be a bounded lattice with greatest element 1 and least element 0. Two elements ${\displaystyle x}$ and ${\displaystyle y}$ of ${\displaystyle L}$ are complements of each other if and only if: $${\displaystyle x\vee y=1\quad {\text{ and }}\quad x\wedge y=0.}$$

In general, some elements of a bounded lattice might not have a complement, and others might have more than one complement. For example, the set ${\displaystyle \{0,1/2,1\}}$ with its usual ordering is a bounded lattice, and ${\displaystyle {\tfrac {1}{2}}}$ does not have a complement. In the bounded lattice N₅, the element ${\displaystyle a}$ has two complements, viz. ${\displaystyle b}$ and ${\displaystyle c}$ (see Pic. 11). A bounded lattice for which every element has a complement is called a complemented lattice.

A complemented lattice that is also distributive is a Boolean algebra. For a distributive lattice, the complement of ${\displaystyle x,}$ when it exists, is unique.

In the case that the complement is unique, we write ${\textstyle \lnot x=y}$ and equivalently, ${\textstyle \lnot y=x.}$ The corresponding unary operation over ${\displaystyle L,}$ called complementation, introduces an analogue of logical negation into lattice theory.

Heyting algebras are an example of distributive lattices where some members might be lacking complements. Every element ${\displaystyle z}$ of a Heyting algebra has, on the other hand, a pseudo-complement, also denoted ${\textstyle \lnot x.}$ The pseudo-complement is the greatest element ${\displaystyle y}$ such that ${\displaystyle x\wedge y=0.}$ If the pseudo-complement of every element of a Heyting algebra is in fact a complement, then the Heyting algebra is in fact a Boolean algebra.

A chain from ${\displaystyle x_{0}}$ to ${\displaystyle x_{n}}$ is a set ${\displaystyle \left\{x_{0},x_{1},\ldots ,x_{n}\right\},}$ where ${\displaystyle x_{0}<x_{1}<x_{2}<\ldots <x_{n}.}$ The length of this chain is n, or one less than its number of elements. A chain is maximal if ${\displaystyle x_{i}}$ covers ${\displaystyle x_{i-1}}$ for all ${\displaystyle 1\leq i\leq n.}$

If for any pair, ${\displaystyle x}$ and ${\displaystyle y,}$ where ${\displaystyle x<y,}$ all maximal chains from ${\displaystyle x}$ to ${\displaystyle y}$ have the same length, then the lattice is said to satisfy the Jordan–Dedekind chain condition.

A lattice ${\displaystyle (L,\leq )}$ is called graded, sometimes ranked (but see Ranked poset for an alternative meaning), if it can be equipped with a rank function ${\displaystyle r:L\to \mathbb {N} }$ sometimes to ${\displaystyle \mathbb {Z} }$, compatible with the ordering (so ${\displaystyle r(x)<r(y)}$ whenever ${\displaystyle x<y}$) such that whenever ${\displaystyle y}$ covers ${\displaystyle x,}$ then ${\displaystyle r(y)=r(x)+1.}$ The value of the rank function for a lattice element is called its rank.

A lattice element ${\displaystyle y}$ is said to cover another element ${\displaystyle x,}$ if ${\displaystyle y>x,}$ but there does not exist a ${\displaystyle z}$ such that ${\displaystyle y>z>x.}$ Here, ${\displaystyle y>x}$ means ${\displaystyle x\leq y}$ and ${\displaystyle x\neq y.}$

Any set ${\displaystyle X}$ may be used to generate the free semilattice ${\displaystyle FX.}$ The free semilattice is defined to consist of all of the finite subsets of ${\displaystyle X,}$ with the semilattice operation given by ordinary set union. The free semilattice has the universal property. For the free lattice over a set ${\displaystyle X,}$ Whitman gave a construction based on polynomials over ${\displaystyle X}$'s members.^[10][11]

We now define some order-theoretic notions of importance to lattice theory. In the following, let ${\displaystyle x}$ be an element of some lattice ${\displaystyle L.}$ ${\displaystyle x}$ is called:

• Join irreducible if ${\displaystyle x=a\vee b}$ implies ${\displaystyle x=a{\text{ or }}x=b.}$ for all ${\displaystyle a,b\in L.}$ If ${\displaystyle L}$ has a bottom element ${\displaystyle 0,}$ some authors require ${\displaystyle x\neq 0}$.^[12] When the first condition is generalized to arbitrary joins ${\displaystyle \bigvee _{i\in I}a_{i},}$ ${\displaystyle x}$ is called completely join irreducible (or ${\displaystyle \vee }$-irreducible). The dual notion is meet irreducibility (${\displaystyle \wedge }$-irreducible). For example, in Pic. 2, the elements 2, 3, 4, and 5 are join irreducible, while 12, 15, 20, and 30 are meet irreducible. Depending on definition, the bottom element 1 and top element 60 may or may not be considered join irreducible and meet irreducible, respectively. In the lattice of real numbers with the usual order, each element is join irreducible, but none is completely join irreducible.
• Join prime if ${\displaystyle x\leq a\vee b}$ implies ${\displaystyle x\leq a{\text{ or }}x\leq b.}$ Again some authors require ${\displaystyle x\neq 0}$, although this is unusual.^[13] This too can be generalized to obtain the notion completely join prime. The dual notion is meet prime. Every join-prime element is also join irreducible, and every meet-prime element is also meet irreducible. The converse holds if ${\displaystyle L}$ is distributive.

Let ${\displaystyle L}$ have a bottom element 0. An element ${\displaystyle x}$ of ${\displaystyle L}$ is an atom if ${\displaystyle 0<x}$ and there exists no element ${\displaystyle y\in L}$ such that ${\displaystyle 0<y<x.}$ Then ${\displaystyle L}$ is called:

• Atomic if for every nonzero element ${\displaystyle x}$ of ${\displaystyle L,}$ there exists an atom ${\displaystyle a}$ of ${\displaystyle L}$ such that ${\displaystyle a\leq x;}$^[14]
• Atomistic if every element of ${\displaystyle L}$ is a supremum of atoms.^[15]

However, many sources and mathematical communities use the term "atomic" to mean "atomistic" as defined above.^{[citation needed]}

The notions of ideals and the dual notion of filters refer to particular kinds of subsets of a partially ordered set, and are therefore important for lattice theory. Details can be found in the respective entries.

• Join and meet – Concept in order theory
• Map of lattices – Concept in mathematics
• Orthocomplemented lattice
• Total order – Order whose elements are all comparable
• Ideal – Nonempty, upper-bounded, downward-closed subset and filter (dual notions)
• Skew lattice – Algebraic StructurePages displaying wikidata descriptions as a fallback (generalization to non-commutative join and meet)
• Eulerian lattice
• Post's lattice – lattice of all clones (sets of logical connectives closed under composition and containing all projections) on a two-element set {0, 1}, ordered by inclusionPages displaying wikidata descriptions as a fallback
• Tamari lattice – mathematical object formed by an order on the way of parenthesing an expressionPages displaying wikidata descriptions as a fallback
• Young–Fibonacci lattice
• 0,1-simple lattice

This article is in list format but may read better as prose. You can help by converting this article, if appropriate. Editing help is available. (March 2017)

Note that in many applications the sets are only partial lattices: not every pair of elements has a meet or join.

• Pointless topology
• Lattice of subgroups
• Spectral space
• Invariant subspace
• Closure operator
• Abstract interpretation
• Subsumption lattice
• Fuzzy set theory
• Algebraizations of first-order logic
• Semantics of programming languages
• Domain theory
• Ontology (computer science)
• Multiple inheritance
• Formal concept analysis and Lattice Miner (theory and tool)
• Bloom filter
• Information flow
• Ordinal optimization
• Quantum logic
• Median graph
• Knowledge space
• Regular language learning
• Analogical modeling