1 General definition

A closed set is a collection that remains unchanged when a specified closure condition is applied. The exact meaning depends on the mathematical setting. In some contexts, closure refers to an algebraic operation such as addition or multiplication; in others, it refers to a topological property or to logical consequence under rules of inference. In every case, the common idea is stability: once a set is closed, applying the relevant rule does not produce anything outside it.

Closed sets are typically discussed together with a closure process or closure operator. This process takes an arbitrary subset and enlarges it just enough to satisfy the required condition. The resulting set is then closed.

1.1 Closure conditions

A closure condition is the rule that determines whether a set counts as closed. It may require a set to contain all outputs of an operation applied to its elements, all limits of certain sequences, or all statements implied by a collection of premises. The condition is usually formulated so that the closed sets form a well-behaved family.

In many settings, closure conditions are designed to be minimal and stable. Minimality means that no unnecessary elements are added, while stability means that once the condition is satisfied, applying it again changes nothing.

1.2 Examples of closed sets

In algebra, a subgroup is closed under the group operation and taking inverses. In topology, a closed interval such as \([0,1]\) in the real line is closed in the usual topology. In formal logic, the set of all consequences of a theory is closed under the chosen inference rules.

Other examples include the set of multiples of a fixed integer, which is closed under addition, and the span of a collection of vectors, which is closed under linear combinations. These examples show that closedness can describe very different kinds of mathematical stability.

1.3 Closed sets versus open sets

Closed sets are often contrasted with open sets, especially in topology. Open sets are defined by local neighborhood conditions, while closed sets are usually described by complements or limit behavior. The two notions are not opposites in every sense, but they are complementary in a precise structural way.

A set may be both open and closed, neither, or one without the other, depending on the space. Such sets are called clopen. The relationship between open and closed sets is one of the central organizing ideas in topology.

2 In algebra

In algebra, closed sets are usually subsets that are stable under one or more operations. The operations may come from groups, rings, fields, modules, lattices, or other algebraic structures. Closedness ensures that the subset itself carries a compatible algebraic structure.

This idea is essential for defining substructures. A subset that is closed under the relevant operations can inherit laws from the larger system and become an algebraic object in its own right.

2.1 Closure under operations

Closure under operations means that applying an operation to elements of the set produces another element of the same set. For a binary operation, this means that if \(a\) and \(b\) are in the set, then so is \(a \ast b\). For several operations, the set must be stable under each one.

This property is what allows substructures to behave like smaller versions of the ambient structure. Without closure, the subset would not support the same algebraic manipulation.

2.1.1 Subgroups

A subgroup is a subset of a group that is closed under the group operation and inverses. It must also contain the identity element, which follows from the other conditions in many standard formulations. Subgroups inherit the group laws from the larger group.

Subgroups serve as a basic example of a closed set in algebra. They capture symmetry and internal structure in a way that is both rigid and useful.

2.1.2 Subrings and subfields

A subring is a subset of a ring that is closed under addition, subtraction, and multiplication, with the appropriate identity conditions depending on convention. A subfield is a subset of a field that is closed under addition, subtraction, multiplication, and division by nonzero elements. These conditions ensure that the subset itself forms a ring or field.

Such closed subsets are important in number theory and algebraic geometry. They provide smaller algebraic environments where computations and structural questions can be carried out.

2.2 Closure systems

A closure system is a family of sets that is stable under taking intersections. It is often the collection of all sets closed under some closure operator. Closure systems are closely related to ordered structures and lattice theory.

They are useful because they organize all closed sets of a given type into a coherent class. This makes it possible to study the abstract behavior of closure without focusing on a single example.

2.2.1 Intersection properties

One key feature of a closure system is that arbitrary intersections of its members remain in the system. This means that if several closed sets are combined by intersection, the result is still closed. The property reflects the idea that common information or shared constraints preserve the closure condition.

Intersection stability is one of the reasons closure systems are mathematically tractable. It often allows the smallest closed set containing a given subset to be constructed as an intersection of all closed sets containing that subset.

2.2.2 Generated closed sets

A generated closed set is the smallest closed set containing a specified subset. It is obtained by repeatedly applying the relevant closure condition until no new elements appear. In many frameworks, this is described as the closure of the subset.

Examples include the subgroup generated by a set of group elements, or the subspace generated by a set of vectors. The generated closed set is often the most natural closed object associated with the original subset.

3 In topology

In topology, closed sets are fundamental objects defined by the topology of a space. They encode how points can accumulate, how continuity behaves, and how spaces are decomposed. The collection of closed sets is determined by the chosen topology.

Topological closedness is not merely a geometric notion. It depends on the ambient space, so the same subset may be closed in one topology and not closed in another.

3.1 Closed sets in topological spaces

A closed set in a topological space is, by definition, a set whose complement is open. Equivalently, it may be specified as part of the topology itself, since open sets are usually taken as primitive and closed sets are then derived from them. Closed sets include many familiar examples from analysis, such as intervals of the form \([a,b]\) in the real numbers.

Their importance comes from the way they interact with continuity and compactness. Many central theorems in topology and analysis are stated in terms of closed sets.

3.2 Characterizations of closed sets

Closed sets can be recognized in several equivalent ways. These characterizations provide different viewpoints and are often convenient in different branches of mathematics. The most common are complement-based and limit-point-based descriptions.

Equivalent formulations are especially valuable because they connect topological intuition with formal proofs. A property that is difficult to verify directly may be easier to check through one of these alternative characterizations.

3.2.1 Complements of open sets

The most basic characterization of a closed set is that its complement is open. This follows directly from the axioms of a topology, which are built so that openness and closedness correspond through complementation. In practice, this is often the quickest way to verify closedness.

This duality means that many statements about open sets have closed-set counterparts obtained by reversing unions and intersections. As a result, the two notions are tightly linked throughout topology.

3.2.2 Limit point characterization

A set is closed if it contains all of its limit points. A limit point is a point around which every neighborhood contains points of the set, possibly other than the point itself. If all such points are already included, the set is closed.

This characterization is especially useful in analysis. It explains why closed sets capture the idea of being complete with respect to accumulation, without leaving out boundary points that are approached from within the set.

3.3 Properties of closed sets

Closed sets satisfy several standard set-theoretic properties in a topological space. These properties reflect the axioms of the topology and make closed sets a stable class under certain operations. They are the closed-set analogues of the axioms for open sets.

The behavior of closed sets under unions and intersections is one of the most frequently used parts of topology. It gives the collection of closed sets a clear algebra of its own.

3.3.1 Arbitrary intersections

Any intersection of closed sets is closed. This remains true even for infinitely many closed sets. The property follows from the dual fact that unions of open sets are open.

As a result, the intersection of all closed sets containing a given subset is again closed. This construction produces the closure of that subset in the topological sense.

3.3.2 Finite unions

A finite union of closed sets is closed. This is the dual of the fact that finite intersections of open sets are open. The restriction to finite unions is essential, since arbitrary unions of closed sets need not be closed.

This property makes closed sets stable under combining a limited number of topological constraints. It is widely used in proofs involving decomposition into manageable pieces.

4 In logic and formal systems

In logic, closed sets arise when a collection of formulas or propositions is stable under inference. The relevant closure condition depends on the proof system or consequence relation being used. The idea is that a closed set already contains everything that can be derived from it.

This notion plays a major role in proof theory, model theory, and the study of formal theories. It provides a way to distinguish between raw premises and their full deductive consequences.

4.1 Closure under inference rules

A set of formulas is closed under inference rules if any formula that can be derived from formulas in the set is also included in the set. In such a system, no valid deduction leads outside the set. Closure under inference is therefore a formal version of deductive completeness relative to the chosen rules.

This concept is central to the organization of axiomatic theories. It ensures that the theory already contains all immediate logical consequences of its axioms.

4.2 Deductive closure

Deductive closure is the result of adding to a set of statements every formula that follows from it. It is the smallest closed set containing the original collection, relative to a specified logic. Deductive closure captures the full content of a theory under derivation.

It is often denoted by a closure operator on sets of sentences. This makes it possible to analyze theories in a way parallel to algebraic and topological closure.

4.2.1 Theories as closed sets

A theory is often understood as a deductively closed set of sentences. Once a sentence is in the theory, all of its logical consequences are also in the theory. In this sense, a theory is not just a starting collection of axioms but the entire deductive consequence of those axioms.

This perspective helps distinguish between an axiom system and the theory it generates. The latter is the closed set, while the former is a generating set.

4.2.2 Consequence relations

A consequence relation specifies when a formula follows from a set of formulas. It provides the formal basis for deductive closure. If a set contains all of its consequences, it is closed with respect to that relation.

Different logical systems produce different closure notions. Classical, intuitionistic, and modal logics, for example, each induce their own pattern of closed sets.

4.3 Syntactic and semantic closure

Syntactic closure concerns derivability by formal proof rules, while semantic closure concerns truth in all intended models. In many logics, these two notions are closely connected by soundness and completeness results. A set may be closed syntactically if it contains everything provable from it, and semantically if it contains everything true in its semantic consequences.

The distinction matters because proof and meaning are not identical viewpoints. Closure can therefore be studied either through formal manipulation of symbols or through interpretation in models.

5 Closure operators

A closure operator is a map that assigns to each subset its closure. It abstracts the common behavior found in topology, algebra, and logic. The operator identifies the smallest closed set containing a given subset, when such a notion is available.

Closure operators provide a unified framework for many different kinds of closed sets. Once the operator is defined, closed sets are exactly the fixed points of that operator.

5.1 Extensivity

Extensivity means that every set is contained in its closure. Nothing is lost when the closure is taken; the operation only adds elements. This reflects the idea that closure enlarges a set to meet the required condition.

Extensivity is one of the basic axioms of closure operators. It ensures that the original set is always part of the result.

5.2 Idempotence

Idempotence means that applying the closure operator twice has the same effect as applying it once. Once a set has been closed, closing it again does not change it. This is exactly what one expects from a completed closure process.

Idempotence distinguishes closure from iterative expansion procedures that continue to change with repetition. It is a key feature of stable mathematical completion.

5.3 Monotonicity

Monotonicity means that if one set is contained in another, then its closure is contained in the closure of the larger set. Larger input should not produce a smaller closure. This property makes closure compatible with inclusion.

Monotonicity is essential for comparing different subsets. It ensures that closure behaves predictably when information is added.

5.4 Closed sets induced by closure operators

The closed sets associated with a closure operator are precisely the sets that equal their own closure. These sets form the fixed points of the operator and often constitute a closure system. They are the objects for which the closure condition is already satisfied.

This viewpoint unifies many examples across mathematics. Whether the operator comes from algebraic generation, topological completion, or logical deduction, the closed sets are those that are unchanged by the process.

Several related ideas are often discussed alongside closed sets. Some are defined by similar stability conditions, while others contrast with closedness in illuminating ways. These concepts appear in different branches of mathematics but share the theme of structural containment.

6.1 Convex sets

A convex set is a set in a vector space or affine space that contains every line segment joining any two of its points. Convexity is a kind of closure under linear interpolation. Although it is not usually called closed in the topological sense, it has a similar flavor of internal stability.

Convex sets are central in geometry and optimization. They illustrate how closure-like conditions can be tied to shape and combination rules.

6.2 Clopen sets

A clopen set is both open and closed. Such sets are important in topological decomposition, since they often indicate that a space can be split into separate pieces. In connected spaces, the only clopen sets are typically the empty set and the whole space.

Clopen sets show that openness and closedness are not mutually exclusive. They occupy the overlap between the two notions.

6.3 Algebraic closure

Algebraic closure usually refers to the process of adjoining solutions of polynomial equations to a field, or more broadly to a completion under algebraic operations. It is a different use of the word closure, but it shares the same general idea of adding all elements required by a rule. The resulting structure is algebraically closed in the relevant sense.

This concept is especially important in field theory. It demonstrates that closure can refer not only to subsets but also to enlarging entire algebraic systems.

6.4 Closure under transitive relations

Closure under a transitive relation means that whenever two elements are related in a chain, the relation also holds directly between the endpoints. In such contexts, a closed set may be one that contains everything reachable under repeated application of the relation. This idea appears in graph theory, order theory, and database theory.

Transitive closure is a common example. It collects all implied reachability relations and turns a partial description into a complete one.