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 $\,\leq \,$ (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\leq c$ and $b\leq c.$ A directed set's preorder is called a direction.

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]^[a] Some authors (and this article) assume that a directed set is directed upward, unless otherwise stated. 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

The set of natural numbers $\mathbb {N}$ with the ordinary order $\,\leq \,$ is one of the most important examples of a directed set. Every totally ordered set is a directed set, including $(\mathbb {N} ,\leq ),$ $(\mathbb {N} ,\geq ),$ $(\mathbb {R} ,\leq ),$ and $(\mathbb {R} ,\geq ).$

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\leq a$ and $b\leq b.$ A less trivial example is like the following example of the "reals directed towards $x_{0}$ " but in which the ordering rule only applies to pairs of elements on the same side of $x_{0}$ (that is, if one takes an element $a$ to the left of $x_{0},$ and $b$ to its right, then $a$ and $b$ are not comparable, and the subset $\{a,b\}$ has no upper bound).

Product of directed sets

Let $\mathbb {D} _{1}$ and $\mathbb {D} _{2}$ be directed sets. Then the Cartesian product set $\mathbb {D} _{1}\times \mathbb {D} _{2}$ can be made into a directed set by defining $\left(n_{1},n_{2}\right)\leq \left(m_{1},m_{2}\right)$ if and only if $n_{1}\leq m_{1}$ and $n_{2}\leq m_{2}.$ In analogy to the product order this is the product direction on the Cartesian product. For example, the set $\mathbb {N} \times \mathbb {N}$ of pairs of natural numbers can be made into a directed set by defining $\left(n_{0},n_{1}\right)\leq \left(m_{0},m_{1}\right)$ if and only if $n_{0}\leq m_{0}$ and $n_{1}\leq m_{1}.$

Directed towards a point

If $x_{0}$ is a real number then the set $I:=\mathbb {R} \backslash \lbrace x_{0}\rbrace$ can be turned into a directed set by defining $a\leq _{I}b$ if $\left|a-x_{0}\right|\geq \left|b-x_{0}\right|$ (so "greater" elements are closer to $x_{0}$ ). We then say that the reals have been directed towards $x_{0}.$ This is an example of a directed set that is neither partially ordered nor totally ordered. This is because antisymmetry breaks down for every pair $a$ and $b$ equidistant from $x_{0},$ where $a$ and $b$ are on opposite sides of $x_{0}.$ Explicitly, this happens when $\{a,b\}=\left\{x_{0}-r,x_{0}+r\right\}$ for some real $r\neq 0,$ in which case $a\leq _{I}b$ and $b\leq _{I}a$ even though $a\neq b.$ Had this preorder been defined on $\mathbb {R}$ instead of $\mathbb {R} \backslash \lbrace x_{0}\rbrace$ then it would still form a directed set but it would now have a (unique) greatest element, specifically $x_{0}$ ; however, it still wouldn't be partially ordered. This example can be generalized to a metric space $(X,d)$ by defining on $X$ or $X\setminus \left\{x_{0}\right\}$ the preorder $a\leq b$ if and only if $d\left(a,x_{0}\right)\geq d\left(b,x_{0}\right).$

Maximal and greatest elements

An element $m$ of a preordered set $(I,\leq )$ is a maximal element if for every $j\in I,$ $m\leq j$ implies $j\leq m.$ ^[b] It is a greatest element if for every $j\in I,$ $j\leq m.$

Any preordered set with a greatest element is a directed set with the same preorder. For instance, in a poset $P,$ every lower closure of an element; that is, every subset of the form $\{a\in P:a\leq x\}$ where $x$ is a fixed element from $P,$ is directed.

Every maximal element of a directed preordered set is a greatest element. Indeed, a directed preordered set is characterized by equality of the (possibly empty) sets of maximal and of greatest elements.

Subset inclusion

The subset inclusion relation $\,\subseteq ,\,$ along with its dual $\,\supseteq ,\,$ define partial orders on any given family of sets. A non-empty family of sets is a directed set with respect to the partial order $\,\supseteq \,$ (respectively, $\,\subseteq \,$ ) if and only if the intersection (respectively, union) of any two of its members contains as a subset (respectively, is contained as a subset of) some third member. In symbols, a family $I$ of sets is directed with respect to $\,\supseteq \,$ (respectively, $\,\subseteq \,$ ) if and only if

for all

A,B\in I,

there exists some

C\in I

such that

A\supseteq C

and

B\supseteq C

(respectively,

A\subseteq C

and

B\subseteq C

)

or equivalently,

for all

A,B\in I,

there exists some

C\in I

such that

A\cap B\supseteq C

(respectively,

A\cup B\subseteq C

).

Many important examples of directed sets can be defined using these partial orders. For example, by definition, a prefilter or filter base is a non-empty family of sets that is a directed set with respect to the partial order $\,\supseteq \,$ and that also does not contain the empty set (this condition prevents triviality because otherwise, the empty set would then be a greatest element with respect to $\,\supseteq \,$ ). Every $π$ -system, which is a non-empty family of sets that is closed under the intersection of any two of its members, is a directed set with respect to $\,\supseteq \,.$ Every λ-system is a directed set with respect to $\,\subseteq \,.$ Every filter, topology, and σ-algebra is a directed set with respect to both $\,\supseteq \,$ and $\,\subseteq \,.$

Tails of nets

By definition, a net is a function from a directed set and a sequence is a function from the natural numbers $\mathbb {N} .$ Every sequence canonically becomes a net by endowing $\mathbb {N}$ with $\,\leq .\,$

If $x_{\bullet }=\left(x_{i}\right)_{i\in I}$ is any net from a directed set $(I,\leq )$ then for any index $i\in I,$ the set $x_{\geq i}:=\left\{x_{j}:j\geq i{\text{ with }}j\in I\right\}$ is called the tail of $(I,\leq )$ starting at $i.$ The family $\operatorname {Tails} \left(x_{\bullet }\right):=\left\{x_{\geq i}:i\in I\right\}$ of all tails is a directed set with respect to $\,\supseteq ;\,$ in fact, it is even a prefilter.

Neighborhoods

If $T$ is a topological space and $x_{0}$ is a point in $T,$ the set of all neighbourhoods of $x_{0}$ can be turned into a directed set by writing $U\leq V$ if and only if $U$ contains $V.$ For every $U,$ $V,$ and $W$ :

$U\leq U$ since $U$ contains itself.
if $U\leq V$ and $V\leq W,$ then $U\supseteq V$ and $V\supseteq W,$ which implies $U\supseteq W.$ Thus $U\leq W.$
because $x_{0}\in U\cap V,$ and since both $U\supseteq U\cap V$ and $V\supseteq U\cap V,$ we have $U\leq U\cap V$ and $V\leq U\cap V.$

Finite subsets

The set $\operatorname {Finite} (I)$ of all finite subsets of a set $I$ is directed with respect to $\,\subseteq \,$ since given any two $A,B\in \operatorname {Finite} (I),$ their union $A\cup B\in \operatorname {Finite} (I)$ is an upper bound of $A$ and $B$ in $\operatorname {Finite} (I).$ This particular directed set is used to define the sum ${\textstyle \sum \limits _{i\in I}}r_{i}$ of a generalized series of an $I$ -indexed collection of numbers $\left(r_{i}\right)_{i\in I}$ (or more generally, the sum of elements in an abelian topological group, such as vectors in a topological vector space) as the limit of the net of partial sums $F\in \operatorname {Finite} (I)\mapsto {\textstyle \sum \limits _{i\in F}}r_{i};$ that is: $\sum _{i\in I}r_{i}~:=~\lim _{F\in \operatorname {Finite} (I)}\ \sum _{i\in F}r_{i}~=~\lim \left\{\sum _{i\in F}r_{i}\,:F\subseteq I,F{\text{ finite }}\right\}.$

Logic

Let $S$ be a formal theory, which is a set of sentences with certain properties (details of which can be found in the article on the subject). For instance, $S$ could be a first-order theory (like Zermelo–Fraenkel set theory) or a simpler zeroth-order theory. The preordered set $(S,\Leftarrow )$ is a directed set because if $A,B\in S$ and if $C:=A\wedge B$ denotes the sentence formed by logical conjunction $\,\wedge ,\,$ then $A\Leftarrow C$ and $B\Leftarrow C$ where $C\in S.$ If $S/\sim$ is the Lindenbaum–Tarski algebra associated with $S$ then $\left(S/\sim ,\Leftarrow \right)$ is a partially ordered set that is also a directed set.

Contrast with semilattices

Directed set is a more general concept than (join) semilattice: 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\leq 1011$ holds, but $0001\leq 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,\leq )$ 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.^{[further explanation needed]}

Notes

^ That is, for any $a$ and $b$ in $A$ there must exist $c$ in $A$ with $c\leq a$ and $c\leq b$ .
^ This implies $j=m$ if $(I,\leq )$ is a partially ordered set.

Footnotes

^ Kelley 1975, pp. 65.
^ Robert S. Borden (1988). A Course in Advanced Calculus. Courier Corporation. p. 20. ISBN 978-0-486-15038-3.
^ Arlen Brown; Carl Pearcy (1995). An Introduction to Analysis. Springer. p. 13. ISBN 978-1-4612-0787-0.
^ 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.
^ Gierz et al. 2003, p. 2.

Works cited

Kelley, John L. (1975). General Topology. Graduate Texts in Mathematics. Vol. 27 (2nd ed.). Springer-Verlag. ISBN 978-0-387-90125-1. OCLC 1365153. (1st ed., 1955)
Gierz, G.; Hofmann, K. H.; Keimel, K.; Lawson, J. D.; Mislove, M.; Scott, D. S. (2003). Continuous Lattices and Domains. Cambridge University Press. doi:10.1017/CBO9780511542725. ISBN 9780511542725. OCLC 7334257218.

[4] That is, for any $a$ and $b$ in $A$ there must exist $c$ in $A$ with $c\leq a$ and $c\leq b$ .

[6] This implies $j=m$ if $(I,\leq )$ is a partially ordered set.

[FOOTNOTEKelley197565-1] Kelley 1975, pp. 65.

[2] Robert S. Borden (1988). A Course in Advanced Calculus. Courier Corporation. p. 20. ISBN 978-0-486-15038-3.

[Brown-Pearcy-3] Arlen Brown; Carl Pearcy (1995). An Introduction to Analysis. Springer. p. 13. ISBN 978-1-4612-0787-0.

[CarlHeikkilä2010-5] 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.

[FOOTNOTEGierzHofmannKeimelLawson20032-7] Gierz et al. 2003, p. 2.

[1]

[2]

[3]

[a]

[4]

[b]

[5]

v t e Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types (list)	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially ordered group Positive cone of a partially ordered group Upper set Young's lattice