# Lattice (order)

Last updated

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 two elements have 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 natural numbers, partially ordered by divisibility, for which the unique supremum is the least common multiple and the unique infimum is the greatest common divisor.

## Contents

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.

## Lattices as partially ordered sets

If ${\displaystyle (L,\leq )}$ is a partially ordered set (poset), and ${\displaystyle S\subseteq L}$ is an arbitrary subset, then an element ${\displaystyle u\in L}$ is said to be an upper bound of ${\displaystyle S}$ if ${\displaystyle s\leq u}$ for each ${\displaystyle s\in S.}$ A set may have many upper bounds, or none at all. An upper bound ${\displaystyle u}$ of ${\displaystyle S}$ is said to be its least upper bound, or join , or supremum, if ${\displaystyle u\leq x}$ for each upper bound ${\displaystyle x}$ of ${\displaystyle S.}$ A set need not have a least upper bound, but it cannot have more than one. [note 1] Dually, ${\displaystyle l\in L}$ is said to be a lower bound of ${\displaystyle S}$ if ${\displaystyle l\leq s}$ for each ${\displaystyle s\in S.}$ A lower bound ${\displaystyle l}$ of ${\displaystyle S}$ is said to be its greatest lower bound, or meet , or infimum, if ${\displaystyle x\leq l}$ for each lower bound ${\displaystyle x}$ of ${\displaystyle S.}$ A set may have many lower bounds, or none at all, but can have at most one greatest lower bound. [note 1]

A partially ordered set ${\displaystyle (L,\leq )}$ is called a join-semilattice if each two-element subset ${\displaystyle \{a,b\}\subseteq L}$ has a join (i.e. least upper bound, denoted by ${\displaystyle a\vee b}$), and is called a meet-semilattice if each two-element subset has a meet (i.e. greatest lower bound, denoted by ${\displaystyle a\wedge b}$). ${\displaystyle (L,\leq )}$ is called a lattice if it is both a join- and a meet-semilattice. 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.

A bounded lattice is a lattice that additionally has a greatest element (also called maximum, or top element, and denoted by 1, or by ${\displaystyle \,\top }$) and a least element (also called minimum, or bottom, denoted by 0 or by ${\displaystyle \,\bot }$), which satisfy

${\displaystyle 0\leq x\leq 1\;{\text{ for every }}x\in L.}$

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

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 ${\displaystyle \bigvee \varnothing =0,}$ and the meet of the empty set is the greatest element ${\displaystyle \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{\text{ and }}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 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.}$

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.}$

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 ℤ, compatible with the ordering (so ${\displaystyle r(y) whenever ${\displaystyle x) 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.

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]

## Lattices as algebraic structures

### General lattice

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}$ is a lattice if the following axiomatic identities hold 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. [note 2] Those 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.

### Bounded lattice

A bounded lattice is 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}$

See semilattice for further details.

### Connection to other algebraic structures

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.

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.

## Connection between the two definitions

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 ≤ 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.

## Examples

• 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. Set intersection and set union interpret meet and join, respectively (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 a 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.

## Examples of non-lattices

 Pic. 8: Non-lattice poset: ${\displaystyle a}$ and ${\displaystyle b}$ have common lower bounds ${\displaystyle 0,d,g,h,}$ and ${\displaystyle i,}$ but none of them is the greatest lower bound.
 Pic. 7: Non-lattice poset: ${\displaystyle b}$ and ${\displaystyle c}$ have common upper bounds ${\displaystyle d,e,}$ and ${\displaystyle f,}$ but none of them is the least upper bound.
 Pic. 6: Non-lattice poset: ${\displaystyle c}$ and ${\displaystyle d}$ have no common upper bound.

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).

## Morphisms of lattices

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).

## Sublattices

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.}$ [2]

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.}$

## Properties of lattices

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

### Completeness

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.

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

### Conditional completeness

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.

### Distributivity

 Pic. 11: Smallest non-modular (and hence non-distributive) lattice N5. The labelled elements violate the distributivity equation ${\displaystyle c\wedge (a\vee b)=(c\wedge a)\vee (c\wedge b),}$ but satisfy its dual ${\displaystyle c\vee (a\wedge b)=(c\vee a)\wedge (c\vee b).}$
 Pic. 10: Smallest non-distributive (but modular) lattice M3.

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 M3 and N5; [3] they are shown in Pictures 10 and 11, respectively. A lattice is distributive if and only if it doesn't have a sublattice isomorphic to M3 or N5. [4] Each distributive lattice is isomorphic to a lattice of sets (with union and intersection as join and meet, respectively). [5]

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.

### Modularity

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 doesn't have a sublattice isomorphic to N5 (shown in Pic. 11). [4] Besides distributive lattices, examples of modular lattices are the lattice of two-sided ideals of a ring, the lattice of submodules of a module, 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.

### Semimodularity

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:}$

${\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. [6]

### Continuity and algebraicity

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.

### Complements and pseudo-complements

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 N5, 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 the complement is unique, we write ¬x = y and equivalently, ¬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 ¬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.

### Jordan–Dedekind chain condition

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} 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 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.

## Free lattices

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. [7] [8]

## Important lattice-theoretic notions

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.}$ If ${\displaystyle L}$ has a bottom element ${\displaystyle 0,}$${\displaystyle x\neq 0}$ is sometimes required. ${\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.}$ 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. 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.}$ 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 and there exists no element ${\displaystyle y\in L}$ such that ${\displaystyle 0 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;}$
• Atomistic if every element of ${\displaystyle L}$ is a supremum of atoms.

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.

### Applications that use lattice theory

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

## Notes

1. If there were more, say ${\displaystyle x}$ and ${\displaystyle y}$, then all three relations ${\displaystyle x\neq y}$, ${\displaystyle x\leq y}$ and ${\displaystyle y\leq x}$ would have to be true, which is disallowed by the definition of a partially ordered set.
2. ${\displaystyle a\vee a=a\vee (a\wedge (a\vee a))=a,}$ and dually for the other idempotent law. Dedekind, Richard (1897), "Über Zerlegungen von Zahlen durch ihre grössten gemeinsamen Teiler", Braunschweiger Festschrift: 1–40.

## Related Research Articles

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.

In mathematics, a Heyting algebra is a bounded lattice equipped with a binary operation ab of implication such that ≤ b is equivalent to c ≤. From a logical standpoint, AB is by this definition the weakest proposition for which modus ponens, the inference rule AB, AB, is sound. Like Boolean algebras, Heyting algebras form a variety axiomatizable with finitely many equations. Heyting algebras were introduced by Arend Heyting (1930) to formalize intuitionistic logic.

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.

In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable.

Order theory is a branch of mathematics which investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of order-theoretic terms can be found in the order theory glossary.

This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be the following overview articles:

In the mathematical area of order theory, one often speaks about functions that preserve certain limits, i.e. certain suprema or infima. Roughly speaking, these functions map the supremum/infimum of a set to the supremum/infimum of the image of the set. Depending on the type of sets for which a function satisfies this property, it may preserve finite, directed, non-empty, or just arbitrary suprema or infima. Each of these requirements appears naturally and frequently in many areas of order theory and there are various important relationships among these concepts and other notions such as monotonicity. If the implication of limit preservation is inverted, such that the existence of limits in the range of a function implies the existence of limits in the domain, then one obtains functions that are limit-reflecting.

In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order and lattice theory.

In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). The most familiar example is the completeness of the real numbers. A special use of the term refers to complete partial orders or complete lattices. However, many other interesting notions of completeness exist.

In the mathematical area of order theory, there are various notions of the common concept of distributivity, applied to the formation of suprema and infima. Most of these apply to partially ordered sets that are at least lattices, but the concept can in fact reasonably be generalized to semilattices as well.

In mathematics, especially in order theory, a complete Heyting algebra is a Heyting algebra that is complete as a lattice. Complete Heyting algebras are the objects of three different categories; the category CHey, the category Loc of locales, and its opposite, the category Frm of frames. Although these three categories contain the same objects, they differ in their morphisms, and thus get distinct names. Only the morphisms of CHey are homomorphisms of complete Heyting algebras.

In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids are commonly axiomatized in two equivalent ways, either as a set system modeling the possible states of such a process, or as a formal language modeling the different sequences in which elements may be included. Dilworth (1940) was the first to study antimatroids, using yet another axiomatization based on lattice theory, and they have been frequently rediscovered in other contexts.

In the mathematical fields of order and domain theory, a Scott domain is an algebraic, bounded-complete cpo. They are named in honour of Dana S. Scott, who was the first to study these structures at the advent of domain theory. Scott domains are very closely related to algebraic lattices, being different only in possibly lacking a greatest element. They are also closely related to Scott information systems, which constitute a "syntactic" representation of Scott domains.

In mathematics, a join-semilattice is a partially ordered set that has a join for any nonempty finite subset. Dually, a meet-semilattice is a partially ordered set which has a meet for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa.

In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets.

In mathematics, a Riesz space, lattice-ordered vector space or vector lattice is a partially ordered vector space where the order structure is a lattice.

In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most famous and long-standing open problems in lattice theory; it had a deep impact on the development of lattice theory itself. The conjecture that every distributive lattice is a congruence lattice is true for all distributive lattices with at most 1 compact elements, but F. Wehrung provided a counterexample for distributive lattices with ℵ2 compact elements using a construction based on Kuratowski's free set theorem.

In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice. As free objects, they have the universal property.

In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ("poset"). Ordinal optimization has applications in the theory of queuing networks.

In mathematics, Birkhoff's representation theorem for distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations correspond to unions and intersections of sets. The theorem can be interpreted as providing a one-to-one correspondence between distributive lattices and partial orders, between quasi-ordinal knowledge spaces and preorders, or between finite topological spaces and preorders. It is named after Garrett Birkhoff, who published a proof of it in 1937.

## References

1. Grätzer 1996, p.  52.
2. Burris, Stanley N., and Sankappanavar, H. P., 1981. A Course in Universal Algebra. Springer-Verlag. ISBN   3-540-90578-2.
3. Davey & Priestley (2002), Exercise 4.1, p. 104.
4. Davey & Priestley (2002), Theorem 4.10, p. 89.
5. Davey & Priestley (2002), Theorem 10.21, pp. 238–239.
6. Stanley, Richard P, Enumerative Combinatorics (vol. 1), Cambridge University Press, pp. 103–104, ISBN   0-521-66351-2
7. Philip Whitman (1941). "Free Lattices I". Annals of Mathematics . 42: 325–329. doi:10.2307/1969001.
8. Philip Whitman (1942). "Free Lattices II". Annals of Mathematics. 43: 104–115. doi:10.2307/1968883.

Monographs available free online:

Elementary texts recommended for those with limited mathematical maturity:

• Donnellan, Thomas, 1968. Lattice Theory. Pergamon.
• Grätzer, George, 1971. Lattice Theory: First concepts and distributive lattices. W. H. Freeman.

The standard contemporary introductory text, somewhat harder than the above: