Pareto efficiency without topology

Given a vector optimization problem over spaces endowed with a topological linear structure, existence results for optima (efficient points) are known. Relying only on the linear structure, the set of properly efficient points from a convex set is proved to be nonempty and the sets of Proper efficient points and Pareto efficient points coincide, provided that the set of internal points picked from the corresponding cone is nonempty. This result is appealing since the scalarization of the vector optimization problem is valid without topological requirements. A As an important consequence, we provide the Second Welfare Theorem in vector lattices and especially in Lebesgue spaces holds without topology.


Motivation of the paper
In vector optimization problems dealing with the existence of efficient points x 0 , one can consider a partially ordered vector space. We assume throughout the paper that any vector space is defined over the real numbers. Henceforth, we consider a vector space L, an ordering cone K ⊆ L and a constraint set A ⊆ L such that x ∈ (x 0 − K) and x ∈ A would imply x = x 0 , provided that the cone K is pointed. These are minimal points of A, also called Pareto efficient points. A similar definition holds for maximal points, it suffices to consider minimal points with respect to the ordering cone −K . The general problem in vector optimization is to determine properties for the set of minimal points (A, K) of A, with respect to the cone K. The scalarization 1 3 of such a problem is nothing but finding a linear functional f such that f (x) ⩾ f (x 0 ) , for some x 0 ∈ (A, K) . Thus x 0 is a solution to the linear programming problem given by minimizing f(x) subject to x ∈ A . When x 0 ∈ (A, K) is such that x 0 solves the linear programming problem over A and f is a strictly positive linear functional, with respect to K, then x 0 is a proper efficient point. The linear functional for which scalarization is provided relies on x 0 itself. The definition of a strictly positive linear functional with respect to the cone K is given in the Appendix.
In most of the research devoted to Pareto efficient points, authors use topological properties either of the cone being used for real-valued or vector minimization problems, or topological properties of the vector space itself. Indeed the latter is either a locally convex topological vector space or some normed linear space. Thus, vector optimization problems involve questions about the (topological) interior points of the ordering cone. In this paper we show that algebraic interior points may replace topological interior points in studying vector optimization problems. This approach yields results similar or 'stronger' than 'density results' of the vector optimization problems. Density arguments generalize the Arrow-Barankin-Blackwell Theorem originally developed in finite dimensional spaces and prescribe how the set of Pareto efficient points or proper efficient points may be approximated by a suitable subset using the topological structure of the space being considered, see for example Gong [11]. or Ng and Zheng [15] and the references therein. Instead, our algebraic approach tied to convexity enables us to use The Eidelheit's separation theorem as stated in [8] and to show equality between the set of Pareto efficient points and the set of proper efficient points. We apply our results to the special case of Lebesgue spaces. Eventually we consider applications to optimal allocation in exchange economies.

Pareto efficient and proper efficient points
Here and throughout the paper we let L be a nonempty vector space. In the following we recall the definition of Pareto efficient and proper efficient points whenever L is endowed with some topology and A, K are its subsets.

Definition 2.2
A proper efficient point of some A, with respect to the cone K, is any x 0 ∈ A such that f (x) ⩾ f (x 0 ), for every x ∈ A and f is a strictly positive functional, with respect to K. Namely, f (k) > 0 for any k ∈ K ⧵ {0} . The set of these points is denoted by (A, K).
The above definition of proper efficient points is due to Gong [11]. A general version of the Arrow-Barankin-Blackwell Theorem for normed linear spaces is the following: Pareto efficiency without topology Theorem 2.3 If K ⊆ L is a closed cone and A ⊆ L is non-empty convex and closed set, then (A, K) ⊆ (A, K).
The finite dimensional version of the above theorem appears initially in Arrow et al. [6]. A seminal reference to the above result in normed linear spaces is contained in Borwein [7]. The notion of proper efficient points can be found in Geoffrion [10] as applied to the study of multi-criteria optimization problems. Positive 'components' akin to nonnegative Lagrange multipliers means that every constraint condition cannot be omitted, otherwise they are binding and then may be discarded.
In the rest of the paper we relax the topological requirement for L and use its linear structure. The constrain set A ⊂ L is nonempty and K ⊆ L is a cone. We additionally need A to be convex. Further, for a vector optimization problem the determination of the optima in (A, K) is understood, while its scalarization is achieved if for some A systematic study of vector optimization problems in infinite dimensional spaces began with Borwein [7] as an attempt to determine the solution set (A, K) . The motivation for using infinite dimensional spaces is the modeling of uncertainty, either for the values of the objective functional or for the constraint set. Other seminal works on the validity of the Arrow-Barankin-Blackwell Theorem are Fu [9], Jahn [12] and Petschke [16]. The assumptions of these papers are almost the same, and rely on the properties of a base for the cone K, which induces the partial ordering on K. We remind that a base for the cone K is some convex set B of the cone K, such that for any k ∈ K ⧵ {0} there exists a unique real number t k > 0 , such that t k ⋅ k ∈ B . t ⋅ x denotes the product between any vector x of L and some real number t. In [11] the existence of a norm bounded base of the ordering cone implies the definition of a sequence of expansion cones, which are useful for the study of the efficient points of normed spaces. In [1] a similar approach is provided for characterizing proper efficiency by replacing the topological setting by the algebraic one. However, a solid cone should be defined in a suitable way. Since usually a cone K is called solid if the norm-interior of the dual wedge K 0 of K is nonempty, the algebraic analogue requires the existence of algebraic interior points in K 0 . Indeed, in [17] algebraic notions replace the topological ones in the study of Pareto efficient points with respect to expansion cones.

Internal and interior points of a cone
In this section we prove that there exist classes of normed vector lattices in which a set of norm-interior points of the ordering cone (inducing the lattice structure) is empty. On the other hand, the set of (algebraic) internal points of the cone is nonempty. If this is the case, internal points of vector lattices allow the use of the Eidelheit's separation theorem. Henceforth, we specialize to Lebesgue spaces L p , namely L p (Ω, F, ) , where 1 ⩽ p < +∞ and (Ω, F, ) is an atomless complete probability space. In particular, it supports distributions of random variables whose possible cardinal number is equal to that of the set of real numbers. We make use of the following sets (see Appendix 6): The former definition relies on the norm topology, while the latter is purely algebraic and depends on the lattice structure of L 1 . Proof Proof If x ∈ L 1 + ⧵ {0} is a quasi-interior point of L 1 + , then for any x 0 ∈ L 1 , there exists some sequence (x n ) n∈ℕ lying in I x , which is norm-convergent to x 0 . Hence, for some > 0 , there exists some n 0 ( ) , such that ‖x 0 − x n ‖ 1 < , for any n ⩾ n 0 = n 0 ( ) , which also depends on x 0 . Thus, −x n 0 ∈ I x and −x n 0 ∈ [−k n 0 x, k n 0 x] for some k n 0 ∈ ℕ . Now, we get and the proof is complete. ◻

Vector optimization using internal points
In this section, we show how internal points of a cone affect scalarization of vector optimization problems. First, we characterize proper efficient points of a convex constraint set A through internal points of the ordering cone K.
Pareto efficiency without topology

Theorem 4.1 Given a vector space L and a convex subset A, let K ⊆ L be a cone whose algebraic interior is nonempty. If
where K 0 and (x 0 − K) 0 denote the internal points of K and x 0 − K , respectively By Eidelheit's separation theorem there exists some linear functional f ≠ 0 , lying in the algebraic dual L ′ of L such that where the supremum is not equal to −∞ , since A is nonempty. From the above separation inequality, we obtain that f (x 0 ) − f (k) ⩾ f (x 0 ) , for any k ∈ K . Hence, g = −f ∈ K 0 . If we suppose that there exists some k 0 ∈ K ⧵ {0} such that g(k 0 ) > 0 then nk 0 ∈ K for any n ∈ ℕ , but this is a contradiction since the separation inequality is violated as far as n → +∞ . Hence, g is a strictly positive functional with respect to K. The separation inequality now implies that g(a) ⩾ g(x 0 ) for any a ∈ A , namely x 0 ∈ (A, K) . ◻ Next, we state our main result in this section: using again convexity and internal points, optima are both properly efficient and Pareto efficient.

Implications in mathematical economics
In mathematical economics, a prominent topic is the study of Exchange Economies, having a finite number of consumers i = 1, … , I . Infinite dimensional spaces are applied to accommodate uncertainty in economic phenomena. In particular, infinite dimensional vector lattices have a widespread application, because properties of vector lattices may replace the topological requirements used in the proof of existence results in welfare economics. These results rely on the order structure of vector lattices or other partially ordered linear spaces, without using the locally convex topological setting. The result presented in this paragraph is a part of this direction of study. The most important contributions in the same fashion are Aliprantis and Brown [4] and Aliprantis et al. [5]. The last paper is devoted to partially ordered vector spaces, which possess the Riesz Decomposition Property. A previous work, which is important since it is devoted to partially ordered spaces the prices of which lie in the topological dual of some vector lattice is [14]. Each consumer's consumption set is L + , which denotes the positive cone of some vector lattice having quasi-interior points, such as L p spaces. For this purpose 1 ⩽ p < +∞ . The endowment of consumers are denoted by i ∈ L + , for any i = 1, … , I . The utility function of any consumer is denoted by u i ∶ L + → ℝ , for any i = 1, … , I . The set of allocations is the set The sets of utility improvement with respect to the allocation x are actually A i = {x ∈ L + |u i (x) ⩾ u i (x i )} , for any i = 1, … , I . We suppose that A i is convex for any x ∈ A and for any i = 1, … , I.

Remark 5.1
We do not require additional topological structure of any A i . Now we show that every consumer's bundle is indeed a proper efficient point with respect to the problem of maximizing utility in a Pareto optimal way.

Appendix: Partially ordered vector spaces
Let L be a vector space and let K ⊆ L be nonempty with K ≠ {0} . We call K a wedge of L if where k denotes the product between the scalar and the vector k.
If in addition K ∩ (−K) = {0} , where 0 is the zero vector of L, then K is a cone of L. We write −K = {x ∈ L | −x ∈ K} for the negative of K. Sometimes a cone is mentioned as pointed cone and a wedge is termed as cone. Any cone K induces a partial ordering on L as follows: This can be written x ⩽ K y . In the case K ≠ {0} , the partial ordering is reflexive, antisymmetric, transitive and compatible with the linear structure of L: (ii) If x ⩾ y and y ⩾ x , then x = y; (iii) If x ⩾ y and y ⩾ z , then x ⩾ z; (iv) If x ⩾ y , then x ⩾ y for any ∈ ℝ + ; (v) If x ⩾ y , then x + z ⩾ y + z , for any z ∈ L.
If L ′ is the algebraic dual of L, that is the vector space of all linear functionals of L, then is called the polar wedge of K. For A ⊆ L a vector a ∈ A is an internal point of A if given some x ∈ L , there exists a real number > 0 such that a + x ∈ A , for any ∈ ℝ , with | | ⩽ . An internal point is often called algebraic interior point. Any f ∈ K 0 is called a positive functional with respect to K. If K is a cone, then any supremum in L, we call it a vector lattice. A subset S of the vector lattice L is solid if for any x ∈ S , such that y ∈ L and |y| ⩽ |x| , then y ∈ S . The solid subspace generated by x ∈ L ⧵ {0} is defined as I x = ∪ ∞ n=1 [−nx, nx] , where n ∈ ℕ . If L is a normed linear space and I x is dense in L, then x is called quasi-interior point.
Funding Open access funding provided by HEAL-Link Greece.

Data availability
The manuscript has no associated data.

Declarations
Conflicts of interest There is not any conflict of interest concerning this paper.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http:// creat iveco mmons. org/ licen ses/ by/4. 0/.