A set is closed under an operation if applying the operation to elements of always produces an element of :
Examples:
- is closed under addition and multiplication, but not subtraction ()
- is closed under but not division
- are closed under all four arithmetic operations (excluding division by zero)
- The set of even integers is closed under addition; odd integers are not ()
Closure of a set (noun): given and an operation , the closure is the smallest superset of that is closed under . Constructively: keep applying to elements until no new elements appear.
Closure of relations: given a relation on , extend minimally to satisfy a property.
- Reflexive closure:
- Symmetric closure:
- Transitive closure : smallest transitive relation containing — if then . Computed by repeated composition:
Where closure shows up:
- Algebra: groups, rings, and fields are defined by closure axioms — a group requires closed under
- Linear algebra: a subspace must be closed under addition and scalar multiplication
- Measure theory: a -algebra is a collection of sets closed under countable unions and complements — foundational for probability
- Topology: the topological closure is the smallest closed set containing (contains all its limit points)
- Formal languages: the Kleene star is the closure of a language under concatenation
- Databases / graphs: transitive closure answers reachability — "can I get from to ?"
Intuition: closure is the answer to "if I start with this set and keep doing this operation, what's the smallest set I can't escape?" It's the fixpoint of "add everything forced to be here."
See also: Vector Spaces and Basis, Graphs and Traversals