In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets.
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
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.
Read more about Completely Distributive Lattice: Alternative Characterizations, Properties, Free Completely Distributive Lattices, Examples
Famous quotes containing the word completely:
“In compensation for considerable disgust, despondency, and boredomsuch as living in solitude without friends, books, duties, or passions necessarily entailswe are given those quarter-hours of deepest communion with ourselves and nature. Those who completely barricade themselves from boredom, barricade themselves from themselves as well: they will never get to drink the most refreshingly potent draught from the their own innermost fountain.”
—Friedrich Nietzsche (18441900)