Lably
Skip to content

Completely distributive lattice

  • 2 min read
  • 4 chapters

Related on Lably

Through Monotonic function and Power set

Formally, a complete lattice L is said to be completely distributive if, for any doubly indexed family {xj,k | j in J, k in Kj} of L, we have

⋀j∈J⋁k∈Kjxj,k=⋁f∈F⋀j∈Jxj,f(j)

where F is the set of choice functions f choosing for each index j of J some index f(j) in Kj.

Complete distributivity is a self-dual property, i.e. dualizing the above statement yields the same class of complete lattices.

Alternative characterizations

Various different characterizations exist. For example, the following is an equivalent law that avoids the use of choice functions. For any set S of sets, we define the set S# to be the set of all subsets X of the complete lattice that have non-empty intersection with all members of S. We then can define complete distributivity via the statement

⋀{⋁Y∣Y∈S}=⋁{⋀Z∣Z∈S#}

The operator ( )# might be called the crosscut operator. This version of complete distributivity only implies the original notion when admitting the Axiom of Choice.


Sign in to keep reading

3 more chapters are free with a Lably account.

More in Topics in mathematics