ordered vector space

In mathematics, an ordered vector space or partially ordered vector space is a vector space equipped with a partial order that is compatible with the vector space operations.

Definition

Given a vector space ''X'' over the real numbers R and a preorder ≤ on the set ''X'', the pair is called a preordered vector space and we say that the preorder ≤ is compatible with the vector space structure of ''X'' and call ≤ a vector preorder on ''X'' if for all ''x'', ''y'', ''z'' in ''X'' and ''λ'' in R with the following two axioms are satisfied

# implies
# implies .

If ≤ is a partial order compatible with the vector space structure of ''X'' then is called an ordered vector space and ≤ is called a vector partial order on ''X''.
The two axioms imply that translations and positive homotheties are automorphisms of the order structure and the mapping is an isomorphism to the dual order structure. Ordered vector spaces are ordered groups under their addition operation.
Note that ''x'' ≤ ''y'' if and only if −''y'' ≤ −''x''.

Positive cones and their equivalence to orderings

A subset ''C'' of a vector space ''X'' is called a cone if for all real ''r'' > 0, ''rC'' ⊆ ''C''. A cone is called pointed if it contains the origin. A cone ''C'' is convex if and only if ''C'' + ''C'' ⊆ ''C''. The intersection of any non-empty family of cones (resp. convex cones) is again a cone (resp. convex cone);
the same is true of the union of an increasing (under set inclusion) family of cones (resp. convex cones). A cone ''C'' in a vector space ''X'' is said to be generating if ''X'' = ''C'' − ''C''.
A positive cone is generating if and only if it is a directed set under ≤.

Given a preordered vector space ''X'', the subset ''X''⁺ of all elements ''x'' in (''X'', ≤) satisfying ''x'' ≥ 0 is a pointed convex cone with vertex 0 (i.e. it contains 0) called the positive cone of ''X'' and denoted by $\operatorname X$.
The elements of the positive cone are called positive.
If ''x'' and ''y'' are elements of a preordered vector space (''X'', ≤), then ''x'' ≤ ''y'' if and only if ''y'' − ''x'' ∈ ''X''⁺.
Given any pointed convex cone ''C'' with vertex 0, one may define a preorder ≤ on ''X'' that is compatible with the vector space structure of ''X'' by declaring for all ''x'' and ''y'' in ''X'', that ''x'' ≤ ''y'' if and only if ''y'' − ''x'' ∈ ''C'';
the positive cone of this resulting preordered vector space is ''C''.
There is thus a one-to-one correspondence between pointed convex cones with vertex 0 and vector preorders on ''X''.
If ''X'' is preordered then we may form an equivalence relation on ''X'' by defining ''x'' is equivalent to ''y'' if and only if ''x'' ≤ ''y'' and ''y'' ≤ ''x'';
if ''N'' is the equivalence class containing the origin then ''N'' is a vector subspace of ''X'' and ''X''/''N'' is an ordered vector space under the relation: ''A'' ≤ ''B'' if and only there exist ''a'' in ''A'' and ''b'' in ''B'' such that ''a'' ≤ ''b''.

A subset of ''C'' of a vector space ''X'' is called a proper cone if it is a convex cone of vertex 0 satisfying ''C'' ∩ (−''C'') = .
Explicitly, ''C'' is a proper cone if (1) ''C'' + ''C'' ⊆ ''C'', (2) ''rC'' ⊆ ''C'' for all ''r'' > 0, and (3) ''C'' ∩ (−''C'') = .
The intersection of any non-empty family of proper cones is again a proper cone. Each proper cone ''C'' in a real vector space induces an order on the vector space by defining ''x'' ≤ ''y'' if and only if ''y'' − ''x'' ∈ ''C'', and furthermore, the positive cone of this ordered vector space will be ''C''. Therefore, there exists a one-to-one correspondence between the proper convex cones of ''X'' and the vector partial orders on ''X''.

By a total vector ordering on ''X'' we mean a total order on ''X'' that is compatible with the vector space structure of ''X''.
The family of total vector orderings on a vector space ''X'' is in one-to-one correspondence with the family of all proper cones that are maximal under set inclusion.
A total vector ordering ''cannot'' be Archimedean if its dimension, when considered as a vector space over the reals, is greater than 1.

If ''R'' and ''S'' are two orderings of a vector space with positive cones ''P'' and ''Q'', respectively, then we say that ''R'' is finer than ''S'' if ''P'' ⊆ ''Q''.

Examples

The real numbers with the usual ordering form a totally ordered vector space. For all integers ''n'' ≥ 0, the Euclidean space R^''n'' considered as a vector space over the reals with the lexicographic ordering forms a preordered vector space whose order is Archimedean if and only if ''n'' = 0 or 1.

Pointwise order

If ''S'' is any set and if ''X'' is a vector space (over the reals) of real-valued functions on ''S'', then the pointwise order on ''X'' is given by, for all ''f'', ''g'' ∈ ''X'', ''f'' ≤ ''g'' if and only if ''f''(''s'') ≤ ''g''(''s'') for all ''s'' in ''S''.

Spaces that are typically assigned this order include:
* the space 𝓁_∞(''S'', R) of bounded real-valued maps on ''S''.
* the space ''c''₀(R) of real-valued sequences that converge to 0.
* the space ''C''(''S'', R) of continuous real-valued functions on a topological space ''S''.
* for any non-negative integer ''n'', the Euclidean space R^''n'' when considered as the space ''C''(, R) where ''S'' = is given the discrete topology.

The space $\mathcal^\left( \mathbb, \mathbb \right)$ of all measurable almost-everywhere bounded real-valued maps on R, where the preorder is defined for all ''f'', ''g'' ∈ $\mathcal^\left( \mathbb, \mathbb \right)$ by ''f'' ≤ ''g'' if and only if ''f''(''s'') ≤ ''g''(''s'') almost everywhere.

Intervals and the order bound dual

An order interval in a preordered vector space is set of the form
: 'a'', ''b''= ,
: 'a'', ''b''[_=_,
:'a'', ''b''.html" ;"title="=_,
:.html" ;"title="'a'', ''b''[ = ,
:">'a'', ''b''[ = ,
:'a'', ''b''">=_,
:.html" ;"title="'a'', ''b''[ = ,
:">'a'', ''b''[ = ,
:'a'', ''b''= , or
:]''a'', ''b''[ = .
From axioms 1 and 2 above it follows that ''x'', ''y'' ∈ 'a'', ''b''and 0 < λ < 1 implies λ''x'' + (1 − ''λ'')''y'' in 'a'', ''b''
thus these order intervals are convex.
A subset is said to be order bounded if it is contained in some order interval.
In a preordered real vector space, if for ''x'' ≥ 0 then the interval of the form ��''x'', ''x'' is balanced.
An order unit of a preordered vector space is any element ''x'' such that the set ��''x'', ''x''is absorbing.

The set of all linear functionals on a preordered vector space ''X'' that map every order interval into a bounded set is called the order bound dual of ''X'' and denoted by ''X''^''b''.
If a space is ordered then its order bound dual is a vector subspace of its algebraic dual.

A subset ''A'' of an ordered vector space ''X'' is called order complete if for every non-empty subset ''B'' ⊆ ''A'' such that ''B'' is order bounded in ''A'', both $\sup B$ and $\inf B$ exist and are elements of ''A''. We say that an ordered vector space ''X'' is order complete is ''X'' is an order complete subset of ''X''.

Examples

If (''X'', ≤) is a preordered vector space over the reals with order unit ''u'', then the map $p(x) := \inf \left\$ is a sublinear functional.

Properties

If ''X'' is a preordered vector space then for all ''x'', ''y'' ∈ ''X'',

* ''x'' ≥ 0 and ''y'' ≥ 0 imply ''x'' + ''y'' ≥ 0.
* ''x'' ≤ ''y'' if and only if −''y'' ≤ −''x''.
* ''x'' ≤ ''y'' and ''r'' < 0 imply ''rx'' ≥ ''ry''.
* ''x'' ≤ ''y'' if and only if ''y'' = sup if and only if ''x'' = inf.
* sup exists if and only if inf exists, in which case inf = −sup.
* sup exists if and only if inf exists, in which case for all ''z'' ∈ ''X'',
** sup = ''z'' + sup, and
** inf = ''z'' + inf
** ''x'' + ''y'' = inf + sup.
* ''X'' is a vector lattice if and only if sup exists for all ''x'' in ''X''.

Spaces of linear maps

A cone $C$ is said to be generating if $C - C$ is equal to the whole vector space.
If $X$ and $W$ are two non-trivial ordered vector spaces with respective positive cones $P$ and $Q,$ then $P$ is generating in $X$ if and only if the set $C = \$ is a proper cone in $L(X; W),$ which is the space of all linear maps from $X$ into $W.$
In this case, the ordering defined by $C$ is called the canonical ordering of $L(X; W).$
More generally, if $M$ is any vector subspace of $L(X; W)$ such that $C \cap M$ is a proper cone, the ordering defined by $C \cap M$ is called the canonical ordering of $M.$

Positive functionals and the order dual

A linear function $f$ on a preordered vector space is called positive if it satisfies either of the following equivalent conditions:

# $x \geq 0$ implies $f(x) \geq 0.$
# if $x \leq y$ then $f(x) \leq f(y).$

The set of all positive linear forms on a vector space with positive cone $C,$ called the dual cone and denoted by $C^*,$ is a cone equal to the polar of $-C.$
The preorder induced by the dual cone on the space of linear functionals on $X$ is called the .

The order dual of an ordered vector space $X$ is the set, denoted by $X^+,$ defined by $X^+ := C^* - C^*.$
Although $X^+ \subseteq X^b,$ there do exist ordered vector spaces for which set equality does hold.

Special types of ordered vector spaces

Let ''X'' be an ordered vector space. We say that an ordered vector space ''X'' is Archimedean ordered and that the order of ''X'' is Archimedean if whenever ''x'' in ''X'' is such that $\left\$ is majorized (i.e. there exists some ''y'' in ''X'' such that ''nx'' ≤ ''y'' for all $n \in \mathbb$) then .
A topological vector space (TVS) that is an ordered vector space is necessarily Archimedean if its positive cone is closed.

We say that a preordered vector space ''X'' is regularly ordered and that its order is regular if it is Archimedean ordered and ''X''⁺ distinguishes points in ''X''.
This property guarantees that there are sufficiently many positive linear forms to be able to successfully use the tools of duality to study ordered vector spaces.

An ordered vector space is called a vector lattice if for all elements ''x'' and ''y'', the supremum sup(''x'', ''y'') and infimum inf(''x'', ''y'') exist.

Subspaces, quotients, and products

Throughout let ''X'' be a preordered vector space with positive cone ''C''.

;Subspaces

If ''M'' is a vector subspace of ''X'' then the canonical ordering on ''M'' induced by ''Xs positive cone ''C'' is the partial order induced by the pointed convex cone ''C'' ∩ ''M'', where this cone is proper if ''C'' is proper.

;Quotient space

Let ''M'' be a vector subspace of an ordered vector space ''X'', $\pi : X \to X / M$ be the canonical projection, and let $\hat := \pi(C)$.
Then $\hat$ is a cone in ''X''/''M'' that induces a canonical preordering on the quotient space ''X''/''M''.
If $\hat$ is a proper cone in ''X''/''M'' then $\hat$ makes ''X''/''M'' into an ordered vector space.
If ''M'' is ''C''-saturated then $\hat$ defines the canonical order of ''X''/''M''.
Note that $X=\mathbb^2_$ provides an example of an ordered vector space where $\pi(C)$ is not a proper cone.

If ''X'' is also a topological vector space (TVS) and if for each neighborhood ''V'' of 0 in ''X'' there exists a neighborhood ''U'' of 0 such that ''U'' + ''N'') ∩ C⊆ ''V'' + ''N'' then $\hat$ is a normal cone for the quotient topology.

If ''X'' is a topological vector lattice and ''M'' is a closed solid sublattice of ''X'' then ''X''/''L'' is also a topological vector lattice.

;Product

If ''S'' is any set then the space ''X''^''S'' of all functions from ''S'' into ''X'' is canonically ordered by the proper cone $\left\$.

Suppose that $\left\$ is a family of preordered vector spaces and that the positive cone of $X_\alpha$ is $C_\alpha$.
Then $C := \prod_ C_\alpha$ is a pointed convex cone in $\prod_\alpha X_\alpha$, which determines a canonical ordering on $\prod_\alpha X_\alpha$;
''C'' is a proper cone if all $C_\alpha$ are proper cones.

;Algebraic direct sum

The algebraic direct sum $\bigoplus_\alpha X_\alpha$ of $\left\$ is a vector subspace of $\prod_\alpha X_\alpha$ that is given the canonical subspace ordering inherited from $\prod_\alpha X_\alpha$.
If ''X''₁, ..., ''X''_''n'' are ordered vector subspaces of an ordered vector space ''X'' then ''X'' is the ordered direct sum of these subspaces if the canonical algebraic isomorphism of ''X'' onto $\prod_\alpha X_$ (with the canonical product order) is an order isomorphism.

Examples

* The real numbers with the usual order is an ordered vector space.
* R² is an ordered vector space with the ≤ relation defined in any of the following ways (in order of increasing strength, i.e., decreasing sets of pairs):
** Lexicographical order: if and only if or ( and ). This is a total order. The positive cone is given by or ( and ), i.e., in polar coordinates, the set of points with the angular coordinate satisfying , together with the origin.
** if and only if and (the product order of two copies of R with "≤"). This is a partial order. The positive cone is given by and , i.e., in polar coordinates , together with the origin.
** if and only if ( and ) or ( and ) (the reflexive closure of the direct product of two copies of R with "<"). This is also a partial order. The positive cone is given by ( and ) or (), i.e., in polar coordinates, , together with the origin.
:Only the second order is, as a subset of R⁴, closed; see partial orders in topological spaces.
:For the third order the two-dimensional " intervals" are open sets which generate the topology.
* R^''n'' is an ordered vector space with the ≤ relation defined similarly. For example, for the second order mentioned above:
** if and only if for .
* A Riesz space is an ordered vector space where the order gives rise to a lattice.
* The space of continuous functions on where if and only if for all ''x'' in .

See also

*
*
*
*
*
*
*
*
*
*

References

Bibliography

*
* Bourbaki, Nicolas; Elements of Mathematics: Topological Vector Spaces; .
*
*
*

{{Order theory

Functional analysis
Ordered groups
Vector spaces