Lattices

supposed a poset <s, ≤>, if it has a supermum and infimum so we will call  <s, ≤> Lattices.

• Reflexivity:   ∀x ∈ S :  x ≤ x

• Transitivity:   ∀x, y, z ∈ S : x ≤ y ∧ y ⊑ z ⇒ x ≤ z

• Anti-symmetry: ∀x, y ∈ S : x ≤ y ∧ y ⊑ x ⇒ x = y

Let X ⊆ S. We say that

§ y ∈ S is an upper bound for X, written X ≤ y,

                         if we have  ∀x ∈ X : x ≤ y

§ y ∈ S is a lower bound for X, written y ≤ X,

                        if we have ∀x ∈ X : y ≤ x

A least upper bound (lub, join, supremum, sup), written lubX, is defined by:

X ≤ _lubX ∧ (∀y ∈ S : X ≤ y ⇒ _lubX ≤ y)

A greatest lower bound (glb, meet, infimum, inf), written _glbX, is defined by:

_glbX ≤ X ∧ (∀y ∈ S : y ≤ X ⇒ y ≤ _glbX)

Fixed-Points
A function f : L→ L is monotone when ∀x; y ∈ S : x ≤ y ⇒ f(x)≤ f(y).
Note that this property does not imply that f is increasing; for example, all constant functions are monotone. Viewed as functions t and u are monotone in both arguments. Note that the composition of monotone functions is again monotone.
The central result we need is the fixed-point theorem. In a lattice L with
nite height, every monotone function f has a unique least xed-point defined
as:

fix (f) =  lub f i (⊥)

                            i³0

for which f(fix(f)) = fix(f).

The time complexity of computing a fixed-point depends on three factors:
the height of the lattice, since this provides a bound for k;
the cost of computing f;
the cost of testing equality.