In
order theory
Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article intr ...
, a continuous poset is a
partially ordered set
In mathematics, especially order theory, a partial order on a Set (mathematics), set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements need ...
in which every element is the
directed
Direct may refer to:
Mathematics
* Directed set, in order theory
* Direct limit of (pre), sheaves
* Direct sum of modules, a construction in abstract algebra which combines several vector spaces
Computing
* Direct access (disambiguation), a ...
supremum
In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
of elements approximating it.
Definitions
Let
be two elements of a
preordered set . Then we say that
approximates
, or that
is way-below
, if the following two equivalent conditions are satisfied.
* For any
directed set
In mathematics, a directed set (or a directed preorder or a filtered set) is a preordered set in which every finite subset has an upper bound. In other words, it is a non-empty preordered set A such that for any a and b in A there exists c in A wit ...
such that
, there is a
such that
.
* For any
ideal such that
,
.
If
approximates
, we write
. The approximation relation
is a
transitive relation
In mathematics, a binary relation on a set (mathematics), set is transitive if, for all elements , , in , whenever relates to and to , then also relates to .
Every partial order and every equivalence relation is transitive. For example ...
that is weaker than the original order, also
antisymmetric if
is a
partially ordered set
In mathematics, especially order theory, a partial order on a Set (mathematics), set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements need ...
, but not necessarily a
preorder
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. The name is meant to suggest that preorders are ''almost'' partial orders, ...
. It is a preorder if and only if
satisfies the
ascending chain condition
In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly Ideal (ring theory), ideals in certain commutative rings. These conditions p ...
.
For any
, let
:
:
Then
is an
upper set
In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger ...
, and
a
lower set
In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger ...
. If
is an
upper-semilattice,
is a
directed set
In mathematics, a directed set (or a directed preorder or a filtered set) is a preordered set in which every finite subset has an upper bound. In other words, it is a non-empty preordered set A such that for any a and b in A there exists c in A wit ...
(that is,
implies
), and therefore an
ideal.
A
preordered set is called a continuous preordered set if for any
, the subset
is
directed
Direct may refer to:
Mathematics
* Directed set, in order theory
* Direct limit of (pre), sheaves
* Direct sum of modules, a construction in abstract algebra which combines several vector spaces
Computing
* Direct access (disambiguation), a ...
and
.
Properties
The interpolation property
For any two elements
of a continuous preordered set
,
if and only if for any
directed set
In mathematics, a directed set (or a directed preorder or a filtered set) is a preordered set in which every finite subset has an upper bound. In other words, it is a non-empty preordered set A such that for any a and b in A there exists c in A wit ...
such that
, there is a
such that
. From this follows the interpolation property of the continuous preordered set
: for any
such that
there is a
such that
.
Continuous dcpos
For any two elements
of a continuous
dcpo , the following two conditions are equivalent.
*
and
.
* For any
directed set
In mathematics, a directed set (or a directed preorder or a filtered set) is a preordered set in which every finite subset has an upper bound. In other words, it is a non-empty preordered set A such that for any a and b in A there exists c in A wit ...
such that
, there is a
such that
and
.
Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any
such that
and
, there is a
such that
and
.
For a
dcpo , the following conditions are equivalent.
*
is continuous.
* The
supremum
In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
map
from the
partially ordered set
In mathematics, especially order theory, a partial order on a Set (mathematics), set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements need ...
of
ideals of
to
has a
left adjoint
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are k ...
.
In this case, the actual left adjoint is
:
:
Continuous complete lattices
For any two elements
of a
complete lattice
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum ( join) and an infimum ( meet). A conditionally complete lattice satisfies at least one of these properties for bounded subsets. For compariso ...
,
if and only if for any subset
such that
, there is a
finite subset
In mathematics, a set is a collection of different things; the things are '' elements'' or ''members'' of the set and are typically mathematical objects: numbers, symbols, points in space, lines, other geometric shapes, variables, or other set ...
such that
.
Let
be a
complete lattice
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum ( join) and an infimum ( meet). A conditionally complete lattice satisfies at least one of these properties for bounded subsets. For compariso ...
. Then the following conditions are equivalent.
*
is continuous.
* The
supremum
In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
map
from the
complete lattice
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum ( join) and an infimum ( meet). A conditionally complete lattice satisfies at least one of these properties for bounded subsets. For compariso ...
of
ideals of
to
preserves arbitrary
infima
In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
.
* For any family
of
directed set
In mathematics, a directed set (or a directed preorder or a filtered set) is a preordered set in which every finite subset has an upper bound. In other words, it is a non-empty preordered set A such that for any a and b in A there exists c in A wit ...
s of
,
.
*
is
isomorphic
In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
to the
image
An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be di ...
of a
Scott-continuous
In mathematics, given two partially ordered sets ''P'' and ''Q'', a function ''f'': ''P'' → ''Q'' between them is Scott-continuous (named after the mathematician Dana Scott) if it preserves all directed suprema. That is, for every directed sub ...
idempotent map on the
direct power of arbitrarily many two-point lattices
.
A continuous
complete lattice
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum ( join) and an infimum ( meet). A conditionally complete lattice satisfies at least one of these properties for bounded subsets. For compariso ...
is often called a continuous lattice.
Examples
Lattices of open sets
For a
topological space
In mathematics, a topological space is, roughly speaking, a Geometry, geometrical space in which Closeness (mathematics), closeness is defined but cannot necessarily be measured by a numeric Distance (mathematics), distance. More specifically, a to ...
, the following conditions are equivalent.
* The
complete Heyting algebra of open sets of
is a continuous
complete Heyting algebra.
* The
sobrification of
is a
locally compact space
In topology and related branches of mathematics, a topological space is called locally compact if, roughly speaking, each small portion of the space looks like a small portion of a compact space. More precisely, it is a topological space in which ...
(in the sense that every point has a
compact
Compact as used in politics may refer broadly to a pact or treaty; in more specific cases it may refer to:
* Interstate compact, a type of agreement used by U.S. states
* Blood compact, an ancient ritual of the Philippines
* Compact government, a t ...
local base
In topology and related areas of mathematics, the neighbourhood system, complete system of neighbourhoods, or neighbourhood filter \mathcal(x) for a point x in a topological space is the collection of all neighbourhood
A neighbourhood (Comm ...
)
*
is an
exponentiable object in the category
of
topological space
In mathematics, a topological space is, roughly speaking, a Geometry, geometrical space in which Closeness (mathematics), closeness is defined but cannot necessarily be measured by a numeric Distance (mathematics), distance. More specifically, a to ...
s.
That is, the
functor
In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
has a
right adjoint
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are k ...
.
References
External links
*
*
*
*
*
* {{PlanetMath, urlname=ContinuousPoset, title=Continuous poset
Order theory