Fact-checked by Grok 2 weeks ago

Ordered vector space

An ordered vector space is a real vector space V equipped with a partial order \leq that is compatible with the linear structure, meaning that for all u, v, w \in V and \lambda \geq 0, if u \leq v then u + w \leq v + w and \lambda u \leq \lambda v.^[1] This structure ensures the order is preserved under addition and positive scalar multiplication, allowing elements to be compared while maintaining the algebraic properties of the vector space.^[2] The partial order in an ordered vector space is typically defined via a positive cone K = \{x \in V \mid 0 \leq x\}, which is a nonempty subset closed under addition and multiplication by nonnegative scalars, with the pointedness condition K \cap (-K) = \{0\} ensuring the order is antisymmetric.^[1] Key properties include the order being reflexive, antisymmetric, and transitive, forming a partial order, and the cone often generating the space such that V = K - K.^[3] Additional attributes like directedness (every element is a difference of positives) or Archimedeanness (no nontrivial infinitesimal elements) further refine the structure, with the latter implying that if nx \leq y for all n \in \mathbb{N}, then x \leq 0.^[1] Ordered vector spaces form a foundational framework in functional analysis, with significant subclasses such as Riesz spaces (or vector lattices), where the order extends to a lattice structure allowing suprema and infima for any two elements.^[4] These spaces underpin the study of positive operators, Banach lattices, and order-bounded maps, finding applications in optimization, economic theory (e.g., equilibrium models), operator semigroups, and even quantum information theory for entanglement detection via positive operators.^[4]^[3] The theory originated in the early 20th century, evolving through contributions from various mathematical schools, including systematic developments in the mid-20th century that integrated it with topology and functional analysis.^[4]

Fundamentals

Definition

An ordered vector space is a real vector space V equipped with a partial order \leq that is compatible with the vector space operations. Specifically, the partial order \leq is reflexive, antisymmetric, and transitive, and satisfies the following compatibility conditions for all x, y, z \in V and all scalars \lambda \in \mathbb{R}: if x \leq y, then x + z \leq y + z (translation invariance); and if x \leq y and \lambda \geq 0, then \lambda x \leq \lambda y (positive homogeneity).^[5]^[6] Unlike a totally ordered vector space, where every pair of elements is comparable, the partial order in an ordered vector space allows for incomparability; for instance, in \mathbb{R}^n with the componentwise order, vectors like (1, 0) and (0, 1) satisfy neither (1, 0) \leq (0, 1) nor (0, 1) \leq (1, 0).^[6] The development of ordered vector spaces gained prominence in the 1920s through the work of Hans Hahn and Stefan Banach, particularly in the context of the Hahn-Banach theorem for extending linear functionals on partially ordered spaces.^[7]

Positive Cones and Orderings

In an ordered vector space (V, \leq), the positive cone is defined as the subset P = \{ x \in V \mid 0 \leq x \}.^[8] This set P forms a convex cone that is closed under addition and multiplication by positive scalars, as the partial order \leq is compatible with the vector space operations: if x, y \in P and \lambda, \mu > 0, then \lambda x + \mu y \geq \lambda \cdot 0 + \mu \cdot 0 = 0.^[8] Moreover, P is pointed, meaning P \cap (-P) = \{0\}, which ensures the antisymmetry of the partial order, since if x \leq 0 and -x \leq 0, then x = 0.^[8] Conversely, any pointed, convex, generating cone P \subseteq V that is closed under addition and positive scalar multiplication induces a partial order on V via the relation x \leq y if and only if y - x \in P.^[8] This construction yields an equivalence: every compatible partial order on a vector space corresponds bijectively to such a positive cone, and vice versa.^[8] A cone satisfying these properties is often termed a proper cone, ensuring the induced order is partial rather than total or trivial.^[9] To sketch the proof of this bijection, first note that given a compatible partial order \leq, the associated P inherits convexity and closure under addition and positive scalars directly from the order compatibility axioms. Pointedness follows from antisymmetry.^[8] For the reverse direction, the relation defined by P is reflexive since $0 \in P, transitive because if y - x \in P and z - y \in P, then z - x = (z - y) + (y - x) \in P by closure under addition, and antisymmetric by pointedness. Compatibility holds: for addition, x \leq y implies x + w \leq y + w as (y + w) - (x + w) = y - x \in P; for positive scalars \lambda > 0, \lambda x \leq \lambda y since \lambda (y - x) \in P.^[8] Additional properties of the cone ensure the order's partial nature. The pointed condition prevents the order from being total, as non-zero elements need not be comparable. If the cone is generating (i.e., V = P - P), the order distinguishes elements across V without leaving subspaces unordered.^[8] If the cone fails to be pointed, the induced relation may not be antisymmetric; if not generating, the order restricts to a proper subspace.^[9]

Core Structures

Intervals

In an ordered vector space (V, \leq), where \leq is a partial order compatible with the vector space structure, the order interval between comparable elements a, b \in V with a \leq b is defined as the set

[a, b] = \{ x \in V \mid a \leq x \leq b \}.

This set consists of all elements sandwiched between a and b under the order relation. Equivalently, the order interval can be characterized using the positive cone V_+ = \{ x \in V \mid 0 \leq x \} as

[a, b] = (a + V_+) \cap (b - V_+).

If a \not\leq b, the interval is empty by convention.^[8]^[10] Order intervals possess several key structural properties. They are always convex, meaning that for any x, y \in [a, b] and \lambda \in [0, 1], the convex combination \lambda x + (1 - \lambda) y also belongs to [a, b], which follows directly from the compatibility of the order with scalar multiplication and addition. By construction, order intervals are order bounded, as they are contained within themselves and thus bounded above by b and below by a. In spaces equipped with an order unit u > 0—an element such that for every x \in V, there exists \alpha > 0 with -\alpha u \leq x \leq \alpha u—the symmetric interval [-u, u] is absorbing, meaning that for every x \in V, there is a scalar \lambda > 0 such that \lambda x \in [-u, u]. This absorbing property facilitates the definition of a natural seminorm on V, given by the Minkowski functional of [-u, u].^[8]^[11] The relation between order intervals and the positive cone is foundational, particularly in spaces with an order unit. For u > 0, the interval [0, u] = \{ x \in V \mid 0 \leq x \leq u \} plays a central role, as it captures the "bounded positive" elements up to u, and the positive cone V_+ consists of all nonnegative scalar multiples of elements from such intervals in the Archimedean case. More generally, any order interval admits a translation representation tied to the positive cone: [a, b] = a + [0, b - a], where b - a \in V_+. In unit-normalized ordered vector spaces, where the order unit is denoted by $1 (or e), order intervals can be characterized as translates of the standard unit interval [0, 1]. Specifically, for comparable a, b with b - a = 1, [a, b] = a + [0, 1], providing a uniform way to describe bounded order-convex sets across the space. This normalization aids in studying uniform structures and topologies induced by the order.^[8]^[11]

Order Bound Dual

The order bound dual of an ordered vector space V, denoted V^o, consists of all linear functionals f \in V^* such that for every order interval [a, b] in V, the image set \{f(x) \mid x \in [a, b]\} is bounded in the underlying scalar field.^[12] Order intervals provide the fundamental bounded sets in the order structure of V, and the boundedness condition ensures that f respects these order-theoretic constraints.^[12] The order bound dual V^o contains the order dual V^+ = \{f \in V^* \mid f(x) \geq 0 \text{ for all } x \geq 0\}, the set of positive linear functionals on V.^[12] Positive functionals are inherently order bounded, as their values on any interval [a, b] lie between 0 and f(b - a), establishing the inclusion V^+ \subseteq V^o.^[13] As a subset of the algebraic dual V^*, V^o forms a cone, closed under multiplication by non-negative scalars: if f \in V^o and \lambda \geq 0, then \lambda f \in V^o.^[12] Moreover, V^o majorizes the order dual in the sense that it contains the linear span of V^+, comprising all differences of positive functionals, which are order bounded by construction.^[13] This inclusion highlights V^o as a natural extension of the space generated by positive elements in the dual. In Archimedean ordered vector spaces, the order bound dual V^o coincides with the full algebraic dual V^* under certain conditions, such as when V is finite-dimensional.^[12] In this setting, the Archimedean property ensures that the order structure aligns closely with the linear structure, rendering all linear functionals order bounded.^[12]

Examples of Intervals and Duals

In the finite-dimensional real vector space \mathbb{R}^n equipped with the componentwise partial order defined by x \leq y if and only if x_i \leq y_i for all i = 1, \dots, n, the order intervals take the form of rectangular boxes [a, b] = \{ x \in \mathbb{R}^n \mid a \leq x \leq b \}, which can be expressed as the Cartesian product \prod_{i=1}^n [a_i, b_i]. These intervals are convex, symmetric about their midpoints, and bounded in the order sense, illustrating how the componentwise order generates compact sets in the Euclidean topology. The order bound dual of \mathbb{R}^n coincides with its algebraic dual, consisting of all linear functionals \phi(x) = \sum_{i=1}^n c_i x_i for c = (c_1, \dots, c_n) \in \mathbb{R}^n, since the space is finite-dimensional and every linear functional is automatically order bounded on bounded order intervals; the associated order unit norm on the dual is the \ell^1-norm \|c\|_1 = \sum_{i=1}^n |c_i|. Consider the space C[0,1] of continuous real-valued functions on the compact interval [0,1], ordered pointwise by f \leq g if f(t) \leq g(t) for all t \in [0,1]. A representative order interval is [0, e], where e is the constant function e(t) = 1, consisting of all functions f satisfying $0 \leq f(t) \leq 1 for every t \in [0,1]; this interval is compact in the uniform topology and corresponds to the unit ball in the supremum norm restricted to positive functions. The order bound dual comprises all order-bounded linear functionals, which are precisely those representable as Riemann-Stieltjes integrals \phi(f) = \int_0^1 f(t) \, d\alpha(t) for \alpha: [0,1] \to \mathbb{R} of bounded variation, with the total variation of \alpha providing the order bound.^[14] In the Lebesgue space L^p(\mu) for $1 < p < \infty over a \sigma-finite measure space (\Omega, \Sigma, \mu), equipped with the partial order f \leq g almost everywhere if f(t) \leq g(t) for \mu-almost all t \in \Omega, the positive cone is the set of non-negative functions in L^p. Order intervals [f, g] = \{ h \in L^p \mid f \leq h \leq g \ \mu\text{-a.e.} \} with f, g \in L^p and f \leq g are bounded subsets whose p-norms are controlled by \|g - f\|_p. The order bound dual is isometrically isomorphic to L^q(\mu) where \frac{1}{p} + \frac{1}{q} = 1, via the duality pairing \phi_h(f) = \int_\Omega h f \, d\mu for h \in L^q, as every order-bounded functional on such intervals extends continuously to the norm dual. A classical non-Archimedean example is the lexicographic plane \mathbb{R}^2 with the order (x_1, y_1) \leq (x_2, y_2) if x_1 < x_2 or (x_1 = x_2 and y_1 \leq y_2). This order is compatible but non-Archimedean, as elements like (0,1) are infinitesimal relative to (1,0), since no finite multiple n(0,1) = (0,n) \leq (1,0). Order intervals like [(0,0), (1,0)] consist of elements with first coordinate in [0,1) and arbitrary second if first=0 or 1, but bounded in the x-direction; the structure allows unbounded chains in the y-direction, highlighting the lack of Archimedeanness. The order bound dual includes functionals bounded on these intervals, such as those prioritizing the first coordinate.^[8]

Intrinsic Properties

General Properties

An ordered vector space V is equipped with a partial order \leq that is compatible with its vector space operations, relying on the underlying positive cone K = \{ x \in V \mid x \geq 0 \}, which is pointed (i.e., K \cap (-K) = \{0\}) and generates V as V = K - K. This compatibility ensures monotonicity with respect to addition and scalar multiplication: for all x, y, z \in V with x \leq y, it holds that x + z \leq y + z, and for all \lambda \geq 0, \lambda x \leq \lambda y.^[8] The order in an ordered vector space is typically directed upward, meaning that for any x, y \in V, there exists z \in V such that z \geq x and z \geq y. This directedness follows from the generating property of the positive cone and implies that the space can be viewed as differences of positive elements, facilitating the study of order-theoretic behaviors.^[8] An order ideal in an ordered vector space V is a linear subspace I \subseteq V that is downward directed with respect to the order in the positive direction: if x \in I and $0 \leq y \leq x with y \in V, then y \in I. Such ideals are closed under addition and scalar multiplication by construction as subspaces, and they capture subsets that are "convex" in the order sense without requiring the existence of absolute values.^[15] Unlike totally ordered vector spaces, the partial order in a general ordered vector space does not satisfy trichotomy: not every pair of elements x, y \in V is comparable, as there may exist elements such that neither x \leq y nor y \leq x holds. This lack of total comparability distinguishes ordered vector spaces from one-dimensional cases like \mathbb{R} and allows for richer structures in higher dimensions.^[8]

Archimedean Ordered Vector Spaces

An ordered vector space V with positive cone P is said to be Archimedean if, whenever y \in V satisfies n y \leq x for some fixed x \in P and all natural numbers n \geq 1, it follows that y \leq 0.^[16] This condition ensures the absence of positive infinitesimal elements relative to any fixed positive bound, preventing the existence of nonzero elements that remain arbitrarily small under repeated scalar multiplication by natural numbers. Equivalently, V is Archimedean if and only if \inf_{n \geq 1} \frac{1}{n} y = 0 for every y \in P.^[16] A key consequence of the Archimedean property is that such spaces admit a dense order embedding into spaces of real-valued functions. Specifically, every Archimedean ordered vector space with an order unit can be order densely embedded into a Riesz space of \mathbb{R}-valued functions on some set, preserving the order structure and ensuring that the image is dense in the sup-norm sense. This embedding theorem facilitates the representation of abstract orders via concrete function spaces, bridging algebraic and analytic perspectives. A classic example of a non-Archimedean ordered vector space is provided by the Hahn series over \mathbb{R}, denoted \mathbb{R}[[t^\Gamma]], where \Gamma is a well-ordered abelian group under addition. These series, with well-ordered support and coefficients in \mathbb{R}, are ordered lexicographically by the leading term's group element, yielding a proper cone that admits positive infinitesimals—for instance, t^\gamma for \gamma > 0 satisfies n t^\gamma < 1 for all n \in \mathbb{N} without t^\gamma \leq 0.^[17]

Functional Analysis Aspects

Spaces of Linear Maps

In ordered vector spaces V and W, the space L(V, W) of all linear maps from V to W inherits a natural partial order, called the pointwise order, defined by T \leq S for T, S \in L(V, W) if and only if Tx \leq Sx for every x \in V. Since the orders on V and W are compatible with their respective vector space structures, this condition is equivalent to Tx \leq Sx holding for all x \geq 0 in V. Under this pointwise order, L(V, W) becomes an ordered vector space, with the positive cone consisting of all positive operators T \geq 0, meaning T(P_V) \subseteq P_W, where P_V and P_W denote the positive cones of V and W. ^[2] The pointwise order on L(V, W) is compatible with its vector space operations, preserving addition and positive scalar multiplication in the same manner as the orders on V and W. If V and W are Archimedean ordered vector spaces, then so is L(V, W) under the pointwise order. Furthermore, the composition of positive operators is positive, ensuring that the set of positive operators forms a cone closed under addition and positive scalar multiplication. ^[18] When the positive cone of V or W is generating—meaning V = P_V - P_V or W = P_W - P_W—the induced positive cone in L(V, W) is also generating, making the pointwise order directed. In contrast, if V or W lacks a generating cone, the pointwise order on L(V, W) may fail to be directed, resulting in a structure where not every pair of elements admits an upper bound; such configurations are termed mixed orders. This distinction affects the applicability of certain order-theoretic properties, such as the existence of order bounds for operators. ^[2]

Positive Functionals and Order Dual

In an ordered vector space V with positive cone V_+, a linear functional f: V \to \mathbb{R} is called positive if f(x) \geq 0 whenever x \in V_+. The order dual of V, denoted V^+, is the set of all positive linear functionals on V. This set V^+ forms a cone in the algebraic dual space V^*, closed under addition and positive scalar multiplication, and plays a central role in the order structure of V. In general, the order dual of an Archimedean ordered vector space may be trivial, but it is nontrivial when V has additional structure, such as an order unit.^[8] In Archimedean ordered vector spaces with an order unit, the order dual separates points in the sense that the only element orthogonal to all positive functionals is zero. When V admits an order unit e > 0 (an element dominating all others up to scalar multiples), the order unit norm on V is defined by \|x\| = \inf \{ \lambda > 0 : -\lambda e \leq x \leq \lambda e \}. This norm is metrized via the order dual, specifically as \|x\| = \sup \{ |f(x)| : f \in V^+, \, f(e) = 1 \}, where the set of such normalized positive functionals forms the state space of V.^[19] In optimization, the state space of an ordered vector space with order unit corresponds to the set of normalized positive functionals, enabling scalarization of vector-valued objectives: a point x is Pareto optimal if f(x) is optimal for every state f, providing a duality framework for multi-objective problems.^[19]

Constructions and Extensions

Subspaces and Quotients

In an ordered vector space (V, V^+, \leq), where V^+ is the positive cone, a linear subspace U \subseteq V inherits the order structure naturally by restricting the partial order to U. Specifically, the induced positive cone on U is given by U^+ = U \cap V^+, which forms a proper cone in U since V^+ is pointed and closed under addition and positive scalar multiplication.^[20] This ensures that U becomes an ordered vector space where the order is compatible with the vector space operations: for u_1, u_2, w \in U and \lambda \geq 0, if u_1 \leq u_2 then u_1 + w \leq u_2 + w and \lambda u_1 \leq \lambda u_2.^[20] The induced order is translation-invariant and compatible with the vector space operations restricted to U. Certain hereditary properties transfer to such order subspaces. In particular, if V is Archimedean—meaning that if nx \leq y for all positive integers n and some x, y \in V with y \in V^+, then x \leq 0—then the subspace U with the induced order is also Archimedean.^[20] This follows because any sequence violating Archimedeanness in U would contradict the property in V. However, not all subspaces admit a nontrivial induced order; the cone U^+ must be proper to avoid trivializing the order. To induce an order on the quotient space V/U, the subspace U must be an order ideal, defined as a linear subspace such that if u \in U and $0 \leq z \leq u for some z \in V, then z \in U.^[21] In this case, the quotient V/U is partially ordered by declaring x + U \leq y + U if and only if there exists u \in U such that x \leq y + u.^[20] The positive cone in the quotient is then (V^+ + U)/U, which is a proper cone ensuring compatibility. Unlike subspaces, Archimedeanness is not necessarily preserved in such quotients; for instance, the Archimedeanization process involves quotienting by a specific null ideal to enforce the property, indicating that general quotients by order ideals may fail to inherit it.^[20] An important example of an order ideal is the kernel of a positive linear functional \phi: V \to \mathbb{R}, since if p \in \ker \phi and $0 \leq q \leq p, then $0 \leq \phi(q) \leq \phi(p) = 0, so \phi(q) = 0 and q \in \ker \phi.^[11] The quotient V / \ker \phi then embeds order-isomorphically into \mathbb{R} via \phi, preserving the order structure.^[21]

Products and Direct Sums

In the context of ordered vector spaces, the Cartesian product of a family \{V_i\}_{i\in I} of ordered vector spaces is the vector space \prod_{i\in I} V_i equipped with the product order, defined by (x_i)_{i\in I} \leq (y_i)_{i\in I} if and only if x_i \leq y_i in V_i for every i\in I.^[22] This componentwise partial order is compatible with the vector space operations on the product, making \prod_{i\in I} V_i itself an ordered vector space.^[22] The positive cone of the product is given by P = \prod_{i\in I} P_i, where P_i denotes the positive cone of V_i for each i.^[23] If each P_i is generating in V_i, meaning V_i = P_i - P_i and the order is determined by P_i, then the product cone P is likewise generating in \prod_{i\in I} V_i.^[24] The product order preserves key intrinsic properties of the components: it is Archimedean if and only if each individual order on V_i is Archimedean.^[24] Moreover, if each V_i admits an order unit u_i, then the tuple (u_i)_{i\in I} functions as an order unit for the product space.^[25] The direct sum of ordered vector spaces provides a complementary construction, particularly useful for finite or countable families. For a finite family \{V_1, \dots, V_n\}, the direct sum V_1 \oplus \cdots \oplus V_n coincides with the product \prod_{i=1}^n V_i as vector spaces and inherits the componentwise order, (x_1, \dots, x_n) \leq (y_1, \dots, y_n) if and only if x_i \leq y_i for all i=1,\dots,n.^[23] This order ensures that the direct sum is an ordered vector space, with positive cone P_1 \oplus \cdots \oplus P_n and preservation of generating, Archimedean, and order unit properties analogous to the finite product case.^[24]^[25] For infinite families \{V_i\}_{i\in I}, the algebraic direct sum consists of all tuples (x_i)_{i\in I} \in \prod_{i\in I} V_i with only finitely many nonzero components, equipped with the induced componentwise order from the product.^[23] When the index set I is directed (e.g., a directed partially ordered set), this construction extends naturally to inductive limits of the finite direct sums, preserving the order structure while maintaining compatibility with the vector space operations.^[23] The positive cone in the direct sum is the set of such tuples with each nonzero x_i \in P_i, which generates the space if the component cones do, and the Archimedean property holds if it does for each V_i; similarly, a family of order units \{u_i\} yields an order unit in the direct sum via finite combinations.^[24]^[25]

Special Types

Ordered vector spaces with enhanced structural properties form important subclasses that enable deeper analysis, such as the introduction of compatible norms or decompositions. These special types often arise in applications to optimization and functional analysis, where additional order conditions simplify the study of positive operators and convergence. An ordered vector space E is called an order unit space if there exists a positive element u \in E_+ known as an order unit, such that the order interval [-u, u] = \{ x \in E \mid -u \leq x \leq u \} is absorbing. This means that for every x \in E, there exists \lambda > 0 with -\lambda u \leq x \leq \lambda u.^[26] The order unit facilitates the definition of an order unit norm \|x\|_u = \inf \{ \lambda > 0 \mid -\lambda u \leq x \leq \lambda u \}, turning E into a normed space where the norm is monotone with respect to the order.^[26] Order unit spaces are particularly useful in representing spaces like C(K) for compact K, where the constant function 1 serves as the order unit. Bands provide a way to decompose ordered vector spaces using disjointness. In a directed partially ordered vector space X, two elements x, y \in X are disjoint, denoted x \perp y, if the set of upper bounds of \{x + y, x - y\} coincides with that of \{x - y, -x + y\}.^[27] The disjoint complement of a subset B \subseteq X is B^d = \{ y \in X \mid x \perp y \ \forall x \in B \}, and the double disjoint complement is (B^d)^d. A linear subspace B is a band if B = (B^d)^d.^[27] A band B is called a projection band if X = B \oplus B^d, allowing an order-preserving projection onto B along B^d.^[28] These structures generalize ideals in lattice-ordered spaces and are crucial for spectral decompositions in operator theory. In the context of ordered normed vector spaces, the positive cone E_+ is said to be normal if there exists a constant N > 0 such that for all $0 \leq x \leq y, \|x\| \leq N \|y\|.^[29] This normality condition ensures that the norm is compatible with the order, implying that order-bounded sets are norm-bounded and that positive linear operators map order-bounded sets to norm-bounded ones. Normal cones are essential in studying the geometry of ordered Banach spaces and the continuity of lattice homomorphisms. A further enhancement involves completeness properties relative to the order. An ordered vector space E is \sigma-order complete if every increasing sequence \{a_n\}_{n=1}^\infty \subseteq E that is bounded above admits a supremum \sup_n a_n \in E.^[30] This countable completeness strengthens the order structure, facilitating the existence of limits for monotone sequences and relating to \sigma-Dedekind completeness in more lattice-like settings. In Archimedean ordered vector spaces, \sigma-order completeness often implies desirable topological properties, such as metrizability of the order topology.^[30]

Applications and Examples

Pointwise Order on Function Spaces

One of the most natural examples of ordered vector spaces arises from equipping spaces of real-valued functions with the pointwise order. Let X be an arbitrary set, and consider the vector space \mathbb{R}^X consisting of all functions f: X \to \mathbb{R}. Define the partial order \leq on \mathbb{R}^X by f \leq g if and only if f(x) \leq g(x) for every x \in X. This order is compatible with the vector space operations, as addition and scalar multiplication preserve the order relations, thereby making \mathbb{R}^X an ordered vector space. The associated positive cone is the set of all non-negative functions, i.e., \{f \in \mathbb{R}^X \mid f(x) \geq 0 \ \forall x \in X\}. This pointwise ordering extends directly to important subspaces of function spaces commonly studied in analysis. For instance, let X be a topological space, and let C_b(X) denote the vector space of all continuous real-valued functions on X that are bounded. Endowing C_b(X) with the pointwise order—again, f \leq g whenever f(x) \leq g(x) for all x \in X—yields an ordered vector space whose positive cone comprises the continuous bounded functions that are non-negative on X. Similarly, on a measure space (\Omega, \Sigma, \mu), the space L^\infty(\mu) of (equivalence classes of) essentially bounded measurable functions is ordered pointwise almost everywhere: f \leq g if f(\omega) \leq g(\omega) for \mu-almost every \omega \in \Omega, with the positive cone consisting of those essentially bounded functions non-negative almost everywhere. The pointwise order on these function spaces aligns with the product order on the infinite product \mathbb{R}^X, where the order is defined coordinatewise. The order dual of such spaces, comprising the positive linear functionals, corresponds to integration against positive measures; for example, on C_0(X), the space of continuous functions vanishing at infinity where X is locally compact Hausdorff, every positive functional is given by \phi(f) = \int_X f \, d\mu for some positive Radon measure \mu on X.^[31]

Order Unit Spaces

An ordered vector space E is called an order unit space if there exists an element u \in E^+ (with u > 0) such that for every x \in E, there is some \lambda > 0 satisfying -\lambda u \leq x \leq \lambda u.^[32] This condition ensures that u "spans" the order in the sense that multiples of u dominate every element from both above and below.^[33] Order units provide a reference scale for the partial order, facilitating metric structures on the space.^[34] A prototypical example is the space C(K) of all continuous real-valued functions on a compact Hausdorff space K, equipped with the pointwise order f \leq g if f(t) \leq g(t) for all t \in K. Here, the constant function u \equiv 1 serves as an order unit, since for any f \in C(K), the multiple \lambda \|f\|_\infty \cdot u bounds f appropriately.^[35] Another example is \ell^\infty, the space of bounded real sequences with the pointwise order and the sequence u = (1,1,1,\dots) as the order unit.^[36] Given an order unit u > 0, the order unit norm is defined by

\|x\|_u = \inf \{ \lambda > 0 \mid -\lambda u \leq x \leq \lambda u \}.

This expression yields a genuine norm on E, as it satisfies the norm axioms and is compatible with the vector space operations.^[34] With respect to \|\cdot\|_u, the space E becomes a normed vector space, and the closed order interval [-u, u] coincides with the closed unit ball \{ x \in E \mid \|x\|_u \leq 1 \}.^[37] Consequently, the unit ball is order bounded, and the norm induces a topology in which order bounded sets are absorbed by multiples of the order unit.^[32] If E is Archimedean, completeness with respect to \|\cdot\|_u makes E a Banach space.^[33] Archimedean order unit spaces admit a canonical representation: they are isometrically order isomorphic to (closed) order dense subspaces of C(S), the space of continuous real-valued functions on a compact Hausdorff space S (the state space, consisting of normalized positive linear functionals on E), equipped with the supremum norm and pointwise order, where the order unit u corresponds to the constant function 1.^[38] In this embedding, elements of E map to functions taking values in [0, 1] on S, reflecting the bounding role of u in the dual-ordered setting.^[36]

Riesz Spaces

A Riesz space, also known as a vector lattice, is a partially ordered real vector space in which the order structure forms a lattice, meaning that for every pair of elements x, y in the space, the supremum \sup\{x, y\} and infimum \inf\{x, y\} exist in the space.^[39] This lattice order is compatible with the vector space operations: if x \leq y, then \alpha x \leq \alpha y for \alpha \geq 0, and the order is preserved under addition.^[39] The prototypical example arises from the pointwise order on spaces of real-valued functions, where the supremum and infimum are taken pointwise.^[40] Riesz spaces are precisely the lattice-ordered vector spaces over the real numbers \mathbb{R}, where the partial order satisfies the lattice axioms alongside the vector space structure.^[40] A key property is Dedekind completeness: a Riesz space is Dedekind complete if every non-empty subset that is bounded above has a least upper bound (supremum) in the space.^[39] A related notion is \sigma-Dedekind completeness, where every countable non-empty subset bounded above has a supremum; this is equivalent to the existence of suprema for non-decreasing sequences that are bounded above.^[39] In a \sigma-Dedekind complete Riesz space, the monotone convergence theorem holds: if (x_n) is a non-decreasing sequence in the positive cone bounded above, then \sup_n x_n exists and equals the order limit of the sequence.^[39] Important subclasses of Riesz spaces include those with additional topological structure, such as Banach lattices. An AM-space (abstract M-space) is a Banach lattice whose norm satisfies \|x \vee y\| = \max\{\|x\|, \|y\|\} for all x, y in the space.^[39] A KB-space (Kantorovich-Banach space) is a Banach lattice in which every increasing sequence that is norm-bounded converges in norm to its supremum.^[41] These subclasses capture spaces like the continuous functions C(K) on a compact Hausdorff space (an AM-space) and L^p spaces for $1 \leq p < \infty (KB-spaces).^[39]

References

[1]
[PDF] Norm-induced partially ordered vector spaces - Universiteit Leiden
Definition 1.5. Directed. We call a partially ordered vector space V directed if any element can be written as the difference of two positive elements.
[2]
[PDF] Positive operators and their applications on ordered vector spaces
A vector space X is called an ordered vector space if it is ordered through ⪯ for any elements x, y, z ∈ X and α ∈ R+, x ⪯ y =⇒ x + z ≤ y + z and 0 ≤ x ...
[3]
Ordered Vector Space - an overview | ScienceDirect Topics
An ordered vector space is defined as a real vector space that is equipped with an ordering, allowing for the comparison of its elements, in conjunction with a ...
[4]
Preface
Chapter 6 specializes the theory of K-lattices to the space of all ordered bounded linear functionals on an ordered vector space. Among other things, this ...
[5]
Ordered vector space – Knowledge and References - Taylor & Francis
An ordered vector space is a vector space E that has an order relation "≤" which is reflexive, antisymmetric, and transitive, and is compatible with the ...
[6]
ordered vector space - PlanetMath.org
Mar 22, 2013 · A vector space V V over C ℂ is said to be ordered if W W is an ordered vector space over R ℝ , where V=W⊕iW V = W ⊕ i ⁢ W (V V is the ...Missing: mathematics | Show results with:mathematics
[7]
[PDF] The Hahn-Banach Theorem: The Life and Times - UCI Mathematics
Helly [1912] viewed things in terms of extending continuous linear forms and gave the precursor to the argument that Hahn [1927] and Banach [1929] each used ...
[8]
Chapter 1 - American Mathematical Society
In other words, an ordered vector space is a vector space equipped with cone. This chapter studies the basic properties of cones. Like the rest of this book, ...Missing: textbook | Show results with:textbook
[9]
[PDF] LCoP Part II – Preliminaries and Convex Cone Structures
• An ordered vector space ... • A proper cone K in a vector space can induce a partial order “≥K” a ≥K b ⇔ a − b ∈ K which leads to an ordered vector space.
[10]
[PDF] Order-convergence in partially ordered vector spaces
In ordered vector spaces there are several natural ways to define convergence using only the ordering. We will refer to them as 'order-convergence'. Order ...
[11]
[PDF] Connections Between the General Theories of Ordered Vector ...
Aug 8, 2018 · Definition 1.14 ([AT07, Definition 1.10 & Lemma 1.11]). A real or complex ordered vector space (V,V +) is said to be Archimedean3 if it ...
[12]
Ordered Linear Spaces - SpringerLink
Download chapter PDF · Preliminaries. Graham Jameson. Pages viii-xv. Ordered linear spaces. Graham Jameson. Pages 1-39. Linear lattices and riesz spaces. Graham ...
[13]
An Elementary Example of an Order Bound Dual Space that is not ...
generating cone order bound dual partially ordered vector space positive functional regular functional. Mathematics Subject Classification. 47L07 06F20.
[14]
None
Summary of each segment:
[15]
[1309.2903] Note on Archimedean property in ordered vector spaces
Sep 11, 2013 · It is shown that an ordered vector space X is Archimedean if and only if \inf\limits_{\tau\in\{\tau\}, y\in L}(x_\tau -y) \ = 0 for any bounded ...Missing: R P ∩ Q P =
[16]
[PDF] Non-Archimedean Preferences Over Countable Lotteries - PhilArchive
Let a (discrete) lottery over a set of outcomes X be a function 𝜆 ∶ X → [0,1] such that ∑x∈X 𝜆(x) = 1. Let ΔX be the set of all such lotteries.<|control11|><|separator|>
[17]
Linear Operators in Partially Ordered Normed Vector Spaces
In this paper we study the natural order structure of the normed space of all continuous linear operators between such partially ordered normed spaces. We prove ...
[18]
[PDF] Appendix: Order unit spaces and base norm spaces
A base norm space has a base on a hyperplane, and its dual is an order unit space. The dual of an order unit space is a base norm space.
[19]
[PDF] arXiv:1406.3657v2 [math.FA] 22 Aug 2014
Aug 22, 2014 · The following example shows that, for the cone DV + NV in V/NV to be. Archimedean, existence of an order unit in (V,V+) is not essential.
[20]
[PDF] arXiv:0712.2613v4 [math.OA] 10 Jun 2009
Jun 10, 2009 · This paper develops a theory of ordered ∗-vector spaces with an order unit, focusing on operator systems and related to operator systems.<|control11|><|separator|>
[21]
[PDF] States in some ordered structures and axioms of choice - univ-reunion
Remarks : if E is an ordered vector space : The vector space ET endowed with the product order is an ordered vector space and the vector subspace Z is order- ...
[22]
[PDF] Representations and Semisimplicity of Ordered Topological Vector ...
Sep 24, 2020 · This paper studies ways to represent an ordered topological vector space as a space of continuous functions, extending the classical ...
[23]
[PDF] INTRINSIC STRUCTURES IN AN ORDERED VECTOR SPACE ...
product n Ei in OV is also an Archimedean ordered vector space with. I a generating positive cone. Let pr/: (n Ei ,. 0) - (Ei , 0) be the. I projection ...
[24]
[PDF] Order-Preserving Variants of the Basic Principles of Functional ...
Jun 17, 2019 · An element 1 ∈ L of a partially ordered vector space L is called (strongly) order unit if L = ... order unit in the product. Denote 1E×F = (1E,1F ) ...
[25]
[PDF] arXiv:2312.07714v2 [math.OC] 13 Jan 2024
Jan 13, 2024 · This paper studies partial and weak preference relations on infinite-dimensional vector spaces, compatible with algebraic operations, and their ...Missing: absorptive | Show results with:absorptive
[26]
Bands in partially ordered vector spaces with order unit
Bands can be studied by using a vector lattice cover Y of X. If X has an order unit, Y can be represented as C ( Ω ) , where Ω is a compact Hausdorff space.
[27]
Orderings of vector spaces
The pair (E,~) is called an ordered vector space, and the set E+ := ~ x ~ E: x~ O I is a pro per cone called the positive cone of E. Conversely, each proper ...
[28]
Cone normed spaces and weighted means - ScienceDirect.com
The cone is called normal if there is a constant number such that for all. The least positive number satisfying the above inequality is called the normal ...
[29]
[PDF] Characterization of the σ-Dedekind complete Riesz space by ... - arXiv
Apr 10, 2023 · Order complete ordered vector spaces. Definition 1 The o.v.s. (X, ≤) is called σ-monotone complete o.v.s. if every increasing sequence {an} ...
[30]
[PDF] Order Bounded Maps and Operator Spaces - UNL Math
Mar 28, 2015 · An ordered vector space is a normed vector space V over R, with a subset V+ satisfying the following. 1 a,b ∈ V+ implies that a + b ∈ V+. 2.
[31]
[PDF] The Archimedean order unitization of seminormed ordered vector ...
Feb 13, 2025 · Abstract. In this paper, we describe a way of turning a seminormed preordered vector space into an. Archimedean order unit space.<|separator|>
[32]
[PDF] Functional representation of ordered vector spaces without order unit
Jul 5, 2018 · First we start with the definitions of ordered vector space and positive cone. Definition 1.1. Let X be a (real) vector space. Then a ...
[33]
[PDF] Order isomorphisms of complete order-unit spaces - HAL
Dec 31, 2019 · Abstract. We investigate order isomorphisms, which are not assumed to be linear, between complete order unit spaces.<|separator|>
[34]
Vector Spaces with an Order Unit - ResearchGate
Aug 10, 2025 · This problem is closely related to the problem of defining quotients of ordered vector spaces. ... Characterizations of Ordered Self-adjoint ...
[35]
[PDF] arXiv:2111.06758v2 [math.FA] 6 Jan 2022
Jan 6, 2022 · A norm || · || on an ordered vector space E is said monotone if it preserves the order, i.e., if 0 ≤ v ≤ w then ||v|| ≤ ||w|| for every v ...
[36]
representation of ordered linear spaces - Project Euclid
A simple example of an ordered linear space is provided by the space of all real-valued functions defined on some set with the usual pointwise definitions of ...<|control11|><|separator|>
[37]
[PDF] Chapter 35 Riesz spaces - University of Essex
Sep 4, 2009 · Definition A Riesz space or vector lattice is a partially ordered linear space which is a lattice. 352B Lemma If U is a partially ordered linear ...
[38]
Riesz spaces
- An ordered vector space is said to be a Riesz space. (or lattice-ordered vector space) 1 if its order structure is a lattice-ordering. (that is, if every ...
[39]
property and $b$-weakly compact operators - Math-Net.Ru
A Banach lattice E is called a KB-space if every increasing norm bounded sequence in E+ is norm convergent. KB-spaces have b-property. Perfect Riesz spaces have.