Order convergence

From HandWiki

In mathematics, specifically in order theory and functional analysis, a filter ℱ in an order complete vector lattice X is order convergent if it contains an order bounded subset (that is, a subset contained in an interval of the form [a,b]:={x∈X:a≤x and x≤b}) and if sup⁡{inf⁡S:S∈OBound⁡(X)∩ℱ}=inf⁡{sup⁡S:S∈OBound⁡(X)∩ℱ}, where OBound⁡(X) is the set of all order bounded subsets of X, in which case this common value is called the order limit of ℱ in X.[1]

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 (xα)α∈A in a vector lattice X is said to decrease to x0∈X if α≤β implies xβ≤xα and x0=inf{xα:α∈A} in X. A net (xα)α∈A in a vector lattice X is said to order-converge to x0∈X if there is a net (yα)α∈A in X that decreases to 0 and satisfies |xα−x0|≤yα for all α∈A.[2]

Order continuity

A linear map T:X→Y between vector lattices is said to be order continuous if whenever (xα)α∈A is a net in X that order-converges to x0 in X, then the net (T(xα))α∈A order-converges to T(x0) in Y. T is said to be sequentially order continuous if whenever (xn)n∈ℕ is a sequence in X that order-converges to x0 in X,then the sequence (T(xn))n∈ℕ order-converges to T(x0) in Y.[2]

In an order complete vector lattice X whose order is regular, X is of minimal type if and only if every order convergent filter in X converges when X is endowed with the order topology.[1]

See also

References

  1. ↑ 1.0 1.1 Schaefer & Wolff 1999, pp. 234–242.
  2. ↑ 2.0 2.1 Khaleelulla 1982, p. 8.

Template:Ordered topological vector spaces