closure map
Let be a poset. A function is called a closure map if
- •
is order preserving,
- •
,
- •
is idempotent: .
If the second condition is changed to , then is called a dual closure map on .
For example, the real function such that is the least integer greater than or equal to is a closure map (see Archimedean property). The rounding function is an example of a dual closure map.
A fixed point of a closure map on is an element such that . It is evident that every image point of is a fixed point: for if for some , then .
In the example above, any integer is a fixed point of .
Every closure map can be characterized by an interesting decomposition property: is a closure map iff there is a set and a residuated function such that , where denotes the residual of .
Again, in the example above, , where is the function taking any real number to the largest integer smaller than . is residuated, and its residual is .
Remark. Closure maps are generalizations to closure operator on a set (see the parent entry). Indeed, any closure operator on a set takes a subset of to a subset of satisfying the closure axioms, where Axiom 2 corresponds to condition 2 above, and Axiom 3 says the operator is idempotent. To see that the operator is order preserving, suppose . Then by Axiom 4, and hence . Axiom 1 says that the empty set
is a fixed point of the operator. However, in general, this is not the case, for may not even have a minimal element, as indicated by the above example.
References
- 1 T.S. Blyth, Lattices and Ordered Algebraic Structures
, Springer, New York (2005).