Directed set

In mathematics, a directed set (or a directed preorder or a filtered set) is a nonempty set A together with a reflexive and transitive binary relation ≤ (that is, a preorder), with the additional property that every pair of elements has an upper bound.[1] In other words, for any a and b in A there must exist c in A with a ≤ c and b ≤ c.

The notion defined above is sometimes called an upward directed set. A downward directed set is defined analogously,[2] meaning that every pair of elements is bounded below.[3] Some authors (and this article) assume that a directed set is directed upward, unless otherwise stated. Be aware that other authors call a set directed if and only if it is directed both upward and downward.[4]

Directed sets are a generalization of nonempty totally ordered sets. That is, all totally ordered sets are directed sets (contrast partially ordered sets, which need not be directed). Join semilattices (which are partially ordered sets) are directed sets as well, but not conversely. Likewise, lattices are directed sets both upward and downward.

In topology, directed sets are used to define nets, which generalize sequences and unite the various notions of limit used in analysis. Directed sets also give rise to direct limits in abstract algebra and (more generally) category theory.

Equivalent definition

In addition to the definition above, there is an equivalent definition. A directed set is a set A with a preorder such that every finite subset of A has an upper bound. In this definition, the existence of an upper bound of the empty subset implies that A is nonempty.

Examples

Examples of directed sets include:

• The set of natural numbers N with the ordinary order ≤ is a directed set (and so is every totally ordered set).
• Let D₁ and D₂ be directed sets. Then the Cartesian product set D₁ ${\displaystyle \times }$ D₂ can be made into a directed set by defining (n₁, n₂) ≤ (m₁, m₂) if and only if n₁ ≤ m₁ and n₂ ≤ m₂. In analogy to the product order this is the product direction on the Cartesian product.
• It follows from previous example that the set N ${\displaystyle \times }$ N of pairs of natural numbers can be made into a directed set by defining (n₀, n₁) ≤ (m₀, m₁) if and only if n₀ ≤ m₀ and n₁ ≤ m₁.
• If x₀ is a real number, we can turn the set R − {x₀} into a directed set by writing a ≤ b if and only if
  |a − x₀| ≥ |b − x₀|. We then say that the reals have been directed towards x₀. This is an example of a directed set that is not ordered (neither totally nor partially: antisymmetry breaks down for every pair a and b equidistant from x₀, where a and b are on opposite sides of x₀).
• A (trivial) example of a partially ordered set that is not directed is the set {a, b}, in which the only order relations are a ≤ a and b ≤ b. A less trivial example is like the previous example of the "reals directed towards x₀" but in which the ordering rule only applies to pairs of elements on the same side of x₀ (ie, if one takes an element a to the left of x₀, and b to its right, then a and b are not comparable, and the subset {a, b} has no upper bound).
• If T is a topological space and x₀ is a point in T, we turn the set of all neighbourhoods of x₀ into a directed set by writing U ≤ V if and only if U contains V.
  • For every U: U ≤ U; since U contains itself.
  • For every U, V, and W: if U ≤ V and V ≤ W, then we have U ${\displaystyle \supseteq }$ V and V ${\displaystyle \supseteq }$ W, which implies U ${\displaystyle \supseteq }$ W. Thus U ≤ W.
  • For every U and V: since x₀ ${\displaystyle \in }$ U ${\displaystyle \cap }$ V, and since both U ${\displaystyle \supseteq }$ U ${\displaystyle \cap }$ V and V ${\displaystyle \supseteq }$ U ${\displaystyle \cap }$ V, we have U ≤ U ${\displaystyle \cap }$ V and V ≤ U ${\displaystyle \cap }$ V.
• In a poset P, every lower closure of an element, i.e. every subset of the form {a | a in P, a ≤ x} where x is a fixed element from P, is directed.

Contrast with semilattices

Witness

Directed sets are a more general concept than (join) semilattices: every join semilattice is a directed set, as the join or least upper bound of two elements is the desired c. The converse does not hold however, witness the directed set {1000,0001,1101,1011,1111} ordered bitwise (e.g. 1000 ≤ 1011 holds, but 0001 ≤ 1000 does not, since in the last bit 1 > 0), where {1000,0001} has three upper bounds but no least upper bound, cf. picture. (Also note that without 1111, the set is not directed.)

Directed subsets

The order relation in a directed set is not required to be antisymmetric, and therefore directed sets are not always partial orders. However, the term directed set is also used frequently in the context of posets. In this setting, a subset A of a partially ordered set (P,≤) is called a directed subset if it is a directed set according to the same partial order: in other words, it is not the empty set, and every pair of elements has an upper bound. Here the order relation on the elements of A is inherited from P; for this reason, reflexivity and transitivity need not be required explicitly.

A directed subset of a poset is not required to be downward closed; a subset of a poset is directed if and only if its downward closure is an ideal. While the definition of a directed set is for an "upward-directed" set (every pair of elements has an upper bound), it is also possible to define a downward-directed set in which every pair of elements has a common lower bound. A subset of a poset is downward-directed if and only if its upper closure is a filter.

Directed subsets are used in domain theory, which studies directed complete partial orders.[5] These are posets in which every upward-directed set is required to have a least upper bound. In this context, directed subsets again provide a generalization of convergent sequences.

See also

• Filtered category
• Centered set
• Linked set

Notes

1. Kelley, p. 65.
2. Robert S. Borden (1988). A Course in Advanced Calculus. Courier Corporation. p. 20. ISBN 978-0-486-15038-3.
3. Arlen Brown; Carl Pearcy (1995). An Introduction to Analysis. Springer. p. 13. ISBN 978-1-4612-0787-0.
4. Siegfried Carl; Seppo Heikkilä (2010). Fixed Point Theory in Ordered Sets and Applications: From Differential and Integral Equations to Game Theory. Springer. p. 77. ISBN 978-1-4419-7585-0.
5. Gierz, p. 2.

References

• J. L. Kelley (1955), General Topology.
• Gierz, Hofmann, Keimel, et al. (2003), Continuous Lattices and Domains, Cambridge University Press. ISBN 0-521-80338-1.