Closure (mathematics)


Closure (mathematics)

In mathematics, a set is said to be closed under some operation if performance of that operation on members of the set always produces a unique member of the same set. For example, the real numbers are closed under subtraction, but the natural numbers are not: 3 and 8 are both natural numbers, but the result of 3 − 8 is not. 0 is a closed set under multiplication.

Similarly, a set is said to be closed under a collection of operations if it is closed under each of the operations individually.

A set that is closed under an operation or collection of operations is said to satisfy a closure property. Often a closure property is introduced as an axiom, which is then usually called the axiom of closure. Note that modern set-theoretic definitions usually define operations as maps between sets, so adding closure to a structure as an axiom is superfluous, though it still makes sense to ask whether subsets are closed. For example, the set of real numbers is closed under subtraction, where (as mentioned above) its subset of natural numbers is not.

When a set S is not closed under some operations, one can usually find the smallest set containing S that is closed. This smallest closed set is called the closure of S (with respect to these operations). For example, the closure under subtraction of the set of natural numbers, viewed as a subset of the real numbers, is the set of integers. An important example is that of topological closure. The notion of closure is generalized by Galois connection, and further by monads.

Note that the set S must be a subset of a closed set in order for the closure operator to be defined. In the preceding example, it is important that the reals are closed under subtraction; in the domain of the natural numbers subtraction is not always defined.

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 smallest closed set containing one that isn't closed. In short, the closure of a set satisfies a closure property.

Contents

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 operator obeying several axioms, including an axiom 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 operation 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 and the unary operation of inversion satisfy the closure axiom.

An operation of a different sort is that of finding the limit points of a subset of a topological space (if the space is first-countable, it suffices to restrict consideration to the limits of sequences but in general one must consider at least 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. Closed intervals like [1,2] = {x: 1 ≤ x ≤ 2} are closed in this sense.

A partially ordered set is downward closed (and also called a lower set) if for every element of the set all smaller elements are also in it; this applies for example for the real intervals (−∞, p) and (−∞, p], and for an ordinal number p represented as interval [ 0, p); every downward closed set of ordinal numbers is itself an ordinal number.

Upward closed and upper set are defined similarly.

P closures of binary relations

The notion of a closure can be generalized for an arbitrary binary relation RS×S, and an arbitrary property P in the following way: the P closure of R is the least relation QS×S that contains R (i.e. RQ) and for which property P holds (i.e. P(Q) is true). For instance, one can define the symmetric closure as the least symmetric relation containing R. This generalization is often encountered in the theory of rewriting systems, where one often uses more "wordy" notions such as the reflexive transitive closure R*—the smallest preorder containing R, or the reflexive transitive symmetric closure R—the smallest equivalence relation containing R, and therefore also known as the equivalence closure. For arbitrary P and R, the P closure of R need not exist. In the above examples, these exist because reflexivity, transitivity and symmetry are closed under arbitrary intersections. In such cases, the P closure can be directly defined as the intersection of all sets with property P containing R.[1]

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 if 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

See Also

References

  1. ^ * Franz Baader and Tobias Nipkow, Term Rewriting and All That, Cambridge University Press, 1998, pp. 8–9

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Closure — may refer to: Closure (container) used to seal a bottle, jug, jar, can, or other container Closure (wine bottle), a stopper Closure (business), the process by which an organization ceases operations Closure (philosophy), a principle in… …   Wikipedia

  • Closure with a twist — is a property of subsets of an algebraic structure. A subset Y of an algebraic structure X is said to exhibit closure with a twist if for every two elements there exists an automorphism ϕ of X and an element such that …   Wikipedia

  • Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y)   (cl… …   Wikipedia

  • Closure (computer science) — In computer science, a closure (also lexical closure, function closure, function value or functional value) is a function together with a referencing environment for the non local variables of that function.[1] A closure allows a function to… …   Wikipedia

  • Closure (topology) — For other uses, see Closure (disambiguation). In mathematics, the closure of a subset S in a topological space consists of all points in S plus the limit points of S. Intuitively, these are all the points that are near S. A point which is in the… …   Wikipedia

  • Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines …   Wikipedia

  • Ring (mathematics) — This article is about algebraic structures. For geometric rings, see Annulus (mathematics). For the set theory concept, see Ring of sets. Polynomials, represented here by curves, form a ring under addition and multiplication. In mathematics, a… …   Wikipedia

  • Field (mathematics) — This article is about fields in algebra. For fields in geometry, see Vector field. For other uses, see Field (disambiguation). In abstract algebra, a field is a commutative ring whose nonzero elements form a group under multiplication. As such it …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.