By setting I=J={1,2} and K={(1,1),(2,1),(2,2)}, then K⁢(1)={1}, K⁢(2)={1,2}, and A consists of two functions{(1,1),(2,1)} and {(1,1),(2,2)}. Then, the equation above reads:

(x11)∧(x21∨x22)=(x11∧x21)∨(x11∧x22)

which is one of the distributive laws, so that complete distributivity implies distributivity.

More generally, setting I={1,2} and J containing 1 but otherwise arbitrary, and K={(2,j)∣j∈J}∪{(1,1)}. Then K⁢(1)={1}, K⁢(2)=J, and A is the set of functions from I to J fixing 1, and the equation (1) above now looks like

Dualizing the above equation results in the same lattice. In other words, a completely distributive lattice may be equivalently defined using the dual of Equation (1). As a result, a completely distributive lattice also satisfies MID, and hence is infinite distributive.

2.

However, a completedistributive lattice does not have to be completely distributive. Here’s an example: let ℕ be the set of natural numbers with the usual ordering, and ℕ′ be an identical copy of ℕ such that each natural numbern corresponds to n′∈ℕ′. Then ℕ′ has a natural ordering induced by the usual ordering on ℕ. Take the union N of these two sets. Then N becomes a lattice if we extend the meets and joins on ℕ and ℕ′ by additionally setting

a′∨b:={a′if ⁢b≤a,b′otherwise.

and

a′∧b:={bif ⁢b≤a,aotherwise.

Finally, let L be the lattice formed from N by adjoining an extra element∞ to be its top element. It is not hard to see that L is complete and distributive. However, L is not completely distributive, for 0′∧(⋁{a∣a∈ℕ})=0′∧∞=0′, whereas ⋁{0′∧a∣a∈ℕ}=⋁{0}=0≠0′.

3.

In some literature, completeness assumption is not required, so that the equation (1) above is conditionally defined. In other words, the equation is defined only when each side of the equation exists first.

4.

Another generalization is the so-called (𝔪,𝔫)-distributivity, where 𝔪 and 𝔫 are cardinal numbers. Specifically, a lattice L is (𝔪,𝔫)-distributive if it is complete and equation (1) is true whenever I has cardinality≤𝔪 and each K⁢(i) has cardinality ≤𝔫 for each i∈I.