Order complete

From HandWiki

In mathematics, specifically in order theory and functional analysis, a subset [math]\displaystyle{ A }[/math] of an ordered vector space is said to be order complete in [math]\displaystyle{ X }[/math] if for every non-empty subset [math]\displaystyle{ S }[/math] of [math]\displaystyle{ C }[/math] that is order bounded in [math]\displaystyle{ A }[/math] (meaning contained in an interval, which is a set of the form [math]\displaystyle{ [a, b] := \{ x \in X : a \leq x \text{ and } x \leq b \}, }[/math] for some [math]\displaystyle{ a, b \in A }[/math]), the supremum [math]\displaystyle{ \sup S }[/math]' and the infimum [math]\displaystyle{ \inf S }[/math] both exist and are elements of [math]\displaystyle{ A. }[/math] An ordered vector space is called order complete, Dedekind complete, a complete vector lattice, or a complete Riesz space, if it is order complete as a subset of itself,[1][2] in which case it is necessarily a vector lattice. An ordered vector space is said to be countably order complete if each countable subset that is bounded above has a supremum.[1]

Being an order complete vector space is an important property that is used frequently in the theory of topological vector lattices.

Examples

The order dual of a vector lattice is an order complete vector lattice under its canonical ordering.[1]

If [math]\displaystyle{ X }[/math] is a locally convex topological vector lattice then the strong dual [math]\displaystyle{ X^{\prime}_b }[/math] is an order complete locally convex topological vector lattice under its canonical order.[3]

Every reflexive locally convex topological vector lattice is order complete and a complete TVS.[3]

Properties

If [math]\displaystyle{ X }[/math] is an order complete vector lattice then for any subset [math]\displaystyle{ S \subseteq X, }[/math] [math]\displaystyle{ X }[/math] is the ordered direct sum of the band generated by [math]\displaystyle{ A }[/math] and of the band [math]\displaystyle{ A^{\perp} }[/math] of all elements that are disjoint from [math]\displaystyle{ A. }[/math][1] For any subset [math]\displaystyle{ A }[/math] of [math]\displaystyle{ X, }[/math] the band generated by [math]\displaystyle{ A }[/math] is [math]\displaystyle{ A^{\perp \perp}. }[/math][1] If [math]\displaystyle{ x }[/math] and [math]\displaystyle{ y }[/math] are lattice disjoint then the band generated by [math]\displaystyle{ \{x\}, }[/math] contains [math]\displaystyle{ y }[/math] and is lattice disjoint from the band generated by [math]\displaystyle{ \{y\}, }[/math] which contains [math]\displaystyle{ x. }[/math][1]

See also

References

  1. 1.0 1.1 1.2 1.3 1.4 1.5 Schaefer & Wolff 1999, pp. 204–214.
  2. Narici & Beckenstein 2011, pp. 139-153.
  3. 3.0 3.1 Schaefer & Wolff 1999, pp. 234–239.

Bibliography