Closure (mathematics)

Lore & Background

The concept of closure arises from the property that every intersection of closed sets is a closed set. This allows for the definition of the smallest closed subset containing a given subset Y, called the closure of Y or the set generated by Y. This idea extends to any property of subsets that is stable under intersection, such as Zariski-closed sets in algebraic geometry. In algebraic structures, a substructure is a subset closed under all operations of the structure. For example, a non-empty subset of a group closed under multiplication and inversion is a subgroup. The closure of a single element in a group is a cyclic group. In linear algebra, the closure of a non-empty subset of a vector space under addition and scalar multiplication is its linear span. For binary relations, closures are defined by properties like reflexivity, symmetry, and transitivity. The reflexive transitive closure of a relation is the smallest preorder containing it, and the reflexive transitive symmetric closure is the smallest equivalence relation. Other examples include the convex hull in geometry, the Kleene closure in formal languages, and the σ-algebra generated by a collection of subsets in probability theory.

Reader's Guide

The significance of closure in mathematics lies in its ability to define minimal structures that contain a given set while preserving certain properties. This concept is foundational across many branches: in algebra, it defines substructures like subgroups and linear spans; in order theory, it generates preorders and equivalence relations; in geometry, it produces convex hulls; and in analysis, it generates σ-algebras. The closure operator itself is a function on the power set of a set that is extensive, increasing, and idempotent. The property that intersections of closed sets are closed ensures the existence of a unique smallest closed superset for any subset. This unifying principle allows mathematicians to study generated objects—such as the algebraic closure of a field or the normal closure of a group—as the natural completion of a set under specified operations. The concept also appears in matroid theory, where the closure of X is the largest superset with the same rank as X. Overall, closure provides a systematic way to extend a subset to a structure that is closed under desired operations, making it a cornerstone of modern mathematics.

Did You Know?

• The natural numbers are closed under addition but not under subtraction, as 1 − 2 is not a natural number.
• Every intersection of closed sets is a closed set, which guarantees the existence of a smallest closed superset.
• In group theory, the closure of a single element under group operations is called a cyclic group.
• The reflexive transitive symmetric closure of a relation is the smallest equivalence relation containing it.