Definition:Bounded Lattice/Definition 2
Jump to navigation
Jump to search
This page has been identified as a candidate for refactoring. In particular:
Extract the axioms into a separate page, as is done in Group Theory.
Extract the axioms into a separate page, as is done in Group Theory.
Until this has been finished, please leave {{refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only.
Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
Definition
Let $\struct {S, \vee, \wedge, \preceq}$ be a lattice.
Let $\vee$ and $\wedge$ have identity elements $\bot$ and $\top$ respectively.
Then $\struct {S, \vee, \wedge, \preceq}$ is a bounded lattice.
Thus $\struct {S, \vee, \wedge, \preceq}$ is a bounded lattice if and only if the following axioms are satisfied:
| \((L0)\) | $:$ | Closure | \(\ds \forall a, b \in S:\) | \(\ds a \vee b \in S \) | \(\ds a \wedge b \in S \) | |||
| \((L1)\) | $:$ | Commutativity | \(\ds \forall a, b \in S:\) | \(\ds a \vee b = b \vee a \) | \(\ds a \wedge b = b \wedge a \) | |||
| \((L2)\) | $:$ | Associativity | \(\ds \forall a, b, c \in S:\) | \(\ds a \vee \paren {b \vee c} = \paren {a \vee b} \vee c \) | \(\ds a \wedge \paren {b \wedge c} = \paren {a \wedge b} \wedge c \) | |||
| \((L3)\) | $:$ | Idempotence | \(\ds \forall a \in S:\) | \(\ds a \vee a = a \) | \(\ds a \wedge a = a \) | |||
| \((L4)\) | $:$ | Absorption | \(\ds \forall a, b \in S:\) | \(\ds a \vee \paren {a \wedge b} = a \) | \(\ds a \wedge \paren {a \vee b} = a \) | |||
| \((L5)\) | $:$ | Identity elements | \(\ds \exists \top, \bot \in S: \forall a \in S:\) | \(\ds a \vee \bot = a = \bot \vee a \) | \(\ds a \wedge \top = a = \top \wedge a \) |