Closed Sets
The closed sets with respect to a closure operator on S form a subset C of the power set P(S). Any intersection of sets in C is again in C. In other words, C is a complete meet-subsemilattice of P(S). Conversely, if C ⊆ P(S) is closed under arbitrary intersections, then the function that associates to every subset X of S the smallest set Y ∈ C such that X ⊆ Y is a closure operator.
A closure operator on a set is topological if and only if the set of closed sets is closed under finite unions, i.e., C is a meet-complete sublattice of P(S). Even for non-topological closure operators, C can be seen as having the structure of a lattice. (The join of two sets X,Y ⊆ P(S) being cl(X Y).) But then C is not a sublattice of the lattice P(S).
Given a finitary closure operator on a set, the closures of finite sets are exactly the compact elements of the set C of closed sets. It follows that C is an algebraic poset. Since C is also a lattice, it is often referred to as an algebraic lattice in this context. Conversely, if C is an algebraic poset, then the closure operator is finitary.
Read more about this topic: Consequence Operator
Famous quotes containing the words closed and/or sets:
“My old Father used to have a saying that “If you make a bad bargain, hug it the tighter”; and it occurs to me, that if the bargain you have just closed [marriage] can possibly be called a bad one, it is certainly the most pleasant one for applying that maxim to, which my fancy can, by any effort, picture.”
—Abraham Lincoln (1809–1865)
“And weren’t there special cemetery flowers,
That, once grief sets to growing, grief may rest:
The flowers will go on with grief awhile,
And no one seem neglecting or neglected?
A prudent grief will not despise such aids.”
—Robert Frost (1874–1963)