Closure (mathematics)
From Free net encyclopedia
In mathematics, a set is said to be closed under some operation if the operation takes members of the set to inside the set. For example, the real numbers are closed under subtraction, but the natural numbers are not. A set with an operation together are said to satisfy the axiom of closure if the set is closed under that operation.
When a set S is not closed under some operation, one can usually find the smallest subset containing it which is closed. This new closed set is called the closure of S. For example, the closure under subtraction in the reals of the natural numbers is the integers. Note that the set S must be a subset of a closed set in order for the closure operator to be defined. It is important here that the reals be closed under subtraction.
The two uses of the word "closure" should not be confused. The former usage refers to the property of being closed, and the latter refers to the process of creating a privileged closed set out of one that isn't closed. In short, the closure of a set satisfies the axiom of closure.
Closed sets
A set is closed under an operation if that operation returns a member of the set when evaluated on members of the set. Sometimes the requirement that the operation be valued in a set is explicitly stated, in which case it is known as the axiom of closure. For example, one may define a group as a set with a binary product such that the product of any two elements of the group is again an element. However the modern definition of an operation makes this axiom superfluous; an n-ary operator on S is just a subset of Sn+1. By its very definition, an operator on a set cannot have values outside the set.
Nevertheless, the closure property of an operator on a set still has some utility. Closure on a set does not necessarily imply closure on all subsets. Thus a subgroup of a group is a subset on which the binary product satisfies the closure axiom.
An operation of a different sort is that of adjoining to a subset of a topological space the limit points of the subset (if the space is first countable, it suffices to consider the limits of sequences but in general one must consider limits of nets). A set that is closed under this operation is usually just referred to as a closed set in the context of topology. Without any further qualification, the phrase usually means closed in this sense.
Closure operator
Given an operation on a set X, one can define the closure C(S) of a subset S in X to be the smallest subset closed under that operation that contains S as a subset. For example, the closure of a subset of a group is the subgroup generated by that set.
The closure of sets with respect to some operation defines a closure operator on the subsets of X. The closed sets can be determined from the closure operator; a set is closed iff it is equal to its own closure. Typical structural properties of all closure operations are:
- The closure is increasing or extensive: the closure of an object contains the object.
- The closure is idempotent: the closure of the closure equals the closure.
- The closure is monotone, that is, if X is contained in Y, then also C(X) is contained in C(Y).
An object that is its own closure is called closed. By idempotency, an object is closed if and only if it is the closure of some object.
These three properties define an abstract closure operator. Typically, an abstract closure acts on the class of all subsets of a set.
Examples
- In topology and related branches, the topological closure of a set.
- In linear algebra, the linear span of a set X of vectors is the closure of that set; it is the smallest subset of the vector space that includes X and is a subspace.
- In matroid theory, the closure of X is the largest superset of X that has the same rank as X.
- In set theory, the transitive closure of a binary relation.
- In algebra, the algebraic closure of a field.
- In commutative algebra, closure operations for ideals, as integral closure and tight closure.
- In geometry, the convex hull of a set S of points is the smallest convex set of which S is a subset.
- In the theory of formal languages, the Kleene closure of a language can be described as the set of strings that can be made by concatenating zero or more strings from that language.de:Hüllenoperator
ko:닫힘 (수학) it:Chiusura induttiva nl:Afsluiting (topologie) ja:生成 (数学) ru:Замыкание (математика) zh:封闭性