# Directed set

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, a directed set is a right filtering preorder, i.e. a set A together with a binary relation ≤ having the following properties:

• aa for all a in A (reflexivity)
• if ab and bc, then ac (transitivity)
• for any two a and b in A, there exists a c in A with ac and bc (directedness)

Given two points a and b one can move from a in the direction of b by finding another point c "beyond" both a and b. Continuing inductively, one can find a sequence abcd ≤ ... of points

## Applications

Directed sets are generalizations of totally ordered sets. In topology they are used to define nets that generalize sequences and unite the various notions of limit used in analysis.

## 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).
• If x0 is a real number, we can turn the set R − {x0} into a directed set by writing ab if and only if
|ax0| ≥ |bx0|. We then say that the reals have been directed towards x0. This is not a partial order.
• If T is a topological space and x0 is a point in T, we turn the set of all neighbourhoods of x0 into a directed set by writing UV if and only if U contains V.
• For every U: UU; since U contains itself.
• For every U,V,W: if UV and VW, then UW; since if U contains V and V contains W then U contains W.
• For every U, V: there exists the set UV such that UUV and VUV; since both U and V contain UV.
• In a poset P, every subset of the form {a| a in P, ax}, where x is a fixed element from P, is directed.

## Directed subsets

Directed sets need not be antisymmetric and therefore in general are not partial orders. However, the term is also frequently used in the context of posets. In this setting, a subset A of a partially ordered set (P,≤) is called a directed subset iff

• A is not the empty set,
• for any two a and b in A, there exists a c in A with ac and bc (directedness),

where the order of the elements of A is inherited from P. For this reason, reflexivity and transitivity need not be required explicitly.

Directed subsets are most commonly used in domain theory, where one studies orders for which these sets are required to have a least upper bound. Thus, directed subsets provide a generalization of (converging) sequences in the setting of partial orders as well.