HOME

TheInfoList



OR:

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 a,b\in P be two elements of a preordered set (P,\lesssim). Then we say that a approximates b, or that a is way-below b, 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 ...
D\subseteq P such that b\lesssim\sup D, there is a d\in D such that a\lesssim d. * For any ideal I\subseteq P such that b\lesssim\sup I, a\in I. If a approximates b, we write a\ll b. The approximation relation \ll 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 P 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 (P,\lesssim) 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 a\in P, let :\mathop\Uparrow a=\ :\mathop\Downarrow a=\ Then \mathop\Uparrow a 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 \mathop\Downarrow a 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 P is an upper-semilattice, \mathop\Downarrow a 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, b,c\ll a implies b\vee c\ll a), and therefore an ideal. A preordered set (P,\lesssim) is called a continuous preordered set if for any a\in P, the subset \mathop\Downarrow a 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 a=\sup\mathop\Downarrow a.


Properties


The interpolation property

For any two elements a,b\in P of a continuous preordered set (P,\lesssim), a\ll b 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 ...
D\subseteq P such that b\lesssim\sup D, there is a d\in D such that a\ll d. From this follows the interpolation property of the continuous preordered set (P,\lesssim): for any a,b\in P such that a\ll b there is a c\in P such that a\ll c\ll b.


Continuous dcpos

For any two elements a,b\in P of a continuous dcpo (P,\le), the following two conditions are equivalent. * a\ll b and a\ne b. * 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 ...
D\subseteq P such that b\le\sup D, there is a d\in D such that a\ll d and a\ne d. Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any a,b\in P such that a\ll b and a\ne b, there is a c\in P such that a\ll c\ll b and a\ne c. For a dcpo (P,\le), the following conditions are equivalent. * P 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 \sup \colon \operatorname(P)\to P 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 P to P 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 : \colon P\to\operatorname(P) :\mathord\Downarrow\dashv\sup


Continuous complete lattices

For any two elements a,b\in L 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 ...
L, a\ll b if and only if for any subset A\subseteq L such that b\le\sup A, 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 ...
F\subseteq A such that a\le\sup F. Let L 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. * L 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 \sup \colon \operatorname(L)\to L 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 L to L 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 \mathcal D 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 L, \textstyle\inf_\sup D=\sup_\inf_f(D). * L 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 r \colon \^\kappa\to\^\kappa 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 ...
X, the following conditions are equivalent. * The complete Heyting algebra \operatorname(X) of open sets of X is a continuous complete Heyting algebra. * The sobrification of X 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 ...
) * X is an exponentiable object in the category \operatorname 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 ...
(-)\times X\colon\operatorname\to\operatorname 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