Closure operator


In mathematics, a closure operator on a set S is a function from the power set of S to itself that satisfies the following conditions for all sets
Closure operators are determined by their closed sets, i.e., by the sets of the form cl, since the closure cl of a set X is the smallest closed set containing X. Such families of "closed sets" are sometimes called closure systems or "Moore families", in honor of E. H. Moore who studied closure operators in his 1910 Introduction to a form of general analysis, whereas the concept of the closure of a subset originated in the work of Frigyes Riesz in connection with topological spaces. Though not formalized at the time, the idea of closure originated in the late 19th century with notable contributions by Ernst Schröder, Richard Dedekind
and George Cantor.
Closure operators are also called "hull operators", which prevents confusion with the "closure operators" studied in topology. A set together with a closure operator on it is sometimes called a closure space.

Applications

Closure operators have many applications:
In topology, the closure operators are topological closure operators, which must satisfy
for all .
In algebra and logic, many closure operators are finitary closure operators, i.e. they satisfy
In universal logic, closure operators are also known as consequence operators.
In the theory of partially ordered sets, which are important in theoretical computer science, closure operators have a more general definition that replaces with.

Closure operators in topology

The topological closure of a subset X of a topological space consists of all points y of the space, such that every neighbourhood of y contains a point of X. The function that associates to every subset X its closure is a topological closure operator. Conversely, every topological closure operator on a set gives rise to a topological space whose closed sets are exactly the closed sets with respect to the closure operator.

Closure operators in algebra

Finitary closure operators play a relatively prominent role in universal algebra, and in this context they are traditionally called algebraic closure operators. Every subset of an algebra generates a subalgebra: the smallest subalgebra containing the set. This gives rise to a finitary closure operator.
Perhaps the best known example for this is the function that associates to every subset of a given vector space its linear span. Similarly, the function that associates to every subset of a given group the subgroup generated by it, and similarly for fields and all other types of algebraic structures.
The linear span in a vector space and the similar algebraic closure in a field both satisfy the exchange property: If x is in the closure of the union of A and but not in the closure of A, then y is in the closure of the union of A and. A finitary closure operator with this property is called a matroid. The dimension of a vector space, or the transcendence degree of a field is exactly the rank of the corresponding matroid.
The function that maps every subset of a given field to its algebraic closure is also a finitary closure operator, and in general it is different from the operator mentioned before. Finitary closure operators that generalize these two operators are studied in model theory as dcl and acl.
The convex hull in n-dimensional Euclidean space is another example of a finitary closure operator. It satisfies the anti-exchange property: If x is not contained in the union of A and, but in its closure, then y is not contained in the closure of the union of A and. Finitary closure operators with this property give rise to antimatroids.
As another example of a closure operator used in algebra, if some algebra has universe A and X is a set of pairs of A, then the operator assigning to X the smallest congruence containing X is a finitary closure operator on A x A.

Closure operators in logic

Suppose you have some logical formalism that contains certain rules allowing you to derive new formulas from given ones. Consider the set F of all possible formulas, and let P be the power set of F, ordered by ⊆. For a set X of formulas, let cl be the set of all formulas that can be derived from X. Then cl is a closure operator on P. More precisely, we can obtain cl as follows. Call "continuous" an operator J such that, for every directed class T,
This continuity condition is on the basis of a fixed point theorem for J. Consider the one-step operator J of a monotone logic. This is the operator associating any set X of formulas with the set J of formulas that are either logical axioms or are obtained by an inference rule from formulas in X or are in X. Then such an operator is continuous and we can define cl as the least fixed point for J greater or equal to X. In accordance with such a point of view, Tarski, Brown, Suszko and other authors proposed a general approach to logic based on closure operator theory. Also, such an idea is proposed in programming logic and in fuzzy logic.

Consequence operators

Around 1930, Alfred Tarski developed an abstract theory of logical deductions that models some properties of logical calculi. Mathematically, what he described is just a finitary closure operator on a set. In universal logic and abstract algebraic logic, finitary closure operators are still studied under the name consequence operator, which was coined by Tarski. The set S represents a set of sentences, a subset T of S a theory, and cl is the set of all sentences that follow from the theory. Nowadays the term can refer to closure operators that need not be finitary; finitary closure operators are then sometimes called finite consequence operators.

Closed and pseudo-closed sets

The closed sets with respect to a closure operator on S form a subset C of the power set P. Any intersection of sets in C is again in C. In other words, C is a complete meet-subsemilattice of P. Conversely, if C ⊆ P 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.
There is a simple and fast algorithm for generating all closed sets of a given 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. Even for non-topological closure operators, C can be seen as having the structure of a lattice. being cl But then C is not a sublattice of the lattice P.
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.
Each closure operator on a finite set S is uniquely determined by its images of its pseudo-closed sets.
These are recursively defined: A set is pseudo-closed if it is not closed and contains the closure of each of its pseudo-closed proper subsets. Formally: P ⊆ S is pseudo-closed if and only if
A partially ordered set is a set together with a partial order ≤, i.e. a binary relation that is reflexive, transitive and antisymmetric. Every power set P together with inclusion ⊆ is a partially ordered set.
A function cl: P → P from a partial order P to itself is called a closure operator if it satisfies the following axioms for all elements x, y in P.
More succinct alternatives are available: the definition above is equivalent to the single axiom
for all x, y in P.
Using the pointwise order on functions between posets, one may alternatively write the extensiveness property as idP ≤ cl, where id is the identity function. A self-map k that is increasing and idempotent, but satisfies the dual of the extensiveness property, i.e. k ≤ idP is called a kernel operator, interior operator, or dual closure. As examples, if A is a subset of a set B, then the self-map on the powerset of B given by μA = A ∪ X is a closure operator, whereas λA = A ∩ X is a kernel operator. The ceiling function from the real numbers to the real numbers, which assigns to every real x the smallest integer not smaller than x, is another example of a closure operator.
A fixpoint of the function cl, i.e. an element c of P that satisfies cl = c, is called a closed element. A closure operator on a partially ordered set is determined by its closed elements. If c is a closed element, then x ≤ c and cl ≤ c are equivalent conditions.
Every Galois connection gives rise to a closure operator. In fact, every closure operator arises in this way from a suitable Galois connection. The Galois connection is not uniquely determined by the closure operator. One Galois connection that gives rise to the closure operator cl can be described as follows: if A is the set of closed elements with respect to cl, then cl: P → A is the lower adjoint of a Galois connection between P and A, with the upper adjoint being the embedding of A into P. Furthermore, every lower adjoint of an embedding of some subset into P is a closure operator. "Closure operators are lower adjoints of embeddings." Note however that not every embedding has a lower adjoint.
Any partially ordered set P can be viewed as a category, with a single morphism from x to y if and only if x ≤ y. The closure operators on the partially ordered set P are then nothing but the monads on the category P. Equivalently, a closure operator can be viewed as an endofunctor on the category of partially ordered sets that has the additional idempotent and extensive properties.
If P is a complete lattice, then a subset A of P is the set of closed elements for some closure operator on P if and only if A is a Moore family on P, i.e. the largest element of P is in A, and the infimum of any non-empty subset of A is again in A. Any such set A is itself a complete lattice with the order inherited from P. When P is the powerset Boolean algebra of a set X, then a Moore family on P is called a closure system on X.
The closure operators on P form themselves a complete lattice; the order on closure operators is defined by cl1 ≤ cl2 iff cl1 ≤ cl2 for all x in P.