Order convergence explained
in an
order complete vector lattice
is
order convergent if it contains an order bounded subset (that is, a subset contained in an interval of the form
[a,b]:=\{x\inX:a\leqxandx\leqb\}
) and if
where
is the set of all order bounded subsets of
X, in which case this common value is called the
order limit of
in
Order convergence plays an important role in the theory of vector lattices because the definition of order convergence does not depend on any topology.
Definition
A net
\left(x\alpha\right)\alpha
in a vector lattice
is said to
decrease to
if
implies
and
x0=inf\left\{x\alpha:\alpha\inA\right\}
in
A net
\left(x\alpha\right)\alpha
in a vector lattice
is said to
order-converge to
if there is a net
\left(y\alpha\right)\alpha
in
that decreases to
and satisfies
\left|x\alpha-x0\right|\leqy\alpha
for all
.
Order continuity
A linear map
between vector lattices is said to be
order continuous if whenever
\left(x\alpha\right)\alpha
is a net in
that order-converges to
in
then the net
\left(T\left(x\alpha\right)\right)\alpha
order-converges to
in
is said to be sequentially order continuous if whenever
is a sequence in
that order-converges to
in
then the sequence
\left(T\left(xn\right)\right)n
order-converges to
in
Related results
whose order is regular,
is of minimal type if and only if every order convergent filter in
converges when
is endowed with the
order topology