Order, lattices, ordered algebraic structures Definition
Closure operator
Builds on Partial order
Definition
Let be a partially ordered set. A closure operator on is a map such that, for all :
- (extensive);
- if , then (monotone);
- (idempotent).
An element with is closed.
Remarks
Let be a topological space and the set of subsets of ordered by inclusion. The map sending to its closure is a closure operator: , gives , and . On , the map is extensive and monotone but not idempotent, since . The three clauses together are equivalent to one condition: if and only if , for all . The closed elements determine : is the least closed element above . If is a Galois connection with lower adjoint , then is a closure operator. The dual notion is an interior operator.
Reading path
To understand this page from the ground up, read these 16 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Closure operator definition
Further reading
About this page
| Tag | 17FVAN6HXX |
|---|---|
| URI | m2://17FVAN6HXX |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A15 |
| Defines | Closure operator |
| Uses | Partial order |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.