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]

Directed sets are a generalization of nonempty totally ordered sets, that is, all totally ordered sets are directed sets (but not all partially ordered sets). 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.

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).
• The set N 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).
• 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₀.
• 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,W: if U ≤ V and V ≤ W, then U ≤ W; since if U contains V and V contains W then U contains W.
  • For every U, V: there exists the set U V such that U ≤ U V and V ≤ U V; since both U and V contain U V.
• In a poset P, every subset of the form {a| a in P, a ≤x}, where x is a fixed element from P, is directed.

Contrast with semilattices

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, where {1000,0001} has three upper bounds but no least upper bound.

Directed subsets

The order relation in a directed sets 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 A is not the empty set, and for any a and b in A there exists a c in A with a ≤ c and b ≤ c. 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.^[2] 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

Notes

References

• J. L. Kelley (1955), General Topology.

• Gierz, Hofmann, Keimel, et al. (2003), Continuous Lattices and Domains, Cambridge University Press. ISBN 0521803381.