Order, lattices, ordered algebraic structures Definition
Directed set
Builds on Preorder
Definition
Let be a set with a preorder . The set is directed (upward directed) when:
- is nonempty.
- For all there is with and , that is, every two elements have an upper bound in .
Remarks
Example: the set of neighbourhoods of a point in a topological space, ordered by reverse inclusion ( when ), is directed. Check: has the neighbourhood consisting of the whole space, and for neighbourhoods the set is a neighbourhood with and .
Non-example: the set with the trivial order, where each element is only below itself, fails clause 2, since and have no common upper bound.
By induction, every finite subset of a directed set has an upper bound in it.
A downward directed set is defined dually, with lower bounds.
Some authors, and the Mathlib predicate IsDirected, drop clause 1.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Preorder concept
- Directed set definition
Further reading
About this page
| Tag | 8F933HJ1RY |
|---|---|
| URI | m2://8F933HJ1RY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06, 54A20 |
| Defines | Directed set |
| Uses | Preorder |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.