PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (210)
Orphanage
Unclass'd (1)
Unproven (473)
Corrections (34)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
domain (Definition)

A poset $ P$ is said to be a directed complete partially ordered set, or dcpo for short, if every directed set $ D\subseteq P$ has a supremum.

A domain $ P$ is a continuous dcpo. Here, continuous means that $ P$ is a continuous poset.

Example. Let $ A,B$ be sets. Consider the set $ P$ of all partial functions from $ A$ to $ B$. This means that any $ f\in P$ is a function $ C\to B$, for some subset $ C$ of $ A$. We show that $ P$ is a domain.

  1. $ P$ is a poset: Define a binary relation on $ P$ as follows: $ f\le g$ iff $ g$ is an extension of $ f$. In other words, if $ f:C\to B$ and $ g:D\to B$, then $ C \subseteq D$ and $ f(x)=g(x)$ for all $ x\in C$. Clearly, $ \le$ is reflexive, anti-symmetric, and transitive. So $ \le$ turns $ P$ into a poset.
  2. $ P$ is a dcpo: Suppose that $ D$ is a directed subset of $ P$. Set $ E=\bigcup \lbrace \operatorname{dom}(f) \mid f\in D\rbrace$. Define $ g:E\to B$ as follows: for any $ x\in E$, $ g(x)=f(x)$ where $ x\in \operatorname{dom}(f)$ for some $ f\in D$. Is this well-defined? Suppose $ x\in \operatorname{dom}(f_1)\cap\operatorname{dom}(f_2)$. Since $ D$ is directed, there is an $ f\in D$ extending both $ f_1$ and $ f_2$. This means that $ f_1(x)=f(x)=f_2(x)$. Therefore, $ g:=\bigvee D$ is a well-defined function (on $ E$). Hence $ P$ is a dcpo.
  3. If $ f,g\ll h$, then $ f\vee g\ll h$: Since $ h$ extends both $ f$ and $ g$, $ a:=f\vee g:\operatorname{dom}(f)\cup\operatorname{dom}(g)\to B$ is well-defined (the construction is the same as above). To show that $ a\ll h$, suppose $ D\subseteq P$ is directed and $ h\le \bigvee D$ (note that $ \bigvee D$ exists by 2 above). Since $ f\ll h$, there is $ r\in D$ such that $ f\le r$. Similarly, $ g\ll h$ implies an $ s\in D$ with $ g\le s$. Since $ D$ is directed, there is $ t\in D$ with $ r,s\le t$. This means $ f\le t$ and $ g\le t$, or $ a=f\vee g\le t$.
  4. $ P$ is continuous: Let $ \operatorname{wb}(h)=\lbrace f \in P\mid f\ll h \rbrace$. Then by 3 above, $ \operatorname{wb}(h)$ is a directed set. By 2, $ b:=\bigvee \operatorname{wb}(h)$ exists, and $ b\le h$. Suppose $ x\in \operatorname{dom}(h)$. Then the function $ c_x:\lbrace x\rbrace\to B$ defined by $ c_x(x)=h(x)$ is way below $ h$, for if $ h\le \bigvee D$, then $ x\in \operatorname{dom}(f)$ for some $ f\in D$, or $ \operatorname{dom}(c_x)=\lbrace x\rbrace \subseteq \operatorname{dom}(f)$, which means $ c_x\le f$. Therefore, $ c_x\le b$. This implies that $ \operatorname{dom}(h)= \bigvee \lbrace \operatorname{dom}(c_x)\mid x\in \operatorname{dom}(h)\rbrace \subseteq \operatorname{dom}(b)$. As a result, $ h\le b$.

Remark. Domain theory is a branch of order theory that is used extensively in theoretical computer science. As in the example, one can think of a domain as a collection of partial pictures or pieces of partial information. Being continuous is the same as saying that any picture or piece of information can be pieced together by partial ones by way of “approximations”.



"domain" is owned by CWoo.
(view preamble)

View style:

See Also: complete lattice

Other names:  directed complete, directed complete poset, directed complete partially ordered set
Also defines:  domain, dcpo
Log in to rate this entry.
(view current ratings)

Cross-references: information, collection, order, branch, theory, way below, implies, well-defined, transitive, anti-symmetric, Reflexive, extension, iff, binary relation, subset, function, partial functions, continuous poset, continuous, supremum, directed set, poset
There are 69 references to this entry.

This is version 4 of domain, born on 2007-03-11, modified 2007-04-29.
Object id is 9062, canonical name is Domain6.
Accessed 2319 times total.

Classification:
AMS MSC: 06B35 (Order, lattices, ordered algebraic structures :: Lattices :: Continuous lattices and posets, applications)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)