Disjointness preserving operators on normed pre-Riesz spaces: extensions and inverses

We explore inverses of disjointness preserving bijections in infinite dimensional normed pre-Riesz spaces by several methods. As in the case of Banach lattices, our aim is to show that such inverses are disjointness preserving. One method is extension of the operator to the Riesz completion, which works under suitable denseness and continuity conditions. Another method involves a condition on principle bands. Examples illustrate the differences to the Riesz space theory.


Introduction
In 1992, Y. A. Abramovich raised a question in the problem section of [6]: if X , Y are vector lattices and T : X → Y is a linear disjointness preserving bijection, is T −1 : Y → X disjointness preserving as well? If X and Y are Banach lattices, the answer is affirmative, see [5]. This initiated research to explore the most general setting in which a similar result is true; see [2] and references therein. It is also observed there that for a disjointness preserving bijection between arbitrary vector lattices the inverse is not disjointness preserving, in general. In [7] it is proved that an order bounded B Onno van Gaans vangaans@math.leidenuniv.nl Anke Kalauch anke.kalauch@tu-dresden.de Feng Zhang zhangfeng.0631@163.com 1 Institut für Analysis, Fakultät Mathematik, TU Dresden, 01062 Dresden, Germany 2 Mathematical Institute, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands disjointness preserving bijection between Archimedean vector lattices has an order bounded disjointness preserving inverse. A result clarifying the role of the underlying spaces is given in [5,Theorem 2.1], which reads as follows. Theorem 1.1 Let X be a uniformly complete vector lattice, Y a normed vector lattice, and T : X → Y an injective and disjointness preserving operator. Then for every x 1 , x 2 ∈ X we have that T x 1 ⊥ T x 2 implies x 1 ⊥ x 2 .
In general partially ordered vector spaces there is a natural notion of disjointness, see [9]. In [15], van Haandel develops a theory for pre-Riesz spaces, which are exactly those partially ordered vector spaces that can be order densely embedded into vector lattices. The smallest vector lattice in which a pre-Riesz space can be order densely embedded is called the Riesz completion. In particular, every directed Archimedean partially ordered vector space is a pre-Riesz space. For the theory of pre-Riesz spaces, see also [10]. Abramovich's question extends naturally to the pre-Riesz setting. So far, the problem is only studied in finite dimensions. In [8], it is shown that the inverses of disjointness preserving bijections in finite dimensional Archimedean pre-Riesz spaces are disjointness preserving. The affirmative answer in the finite-dimensional setting motivates to investigate the infinite-dimensional case. The present paper is a first exploration of Abramovich's problem for the infinite-dimensional pre-Riesz space setting. We consider several approaches and examples. Among them, we try to generalize Theorem 1.1 by extending disjointness preserving operators on pre-Riesz spaces to Riesz completions.
The paper is organized as follows. In Sect. 2, we collect some basic terminology and properties. In Sect. 3 we compare the setting of pre-Riesz spaces to the vector lattice setting by means of two examples. In Sect. 4 we show that there may exist a rich set of disjointness preserving operators on a pre-Riesz space by computing all disjointness preserving bijections in a finite dimensional example with a particular polyhedral cone. In the Sects. 5 and 6 we consider generalization of Theorem 1.1. In Sect. 5 we consider more general range spaces, which turns out to be straightforward. Generalizing the domain space X is a more difficult task, as is discussed in Sect. 6. Our method is to extend disjointness preserving operators on pre-Riesz spaces to their Riesz completions. We study several ways, each of them involving quite strong conditions. Finally, in Sect. 7 we consider a pre-Riesz space generalization of Abramovich and Kitover's analysis of inverses of disjointness preserving operators in [1], which involves a property called property (β).

Preliminaries
We collect some basic terminology; see, e.g., [3,10]. Let X be a real vector space and let K be a cone in X , that is, K is a wedge (x, y ∈ K , λ, μ ≥ 0 imply λx + μy ∈ K ) and K ∩ (− K ) = {0}. For x, y ∈ X , a partial order in X is induced by We call (X , K ) then a (partially) ordered vector space. We write x > 0 whenever x ∈ K \{0}. For M ⊆ X , we denote M u := {x ∈ X : for all y ∈ M one has x ≥ y} and M l := {x ∈ X : for all y ∈ M one has x ≤ y}.
The space X has the Riesz decomposition property if for every x 1 , x 2 , z ∈ K with z ≤ x 1 + x 2 there exist z 1 , z 2 ∈ K such that z = z 1 + z 2 with z 1 ≤ x 1 and z 2 ≤ x 2 . Definition 2.1 A partially ordered vector space X is called a pre-Riesz space if for every x, y, z ∈ X such that {x + y, x + z} u ⊆ {y, z} u one has that x ≥ 0.
Let X be a partially ordered vector space. Recall that X is Archimedean if for every x, y ∈ X with nx ≤ y for all n ∈ N one has x ≤ 0. The space X is called directed if for every x, y ∈ X there exists z ∈ X such that z ≥ x and z ≥ y. Every pre-Riesz space is directed and every Archimedean directed ordered vector space is pre-Riesz.
A linear subspace D of X is called order dense in X if for every x ∈ X we have Clearly, every order dense subspace is majorizing. We say that a subspace X of a vector lattice Y generates Y as a vector lattice if for every y ∈ Y there exist a 1 , . . . , A pair (Y , i) as in (ii) is called a vector lattice cover of X . A pair (Y , i) as in (iii) is unique up to isomorphism and called the Riesz completion of X , denoted by (X ρ , i). Note that if X is Archimedean, then the classical Dedekind completion (X δ , j) of X is a vector lattice cover; for details see [10,Chapter 2].
Let X be a pre-Riesz space. Two elements x, y ∈ X are called disjoint, denoted by We will need the following technical observation. If D is a majorizing subspace of a vector lattice Y and u ∈ Y is such that u ⊥ d for every d ∈ D, then u = 0. Indeed, there is w ∈ D such that |u| ≤ w. Hence, |u| = |u| ∧ w = 0, consequently u = 0. We conclude the following lemma.

Lemma 2.4
If X is a pre-Riesz space and u ∈ X ρ is such that u ⊥ x for every x ∈ i(X ), then u = 0. Definition 2.5 Let X be a pre-Riesz space and let (X ρ , i) be the Riesz completion of It is known that every pervasive pre-Riesz space is fordable [10,Proposition 4.1.15], whereas the converse is not true, in general, see [10,Example 4.1.19]. If a pre-Riesz space X is pervasive and (Y , i) is any vector lattice cover of X , then for every y ∈ Y with y > 0 there exists x ∈ X with 0 < i(x) ≤ y, see [10,Proposition 2.8.8].
Let X and Y be pre-Riesz spaces. A linear operator T : X → Y is called disjointness preserving if for every x, y ∈ X with x ⊥ y we have T x ⊥ T y.
A seminorm · on an ordered vector space X is called monotone if x ≤ y for every x, y ∈ X with 0 ≤ x ≤ y. A seminorm · on a Riesz spae X is a Riesz seminorm if it is monotone and |x| = x for every x ∈ X . By a normed Riesz space we mean a Riesz space endowed with a Riesz norm. The cone of a normed Riesz space is closed and therefore every normed Riesz space is Archimedean.
For a net (x α ) α∈I in an ordered vector space (X , K ) and x ∈ X we write x α ↑ x if (x α ) α is increasing and x is the supremum of {x α : α ∈ I }. Similarly, we use the notation x α ↓ x. The net (x α ) α∈I order converges, in short o-converges, to x ∈ X (denoted by x α o − → x), if there is a net (y α ) α∈I in X such that y α ↓ 0 and for every α ∈ I one has ±(x α − x) ≤ y α . A linear operator T : X → Y between two ordered vector spaces is said to be order For u ∈ K , a sequence (x n ) n in X is said to be u-relatively uniformly convergent to x ∈ X if for every ε > 0 there exists N ∈ N such that for every n ≥ N we have ±(x n − x) ≤ εu. Then x is called the u-relatively uniform limit of (x n ) n . For u ∈ K , the sequence (x n ) n is called a u-relatively uniformly Cauchy sequence if for every ε > 0 there exists N ∈ N such that ±(x m − x n ) ≤ εu for every m, n ≥ N . An ordered vector space X is called uniformly complete if, for every u ∈ K , every u-relatively uniformly Cauchy sequence has a u-relatively uniform limit. Note that a uniformly complete vector lattice is Archimedean.
An element u > 0 is called an order unit if for every x ∈ X there is λ ∈ R, λ > 0, such that −λu ≤ x ≤ λu. If an ordered vector space has an order unit, then the space is directed. If X is an Archimedean ordered vector space with order unit u, then defines a norm on X , the so-called u-norm. In this case, the uniform completion of X is defined to be the norm completion of X with respect to the u-norm. The space X is uniformly complete if and only if X is norm complete with respect to the u-norm.

Examples
This section shall illustrate that the theory of disjointness preserving operators in pre-Riesz spaces has aspects similar to the vector lattice setting, and aspects that are very different.
Concerning disjointness preserving operators in vector lattices, Riesz homomorphisms are typical examples. In pre-Riesz spaces, the following similar notion is introduced in [15]. Definition 3.1 Let X and Y be pre-Riesz spaces. An operator T : X → Y is said to be a Riesz* homomorphism if for every x 1 , . . . , x n ∈ X one has T ({x 1 , . . . , x n } ul ) ⊆ {T x n , . . . , T x n } ul .
In Riesz spaces, Riesz* homomorphisms and Riesz homomorphisms coincide; see [10,Lemma 2.3.2]. In pre-Riesz theory, Riesz* homomorphisms play a crucial role since they are exactly those operators that can be extended to Riesz homomorphisms between the corresponding Riesz completions; see the next statement.
Theorem 3.2 [15,Theorem 5.6] Let X and Y be pre-Riesz spaces and (X ρ , i X ) and (Y ρ , i Y ) their Riesz completions, respectively. Let T : X → Y be a linear map. Then the following statements are equivalent: One expects that in pre-Riesz spaces Riesz* homomorphisms preserve disjointness.

Theorem 3.3 Let X and Y be pre-Riesz spaces and T : X → Y a Riesz* homomorphism. Then T is a (positive) disjointness preserving operator.
Proof If (X ρ , i X ) and (Y ρ , i Y ) are the Riesz completions of X and Y , respectively, then due to Theorem 3.2 there is a Riesz homomorphism T ρ : X ρ → Y ρ that satisfies (1). In particular, T ρ is positive and disjointness preserving. Since i X and i Y are bipositive, T is positive. Moreover, due to Theorem 2.3 one obtains that T is disjointness preserving.
It is a remarkable fact in the theory of vector lattices, that every order bounded and disjointness preserving operator is regular [5]. However, this is not true for operators on pre-Riesz spaces, in general. In [14] an example of an order bounded, nonregular linear functional on a directed partially ordered vector space was given. We will use this example to construct an order bounded disjointness preserving operator which is not regular.
and consider the subspace X := span e n , u n,k ; n, k ∈ N of R [0,∞) with pointwise order. For every x ∈ X there exists t 0 > 0 such that x is affine and, hence, differentiable on (0, t 0 ). Define For sake of completeness, we list all relevant properties of X and T , where (i), (iv) and (v) are already dealt with in [14].
(i) X is directed. Indeed, every element in X is bounded and has bounded support.
is Archimedean, therefore its subspace X is Archimedean as well. [15,Theorem 1.7(ii)] yields that X is a pre-Riesz space.
(iii) T is disjointness preserving. Indeed, let x (1) , i.e. x (1) and x (2) are affine on 0, 1 M . Let without loss of generality x (1) = 0 on 0, 1 M , then T x (1) = 0 and hence T x (1) ⊥ T x (2) . (iv) T is order bounded. Indeed, for v, w ∈ X with v ≤ w there are N ∈ N and (v) T is not regular. Indeed, assume that there is a positive linear operator S : X → X such that S ≥ T . For n, k ∈ N one has that 0 ≤ u n,k ≤ e 1 + 1 k e n+1 , hence and therefore k(ne 1 − S(e 1 )) ≤ S(e n+1 ) for every k ∈ N. Since X is Archimedean, it follows that ne 1 − S(e 1 ) ≤ 0. From ne 1 ≤ S(e 1 ) for every n ∈ N one obtains e 1 ≤ 0, a contradiction.

Disjointness preserving operators for a particular polyhedral cone
In [10,Example 4.4.18], a four-ray cone in R 3 is investigated and all disjoint elements are calculated. We generalize this example to R n with a (2n − 2)-ray cone. It turns out that the dual cone has a base which is an (n − 1)-dimensional hypercube. Then K is a cone in X . We endow X with the partial order induced by K . It is clear that K is closed, and that e (n) is an interior point of K and hence an order unit of (X , K ). Consequently, K is generating. As K is closed and hence Archimedean, (X , K ) is a pre-Riesz space. We will determine the disjoint elements in X . We begin by showing that the dual cone Indeed, it is clear that for every σ = (σ 1 , . . . , and hence Hence x ∈ K . Now suppose that there exists f ∈ K \L. Then, according to the Hahn-Banach separation theorem, there exist x ∈ X and c ∈ R such that g(x) ≥ c for every g ∈ L and f (x) < c. Then c ≤ 0. For g ∈ L and n ∈ N we have ng ∈ L, so ng( Next we determine the Riesz completion by means of the functional representation discussed in [10, Section 2.5]. Let and denote the set of all extreme points of by We establish that On the other hand, We obtain Since − e (n) ≤ e (i) ≤ e (n) (with respect to the order induced by the cone K ) and It is clear that = . Due to the functional representation given in [10, Theorem 2.6.2], the Riesz completion X ρ of (X , K ) is given by C( ). Since contains 2 n−1 elements, the space X ρ is 2 n−1 -dimensional. We will identify X ρ with R 2 n−1 , endowed with the standard cone. The corresponding bipositive linear map I : X → X ρ is given by Next, we compute all directed and nondirected bands in the space of the previous example.

Example 4.2
We consider the pre-Riesz space (X , K ) as in Example 4.1 and proceed by determining all nontrivial disjoint elements. Denote for i, j ∈ {1, . . . , n} with i < j, , With the notation as in Example 4.1, observe that We will show that the nontrivial bands in (X , K ) are exactly the subspaces X (i j) and . The proof consists of the following steps (a)-(g). To simplify the proof, we use that for x ∈ X we have In view of this, we define for ∈ {− 1, 1} n the functional The following technical observation will be needed several times later on. Let x ∈ X and ∈ {− 1, 1} n be such that are bands and that X (i j) d = Y (i j) . In the following three steps we show that these are the only nontrivial bands in (X , K ). (e) Let x ∈ X be such that there are i, j ∈ {1, . . . , n} with i < j and x i = 0, x j = 0 and x k = 0 for every k ∈ {1, . . . , n}\{i, j} and such that {x} d is nontrivial. Then Then I has at least three elements. Let y ∈ {x} d and suppose that y = 0. Then there is For a proof of ( * ), note that sign Now we use ( * ) to prove that y = 0, which is a contradiction. Let i ∈ I . We show y i = 0. If i ∈ I is such that there exists j ∈ I \{i} with sign( i x i ) = sign( j x j ), then ( * ) gives y i = 0. Otherwise, for every j ∈ I \{i} we have sign( i x i ) = sign( j x j ) and then sign( j x j ) = sign( k x k ) for every j, k ∈ I \{i}. As I \{i} contains at least two elements, ( * ) yields that y j = 0 for every j ∈ I \{i}. Then g {i} (y) = g I (y), so g I (y) = 0. Also, for j ∈ I \{i} we have g { j} (y) = g I \{i} (y), as y k = 0 for every k ∈ I \{i}. Hence, g I (y) = 0 and g I \{i} (y) = 0, so by (b) we obtain y i = 0.
From the statements in (e), (f) and (g) we conclude that only for elements of the bands X (i j) and Y (i j) there exist nontrivial disjoint elements. Thus, in (X , K ) there are only one-dimensional nontrivial bands. By construction, we have n(n − 1) nontrivial bands in (X , K ). Note that X (i j) and Y (i j) are directed, respectively, if and only if j = n. Hence there are 2(n − 1) directed nontrivial bands and (n − 1)(n − 2) nondirected nontrivial bands in (X , K ).
We determine all disjointness preserving bijective operators in (X , K ). ∈ {− 1, 1} n and α ∈ R\{0} such that for every j ∈ {1, . . . , n} the j-th column of T equals α j e (P( j)) . First we show that every operator T of this type is disjointness preserving, where we use the notation and results of Example 4.2. Indeed, for every i, j ∈ {1, . . . , n} with i < j we have hence T x (i j) ⊥ T y (i j) . Thus, T is disjointness preserving. Conversely, let T : X → X be a disjointness preserving bijection. For j ∈ {1, . . . , n} let T ( j) denote the j-th column of T . Let k, l ∈ {1, . . . , n} with k < l.
Thus every two distinct columns of T are different unit vectors multiplied by plus or minus the same scalar.
Next we determine the positive disjointness preserving bijections in (X , K ). Let T be a disjointness preserving bijection in (X , K ), i.e. for every j ∈ {1, . . . , n} the j-th column of T equals α j e (P( j)) , as above. We claim that T is positive if and only if α > 0 and the n-th column of T equals αe (n) . Indeed, assume that T is positive. Since x (1) and y (1) are positive disjoint elements, there exists i ∈ {1, . . . , n − 1} such that T x (1) , Since e (n) is positive, it follows that α > 0 and that the n-th column of T equals αe (n) .
Hence, T x (i) and T y (i) are positive. Thus T maps each extreme ray of K into K . Therefore, T is positive.

Pervasive pre-Riesz spaces as ranges
Our aim in this section is to replace the range space Y in Theorem 1.1 by a pre-Riesz space. The idea is to consider the Riesz completion (Y ρ , i) of Y and apply Theorem 1.1 to i • T . For that purpose we need a Riesz norm on Y ρ . The next lemma presents conditions on Y that provide such a norm.

Lemma 5.1 Let Y be a pervasive pre-Riesz space, let (Z , i) be a vector lattice cover of Y , and let · Y be a monotone norm on Y . Define for z ∈
Then · Z is a Riesz norm on Z . Moreover, for every y ∈ Y we have i(y) Z ≥ 1 2 y Y and for every y ∈ Y with y ≥ 0 we have i(y) Z = y Y .
Proof By [13, Propositions 5.1 and 6.2], · Z is a Riesz seminorm on Z and both stated relations with · Y hold. It remains to show that · Z is a norm.
Let z ∈ Z be such that z = 0. Since Y is pervasive, there exists y ∈ Y with 0 < i(y) ≤ |z|. Then z Z = |z| Z ≥ i(y) Z ≥ y Y > 0. Hence · Z is a Riesz norm.
As a Riesz space with a Riesz norm is Archimedean, Lemma 5.1 yields that every pervasive pre-Riesz space with a monotone norm is Archimedean.
We can now extend Theorem 1.1 to a setting with the range space being a pre-Riesz space.

Theorem 5.2 Let X be a uniformly complete vector lattice, Y a pervasive pre-Riesz space with a monotone norm, and T : X → Y an injective and disjointness preserving operator. Then for every x
As T is disjointness preserving, by means of Theorem 2.3 we have that i • T is disjointness preserving. With the aid of Lemma 5.1, the monotone norm of Y yields a Riesz norm on Y ρ . Let We apply Theorem 1.1 and obtain that x 1 ⊥ x 2 .

Corollary 5.3
Let X be a uniformly complete vector lattice, Y a pervasive pre-Riesz space with a monotone norm, and T : X → Y a bijective and disjointness preserving operator. Then T −1 : Y → X is disjointness preserving as well.
Proof Let y 1 , y 2 ∈ Y be such that y 1 ⊥ y 2 . Take x 1 , x 2 ∈ X with T x 1 = y 1 and T x 2 = y 2 . We have T x 1 ⊥ T x 2 , hence according to Theorem 5.2 we obtain x 1 ⊥ x 2 . Therefore, T −1 is disjointness preserving.
A key role in the proof of Theorem 1.1 is played by the next result due to de Pagter, see [4,Theorem 8].
Theorem 5.4 Let X be a uniformly complete Archimedean Riesz space and let Y be an Archimedean Riesz space such that for every disjoint sequence (w n ) n in Y with w n > 0 (n ∈ N) there exist positive real numbers λ n (n ∈ N) such that the set {λ n w n : n ∈ N} is not order bounded in Y . Then for every disjointness preserving operator T : X → Y , there exists an order dense ideal in X on which T is order bounded.
One could try to generalize the range space in Theorem 5.4 to a more general pre-Riesz space Y and thus try to generalize Theorem 1.1. It turns out that the conditions on Y needed for this approach are not more general than those of the approach above. Nevertheless, our extension of Theorem 5.4 might be of independent interest.
We need the following simple observation, which follows from the fact that i(Y ) is majorizing in its Riesz completion Y ρ .

Lemma 5.5 Let Y be a pre-Riesz space and let (Y ρ , i) be its Riesz completion. For every subset A ⊆ Y , one has that A is order bounded in Y if and only if i(A) is order bounded in Y ρ .
We arrive at the following extension of Theorem 5.4. Theorem 5.6 Let X be a uniformly complete Archimedean Riesz space and let Y be a pervasive Archimedean pre-Riesz space such that for every disjoint sequence (w n ) n in Y with w n > 0 (n ∈ N) there exist positive real numbers λ n (n ∈ N) such that the set {λ n w n : n ∈ N} is not order bounded in Y . Then for every disjointness preserving operator T : X → Y , there exists an order dense ideal in X on which T is order bounded.
Proof Let T : X → Y be a disjointness preserving operator. Let (Y ρ , i) denote the Riesz completion of Y . By Theorem 2.3, we have for every Let (w n ) n be a disjoint sequence in Y ρ with w n > 0 (n ∈ N). Since Y is pervasive, for every n ∈ N there exists y n ∈ Y with 0 < i(y n ) ≤ w n . Then (y n ) n is a disjoint sequence in Y , so there exist positive real numbers λ n (n ∈ N) such that {λ n y n : n ∈ N} is not order bounded in Y . With the aid of Lemma 5.5, it follows that {λ n i(y n ) : n ∈ N} is not order bounded and hence {λ n w n : n ∈ N} is not order bounded.
Theorem 5.4 now yields that there exists an order dense ideal D in X on which i • T is order bounded. Then it follows from Lemma 5.5 that T is order bounded on D.
The condition in Theorems 5.4 and 5.6 involving the disjoint sequence (w n ) n is satisfied if the space Y can be equipped with a monotone norm. The next lemma provides the details of the simple verification of this fact.

Lemma 5.7
If Y is a pre-Riesz space with a monotone norm · Y , then for every sequence (w n ) n in Y with w n > 0 (n ∈ N), there exist positive real numbers λ n (n ∈ N) such that the set {λ n w n : n ∈ N} is not order bounded in Y .
Proof For the disjoint sequence (w n ) n in Y , let λ n := n w n Y . Then λ n w n Y = n w n Y w n Y = n, so {λ n w n : n ∈ N} is not norm bounded. Since the norm of Y is monotone, every order bounded set in Y is norm bounded. Hence {λ n w n : n ∈ N} is not order bounded in Y .
Observe that if X is a Banach lattice then X is a uniformly complete Archimedean Riesz space [11, Proposition 1.1.8(iv)]. By combining Theorem 5.6 with Lemma 5.7, we immediately obtain the following coro.

Corollary 5.8
If X is a Banach lattice and Y a pervasive pre-Riesz space with a monotone norm, then for every disjointness preserving operator T : X → Y there exists an order dense ideal in X on which T is order bounded.

Extension of disjointness preserving operators on pre-Riesz spaces
In this section, we investigate whether in Theorem 1.1 the uniformly complete vector lattice X can be replaced by a more general pre-Riesz space. We try to accomplish such a generalization by extending the operator. Given a disjointness preserving operator on a pre-Riesz space, we wish to extend it to a disjointness preserving operator on its Riesz completion. This turns out to be a difficult task and our attempts only succeed under quite strong additional conditions. We start by identifying some denseness properties yielding that an operator that extends a disjointness preserving operator is itself disjointness preserving. Theorem 6.1 Let (X , K ) be a pre-Riesz space with Riesz completion (X ρ , i). Let Y be a vector lattice. Assume that for every x ∈ X ρ with x ≥ 0, there exists a sequence (x n ) n in K such that i(x n ) ↑ x. If T : X ρ → Y is an order continuous operator such that (T • i) : X → Y is a positive disjointness preserving operator, then T is also disjointness preserving.
Proof Let x, y ∈ (X ρ ) + such that x ⊥ y. It suffices to show that T x ⊥ T y. By assumption, there exist sequences (x n ) n and (y n ) n in K such that i(x n ) ↑ x and i(y n ) ↑ y. Then clearly i(x n ) ⊥ i(y n ), so x n ⊥ y n in X for every n. Since T is order continuous and the lattice operations are order continuous [10, Proposition 1.1.34], we obtain that T i(x n ) ∧ T i(y n ) converges to T x ∧ T y. Since it follows that T x ⊥ T y. Theorem 6.2 Let X be a pre-Riesz space with Riesz completion (X ρ , i) and let (Y , · Y ) be a normed vector lattice. Assume that there is a norm · X ρ on X ρ such that for every x ∈ X ρ with x > 0, there exists a sequence (x n ) n in X with

is norm continuous and (T • i) : X → Y is a positive linear disjointness preserving operator, then T is also disjointness preserving.
Proof Let x, y in (X ρ ) + with x ⊥ y. If x = 0 or y = 0, then it is clear that T x ⊥ T y.
Assume that x > 0 and y > 0. By assumption, there exist sequences (x n ) n and (y n ) n in X with 0 ≤ i(x n ) ≤ x and 0 ≤ i(y n ) ≤ y for every n, and i( As the lattice operations are norm continuous in the normed vector lattice Y [10, Proposition 3.6.19], we have Therefore, |T (x)| ∧ |T (y)| = 0, and hence T is disjointness preserving.

Remark 6.3
In the Theorems 6.1 and 6.2, one can replace the Riesz completion X ρ by an arbitrary vector lattice cover. Since the Riesz completion is the smallest vector lattice cover, the condition on X will be stronger for other vector lattice covers.
The next theorem presents a situation in which the existence of a norm in X ρ and continuity of T as needed in Theorem 6.2 are satisfied. Theorem 6.4 Let X be a pervasive pre-Riesz space with Riesz completion (X ρ , i X ), let · X be a monotone norm on X , and let · X ρ be defined as in (2). Let Y be a partially ordered vector space with a monotone norm · Y , and let T : X → Y be a positive and continuous linear map. Then every positive linear map T : X ρ → Y that extends T in the sense that T • i X = T is continuous with respect to · X ρ and T ≤ T .
Proof As · X is monotone, it follows from Lemma 5.1 that · X ρ is a Riesz norm.
To extend a positive linear operator from a pre-Riesz space into a Dedekind complete vector lattice, we need the following extension theorem due to Kantorovich. Since a pre-Riesz space is a majorizing subspace of the Riesz completion, we could use Kantorovich's theorem to extend a positive operator from an Archimedean pre-Riesz space X to a positive operator on the Riesz completion of X , provided the range space is Dedekind complete. Theorem 6.6 Let X be a pervasive pre-Riesz space with Riesz completion (X ρ , i X ), let · X be a monotone norm on X , and let · X ρ be the norm on X ρ defined as in (2). Assume that for every x ∈ X ρ with x > 0 there exists a sequence (x n ) n in X with 0 ≤ i(x n ) ≤ x for every n and i(x n ) − x X ρ → 0. Let Y be a pervasive pre-Riesz space with Dedekind completion (Y δ , i Y ), let · Y be a monotone norm on Y , and let · Y δ be the norm on Y δ defined as in (2). If T : X → Y is a positive linear map that is continuous, disjointness preserving and injective, then there exists a positive linear extension T : that is continuous, disjointness preserving and injective as well. Moreover, if X has an order unit and X ρu denotes the uniform completion of X ρ , then there exists a positive linear extension T u : that is disjointness preserving and injective. Proof Due to Theorem 6.5, there exists a positive operator T : By Theorem 6.4, T is continuous with respect to the Riesz norm · X ρ on X ρ and · Y δ on Y δ . By Theorem 6.2, T is disjointness preserving.
Next we show that T is injective.
This contradicts that T is injective. Therefore v = 0 and hence T is injective. So T : X ρ → Y δ is a positive disjointness preserving injective operator.
As X ρ is a majorizing subspace of X ρu , by Theorem 6.5, T can be extended to a positive operator T u : X ρu → Y δ .
We show as an intermediate step that every positive element in X ρu can be approximated from below in the relative uniform topology by a sequence from i(X ). Let u be an order unit in X . Then i(u) is an order unit in X ρ . For z ∈ (X ρu ) + , z = 0, there exist a sequence (z n ) n ∈ (X ρ ) + and a sequence (λ n ) n in R with λ n ↓ 0 and |z n − z| ≤ λ n i(u) for every n ∈ N. Then z n − λ n i(u) ≤ z for every n. Take w n = (z n − λ n i(u)) + in X ρ . We have w n ∈ X ρ , 0 ≤ w n ≤ z, and |w n − z| = |(z n − λi(u)) + − z + | ≤ |z n − λ n i(u) − z| ≤ 2λ n i(u), so w n → z i(u)-relatively uniformly.
Next we show that T u is disjointness preserving. Let v, w ∈ X ρu with |v| ⊥ |w|. By the previous discussion, there exist sequences (v n ) n and (w n ) n in X ρ such that 0 ≤ v n ≤ |x|, 0 ≤ w n ≤ |y| and v n → |v| and w n → |w| i(u)-relatively uniformly. Then 0 ≤ v n ∧ w n ≤ |v| ∧ |w| = 0, so v n ⊥ w n and therefore T v n ⊥ T w n . Also, it follows that there exist sequences (α n ) and (β n ) in R with α n ↓ 0 and β n ↓ 0 such that |v n − |v|| ≤ α n i(u) and |w n − |w|| ≤ β n i(u) for every n. We obtain that |v| ≤ ||v| − v n | + |v n | ≤ α n i(u)u + v n and |w| ≤ ||w| − w n | + |w n | ≤ β n i(u) + w n . It follows that Since Y δ is Archimedean and α n ∨ β n ↓ 0, we infer that T u (|v|) ∧ T u (|w|) = 0. Hence T u : X ρu → Y δ is disjointness preserving.

Proposition 6.7
In the setting of Theorem 6.6, T u : X ρu → T u (X ρu ) has a disjointness preserving inverse T −1 u : T u (X ρu ) → X ρu . Proof Note that T u is a positive disjointness preserving operator, hence a Riesz homomorphism. Therefore, T u (X ρu ) is a Riesz subspace of Y δ . The norm of Y yields a Riesz norm on Y δ by (2). Since T u is injective, Corollary 5.3 yields that T −1 u : T u (X ρu ) → X ρu is disjointness preserving. If we combine Theorem 1.1 and Theorem 6.6, we obtain the following.

Theorem 6.8
In the setting of Theorem 6.6, if T : X → Y is bijective, then T −1 is disjointness preserving.
In the following example, we will give an application of Theorem 6.6. also f n ↑ f . We will give a proof of this statement in six steps below. The main idea is to approximate f for a given ε > 0 up to 6ε from below by a g ∈ C m [0, 1] + , by choosing g to be 0 where f ≤ 4ε, choosing g between f − 4ε and f − 3ε where f > 6ε and glue these pieces of g smoothly together. Some technical precautions are needed to make sure that our construction involves only finitely many subintervals and that the smooth connecting parts of g are between 0 and f . (a) Firstly, note that for every f ∈ C[0, 1] and every ε > 0 there exists g ∈ C m [0, 1] such that f − g ∞ < 4ε and g ≤ f − 3ε. Indeed, according to Weierstrass's approximation theorem, there exists g ∈ C m [0, 1] such that ( f − (7/2)ε) − g ∞ < ε/2 and then g < ( f − (7/2)ε) + ε/2 = f − 3ε and f − g ∞ < 4ε.
(b) Secondly, observe the following elementary gluing result. If ε > 0 and p, q, r , s ∈ [0, 1] are such that p < q < r < s and g : (c) Thirdly, observe that the following variations on (b) are also true. If ε > 0 and p, q, r , s ∈ [0, 1] are such that p < q < r < s and g : [p, q] ∪ [r , s] → R is C m , g(q) > ε, and g = 0 on [r , s], then there exists h ∈ C m [ p, s] such that h = g on [ p, q] ∪ [r , s] and 0 ≤ h(t) < g(q) + ε for every t ∈ (q, r ).
Define τ 0 = 0 and for k ∈ N define, inductively, We have σ 1 > 0 and for k ∈ N with σ k < 1 we have σ k < τ k , since f (0), f (1) > 6ε and f is continuous. If σ k = 1, then τ k = 1. Similarly, for every k ∈ N we have τ k < σ k+1 or τ k = σ k+1 = 1. For k ∈ N with σ k < 1 we have f (σ k ) = 5ε and if τ k < 1 then f (τ k ) = 6ε. There exists N ∈ N such that σ k = τ k = 1 for every k ≥ N , since otherwise there would be a convergent subsequence (σ k j ) j with σ k j < 1 and hence f (σ k j ) = 5ε for every j, and then (τ k j ) j would converge to the same limit while f (τ k j ) = 6ε, which contradicts the continuity of f . Now we are ready to construct the desired function g. Let k ∈ N be such that τ k−1 < 1. On [τ k−1 , σ k ], we the aid of (a), we take g to be C m and such that If σ 1 = 1, then we have thus defined g on all of [0, 1]. Otherwise, let k ∈ N be such that σ k < 1. We will define g on (σ k , τ k ). Recall that τ k < 1, so that g has already been defined on If f ≥ 4ε on [σ k , τ k ], then with the aid of step (b), we take g on (σ k , τ k ) such that g is C m on [τ k−1 , σ k+1 ] and min{g(σ k ), g(τ k )} − ε ≤ g(t) ≤ max{g(σ k ), g(τ k )} + ε for every t ∈ (σ k , τ k ). As g(σ k ), g(τ k ) > ε, it follows that g > 0 on (σ k , τ k ). Since g ≤ f − 3ε ≤ 3ε at σ k and at τ k , we also have that g(t) < 4ε ≤ f for every t ∈ (σ k , τ k ).
(f) Let f ∈ C[0, 1] + . We construct a sequence ( f n ) n as announced above. By means of (e), we choose Then, as every g j is positive, ( f n ) n is an increasing sequence in C m [0, 1] + . Further, In the spirit of Theorem 6.1 and Remark 6.3, we have the following consequence of Example 6.9. If T : C[0, 1] → C[0, 1] is an order continuous operator and its restriction to C m [0, 1] is disjointness preserving, then T is disjointness preserving.
In Theorem 6.2, it is required that for every x ∈ (X ρ ) + , there exists a sequence (x n ) n in X which converges to x from below, i.e. 0 ≤ i(x n ) ≤ x for every n and i(x n ) − x X ρ → 0. In general, however, this condition is not always satisfied. For example, let X = Pol[0, 1], then X ρ is the subspace of C[0, 1] consisting of piecewise polynomial functions. It is easy to find a positive x ∈ X ρ \{0} which vanishes on a subinterval of [0, 1] and then there is no sequence in X + that converges to x from below. We note that not every disjointness preserving operator on a pre-Riesz space can be extended to its Riesz completion without some strong conditions and keep the property of being disjointness preserving. For example, if X = Pol[0, 1] the operator T defined by (T x)(t) = t 0 x(s)ds,t ∈ [0, 1], is not disjointness preserving on X ρ but it is disjointness preserving on X , since two elements x, y ∈ X are disjoint in X only if x = 0 or y = 0.
Next we present a way of extending a disjointness preserving operator on a pre-Riesz space to the Riesz completion using the Riesz decomposition property. The range space Y is required to be a Dedekind complete vector lattice. Theorem 6.10 Let X be a pervasive Archimedean pre-Riesz space with the Riesz decomposition property, let (X ρ , i) be its Riesz completion, and let Y be a Dedekind complete vector lattice. If T : X → Y is order bounded and disjointness preserving, then there exists an order bounded and disjointness preserving operator S : X ρ → Y extending T in the sense that S • i = T .

Condition (ˇ) and disjointness preserving inverses
In this section we study a technique of Abramovich and Kitover used in [1] concerning disjointness preserving inverses. They introduce a condition (β), which can be formulated in pre-Riesz spaces as follows.
Definition 7.1 Let X and Y be pre-Riesz spaces and let T : X → Y be a linear operator. T is said to satisfy condition (β) if for every x, y ∈ X with {x} dd ⊆ {y} dd it follows that {T x} dd ⊆ {T y} dd .
The idea of condition (β) traces back to [12]. In function spaces, (β) means the following: if the support of a function is contained in the support of another function, then the same is true for the supports of their images. In the setting of vector lattices, it is shown in [1] that (β) implies that T −1 is disjointness preserving. We will establish that (β) for T implies T −1 being disjointness preserving, provided X and Y are pre-Riesz spaces and X is, in addition, fordable. We begin with a lemma that relates disjointness and principal bands. (ii) Assume that {x} dd ∩ {y} dd = {0}. Let (X ρ , i) be the Riesz completion of X and define u := |i(x)|∧|i(y)|. Since X is fordable, there is S ⊆ X such that {u} d = i(S) d in X ρ . From Theorem 2.3 it follows that