The lateral order on Riesz spaces and orthogonally additive operators

The paper contains a systematic study of the lateral partial order ⊑\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sqsubseteq $$\end{document} in a Riesz space (the relation x⊑y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x \sqsubseteq y$$\end{document} means that x is a fragment of y) with applications to nonlinear analysis of Riesz spaces. We introduce and study lateral fields, lateral ideals, lateral bands and consistent subsets and show the importance of these notions to the theory of orthogonally additive operators, like ideals and bands are important for linear operators. We prove the existence of a lateral band projection, provide an elegant formula for it and prove some properties of this orthogonally additive operator. One of our main results (Theorem 7.5) asserts that, if D is a lateral field in a Riesz space E with the intersection property, X a vector space and T0:D→X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_0:D\rightarrow X$$\end{document} an orthogonally additive operator, then there exists an orthogonally additive extension T:E→X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T:E\rightarrow X$$\end{document} of T0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_0$$\end{document}. The intersection property of E means that every two-point subset of E has an infimum with respect to the lateral order. In particular, the principal projection property implies the intersection property.


Introduction
The main idea of the paper is to show the importance of the so called lateral partial order on a Riesz space for analysis of Riesz spaces, especially for the study of orthogonally additive operators. By the relation x y between elements of a Riesz The second named author was supported by the Russian Foundation for Basic Research (the Grant No. 17-51-12064).
Extended author information available on the last page of the article space we mean that x is a fragment 1 of y, that is, x ⊥ (y − x). To the best of our knowledge, we present here the first systematic study of the lateral order. Among well known results on the subject, it is worth mentioning that the set F e of all fragments of an element e of a Riesz space E is a Boolean algebra with respect to the lateral order with zero 0 and unit e. A prominent role of F e was discovered in the classical Freudenthal Spectral Theorem. First the importance of lateral order was mentioned by Abramovich in 1971 [1], where the author showed that, in a Dedekind complete (respectively, order σ -complete) normed lattice every norm bounded increasing net (respectively, sequence) of positive elements has a supremum, provided so does every norm bounded laterally increasing net (respectively, sequence); see also [2] for another application of laterally increasing nets.
While the present paper was being prepared over the last couple of years, several papers were published by the authors and their co-authors which used some of the tools developed here concerning lateral order. (see [10,11,[17][18][19]21,23]).
Organization of the paper. In Sect. 2 we give necessary information on Riesz spaces and orthogonally additive operators. In Sect. 3 we develop elementary techniques for investigation of the lateral order. Since every subset of a Riesz space is laterally bounded from below by zero, if we speak of a laterally bounded subset we mean that it is laterally bounded from above. We show that every laterally bounded finite set has a lateral supremum and provide with a formula for it. If a Riesz space E has the principal projection property then any finite set has a lateral infimum. Moreover, the lateral infimum x y of a two-point set {x, y} satisfies F x ∩F y = F xy . However, in an arbitrary Riesz space a two-point set need not have a lateral infimum. We do not know whether every Riesz space without the principal projection property admits such an example. We define in an obvious way and investigate the set-theoretical operations on the set F e of all fragments of an element e ∈ E. If the lateral infimum x y of a two-point set {x, y} exists then we define the set-theoretical difference x\ \ \y for arbitrary elements x, y ∈ E. We also prove a number of natural properties of the defined operations for the sake of the other sections. Section 4 is devoted to lateral convergence of nets in Riesz spaces and different types of lateral continuity. One of the main messages is to show that, as was first noted in [10], the standard notion of the lateral convergence considered in a number of papers by different authors is unnatural and too restrictive. More precisely, laterally increasing order convergent nets were defined to be laterally convergent. The new notion proposed in [10] and developed in the present paper naturally generalizes the lateral convergence from laterally increasing nets to arbitrary laterally bounded nets. Due to this idea, the main result of [10] asserts that the lateral continuity of an orthogonally additive operator T at zero implies the lateral continuity of T at any point, which is even impossible to formulate for the old notion because there is no nontrivial laterally increasing net which laterally converges to zero. Our contribution to the subject in this section consists of providing with the following examples. Example 4.15 contains a construction in L p [0, 1] with 1 ≤ p ≤ ∞ of an orthogonally additive laterally-tonorm continuous operator which is not order-to-norm continuous. We also prove that the norm of a Dedekind σ -complete Banach lattice is a laterally-to-norm continuous function if and only if it is an order-to-norm continuous function. Finally, Example 4.18 shows that the lateral continuity of an orthogonally additive operator at one (nonzero) point does not imply its lateral continuity at all other points (e.g., at zero).
In Sect. 5 we introduce and study the notion of a consistent set in a Riesz space. We say that a subset G of a Riesz space E is called consistent if every two-point subset of G is laterally bounded in E. The idea of the notion is to generalize laterally bounded sets to consistent sets, which is much more general. For instance, let 0 < p ≤ ∞ and let e be any element of L 0 [0, 1] which does not belong to L p [0, 1]. Then F e ∩ L p [0, 1] is a consistent set in L p [0, 1] which is not laterally bounded in L p [0,1]. We show that consistent sets can be useful in different contexts. The main result of the section Theorem 5.4 asserts that a Riesz space E is laterally complete if and only if every consistent set A ⊂ E has a lateral supremum.
In Sect. 6 we introduce the notions of a lateral field, a lateral ideal and a lateral band in a Riesz space. During the paper have being written, these notions were already used in some other papers by the authors and their co-authors, confirming their importance. We must say that, lateral ideals and lateral bands are so important for orthogonally additive operators, as the usual ideals and bands are important for linear operators on Riesz spaces. We show that the kernel of a positive orthogonally additive operator is a lateral ideal, however not every lateral ideal equals the kernel of some orthogonally additive operator. Theorem 6.9 gives an elegant formula for the lateral band projection which is a disjointness preserving laterally continuous orthogonally additive operator and has some additional properties. Theorem 6.10 and its corollary assert that the lateral field (ideal, band) generated by a consistent set is consistent, and that any maximal consistent subset of a Riesz space is a lateral band. Section 7 is devoted to extensions of orthogonally additive operators. It contains a survey on the subject and a positive solution of a problem posed in [11]. We say that a Riesz space E has the intersection property if every two-point subset of E has the infimum with respect to the lateral order (for instance, the principal projection property implies the intersection property). The main result of the section (Theorem 7.5) asserts that, if D is a lateral field in a Riesz space E with the intersection property, X a vector space and T 0 : D → X an orthogonally additive operator then there exists an orthogonally additive extension T : E → X of T 0 .

Preliminaries
In this section we give some preliminary information on Riesz spaces and orthogonally additive operators. For the terminology and notation that are familiarly used in the paper, we refer the reader to [5]. All Riesz spaces considered in the paper are assumed to be Archimedean.
There are two types of order convergence of nets in Riesz spaces.
Definition 2.1 Following terminology from [12] and notation from [3], we say that a net (x α ) α∈A in a Riesz space E is • strongly order convergent to a limit x ∈ E if there is a net (y α ) α∈A in E such that y α ↓ 0 and |x α − x| ≤ y α for some α 0 ∈ A and all α ≥ α 0 (write x α • weakly order convergent to a limit x ∈ E if there is a net (y β ) β∈B in E such that y β ↓ 0 and for every β ∈ B there exists α 0 ∈ A such that |x α − x| ≤ y β for all Obviously, every strongly order convergent net is weakly convergent net to the same limit, but the converse is not true [3]. However, the two types of order convergence are equivalent if E is Dedekind complete (because both are equivalent to the equality α γ >α |x γ − x| = 0). Another case, where the weak order convergence implies strong one, is monotonicity of (x α ) α∈A . In these two cases we write It is clear that T (0) = 0. The set of all orthogonally additive operators is a real vector space with respect to the natural linear operations.

Definition 2.3
Let E and F be Riesz spaces. An orthogonally additive operator T : E → F is called: • order bounded if T sends order bounded subsets of E to order bounded subsets of F.
An order bounded orthogonally additive operator T : E → F is called an abstract Uryson operator.
Observe that if T : E → F is a positive orthogonally additive operator and x ∈ E is such that T (x) = 0 then T (−x) = −T (x) (otherwise both T (x) ≥ 0 and T (−x) ≥ 0 would imply T (x) = 0). Thus, the positivity of orthogonally additive operators is completely different from that for linear operators, and so the only linear operator which is positive in the above sense is zero. However, there are lots of natural positive orthogonally additive operators: the positive, negative parts, modulus of an elements x → x + , x → x − , x → |x|, the pth power of the norm of an element of L p (μ)-space x → x p and many others.
A positive orthogonally additive operator need not be order bounded. Indeed, every function T : R → R with T (0) = 0 is an orthogonally additive operator, and obviously, not all of such functions are order bounded.
Another useful observation is that, if T : E → F is a positive orthogonally additive operator and x y in E then T (x) ≤ T (y), no matter whether y is positive or not.

The lateral order and set-theoretical operations on a Riesz space
Let E be a Riesz space. Consider the binary relation on E defined at the very beginning of the paper. We need the following simple (most likely, known) properties of this relation which we provide with a proof for the sake of completeness.

Proposition 3.1 Let E be a Riesz space and x, y ∈ E.
(1) If x y then (2) x y if and only if x + y + and x − y − .

Definition 3.3
Let E be a Riesz space. The partial order on E we call the lateral order on E. A subset G ⊆ E is said to be laterally bounded in E if G ⊆ F x for some x ∈ E. We do not mention here "from above" because every subset is automatically laterally bounded from below by zero. The lateral supremum and infimum are defined as usual in a partially ordered set, using the order on E.

Proposition 3.4 Let E be a Riesz space and e ∈ E. Then
(1) the set F e of all fragments of e is a Boolean algebra with zero 0, unit e with respect to the operations Then the bijection τ : F e + ⊕ F e − → F e given by τ (x, y) = x − y for any (x, y) ∈ F e + ⊕ F e − (the facts that τ (x, y) ∈ F e , and that τ is one-to-one follow from Proposition 3.1), induces a Boolean algebra structure on F e . It remains to observe that τ sends (0, 0) to 0, (e + , e − ) to e + − e − = e, and the induces operations are given by the formulas given in the statement of (1).
Let G be a nonempty subset of E. Extending the notation of Proposition 3.4, the -supremum and the -infimum of G in E we denote by G and G respectively. We also write m k=1 x k or x 1 ∪ ∪ ∪ . . . ∪ ∪ ∪ x n for {x 1 , . . . , x m }, and similarly for infima using the symbols ∩ ∩ ∩ and . This notation is natural due to the following reasons. First, if we deal with a function lattice then the graph of the lateral supremum equals the union of the graphs, in their nonzero parts. Analogously, the graph of the lateral infimum equals the intersection of the graphs, in their nonzero parts. Second reason is that, by Proposition 3.4 (1), F e is a Boolean algebra with respect to the lateral order. Then by Stone's representation theorem [9,Theorem 7.11], F e is Boolean isomorphic to the algebra of subsets of some set. Such a Boolean isomorphism sends the lateral supremum to the union, and the lateral infimum to the intersection. To distinguish the lateral supremum from the set-theoretical union, the reader just has to check whether the symbol concerns elements or sets of elements of a Riesz space. Another thing which differs the lateral supremum from the set-theoretical union is the bold style for lateral suprema and infima. By 3.2, using the well known equality x + y = x ∨ y + x ∧ y [5, Theorem 1.2], we obtain the following consequence. Corollary 3.5 Let E be a Riesz space, e ∈ E and x, y e. Then x + y = x ∪ ∪ ∪ y + x ∩ ∩ ∩ y. If, moreover, x ⊥ y then x + y = x ∪ ∪ ∪ y.
As a direct consequence of item (2) of Proposition 3.1 one has the following statement.  Using Proposition 3.2 (1), one can easily prove by induction the following statement.

Corollary 3.7 Every laterally bounded finite subset
The next statement reduces the lateral supremum and infimum to the usual ones for laterally bounded sets. Proof By (ii) of Corollary 3.6, it is enough to consider the case where G ⊆ E + . But in this case the statement follows from Proposition 3.2 (2).

Corollary 3.9 Let G be a laterally bounded subset of a Dedekind complete Riesz space
A somewhat different approach is needed for investigation of lateral infima. Remark 3.10 For simplicity of notation, we set the convention to write x y instead of x ∩ ∩ ∩ y for elements x, y of a Riesz space E. Next, to avoid lots of parentheses, for example, in the expression (x ∩ ∩ ∩ y) − z we get a deal to operate the lateral infimum x y first. So, we write x y − z instead.
As already mentioned above, every subset of a Riesz space is laterally bounded from below by zero. However, a two-point set need not have -infimum, as the following example shows.
Now we prove that x y does not exist. Assume on the contrary the existence of z = x y. We show that z(t) = 1 for all t ∈ [0, 1) and z(t) = 0 for all t ∈ (1, 2], which contradicts the continuity of z at the point 1. We will use the following property of E (which is a common property of every Riesz space of functions) Fix any point t ∈ [0, 1). Choose α ∈ R with 0 ≤ t < α < 1. Since 1 [0,α] x and Analogously, since z y, either z(t) = 0 or z(t) = y(t). Finally, since x(t) = y(t), we obtain z(t) = 0.
Nevertheless, such examples exist only in Riesz spaces without the principal projection property. Let E be a Riesz space with the principal projection property. By P v , v ∈ E we denote the order projection of E onto the band generated by v.
Moreover P x−y z = P x−y (x − P x−y x) = P x−y x − P x−y x = 0 and hence P x−y ⊥ P z . Show that both relations z x and z y hold. Indeed, P z x = P z (z + P x−y x) = P z z + P z • P x−y x = z; P z y = P z (z + P x−y y) = P z z + P z • P x−y y = z. Now take t ∈ E such that t x and t y.
. and P t ⊥ P x−y . Now we may write Thus by the Lemma 3.12 we have t z and therefore both statements z = x y and F x ∩ F y = F z are proved. Definition 3.14 We say that a Riesz space E has the intersection property if every two-point subset {x, y} ⊂ E has a lateral infimum x y.
By Theorem 3.13, the following holds.

Problem 3.16 Does there exist a Riesz space with the intersection property failing the principal projection property?
We consider some more set-theoretical operations on the Boolean algebra F e of fragments of an element e. Definition 3.17 Let E be a Riesz space and e ∈ E. We define the set-theoretical difference \ \ \ and the symmetric difference on F e by setting x\ \ \y = x (e − y) and x y = (x\ \ \y) ∪ ∪ ∪ (y\ \ \x) for any x, y ∈ F e respectively.
The above operations one can define in another way using the following statement.

Proposition 3.18 Let E be a Riesz space and e ∈ E. Then for any x, y ∈ F e one has
Proof (1) The equality A = (A ∩ B) ∪ (A\B) for subsets of any set X is obvious.
Using the lateral infimum, we define the set-theoretical difference for not necessarily laterally bounded elements.

Definition 3.19
Let E be a Riesz space. For any x, y ∈ E such that x y exists we define the set-theoretical difference by setting Since the two-point set {x, x y} is laterally bounded by x, the operation is well defined. Observe that, in case of existence, one has Indeed, since x, x y ∈ F x , by (3.1) and (2) of Proposition 3.18 If E has the intersection property (in particular, if E has the principal projection property) then x\ \ \y is well defined for any x, y ∈ E. Proposition 3.20 Let E be a Riesz space and x, y, u, v ∈ E with x y and u v. Then the following assertions hold.
(i) If xu, yv exist then xu yv.
The proof is obvious. We need the following statement for the proof of the main result of Sect. 7.

Proposition 3.21 Let E be a Riesz space and x, y, z ∈ E. Then the following assertions hold under the assumption of existence of operations results.
Remark that all items of Proposition 3.21 are evident for elements of a Boolean algebra. So, no proof is needed for laterally bounded sets of elements.
Proof (i) follows from the observation that all the terms belong to F y which is a Boolean algebra. (ii) immediately follows from (i). (iii) Set u = (x\ \ \y) y. Then u x y and u x\ \ \y.
. Since x y u and xz u, we have x y xz u. To prove the other side inequality, set v = u\ \ \(x y xz). By (i) of Proposition 3.20 and (i) of Proposition 3.21, vx y v (x y xz) = 0. Since v u x, one has v = vx and hence vy = vx y = 0. Analogously, vz = 0. Observe that v, y, z y z. Hence, as for elements of the Boolean algebra F y z , we obtain v = vy vz = 0, that is, u = x y xz.
To prove the other side inequality x y\ \ \x yz y\ \ \yz we set x 1 = x y and y 1 = yz. Then the desired inequality is x 1 \ \ \x 1 y 1 y\ \ \y 1 . Taking into account that all the terms of the later inequality are laterally bounded by y, we obtain the inequality from the corresponding inclusion for sets. (vii) Using twice (v) and then (iv) we get (viii) By the definitions and (vii), Substituting x y = x 1 and xz = x 2 we continue the chain of equalities Now all the terms are elements of the Boolean algebra P x . Hence we continue as follows

Lateral convergence and lateral continuity
Some version of laterally (i.e., horizontally) convergence of nets and corresponding continuity of maps acting between Riesz spaces was considered in [13,20] and other papers. A net (x α ) in a Riesz space E in the mentioned above papers is said to be laterally convergent to an element (1) of Proposition 3.1, a laterally increasing net equals a difference of two order increasing nets, and hence, the strong and weak order convergence coincide for a laterally increasing net).
However, the assumption of lateral increasing on the net in the above definition is too restrictive and unjustified. It is very natural to replace this restriction with the condition of lateral boundedness of the net. This idea was realized in a paper by Gumenchuk [10]. We modify Gumenchuk's idea by considering strong and weak order convergence.

Lateral convergence
We introduce several types of lateral convergence of a net to be laterally bounded and order convergent in the corresponding sense. Since attaching of additional terms at the beginning of a net cannot spoil its convergence, we define a slightly weaker notion of lateral boundedness.

Definition 4.2 Let E be a Riesz space and x ∈ E. An eventually laterally bounded net
Observe that the same example showing that the weak order convergence of a net does not imply its strong order convergence, which is referred as Fremlin's example in the literature (see e.g. [25, p. 141]), works for the lateral convergence. We provide this example for the sake of completeness.

Example 4.3
There exists a Riesz space E and a net in E which is weakly laterally convergent, but is not strongly laterally convergent.
Indeed, consider the one-point compactification K of an uncountable discrete space, and let E = C(K ). If (x n ) ∞ n=1 denotes the characteristic functions of a sequence of distinct singletons in K , the sequence (x n ), being laterally bounded from above by the constant function 1, is weakly laterally convergent but not strongly laterally convergent to zero.
Surely, if either E is Dedekind complete or the net is laterally monotone then the −→ x are equivalent, and we write x α −→ x. To distinguish the laterally convergent nets in the sense of Definition 4.2 from the laterally convergent nets considered in papers [13,20], we offer another name for the latter notion.
A subset A of a Riesz space E is said to be strongly order closed (respectively, weakly order closed) if for every net (x α ) in A and every x ∈ E the condition x α Obviously, a strongly (respectively, weakly) order closed subset is strongly (respectively, weakly) laterally closed, however, the set {n −1 x 0 : n ∈ N} where x 0 ∈ E\{0}, is both strongly and weakly laterally closed but is neither strongly nor weakly order closed. Among other obvious implications we point our the following ones: a weakly order closed subset is strongly order closed, and a weakly laterally closed subset is strongly laterally closed.
It is an easy technical exercise to show that the set F e is weakly order closed and hence, weakly laterally closed (see [10] for a short proof that F e is strongly order closed, which also can be applied to prove that F e is weakly order closed). Hence, we obtain the following useful consequence.

Proposition 4.5 Let E be a Riesz space, e ∈ E and x
It is natural that, for a laterally convergent net in a Dedekind complete Riesz space, a majorizing net (which appears in the definition of the order convergence) could be found among the fragments of the modulus of the upper lateral bound. Proposition 4.6 [10] Let E be a Dedekind complete Riesz space, e ∈ E, x α −→ x, where x ∈ E and x α e for all α ≥ α 0 . Then there is a net (v α ) with the same index set such that v α |e| and |x α − x| v α for all α ≥ α 0 and v α ↓ 0.
Another useful fact from [10] describes relationships between the lateral convergence of a net and of its positive and negative parts.
Lemma 4.7 [10] Let E be a Riesz space, (x α ) a net in E and x ∈ E. Then the following assertions are equivalent.
The same is true for weak lateral convergence.
Actually, the proof in [10] of Lemma 4.7 concerns strong lateral convergence. However, the same proof is actual for weak lateral convergence.
There is an example in [10] showing that the eventually laterally boundedness assumption in (ii) cannot be removed.
It is well known that the order convergence of nets in the classical Banach lattices L p with 1 ≤ p ≤ ∞ does not coincide with the convergence in any topology on L p . We remark that the lateral convergence of nets in L p , as well as the up-lateral convergence, is much farther from topological convergence, because the sum of two up-lateral convergent nets need not be laterally convergent. Consider, for example, sequences x n = 1 1 n ,1 and y n = 1 0,1− 1 however the sequence x n + y n = 1 0, 1 is not eventually laterally bounded, and hence, is not laterally convergent.

Lateral boundedness
We show that an orthogonally additive operator is lateral bounded if and only if it preserves disjointness.

Definition 4.8
An orthogonally additive operator T : E → F between Riesz spaces E and F is said to be laterally bounded if T sends laterally bounded subsets of E to laterally bounded subsets of F.

Theorem 4.9
For an orthogonally additive operator T : E → F between Riesz spaces E and F the following assertions are equivalent: (1) T is laterally bounded; (2) T preserves disjointness; (4) T is lateral order preserving, that is, for every x, y ∈ E the relation x y implies T (x) T (y).
For the proof, we need the following lemma.

Lemma 4.10
For any elements x, y of a Riesz space E the following are equivalent: Proof of Lemma 4.10 (i) ⇒ (ii). Observe that if (i) is true then the set {x, y, x + y} is laterally bounded by x + y from above.
(ii) ⇒ (i). Let e ∈ E be such that {x, y, x + y} ⊆ F e . Using (1) of Proposition 3.18, represent x + y as a disjoint sum x + y = (x\y) 2x y (y\x). Then every summand of the disjoint sum is a fragment of x + y, and hence, a fragment of e. Thus, x y and 2x y are fragments of e. Hence, x y ⊥ (e − x y) and 2x y ⊥ (e − 2x y). By [25, p. 64], 2x y ⊥ (e − x y) − (e − 2x y) = x y. This yields x y = 0, and hence, x ⊥ y.

Lateral continuity
One of the motivations to consider the lateral convergence is to generalize theorems in a natural way. For instance, Theorem 5.1 from [15] (see also [24,Theorem 10.17]) asserting that every AM-compact order-to-norm continuous linear operator from an atomless Dedekind complete Riesz space to a Banach space is narrow, was then generalized in [20, Theorem 3.2] simultaneously in three directions: every C-compact up-laterally-to-norm continuous orthogonally additive operator acting from an atomless Dedekind complete Riesz space to a Banach space is narrow. One of the directions is due to the fact that the class of up-laterally-to-norm continuous maps is wider than the class of order-to-norm continuous maps, because the up-lateral convergence implies the order convergence.
A function f : E → F is said to be strongly laterally (or weakly laterally, or up-laterally) continuous provided f is so at every point x ∈ E.

Remark 4.12
The above three notions of lateral continuity are incomparable.
(a) Notice that for any Riesz spaces E and F every function f : E → F is uplaterally continuous at zero. But there are Riesz spaces E, F and a linear operator T : E → F which is not strongly and weakly laterally continuous at zero. Indeed, let Y be an uncountable discrete space, X ⊆ Y be a countable subspace of Y , L = Y {∞} be the one-point compactification of Y , K = X {∞}, E = C(K ) and F = C(L). Consider the operator T : E → F defined by Then T is not strongly and weakly laterally continuous at zero. Thus, the up-lateral continuity does not imply the strong lateral continuity and does not imply the weak lateral continuity.
We consider the linear operator T : E → F defined by It is easy to see that T is both strongly and weakly laterally continuous. However, T is not up-laterally continuous at the point . Thus, the strong lateral continuity and the weak lateral continuity do not imply the up-lateral continuity.
(c) Let E = c be the Banach lattice of all converging sequences and F = C(K ), where K is the one-point compactification of an uncountable discrete space X , (x n ) ∞ n=1 be a sequence of distinct points x n ∈ X and y n = 1 {x n } ∈ F for every n ∈ N. We consider the linear operator T : E → F defined by Show that T is weakly laterally continuous at 0. Denote by A the system of all finite sets A ⊆ X \{x k : k ∈ N}.
Consider the following order ≤ on the set B = N × A: For every β = (n, A) ∈ B we put It is easy to see that y β ↓ 0. Moreover, for every net (u α ) α in E such that u α w− −→ 0 and for every β ∈ B there exists α 0 such that |T (u α )| ≤ y β for all α ≥ α 0 . Consequently, T is weakly laterally continuous at 0.
On the other hand, we consider the sequence (u n ) n∈N of elements u n = 1 − 1 {k:1≤k≤n−1} ∈ E. Then (u n ) n∈N strongly laterally converges to 0. But T (u n ) = y n for every n ∈ N and (T (u n )) n∈N does not strongly laterally converge to 0. Thus, T is not strongly laterally continuous at 0. So, the weak lateral continuity does not imply the strong lateral continuity.
(d) Let E = C(K ), where K is the one-point compactification of an uncountable discrete space, and F = l ∞ . It is easy to construct function (not necessarily orthogonally additive) f : E → F such that f is strongly laterally continuous and is not weakly laterally continuous at 0. So, the strong lateral continuity does not imply the weak lateral continuity.
In case of Dedekind complete E and F we use the term "laterally continuous" for both versions "strongly laterally continuous" and "weakly laterally continuous", because these versions are equivalent.
We say that a net (x α ) is eventually constant if x α = x α 0 for some α 0 and all α ≥ α 0 . Observe that the only eventually constant nets are laterally convergent in the Riesz space R with the usual order. So, every map f : R → F for every Riesz space F is both strongly laterally continuous and weakly laterally continuous. On the other hand, the only laterally continuous functions from an atomless Riesz space E to R are constant functions. Another drawback of the notion of lateral continuity for linear and orthogonally additive operators is that the sum of two laterally continuous operators need not be laterally continuous. is not eventually laterally bounded and hence fails to be convergent both up-laterally and laterally. This is why it is important to investigate mixed versions of continuity like the following ones. Definition 4.14 Let E be a Riesz space and X a normed space. A function f : E → X is said to be s-order-to-norm continuous (or w-order-to-norm continuous) at a point The same function f is called s-order-to-norm continuous (or w-order-to-norm continuous), if it is so at each point x ∈ E.
In a similar way one can define s-laterally-to-norm, w-laterally-to-norm, uplaterally-to-norm continuous functions from a Riesz space to a normed space. Moreover, let E, F be Riesz spaces and (ϕ, ψ) be any pair of distinct types of convergence from the following ones: s-order, w-order, s-lateral, w-lateral, up-lateral. A function f : E → F is said to be ϕ-to-ψ continuous at a point x ∈ E, if for every Since the lateral convergence implies the order convergence, the order-to-norm continuity of a function f : E → X implies the laterally-to norm continuity of f . The following example shows that the converse assertion is not true even for linear operators.

Example 4.15
Let 1 ≤ p ≤ ∞. Then there is a laterally-to-norm continuous orthogonally additive operator T : L p → R which is not order-to-norm continuous.
Proof Given any x ∈ L p , we set To see that T is well defined, we set A x = a ∈ R\{0} : μ x −1 ({a}) = 0 and Note that the set A x is at most countable, B x is a measurable subset of [0, 1] and We will use the following simple observation: B x ⊆ supp x. Show that T is an orthogonally additive operator. Assume x, y ∈ L p and x ⊥ y, that is, supp x ∩ supp y = ∅. Then B x ∩ B y = ∅, B x+y = B x ∪ B y and hence Prove the laterally-to-norm continuity of T . Assume (x α ) is a net is L p and x α −→ x. Choose e ∈ L p and an index α 0 so that x, x α e for all α ≥ α 0 (see Proposition 4.5). Fix any ε > 0 and choose δ > 0 so that for any measurable set A ⊆ [0, 1] the inequality by the choice of δ. Now observe: x(t) equals e(t) and the other one equals zero.
To show that T is not order-to-norm continuous, set x n (t) = 1 +  (1) · is a laterally-to-norm continuous function; (2) · is an order-to-norm continuous function.
Before the proof we remark that a Banach lattice E is Dedekind σ -complete if and only if E has the principal projection property [16, p. 18], which actually is used in the proof below.
Proof Implication (2) ⇒ (1) is obvious. We show (1) ⇒ (2). Take a sequence (x n ) in E + with x n ↓ 0. It is enough to prove that inf n x n = 0. Fix ε > 0. For every n ∈ N let π n denote the order projection of E onto the band in E generated by (x n − εx 1 ) + . Since x n ↓ 0, it follows that π n ↓ 0, where the infimum is taken in the Boolean algebra B(E) of all order projections on E. For n ≥ n 0 we get Hence, 0 ≤ x n ≤ εx 1 + π n x 1 . Thus, 0 ≤ x n ≤ ε x 1 + π n x 1 and 0 ≤ inf n x n ≤ ε x 1 + inf n π n x 1 .
Observe that (π n x 1 ) n∈N laterally converges to 0. Since · is a laterally-to-norm continuous function, we have that inf n π n x 1 = 0 and 0 ≤ inf n x n ≤ ε x 1 .
Since ε > 0 is arbitrary, we deduce that inf n x n = 0.
It is very natural that the continuity of an orthogonally additive operator is equivalent to its continuity at zero.

Theorem 4.17 [10] Let E be a Riesz space, F a Riesz space (normed space), T : E → F an orthogonally additive operator. Let T be s-laterally or s-laterally-toorder (s-laterally-to-norm, respectively) continuous at zero. Then T is s-laterally or s-laterally-to-order (s-laterally-to-norm, respectively) continuous.
The following example shows that the lateral continuity of an orthogonally additive operator at one nonzero point does not imply its lateral continuity at all other points (e.g., at zero).

Example 4.18
There exists a non-Dedekind σ -complete Riesz space E and an orthogonally additive operator T : E → R which is laterally-to-norm continuous in all senses (up, s-and w-) at one point and is not laterally-to-norm continuous in all senses at another point. Hence, the same operator is laterally-to-order continuous in all senses at one point and is not laterally-to-order continuous in all senses at another point.
Observe that Define a map ϕ : F 1 → R by setting Then ϕ : F 1 → R is an orthogonally additive map from F 1 to R. Now set 2 = (2, . . . , 2, . . .). Define a map ψ : Observe that ψ is an orthogonally additive operator as well.
Observe that for each element e ∈ ∞ 0 the function T e : ∞ 0 → ∞ 0 of taking the lateral infimum T e (x) = xe is a disjointness preserving operator. Now we define a map T : ∞ 0 → R by setting for all e ∈ ∞ 0 . Remark that T is well defined because e1 ∈ F 1 and e2 ∈ F 2 . Being of a composition of a disjointness preserving operator by an orthogonally additive operator, each summand of the above formula defines an orthogonally additive operator. Thus, so is the sum T .
Consider the sequence of elements x k ∈ ∞ 0 where x k = (u k,i ) i∈N are such that u k,1 = u k,2 = · · · = u k,k = 1 and ∀i > k : u k,i = 0. It is clear that and so, T is neither up-laterally-to-norm, nor s-laterally-to-norm continuous, nor wlaterally-to-norm continuous at 1. To show that T is s-laterally-to-norm, w-laterallyto-norm and up-laterally-to-norm continuous at 2, consider any s-, w-or up-laterally convergent net (v α ) to 2. Say, (v α ) is eventually laterally bounded by e ∈ ∞ 0 . Let α 0 be an index such that v α e for all α ≥ α 0 . By Proposition 4.5, 2 e, which obviously implies that e = 2. Observe that for any type of lateral convergence of (v α ) one has ψ(2 − v α ) −→ 0. Then for all α ≥ α 0 one has

Consistent sets
The notion of a consistent subset is new. It may be convenient in different contexts. Consistent sets naturally generalize laterally bounded subsets of a Riesz space and give principally new tools for investigation of general Riesz spaces.
Observe that every disjoint set is consistent. Simple examples show that a consistent set in a Riesz space need not be laterally bounded. For instance, the set G = {1 [0,n] : n ∈ N}, being a lateral chain, is consistent but is not laterally bounded in L 1 (R).

Proposition 5.2 For a subset G of a Riesz space E the following assertions are equivalent:
(1) G is consistent; (2) every finite subset of G is laterally bounded; (

3) every finite subset of G has a -supremum in E.
Proof By Corollary 3.7, (2) and (3) are equivalent. Implication (2) ⇒ (1) is obvious. We prove implication (1) ⇒ (2). By Corollary 3.6, it is enough to consider the case where G ⊆ E + . Let G ⊆ E + be consistent and let {x 1 , . . . , x n } be a finite subset of We show that, for all i = 1, . . . , n one has x i x 1 ∨ . . . ∨ x n , which completes the proof. Fix any i. Since x i ⊥ (x i ∨ x j ) − x i for all j, one has Recall that a Riesz space E is called laterally complete if every disjoint family from E + has the supremum. The following simple observation shows that, using lateral terminology, one can give an equivalent definition for not necessarily positive disjoint families.

Proposition 5.3 A Riesz space E is laterally complete if and only if every disjoint family from E has a lateral supremum.
Proof By (2) of Proposition 3.4, if every disjoint family from E has a lateral supremum then E is laterally complete. Let E be laterally complete and G ⊂ E be a disjoint family. Obviously, G + = {g + : g ∈ G} and G − = {g − : g ∈ G} are disjoint families from E + which have suprema sup G + and sup G − by the lateral completeness of E. By (2) of Proposition 3.4, there are lateral suprema G + and G − . Finally, by Corollary 3.6, there exists the lateral supremum G = G + − G − .
The following theorem characterizes laterally complete Riesz spaces in terms of consistent sets.

Theorem 5.4 A Riesz space E is laterally complete if and only if every consistent set A ⊂ E has a lateral supremum A ∈ E.
First we need some lemmas.

Lemma 5.5 Let A be a consistent subset of a Riesz space E, B ⊆ A, a ∈ A. If there exists B then the two-point set {a, B} is laterally bounded.
Proof By Corollary 3.6, with no loss of generality, we may and do assume that A ⊂ E + . Hence, b := B = B. We prove that {a, b} is laterally bounded by e = a ∨ b. First we show that a e, that is, a ⊥ a∨b−a. Since a∨b−a = 0∨(b−a) = (b−a) + , one has By the infinite distributivity property of any Archimedean Riesz space [26, Theorem III.5.1] we continue the chain of equalities as We have proved that, for every b ∈ B, b ⊥ b ∨ a − b. Since the orthogonal complement to any element is a band, we obtain that b = B ⊥ b ∨ a − b.
Remark that the set-theoretical difference in (5.1) is well defined by Lemma 5.5.
Proof Set A ω α = A and prove the following claim by transfinite induction.
If γ is an isolated ordinal then γ = α + 1 for some α < γ , and by the induction assumption If γ is a limited ordinal then by the induction assumption So, Claim ( * ) is proved. The lemma follows from the claim for γ = ω β .

Proof of Theorem 5.4 Let E be laterally complete. Assume
A ⊂ E is consistent. By Corollary 3.6, with no loss of generality, we may and do assume that A ⊂ E + . So, it is enough to prove the following claim.
For every ordinal β every consistent set A ⊂ E + of cardinality < ℵ β has a lateral supremum.
For β = 0 the claim follows from Proposition 5.2. Assume the claim is true for every ordinal 0 ≤ β < γ and prove the claim for β = γ . Let A ⊆ E + be a consistent subset and |A| < ℵ γ . If γ is a limit ordinal then there is β < γ such that |A| < ℵ β , and the lateral boundedness of A follows from the induction assumption. Let γ be an isolated ordinal, γ = β + 1. Then |A| ≤ ℵ β . If |A| < ℵ β then the lateral boundedness of A follows again from the induction assumption. So, consider the case where |A| = ℵ β . Let A = {a α : α < ω β } be any well ordering of A. Set A α = {a ξ : ξ < α} for all 0 < α < ω β and observe that |A α | < ℵ β . By the induction assumption, A α is well defined for all α < ω β . Then we define an ω β -sequence (b α ) α<ω β in E by setting b 0 = a 0 and b α = a α \ A α for 0 < α < ω β . (5. 2) The set-theoretical difference in (5.2) is well defined by Lemma 5.5. It is immediate that (b α ) α<ω β is a disjoint system in E + . By the lateral completeness of E, there exists e = {b α : α < ω β }. By Lemma 5.6, A = e. Assume every consistent set in E has a lateral supremum. Let a i ∈ E + , i ∈ I , be a disjoint system. Obviously, A = {a i : i ∈ I } is a consistent set. By the assumption, there exists A ∈ E. By (2) of Proposition 3.4, sup A = A, and hence, E is laterally complete. Theorem 5.4 has an important consequence which concerns the property of a Riesz space to have a lateral suprema of every laterally bounded set. Definition 5.7 A Riesz space E is said to be C-complete if every nonempty laterally bounded subset G of E has a lateral supremum G ∈ E.

Corollary 5.8 If a Riesz space E is either Dedekind complete or laterally complete then E is C-complete.
Proof If a Riesz space E is Dedekind complete then E is C-complete by Corollary 3.9. If a Riesz space E is laterally complete then E is C-complete by Theorem 5.4.
Observe that the Banach lattice C[0, 1] is a C-complete Riesz space which is both not Dedekind complete and not laterally complete. We do not know whether there is an atomless example of the kind.

Lateral fields, ideals and bands
Definition 6.1 A nonempty subset G of a Riesz space E is called: • finitely laterally closed if for every laterally bounded two-point subset {x, y} of E the condition {x, y} ⊆ G implies x ∪ ∪ ∪ y ∈ G; • a lateral field if it is finitely laterally closed, and for every two-point subset {x, y} of G the existence of x y implies x y ∈ G and x\ \ \y ∈ G; • laterally solid if for each x ∈ E and y ∈ G the relation x y implies x ∈ G; • a lateral ideal if it is laterally solid and finitely laterally closed; • up-laterally closed if for each subset G 1 ⊆ G the existence of f = G 1 in E implies that f ∈ G; • laterally closed if for every net (x α ) in G and every x ∈ E the condition x α −→ x implies that x ∈ G; • a lateral band if it is a laterally closed lateral ideal.
It is immediate that a lateral band is a lateral ideal, and a lateral ideal is a lateral field, but the converse assertions are not true. Every laterally closed subset is up-laterally closed, but, if E contains a nontrivial laterally convergent to zero net (x α ) then the set F e \{0} is obviously up-laterally closed but is not laterally closed. However, for laterally solid sets these two notions coincide.

Proposition 6.2 Let G be an up-laterally closed lateral ideal of a Riesz space E. Then G is a lateral band.
Proof Let (x α ) be a net in G, x ∈ E and x α −→ x. We claim that x ∈ G. Passing to positive and negative parts of the elements and using Corollary 3.9, we reduce the claim to the case where x, x α ≥ 0. Assume Fix any α ≥ α 0 . By (2) of Proposition 3.4, β≥α x β = β≥α x β and hence β≥α x β x α . Since G is laterally solid, β≥α x β ∈ G. Since G is up-laterally solid, by (6.1) x ∈ G.
Remark that in [11] we define a lateral band of a Riesz space E to be laterally solid up-laterally closed subset of E. Fortunately, this appears to be equivalent to the definition given above due to Proposition 6.2.
Observe that a nonempty subset G ⊆ E is consistent and finitely laterally closed if and only if it is directed with respect to the lateral order.
An equivalent definition of a lateral ideal is given in the following simple statement.

Lemma 6.3 Let E be a Riesz space and G ⊂ E. The following assertions are equivalent:
(1) G is a lateral ideal; (2) G is laterally solid and for every x, y ∈ G with x ⊥ y one has x + y ∈ G.
The importance of lateral ideals for orthogonally additive operators is demonstrated in the following statement. Proof Assume x ∈ E, y ∈ ker T and x y hold. Then 0 ≤ T (x) ≤ T (x) + T (y − x) = T (y) = 0, and hence x ∈ ker T , so ker T is laterally solid. Assume x, y ∈ ker T and x ⊥ y. Then T (x + y) = T (x) + T (y) = 0 and x + y = z ∈ ker T . The next statement asserts that not every lateral ideal is the kernel of a positive orthogonally additive separable valued operator.

Proposition 6.5 Let E be a Dedekind complete Riesz space containing a strictly increasing up-laterally convergent sequence. Then there is a lateral ideal in E which cannot be equal the kernel of a positive orthogonally additive operator from E to any separable Banach lattice F.
Proof Let e ∈ E and let (e n ) ∞ n=1 be a sequence with e n e n+1 , e n = e n+1 and e n ↑ −→ e. Set H = ∞ n=1 F e n and prove that H possesses the desired properties. Since e n e n+1 , we have that F e n ⊆ F e n+1 for all n, which implies that H is a lateral ideal.
Assume, on the contrary, that H = ker T , where T : E → F is a positive orthogonally additive operator to a separable Banach lattice F. Let M be an uncountable collection of infinite subsets of N such that the well known mathematical folklore. Set e 1 = e 1 and e n+1 = e n+1 − e n for every n ∈ N. Then e = n∈N e n = n∈N e n . For any A ∈ M set x A = n∈A e n (the lateral supremum exists by Corollary 3.9, because the set under the supremum is laterally bounded by e). Since every A ∈ M is infinite, x A / ∈ H and so, T (x A ) = 0. By the separability of F, there is a nonzero condensation point f ∈ F of the set Fix any δ > 0 and m ∈ N. Choose any A 1 , . . . , A m ∈ M δ . Then, by (6.2), there is n ∈ N such that for the infinite sets B k = A k \{1, . . . , n}, k = 1, . . . , m one has Set y k = {e n : n ∈ B k } and z k = {e n : n ∈ A k \B k } for k = 1, . . . , m. Then x A k = y k z k for k = 1, . . . , m. Since z k ∈ H , by the orthogonal additivity of T we get k=1 is a disjoint sequence. Hence, taking into account that y 1 . . . y m e, by positivity of T we obtain T (y 1 ) + · · · + T (y m ) ≤ T (e). Thus, which contradicts the arbitrariness of δ > 0 and m ∈ N.
The following statement shows that the separability assumption in Proposition 6.5 is essential. where x = (ξ n ) n∈N ∈ l ∞ andx = π(x) = {y ∈ l ∞ : x − y ∈ c 0 }. Notice that F 0 is a Banach lattice with respect to the order For any A ⊆ N set x A = 1 A , where 1 = (1, 1, 1, . . .) ∈ l ∞ . Moreover, for every x = (ξ n ) n∈N ∈ l ∞ set N x = {n ∈ N : ξ n = 1} and M x = {n ∈ N : ξ n = 1}. Fix any sequence (A n ) n∈N of disjoint infinite sets A n ⊆ N. Consider the operator T : l ∞ → F 0 defined by T (x) = π( n∈N x |ξ n | · x A n ) + π(1 M x ). It is easy to see that T is a positive orthogonally additive operator and ker T = H .

Problem 6.7
Are there a Riesz space E and a lateral ideal in E which is not equal to the kernel of any positive orthogonally additive operator T : E → F for any Riesz space F?
Obviously, the intersection of lateral fields (ideals or bands) is a lateral field (resp., ideal or band). So, given any subset G of P, there exists the minimal lateral field F(G), the minimal lateral ideal I(G) and the minimal lateral band B(G) containing G, which equals the intersection of all lateral fields (ideals or bands, resp.) containing G. We say that F(G) (I(G) or B(G), resp.) is the lateral field (ideal or band, resp.) generated by G.

Proposition 6.8 Let E be a Riesz space and G ⊆ E. Then the following assertions hold.
(1) F(G) = ∞ n=0 G n , where G 0 = G and for all n = 0, 1, . . .
x, y ∈ G n and x ∪ ∪ ∪ y exists} ∪ {x y : x, y ∈ G n and x y exists} ∪ {x\ \ \y : x, y ∈ G n and x\ \ \y exists} (3) B(G) = X : X ⊆ x∈G F x and X exists .
The proof is straightforward.
Observe that the lateral ideal generated by a single element x ∈ E equals F x . There is a natural projection of a Dedekind complete Riesz space onto a lateral band having nice properties. The following theorem strengthens Theorem 3 of [11]. Theorem 6.9 Let G be a lateral band of a Dedekind complete Riesz space E. Then the function P G : E → E defined by setting for every x ∈ E
Proof (1) The fact that P G a projection of E onto G is proved in [11,Theorem 3], and the property P G (x) x for all x ∈ E is obvious.
(3) Fix any x, y ∈ E with x ⊥ y and z ∈ F x+y ∩G. By Corollary 3.9 we may and do assume that x, y ∈ E + . Then by the Riesz decomposition property [5,Theorem 1.13], there exists a decomposition z = z 1 z 2 , where z 1 ∈ F x ∩ G and z 2 ∈ F y ∩ G. Thus and passing to the lateral supremum over all z ∈ F x+y ∩ G in the left hand side of the above formula we obtain P G (x + y) ≤ P G (x) + P G (y). On the other hand, for every z 1 ∈ F x ∩ G and z 2 ∈ F y ∩ G the sum z 1 + z 2 belongs to F x+y ∩ G and therefore Passing to the lateral supremum in the left hand side first over all z 1 ∈ F x ∩ G and then over all z 2 ∈ F y ∩ G, we obtain P G (x) + P G (y) ≤ P G (x + y). Finally, we have the equality P G (x) + P G (y) = P G (x + y).
Consider the general case x α ∈ E for all α. By Proposition 4.7, x + α −→ x + and x − α −→ x − . Let α 0 and e ∈ E be such that x α e for all α ≥ α 0 . By Proposition 3.1, x + α e + and x − α e − for all α ≥ α 0 . Then by the above By (1), The following theorem and its corollaries concern relationships between consistent sets and lateral bands.

Theorem 6.10 The lateral band B(G) in a Riesz space E generated by a consistent set G is consistent.
Proof Let x, y ∈ B(G), say x = X and y = Y , where X , Y ⊆ g∈G F g . By Theorem 3.8, x + = sup X + and y + = sup Y + , where X + = {u + : u ∈ X } and Fix any u ∈ X and v ∈ Y . Since G is consistent, the two-point subset {u + , v + } is laterally bounded, and hence u + u + ∪ ∪ ∪ v + = u + ∨ v + by (2) of Proposition 3.4. Hence Observe that Indeed, u + ≤ x + and hence Combining (6.7) with (6.8) we obtain Then that is, x + x + ∨ y + . Analogously, y + x + ∨ y + . Therefore, {x + , y + } is a laterally bounded two-point set. Analogously, the two-point set {x − , y − } is laterally bounded as well. By Corollary 3.6, {x, y} is laterally bounded.

Corollary 6.11
The lateral field F(G) and the lateral ideal I(G) in a Riesz space E generated by a consistent subset G ⊆ E is consistent.

Extensions of orthogonally additive operators
The questions of the extension of orthogonally additive operators from subsets of a Riesz space to the entire space were considered in [11] and [21]. Here we review known results and prove our main result (Theorem 7.5) which gives a positive answer to a problem posed in [11]. One can consider an orthogonally additive operator defined on an arbitrary subset of a Riesz space. More precisely, let E be a Riesz space, X a vector space and D ⊆ E. A function T : D → X is called an orthogonally additive operator if for any x, y ∈ D with x ⊥ y and x +y ∈ D one has T (x +y) = T (x)+T (y). The very general extension problem of whether every orthogonally additive operator defined on an arbitrary subset D of a Riesz space E has an extension to an orthogonally additive operator on E, has a negative answer, even for "good lattices" E. Indeed, let E denote the Riesz space R 5 with the usual coordinate-wise order. Denote by e 1 , . . . , e 5 be the unit vector basis of E. Let D consists of all sums k∈A e k over three-point subsets A ⊂ {1, . . . , 5}. Since D consists of C 3 5 = 10 elements, the set F of all functions T : D → R is a 10-dimensional vector space with respect to the coordinate-wise operations. Since D contains no orthogonal elements, every element of F is an orthogonally additive operator. On the other hand, the set of all orthogonally additive operators defined on the set F e of all fragments of e = e 1 + · · · + e 5 is a 5-dimensional vector space. Hence, not every orthogonally additive operator defined on D can be extended to an orthogonally additive operator on E. Clearly, such an example exists for every Riesz space E with dim E ≥ 5.
In [11] and [21] the authors extend orthogonally additive operators from lateral ideals and lateral bands in a Dedekind complete Riesz space.
is the minimal abstract Uryson extension of T 0 in the sense that if S : E → F is another positive order bounded orthogonally additive operator extension of T 0 then T (x) ≤ S(x) for all x ∈ E.
The first part of Theorem 7.1 is proved in [11] and the second part in [21]. The operator T : E → F defined by (7.1) is called the minimal Uryson extension of T 0 . The following result of [21] say that the minimal Uryson extension preserves different compactness type properties (actually we combine two theorems of [21] in the following one). (1) If T 0 is AM-compact (or C-compact) then so is T .
(2) If, in addition, E is atomless and T 0 is narrow (or strictly narrow) then so is T .
The following result is an easy consequence of Theorem 6.9. A more delicate problem is to extend an orthogonally additive operator from a lateral field.  [11]) Let F be a lateral field in a Riesz space E, X a linear space. Whether every orthogonally additive operator T 0 : F → X can be extended to an orthogonally additive operator T : E → X?
We solve this problem for Riesz spaces with the intersection property which is much less restrictive than for Dedekind complete ones, as in theorems 7.1 and 7.3. Moreover, the following theorem, which is the main result of the section, deals with arbitrary orthogonally additive operators. First we need some lemmas.  where n ∈ N, α k ∈ R and x k ∈ D for k = 1, . . . , n. Let F be the lateral field in E generated by the set {x k : k = 1, . . . , n}. Since x k ∈ F x for all k and F x is a Boolean algebra, F is finite. Using Lemma 7.6, one can easily show that z can be represented as z = s i=1 β i y i where (y i ) s i=1 is a disjoint sequence in D and β i = 0 for all i. Then we define S 0 : Z → X by setting S 0 (0) = 0 and S 0 (z) = s i=1 β i T 0 (y i ).
We show that S 0 (z) does not depend on the expansion of z. Indeed, let z have another expansion z = t j=1 γ j z j , where (z j ) t j=1 is a disjoint sequence in D and γ j = 0 for all j. Observe that if y i z j = 0 for given i and j then β i = γ j . Then Obviously, S 0 extends T 0 to Z . Using the well known technique of Hamel's bases, one can easily extend S 0 to a linear operator S : E → X . Finally we set T = S| F x . Lemma 7.8 Let D 0 be a lateral field in a Riesz space E with the intersection property, x 0 ∈ E\D 0 , D the lateral field in E generated by D 0 ∪ {x 0 }, X a vector space and T 0 : D 0 → X an orthogonally additive operator. Then there exists an orthogonally additive extension T : D → X.
Proof Let Y be the lateral field in E generated by F x 0 ∩ D. We set Y 0 = D 0 ∩ Y . Then Y 0 ⊆ F x 0 and Y 0 is a lateral field in E. By Lemma 7.7, there exists an orthogonally additive extension S : Y → X of S 0 = T 0 | Y 0 . Set Z = {x\ \ \x 0 : x ∈ D 0 } and define an operator R : Z → X by setting where x ∈ D 0 is such that z = x\ \ \x 0 . Show that R is well defined. Assume z ∈ Z and x 1 , x 2 ∈ D 0 satisfy z = x 1 \ \ \x 0 = x 2 \ \ \x 0 . Denote u 1 = x 1 x 0 , u 2 = x 2 x 0 , x = x 1 x 2 and u = u 1 u 2 . Observe that x = z + u. Taking into account that u i \ \ \u = x i \ \ \u ∈ D 0 , we write Analogously, Now we are going to prove the following property of R.
Note that the claim for n = 2 logically does not imply the claim for an arbitrary n, because we do not assume here that z 1 + z 2 ∈ Z . Let x, x 1 , . . . , x n ∈ D 0 be such that z = x − x x 0 and z k = x k − x k x 0 for all k = 1, . . . , n. Settingx k = x k x for each k = 1, . . . , n, we obtain z k =x k − (x k x 0 ) for every k = 1, . . . , n. The forx =x 1 + · · · +x n−1 one has z 1 + · · · + z n−1 =x − (x x 0 ). Now the claim is reduced to the case where n = 2, x 1 x and x 2 = x − x 1 .
Indeed, by item (vii) of Proposition 3.21, Z is closed under intersections. Then by Claim 1, and Claim 2 is proved.

Claim 3
For every d ∈ D there is a unique y ∈ Y and (not necessarily unique) finite collection z 1 , . . . , z n ∈ Z such that d = y z 1 . . . z n .
First we show that if an element d ∈ E has a representation d = y z 1 . . . z n , where y ∈ Y and z i ∈ Z , then y = dx 0 . Indeed, by (v) of Proposition 3.21, dx 0 = yx 0 z 1 x 0 . . . z n x 0 = yx 0 , (7.2) because if z i = x i \ \ \x 0 then by (ii) and (v) of Proposition 3.21, which implies that x 0 z i = 0. On the other hand, y x 0 implies that yx 0 = y. Hence by (7.2), y = dx 0 . In particular, the uniqueness of y is established.
To complete the proof of the lemma, it is enough to observe that D consists of all vectors of the form y + z 1 + · · · + z n , where y ∈ Y , z 1 , . . . , z n ∈ Z is a disjoint sequence, and set T (y + z 1 + · · · + z n ) = S(y) + R(z 1 ) + · · · + R(z n ).

Proof of Theorem 7.5
The proof is standard using Zorn'z lemma and Lemma 7.8 which is considered as an extension by one step.