An Identity of Distributive Lattices
Abstract
In a finite distributive lattice we define two functions s(α)=|\δ ∈ L | δ ≤ α \| and l(α)=|\δ ∈ L | δ ≥ α \|. In this present article we prove that the sum of these two functions over a finite distributive lattice are equal. Using this identity we give a formula for the number of non-comparable pairs of elements in a finite distributive lattice.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.