Max-Plus Convexity in Riesz spaces
Charles Horvath
Université de
Perpignan Département de Mathématiques, Laboratoire LAMPS
52 av. Paul Alduy 66860 PERPIGNAN cedex 9
Abstract.
We study max-plus convexity in an Archimedean Riesz space E with an order unit u; the definition of max-plus convex sets is algebraic and we do not assume that E has an a priori given topological structure. To the given unit u one can associate two equivalent norms ∥⋅∥u and ∥⋅∥hu on E; the distance
Dhu on E associated to ∥⋅∥hu is a geodesic distance for which max-plus convex sets in E are geodesically closed sets. Under suitable assumptions, we establish max-plus versions of some fixed points and continuous selection theorems that are well known for linear convex sets and we show that hyperspaces of compact max-plus convex sets are Absolute Retracts.
[email protected]
MSC: 14T99, 46A40, 54H25, 54C55, 54C65, 62P20.
1. Introduction
To keep the size of this paper reasonable, the definition of max-plus convexity in arbitrary Riesz spaces with respect to a given unit u is given in Section 4 with barely no justification as to why one should be interested in max-plus convexity. If the Riesz space in question is Rn and u=(1,⋯,1) then the max-plus convex sets with respect to u are the usual max-plus convex subsets of Rn. The usual finite dimensional max-plus convexity lives in \big{(}\mathbb{R}\cup\{-\infty\}\big{)}^{n}, the extension to arbitrary Archimedean Riesz spaces with a unit that is presented here is therefore not a full generalization of the finite dimensional framework which does not mean that such a thing could not be done. The reader looking for motivations and applications is referred to [15], [20], [23], [26].
Section 2 is mainly about basic concepts and a few exemples.
Section 3 is about two norms, denoted here by ∥⋅∥u and ∥⋅∥hu, which can be associated to a given unit u in an Archimedean Riesz space E. If E=Rn and
u=(1,⋯,1) then ∥(x1,⋯,xn)∥u=max∣xi∣ and
∥(x1,⋯,xn)∥hu=maxxi++maxxi−, the so called Hilbert affine norm. In Section 4 one will find the definition of max-plus convex sets in an Archimedean Riesz space, with respect to a given unit, and some of their basic properties the most important one being the Kakutani Property, also known in the standard linear framework as the Algebraic Hahn-Banach Property. Section 5 shows that Dhu, the metric associated to ∥⋅∥hu, is a geodesic distance on the Riesz space E with respect to which the geodesically closed sets are precisely the max-plus convex sets, with respect to the given unit u. That max-plus convexity in Rn should be a geodesic structure with respect to an appropriate metric is a not so rescent idea; it had been discussed years ago with Walter Briec from Université de Perpignan and it is Stefan Gaubert, in a discussion with the author at École Polytechnique, who hinted at the fact that the Hilbert affine metric should be the appropriate metric; shortly thereafter, in a private communication [14] mailed to the author, Stefan Gaubert proved that this is indeed the case. The proof given here differs somewhat from Gaubert’s straightforward coordinatewise proof in Rn but would have been impossible without that proof. Section 6 deals with the basic topological properties of max-plus convex sets and hyperspaces of compact max-plus sets; Section 7 is about infinite dimensional max-plus versions of some standard results: Ky Fan Best Approximation and conequently Schauder’s Fixed Point Theorem, Kakutani’s Fixed Point Theorem for upper semicontinuous maps, Michael’s Selection Theorem, Dugundji’s Extension Theorem, and consequently the fact that max-plus convex sets are Absolute Retracts. Max-plus convexity in RS and hyperspaces of compact max-plus convex subsets of RS have been studied by L. Bazylevych, D. Repovs and M. Zarichnyi in [3]. Hyperspaces of max-plus compact convex sets in C(X), where X is a compact metrizable topological space, have been studied by L. Bazylevych and M. Zarichnyi in [2]. In Section 6 one can find a few remarks on hyperspaces of compact max-plus convex sets in a Riesz space .
2. Preliminaries and a few examples
We will denote by R+ the set of positive real numbers and by R++ the set of strictly positive real numbers.
A Riesz space, or a vector lattice, is a real vector space E endowed with a partial order ⩽ that is compatible with the linear structure, that is
[TABLE]
and such that all pairs {x,y} of elements of E have a least upper bound for which we will use the standard notation x∨y.
The positive cone is E+={x∈E:0⩽x} which has the following properties;
[TABLE]
All pairs {x,y} of elements of E have a greatest lower bound, for which we will use the standard notation
x∧y; one easily sees that x\wedge y=-\big{(}(-x)\vee(-y)\big{)}.
A Riesz space E is Archimedean if, whenever x and y are two elements of E such that, for all n∈N, ny⩽x, one has y⩽0.
A Riesz space E is Dedekind complete (respectively, Dedekind σ-complete) if every non-empty (respectively, countable) subset S of E which has an upper bound has a least upper bound.
Since S has an upper bound if and only if −S has a lower bound one can replace in the definition of Dedekind complete (resp. σ-completness) “upper bound” by “lower bound”. A Dedekind σ-complete Riesz space is Archimedean.
Every Archimedean Riesz space has a Dedekind completion, more precisely: there exists a Dedekind complete Riesz space E^ containing E as a vector sublattice such that
[TABLE]
A strong order unit of a Riesz space E is an element u∈E+ such that
[TABLE]
Since strong units are the only kind of units we will consider we will drop the adjective “strong”.
A Riesz norm on a Riesz space E is a norm such that,
[TABLE]
For a Riesz norm one has, for all x∈E, ∥∣x∣∥=∥x∥. 111x+=0∨x,
x−=−(0∧x)=0∨(−x) and ∣x∣=x∨(−x)=x++x−=x+∨x−. Also, ∣tx∣=∣t∣∣x∣, ∣x+y∣⩽∣x∣+∣y∣,
∣x∣⩽y if and only if −y⩽x⩽y,
(x+y)+⩽x++y+, (x+y)−⩽x−+y−,
(x∨y)+=x+∨y+, (x∨y)−=x−∧y−.
A Riesz space equipped with a Riesz norm is a normed lattice. A normed lattice is Archimedean and the lattice operations are uniformly continuous.
Let S be a subset of a Riesz space E for which there exist x1,x2∈E such that, for all x∈S, x1⩽x⩽x2 (S is an order bounded set); if ∥⋅∥ is a Riesz norm on E then,
x∈S, ∥x1∥⩽∥x∥⩽∥x2∥. That is, in a normed lattice an order bounded set is norm-bounded.
Any two complete lattice norms on a given Riesz space E are equivalent, page 352 or [12] Proposition 25 A.
An M**-norm** on a Riesz space E is a Riesz norm such that,
[TABLE]
If ∥⋅∥ is an M-norm on E and if 0⩽x⩽y then ∥x∥≤∥y∥ ( from x∨y=y,
∥y∥=max{∥x∥,∥y∥}). If ∥⋅∥ is an M-norm and a Riesz norm on E then, for all x,y∈E, ∥x∨y∥≤max{∥x∥,∥y∥}.
An AM**-space** is a Riesz space equipped with a complete norm which is an M-norm and a Riesz norm.
An AM**-space with a unit** (resp. an M**-space with a unit**) is an AM-space E
(resp. an M-space ) with a unit u such that ∥u∥=1 in which case the unit ball is
{x∈E:−u⩽x⩽u}.
There is a standard way to associate to each given unit u on an Archimedean Riesz space E an M-norm
∥⋅∥u on E, namely :
[TABLE]
That norm ∥⋅∥u is a Riesz norm is evident; that it is also an M-norm is well known, it can also be seen from Lemma 2 below.
If u1 and u2 are two units on an Archimedean Riesz space E then, the norms
∥⋅∥u1 and ∥⋅∥u2 are equivalent since there exists two natural numbers
n1 and n2 such that u1⩽n1u2 and u2⩽n2u1.
In an Archimedean Riesz space E, possibly without a unit, take an arbitrary element u∈E+∖{0} and let
Eu={x∈E:∃n∈N∣x∣⩽nu} (the principle ideal spanned by u). Then \big{(}E_{\boldsymbol{u}},\|\cdot\|_{\boldsymbol{u}}\big{)} is an M-space with unit. If u is a unit of E then Eu is E itself. Furthermore, if (E,∥⋅∥) is a complete normed lattice or if E is Dedekind σ-complete then, for all u∈E, \big{(}E_{\boldsymbol{u}},\|\cdot\|_{\boldsymbol{u}}\big{)} is an AM-space with unit; details can be found [12], Lemma 25I and Lemma 25J.
If the Riesz space E is equipped with a complete Riesz norm ∥⋅∥ and if u is a unit in E then ∥⋅∥ and ∥⋅∥u are complete lattice norms on E; they are therefore equivalent.
If Ω is a compact topological space then the space C(Ω) of continuous real valued functions on Ω is a Riesz space, the fucntion 1 identically equal to 1 is a unit and, for all
x∈C(Ω), ∥x∥1=supω∈Ω∣x(ω)∣=∥x∥∞; \big{(}\mathcal{C}(\Omega),\|\cdot\|_{\infty}\big{)} is of course an AM-space with unit.
The Bohnenblust-Kakutani-Krein Representation Theorem says that AM-spaces with a unit are isomorphic, as normed Riesz spaces222Riesz spaces E1 and E2 are isomorphic if there exists a linear isomorphism which is also a lattice isomorphism. , to spaces of continuous functions on a compact topological space Ω; see [32], Chapter 17, &121.
(BKK RepresentationTheorem) An AM-space with unit is Riesz isomorphic and norm isomorphic to a space C(Ω) equipped with the sup-norm, for an appropriate compact Hausdorff space Ω.
Now, consider an Archimedean Riesz space E with unit u and let E^ be its Dedekind completion; by the preceding discussion,
\big{(}\hat{E}_{\boldsymbol{u}},\|\cdot\|_{\boldsymbol{u}}\big{)} is an AM-space with unit; by the BBK-Representation Theorem there exits a compact topological space Ω and a Riesz space isomorphism Φ:E^u→C(Ω) such that, for all x^∈E^u, ∥x^∥u=∥Φ(x^)∥∞ and
Φ(u)=1; since E is itself a Riesz subspace of E^u and u∈E; E can be identified with the Riesz subspace Φ(E)=E~ of C(Ω). In conclusion,
An Archimedean Riesz E space with unit u can be identified with a Riesz subspace of a space
C(Ω) where Ω is a compact Hausdorff space that is, there is a Riesz subspace E~ of C(Ω) such that 1∈E~ and there exists a Riesz space isomorphism
Φ:E→E~ such that, for all x∈E, ∥x∥u=∥Φ(x)∥∞.
The closure Eˉ of the Riesz space E~ in C(Ω) is an
AM-space, and since 1∈E~⊆Eˉ it is an AM-space with unit, since 1 is a unit in C(Ω), which shows that an Archimedean Riesz space possessing a unit can be embedded as a dense Riesz subspace of an AM-space with unit and therefore as dense Riesz subspace of some C(Ω′) containing 1, where Ω′ is some compact topological space. If the Riesz space E~ separates the points of Ω then Eˉ=C(Ω), by the Stone-Weierstrass Theorem.
We conclude this section with a few simple examples of the previous constructions.
For all sets S, the space F(S)=RS of arbitrary real valued functions on S with pointwise operations, is an Archimedean Riesz space, without a unit if S is not a finite set; F⋆(S), the space of bounded real valued functions on S, is an Archimedean Riesz space with a unit: u=(1,1,1,…).
Let u∈F(S) be a positive function which is not identically [math]. For all x∈F(S) let Z(x)={ω∈S:x(ω)=0}. Let E=F(S); then x∈Eu if Z(x)⊂Z(u) and ω∈Z(u)supu(ω)∣x(ω)∣<∞ in which case ∥x∥u is this supremum.
If u:S→R is identically equal to one the Eu=F⋆(S).
If Ω is a compact topological space then C(Ω) is Dedekind complete (resp. Dedekind σ-complete) if and only if the closure of every open set (resp. of every Fσ open set) is open. If u∈C(Ω) is a unit, that is a strictly positive function, then
[TABLE]
The classical sequence spaces lp are Riesz subspaces of RN; the sequence whose terms are all equal to 1 is a unit of l∞.
Let \big{(}X,\mathcal{B},\mu\big{)} be a measured space where the measure μ is finite; {\mathcal{M}}\big{(}X,\mathcal{B},\mu\big{)}, the space of almost
μ- everywhere finite real valued functions, with the usual identification of almost μ-everywhere equal functions, is a Dedekind complete Riesz space. Also, still under the hypothesis that μ is a finite measure, the spaces L_{p}\big{(}X,\mathcal{B},\mu\big{)}, 1≤p≤∞ are Dedekind complete. Details can be found in [25] page 126−127.
Given a measured space (Ω,B,μ), L∞(Ω,B,μ) is also, with for its usual norm, an AM-space: the constant map u(ω)=1 is a unit.
Let Ω be a non empty set, F a field of subsets of Ω and
ba(Ω,F) the family of bounded charges333∅∈F on F and Ω∈F ; if A,B∈F then A∪B∈F and A∖B∈F. An element of ba(Ω,F) is a map μ:F→R which is additive (μ(A∪B)=μ(A)+μ(B) if A∩B=∅) and such that μ(∅)=0 and sup∣μ(A)∣<∞. on F;
ba(Ω,F) is a real vector space and the relation μ⩽ν if, for all A∈F, μ(A)≤ν(A), is a partial order on ba(Ω,F) compatible with the vector space structure; endowed with that partial order ba(Ω,F) is a Riesz space, the maximum of two elements μ and ν of
ba(Ω,F) is given by, for all A∈F,
[TABLE]
Furthermore, ba(Ω,F) is Dedekind complete and μ↦∣μ∣(Ω) is a complete Riesz norm on ba(Ω,F) but not an M-norm444By definition of the absolute value of an element of a Riesz space, ∣μ∣=μ++μ−; an explicit formula for the absolute value of
a bounded charge μ is \boldsymbol{|}\mu(A)\boldsymbol{|}=\sup_{\mathcal{R}}\big{\{}\sum_{F\in\mathcal{R}}|\mu(F)|:\mathcal{R}\text{ is a finite partition of }A\text{ by elements of }\mathcal{F}\big{\}}.; by the discussion above, if u∈ba(Ω,F) is a positive charge then ba(Ω,F)u equipped with the norm
∥⋅∥u is an AM-space.
A charge μ∈ba(Ω,F) is a measure if, for all countable family {Fn:n∈N} of pairwise disjoint elements of F whose union belongs to F, one has μ(∪nFn)=∑nμ(Fn); the set of elements of ba(Ω,F) that are measures is a Dedekind-complete Riesz subspace of ba(Ω,F) which is also a Banach sublattice. Details can be found in [4].
We assume throughout that E is an Archimedean Riesz space and that u is a unit of E.
3. Max-plus norms in Archimedean spaces
For all x∈E let
[TABLE]
One has
[TABLE]
and
[TABLE]
Since u is a unit, {t∈R:x⩽tu}=∅ from which pu(x)<∞. If pu(x) were −∞ then we would have, for all
t∈R, tu⩽(−x) and, since E is Archimedean, we would have u⩽0; which is not the case. In conclusion, pu(x) is a real number and, by (9), so is qu(x).
Lemma 1**.**
[TABLE]
from which x=0 if and only if qu(x)=pu(x)=0.
Proof.
If we show that x⩽pu(x)u then the other the inequality will follow from (1).
If pu(x)<t then x⩽tu and therefore, for all n∈N⋆, x⩽(pu(x)+n1)u that is n(x−pu(x)u)⩽u and since E is Archimedean, x−pu(x)u⩽0. □
Call a u-box in E any order interval of the form [su,tu]={y∈E:su⩽y⩽tu}, where s≤t are real numbers; then, by definition, [qu(x),pu(x)] is the smallest u-box containing x.
Lemma 2**.**
[TABLE]
From which we have
[TABLE]
and also x=0 if and only if pu(x+)=pu(x−)=0.
Proof.
From x⩽pu(x)u and y⩽pu(y)u we have x∨y⩽max{pu(x),pu(y)}u and therefore
pu(x∨y)≤max{pu(x),pu(y)}.
From x⩽x∨y and y⩽x∨y we have pu(x)⩽pu(x∨y) and pu(y)⩽pu(x∨y) from which we have max{pu(x),pu(y)}≤pu(x∨y).
From (9) and x\wedge y=-\big{(}(-x)\vee(-y)\big{)} we have qu(x∧y)=min{qu(x),qu(y)}.
From x+=0∨x we have pu(x+)=max{pu(0),pu(x)} and, from
x−=0∨(−x) we have
pu(x−)=pu(0∨(−x))=max{0,pu(−x)}.
If pu(x+)=0=pu(x−) then pu(x)≤0 and pu(−x)≤0; from x⩽pu(x)u,
−x⩽pu(−x)u and u∈E+ we have x∈E+ and −x∈E+ and therefore x=0.
□
Lemma 3**.**
[TABLE]
and, if s<0 then pu(sx)=squ(x).
Proof.
From x⩽pu(x)u and y⩽pu(y)u we have x+y⩽(pu(x)+pu(y))u from which the first part of (1) follows. For the second part, there is nothing to prove if s=0; if s>0 then
sx⩽(spu(x))u from which we have pu(sx)≤spu(x).
From sx≤pu(sx)u we have x≤(s−1pu(sx))u and therefore, pu(x)≤s−1pu(sx) that is
spu(x)≤pu(sx).
The second part is a consequence of qu(x)=−pu(−x).
If s<0 then \boldsymbol{p}_{\boldsymbol{u}}(sx)=\boldsymbol{p}_{\boldsymbol{u}}\big{(}(-s)(-x)\big{)}=|s|\boldsymbol{p}_{\boldsymbol{u}}(-x)=(-|s|)(-\boldsymbol{p}_{\boldsymbol{u}}(-x))=s\boldsymbol{q}_{\boldsymbol{u}}(x). □
Theorem 1**.**
The map from E to R given by
[TABLE]
is a norm on E. Furthermore, for all x,y∈E, ∥x∨y∥hu≤max{∥x∥hu,∥y∥hu} with equality if both x and y are in E+ and
[TABLE]
Proof.
From x+∈E+ and x−∈E+ we have pu(x+)≥0 and pu(x−)≥0 and therefore
∥x∥hu≥0. If ∥x∥hu=0 then pu(x+)=pu(x−)=0 and by Lemma
2, x=0. Clearly, ∥0∥hu=0.
If s>0 the (sx)+=sx+ and (sx)−=sx−; from Lemma 3 we obtain
∥sx∥hu=s∥x∥hu.
If s<0 then sx=∣s∣(−x) from which ∥sx∥hu=∣s∣∥−x∥hu and, ∥−x∥hu=pu((−x)+)+pu((−x)−)=pu(x−)+pu(x+)=∥x∥hu.
∥x+y∥hu≤∥x∥hu+∥y∥hu follows From
(x+y)+⩽x++y+, (x+y)−⩽x−+y− and Lemma 3 we have
\|x+y\|_{\boldsymbol{hu}}=\boldsymbol{p}_{\boldsymbol{u}}\big{(}\big{(}x+y)^{+}\big{)}+\boldsymbol{p}_{\boldsymbol{u}}\big{(}(x+y)^{-}\big{)}\leqslant\boldsymbol{p}_{\boldsymbol{u}}(x^{+})+\boldsymbol{p}_{\boldsymbol{u}}(y^{+})+\boldsymbol{p}_{\boldsymbol{u}}(x^{-})+\boldsymbol{p}_{\boldsymbol{u}}(y^{-})=\|x\|_{\boldsymbol{hu}}+\|y\|_{\boldsymbol{hu}}.
Without loss of generality let us assume that pu(x+)≤pu(y+). From (x∨y)+=x+∨y+
and (x∨y)−=x−∧y− and from (1) of Lemma 2 we have
∥x∨y∥hu≤max{pu(x+),pu(y+)}+min{pu(x−)+pu(y−)}≤pu(y+)+pu(y−). Finally, if x and y are both in E+ then x∨y∈E+. □
We will call ∥⋅∥hu the max-plus norm on E associated to the unit u.
From Theorem 1, the max-plus norm ∥⋅∥hu is an M-norm, but it is not a Riesz norm as can be seen by taking E=R2, u=(1,1) and x=(−1,1) for which we have ∥x∥hu=2 and ∥∣x∣∥hu=1.
More generally, we always have
∥∣x∣∥hu≤∥x∥hu since ∥∣x∣∥hu=∥x++x−∥hu≤∥x+∥hu+∥x−∥hu=pu(x+)+pu(x−).
Corollary 1**.**
*The map (x,y)↦Dhu(x,y)=max{0,pu(x−y)}−min{0,qu(x−y)}
AAAAAAAAAAAAAAAAAAAAAAAAA=max{0,pu(x−y)}+max{0,pu(y−x)}
is a metric on E.*
We will call Dhu the max-plus distance on E associated to the unit u.
For E=Rn, u=(1,⋯,1) and x=(x1,⋯,xn) we have555[n]={1,⋯,n}
{pu(x)=inf{t∈R:∀i∈[n]xi≤t}=max{xi:i∈[n]}qu(x)=sup{t∈R:∀i∈[n]t≤xi}=min{xi:i∈[n]}
From pu(−x)=−min{xi:i∈[n]}=max{−xi:i∈[n]} we finally have
{max{0,pu(x)}=max{xi+:i∈[n]}=pu(x+)max{0,pu(−x)}=max{xi−:i∈[n]}=pu(x−)
which gives
[TABLE]
Put simply, if x∈R+n or if −x∈R+n then ∥x∥hu is the difference between the largest and the smallest coordinate of x; if x∈R+n, ∥x∥hu is the largest coordinate of x and,
if −x∈R+n, ∥x∥hu is the absolute value of the smallest coordinate of x that is, in this last two case, ∥x∥hu=∥x∥∞=maxi∈[n]∣xi∣. The norm ∥⋅∥hu on Rn associated to the unit u=(1,⋯,1) is the Hilbert affine norm of S. Gaubert.
Let \boldsymbol{U}\big{(}E\big{)} be the set of units of the Riesz space E. The set of units of
Rn is R++n={x∈R+n:0<mini∈[n]xi}.
Lemma 4**.**
For all \boldsymbol{u}_{1},\boldsymbol{u}_{2}\in\boldsymbol{U}\big{(}E\big{)} the norms
∥⋅∥hui and ∥⋅∥uj, i,j∈{1,2} are equivalent.
Proof.
First, take u1=u2=u.
From the definitions, \|x\|_{\boldsymbol{u}}=\boldsymbol{p}\big{(}\boldsymbol{|}x\boldsymbol{|}\big{)} and therefore
∥x∥u=∥x∥hu for all x∈E+ which gives ∥x∥hu=∥x+∥u+∥x−∥u≤2∥x∥u.
From ∥x∥u=∥∣x∣∥u we get
∥x∥u=∥x++x−∥u≤∥x+∥u+∥x−∥u=p(x+)+p(x−)=∥x∥hu.
To complete the proof, notice that, for \boldsymbol{u}_{1},\boldsymbol{u}_{2}\in\boldsymbol{U}\big{(}E\big{)}, the norms ∥⋅∥hu1 and ∥⋅∥hu2 are equivalent since
n1u2⩽u1⩽n2u1 for some non zero whole numbers n1 and n2.
□
From Lemma 4 one has that ∥⋅∥hu is complete for a given \boldsymbol{u}\in\boldsymbol{U}\big{(}E\big{)} if and only if ∥⋅∥hu is complete for all \boldsymbol{u}\in\boldsymbol{U}\big{(}E\big{)} if and only if ∥⋅∥u is complete for a given \boldsymbol{u}\in\boldsymbol{U}\big{(}E\big{)} if and only if ∥⋅∥u is complete for all \boldsymbol{u}\in\boldsymbol{U}\big{(}E\big{)}.
Lemma 5**.**
For all \boldsymbol{u}\in\boldsymbol{U}\big{(}E\big{)} the lattice operations ∨, ∧ are uniformly continuous with respect to the metric Dhu. Furthermore, if K⊂E is Dhu-compact then there exists t1,t2∈R such that, for all x∈K, t1u⩽x⩽t2u.
Proof.
The norms ∥⋅∥u and ∥⋅∥hu are equivalent and ∥⋅∥u is a lattice norm, which implies uniform continuity of the lattice operations with respect to ∥⋅∥u.
□
4. Max-plus convexity in Archimedean Riesz spaces with a unit
Given a Riesz space E and a unit u of E one can, as in the now standard finite dimensional case
E=Rn,
introduce on E two operations, max-plus addition ⊕ and max-plus multiplication ⊙ by real numbers:
[TABLE]
It would have been more appropriate to write t⊙ux for x+tu since this “tropical multiplication” depends on the chosen unit u.
Furthermore, writing 1 for the real number [math], (R,⊙,1) is a group (the additive group of real numbers written multiplicatively) and
(t,x)→t⊙x is an action of the group (R,⊙,1) on E with the following properties:
[TABLE]
The notation makes everything look very familiar; the peculiarity here is that the “sum” is idempotent: x⊕x=x.
In the finite dimensional case one can enlarge the set of scalars to R∪{−∞}; tropical addition and multiplication are extended to R∪{−∞} in the obvious way: (−∞)⊕x=x⊕(−∞)=x and (−∞)⊙x=−∞. Writing 0 for −∞ this becomes 0⊕x=x⊕0=x and
0⊙x=0.
E=\big{(}\mathbb{R}^{n}\cup\{-\infty\}\big{)}^{n} with pointwise ⊕ and ⊙ operations, is an indempotent semimodule over the idempotent semi-field R∪{−∞}; this is the standard max-plus semi-module Rmax+n.
Such a coordinatewise procedure that turns an arbitrary Riesz space with unit into an idempotent semi-module over the semi-field
\big{(}{\mathbb{R}}\cup\{-\infty\},\oplus,\odot,{\sf 0},{\sf 1}) is not readily available. By adding a single element to E which becomes by decree the smallest element, the Riesz space E is embedded in a semi-module over R∪{−∞} of which it is a max-plus convex subset(the definition of max-plus convexity is given below).
To an arbitrary Riesz space E add a smallest element, let us call it ⊥, and one can extend scalar multiplication to \odot:\mathbb{R}\cup\{-\infty\}\times\big{(}E\cup\{\boldsymbol{\bot}\}\big{)}\to\big{(}E\cup\{\boldsymbol{\bot}\}\big{)} and the tropical sum to \big{(}E\cup\{\boldsymbol{\bot}\}\big{)}\times\big{(}E\cup\{\boldsymbol{\bot}\}\big{)} in such a way that E∪{⊥} becomes an idempotent semimodule over the totally ordered semi-field R∪{−∞}:
[TABLE]
The max-plus convex hull of a non empty subset S⊂E∪{⊥} is the set of elements of E∪{⊥} which can be written as (x1+t1u)∨⋯∨(xm+tmu) with
{x1,⋯,xm}⊂S, {t1,⋯,tm}⊂R∪{−∞} and max{t1,⋯,tm}=0666In tropical notation this becomes (t1⊙x1)⊕⋯⊕(tm⊙xm) with t1⊕⋯⊕tm=1
(recall here 1 is the usual 0∈R and that ⊙ depends on a fixed unit u : t⊙x=x+tu) exactly as if it were a usual affine combination.. We will use the notation [[S]]u for the max-plus convex hull of S with respect to the unit u; we set
[[∅]]u=∅. Whenever a single fixed unit u is under consideration we drop the index u.
If S⊂E then [[S]]u is a subset of E; it is the set of of elements of E which can be written as
(x1+t1u)∨⋯∨(xm+tmu) with
{x1,⋯,xm}⊂S, {t1,⋯,tm}⊂R and max{t1,⋯,tm}=0 since, if ti=−∞ then xi+tiu=⊥ and, since one the coefficients is [math], let us say tj=0, we have
(xi+tiu)∨(xj+tju)=⊥∨xj=xj.
A subset C of E∪{−∞} is said to be max-plus convex (with respect to u) if C=[[C]]u.
If S={x1,⋯,xm} is a finite set we will write [[x1,⋯,xm]] for [[S]]. The max-plus convex hull of two points x1 and x2 is [[x1,x2]]={x1∨(x2+tu):t≤0}∪{(x1+tu)∨x2:t≤0}; if x1=x2, the set [[x1,x2]] will be called a max-plus segment. Since u is a unit, there exists s≥0 such that (x2−x1)⩽su that is x2+(−s)u⩽x1 which shows that x1∈[[x1,x2]], and similarly for x2.
Given a non empty set S we will denote by ⟨S⟩ the family of non empty finite subsets of S. A set of the form [[S]] with S finite is a max-plus polytope (with respect to u); this definition makes the empty set into a polytope.
Max-plus convex subsets of E∪{⊥} will be rarely referred to. Unless otherwise specified, “max-plus convex set” will mean “max-plus convex set of E”. What matters here, is that E is a max-plus convex subset of the (R∪{−∞})-idempotent semimodule E∪{⊥} and therefore, the max-plus convex subsets of E are exactly the max-plus convex subsets of E∪{⊥} that are contained in E.
The proof of Lemma 6 below is left to the reader; that of Lemma 7 can here be done by hand or one can go to Lemma 2.1.5 in [19].
Lemma 6**.**
*Given a Riesz space E a unit u of E the following properties hold:
(1) S⊂[[S]].
(2) If S1⊂S2 then [[S1]]⊂[[S2]].
(3) [[S]]=A∈⟨S⟩⋃[[A]] where ⟨S⟩ denotes the set of non empty finite subsets of S.
(4) [[[[S]]]]=[[S]].*
Lemma 7**.**
For all finite subset S of E and for all x∈E,
[TABLE]
Lemma 8**.**
*(1) For all x1,x2∈E, [[x1,x2]]=[[x1,x1∨x2]]∪[[x2,x1∨x2]] and [[x1,x1∨x2]]∩[[x2,x1∨x2]]={x1∨x2}.
(2) If w∈[[x1,x2]] then either w∨x2=x1∨x2 or w∨x2=w.
(3) If x1 and x2 are comparable then [[x1,x2]] is, with respect to the partial order of E, a totally ordered subset.*
Proof.
(1) If z=x1∨(x2+su) with s≤0 then, from (x1+su)∨(x2+su)=(x1∨x2)+su and x1+su⩽x1 we have x_{1}\vee\big{(}(x_{1}\vee x_{2})+s\boldsymbol{u}\big{)}=x_{1}\vee(x_{1}+s\boldsymbol{u})\vee(x_{2}+s\boldsymbol{u})=x_{1}\vee(x_{2}+s\boldsymbol{u})=z which shows that z∈[[x1,x1∨x2]]; similarly, if
z=(x1+su)∨x2 with s≤0 then z∈[[x2,x1∨x2]].
From {xi,x1∨x2}⊂[[x1,x2]] and from Lemma 6 we have
[[xi,x1∨x2]]⊂[[x1,x2]].
Take z∈[[x1,x1∨x2]]∩[[x2,x1∨x2]] ; if z=txi∨(x1∨x2) with t≤0 then z=x1∨x2. If z=x1∨s(x1∨x2)=x2∨t(x1∨x2) with s,t≤0 then
z=z∨z=x1∨2∨s(x1∨x2)∨s(x1∨x2)=x1∨x2. This completes the proof of (1).
(2) If w∈[[x1,x1∨x2]] then x1⩽w⩽x1∨x2 and therefore x1∨x2⩽w∨x2⩽x1∨x2∨x2=x1∨x2.
If w∈[[x2,x1∨x2]] then x2⩽w⩽x1∨x2 and therefore
w∨x2=w.
(3) Assume that x1⩽x2. An arbitrary element of [[x1,x2]] is either of the form (x1+su)∨x2 or x1∨(x2+su) with s≤0; since (x1+su)∨x2=x2 and
x1⩽x1∨(x2+su)≤x1∨x2=x2, x1 is the smallest element of [[x1,x2]] and x2 is its largest element. Take z and z′ in [[x1,x2]]; we can assume that z=x1∨(x2+su) and z′=x1∨(x2+s′u) with s≤0 and s′≤0. We have either
s≤s′ of s′≤s from which it follows that either z⩽z′ or
z′⩽z.
□
Lemma 9**.**
(1)* A singleton is max-plus convex.
(2) An arbitrary intersection of max-plus convex sets is max-plus convex.
(3) [[S]] is the smallest max-plus convex set containing S.
(4) C is max-plus convex if and only if, for all x1,x2∈C, [[x1,x2]]⊂C.
(5) The following statements are equivalent:*
[TABLE]
Proof.
Only (4) needs to be checked, (1),(2) and (3) are direct consequences of the definitions. Let us see that C is max-plus convex if for all x1,x2∈C, [[x1,x2]]⊂C; the reverse implication is a consequence of (2) and (4) of Lemma 6. By (3) of Lemma 6 we have to show that, for all A∈⟨C⟩, [[A]]⊂C which can be proved using Lemma 7 and an obvious induction on the cardinality of the set A.
The equivalence of (4) and (5) follows from [[x1,x2]]=[[x1,x1∨x2]]∪[[x2,x1∨x2]]. □
A max-plus half-space of a convex subset C of E is a max-plus convex set D⊂C such that C∖D is also max-plus convex. A max-plus convex subset C of E has the Kakutani-Property if, for arbitrary disjoint max-plus convex subsets C1 and C2 there exists a half-space D of C such that C1⊂D and C2∩D=∅.
Lemma 10**.**
Max-plus convex subsets of E have the Kakutani-Property.
Proof.
From 3.0.12 in [19]. □
We conclude this section by showing that the max-plus metric is additive on max-plus segments,
Proposition 1 below.
Lemma 11**.**
For x1,x2∈E
[TABLE]
Proof.
If x1 and x2 are comparable then either x1=x1∨x2 or x2=x1∨x2 in which case there is nothing to prove. If pu(x1−x2)≤0 then x1⩽x2 and x1 and x2 are comparable, and similarly if pu(x2−x1)≤0. We can therefore assume that
0≤pu(x1−x2) and 0≤pu(x2−x1).
We now have Dhu(x1,x2)=max{0,pu(x1−x2)}+max{0,pu(x2−x1)}=pu(x1−x2)+pu(x2−x1)
and we have to see that pu(x1−x2)+pu(x2−x1)≥∥x1−x2∨x1∥u+∥x2−x2∨x1∥u.
From x1⩽pu(x1−x2)u+x2 and pu(x1−x2)u∈E+ we have
x1∨x2⩽pu(x1−x2)u+x2 and, since ∥⋅∥u is a Riesz norm and
∥u∥u=1, ∥x1∨x2−x2∥u≤pu(x1−x2). Similarly,
∥x1∨x2−x1∥u≤pu(x2−x1).
□
Lemma 12**.**
*If x1≤x2 then, for all z∈[[x1,x2]], Dhu(z,x2)=pu(x2−z)=∥x2−z∥u,
z=x_{1}\vee\big{(}x_{2}-\boldsymbol{p}_{\boldsymbol{u}}(x_{2}-z)\boldsymbol{u}\big{)} and
qu(z−x2)=sup{s≤0:z=x1∨(x2+su)}.*
Proof.
From z∈[[x1,x2]] we have either z=(x1+su)∨x2 or z=x1∨(x2+su) with s≤0. In the first case, from x1≤x2, we have z=x2 in which case pu(x2−z)=pu(0)=0=qu(0) and x_{1}\vee\big{(}x_{2}-\boldsymbol{p}_{\boldsymbol{u}}(x_{2}-z)\boldsymbol{u}\big{)}=x_{1}\vee x_{2}=x_{2}=z.
If z=x1∨(x2+su) with s≤0 then x1∨z=z and x2∨z=x2,
which shows that
x1⩽z⩽x2.
From 0⩽x2−z we have pu(x2−z)=inf{t≥0:x2−z⩽tu}=Dhu(z,x2)=∥x2−z∥u.
From x2+su⩽x1∨(x2+su)=x1∨z=z we have
pu(x2−z)≤(−s) from which we obtain
x2+su⩽x2−pu(x2−z)u and z=x_{1}\vee(x_{2}+s\boldsymbol{u})\leqslant x_{1}\vee\big{(}x_{2}-\boldsymbol{p}_{\boldsymbol{u}}(x_{2}-z)\boldsymbol{u}\big{)}.
From Lemma 1 we have x2−z⩽pu(x2−z)u that is,
x2−pu(x2−z)u⩽z and, since x1⩽z,
x_{1}\vee\big{(}x_{2}-\boldsymbol{p}_{\boldsymbol{u}}(x_{2}-z)\boldsymbol{u}\big{)}\leqslant z.
We have shown that z=x_{1}\vee\big{(}x_{2}-\boldsymbol{p}_{\boldsymbol{u}}(x_{2}-z)\boldsymbol{u}\big{)} and that
s≤−pu(x2−z)=qu(z−x2). □
Lemma 13**.**
If x1 and x2 are two comparable elements of E then, for all
z∈[[x1,x2]],
[TABLE]
Proof.
From Lemma 12 we can write z=x1∨(x2+su) with s=−Dhu(z,x2).
From x1⩽z, Dhu(x1,z)=∥z−x1∥u=inf{t≥0:z−x1≤tu}=inf{t≥0:x1∨(x2+su)≤x1+tu}. If t≥0 and (x2+su)≤x1+tu then
x1∨(x2+su)≤(x1+tu)∨x1=(x1+tu) which shows that
Dhu(x1,z)≤inf{t≥0:(x2−x1)⩽(t−s)u}=Dhu(x1,x2)+s=Dhu(x1,x2)−Dhu(z,x2). □
Proposition 1**.**
For all x1,x2∈E an for all z∈[[x1,x2]]
[TABLE]
Proof.
Let z∈[[x1,x2]]. By Lemma (8) either w∈[[x1,x1∨x2]] or
z∈[[x2,x1∨x2]]. Without loss of generality assume that z∈[[x1,x1∨x2]].
By Lemma 13 we have
Dhu(x1,x1∨x2)=Dhu(x1,z)+Dhu(z,x1∨x2)
and, by Lemma 11,
Dhu(x1,x2)=Dhu(x1,x1∨x2)+Dhu(x2,x1∨x2). Therefore
[TABLE]
From Lemma 8 we have Dhu(z,x1∨x2)=Dhu(z,z∨x2) and consequently
Dhu(x1,x2)=Dhu(x1,z)+Dhu(z,z∨x2)+Dhu(x2,z∨x2) which yields, by Lemma 11, Dhu(x1,x2)=Dhu(x1,z)+Dhu(z,x2). □
5. Geodesics
Given a metric space (X,D), let us say that non empty subset Z⊂X is a geodesic, with respect to the metric D, if there exists an onto map θ from a closed interval [a,b]⊂R to Z such that, for all
t1,t2∈[a,b], D\big{(}\theta(t_{1}),\theta(t_{2})\big{)}=\mid t_{1}-t_{2}\mid in which case we will say that
θ:[a,b]→X is a parametrized geodesic from θ(a) to θ(b).
The metric space (X,D) is a geodesic space if, for all pair (x1,x2)∈X×X, there exists a parametrized geodesic θ:[a,b]→X from x1 to x2.
A geodesic structure on a geodesic metric space (X,D) is a family \Theta=\big{(}\theta_{(x_{1},x_{2})},[a_{(x_{1},x_{2})},b_{(x_{1},x_{2})}]\big{)}_{(x_{1},x_{2})\in X\times X} where
\big{(}\theta_{(x_{1},x_{2})},[a_{(x_{1},x_{2})},b_{(x_{1},x_{2})}]\big{)} is a parametrized geodesic from x1 to x2 ; the geodesic \theta_{(x_{1},x_{2})}\big{(}[a_{(x_{1},x_{2})},b_{(x_{1},x_{2})}\big{)}\subset X will be denoted by θ(x1,x2).
Given a geodesic structure Θ on a metric space (X,D), we will say that a subset C⊂X is geodesically convex (with respect to Θ) if, for all (x1,x2)∈X×X, θ(x1,x2)⊂C; the empty set is convex by default.
If θ:[a,b]→X is a parametrized geodesic from x1 to x2 then, for all s∈R,
t↦θ(t−s) is a parametrized geodesic θ~ on [a+s,b+s] from x1 to x2 such that θ(x1,x2)=θ~(x1,x2) ; since D(x1,x2)=b−a, the map θ~:[0,D(x1,x2)]→X defined by
θ~(t)=θ(t+a) is a parametrized geodesic from from x1 to x2 with
θ(x1,x2)=θ~(x1,x2); let us call θ~:[0,D(x1,x2)]→X the standard parametrized geodesic associated to the parametrized geodesic θ:[a,b]→X.
Given a parametrized geodesic θ:[a,b]→X, from x1 to x2, the affinely parametrized geodesic
θ^:[0,1]→X associated to θ is \hat{\theta}(t)=\theta\big{(}(1-t)a+tb\big{)}=\theta\big{(}a+tD(x_{1},x_{2})\big{)}.
For all t1,t2∈[0,1],
D\big{(}\hat{\theta}(t_{1}),\hat{\theta}(t_{2})\big{)}=\mid t_{1}-t_{2}\mid D(x_{1},x_{2}).
We show that \big{(}E,{\sf D}_{\boldsymbol{hu}}\big{)} is a geodesic metric space, more precisely, there is a geodesic strucuture \Gamma=\big{(}\gamma_{\boldsymbol{u},(x_{1},x_{2})},[\alpha_{\boldsymbol{u},(x_{1},x_{2})},\beta_{\boldsymbol{u},(x_{1},x_{2})}]\big{)} on E for which the geodesics are precisely the max-plus segments and therefore, the max-plus convex sets are precisely the geodesicaly convex sets. To avoid cumbersome double subscripts we will write γu(x1,x2,t) for γu(x1,x2)(t) and similarly for α and β. The explicit form of
γu(x1,x2,t) is given in Theorem 2; for E=Rn and u=(1,⋯,1) this is due to Stefan Gaubert, [14].
Lemma 14**.**
Two arbitrary points x1,x2∈E being given, any two other points of [[x1,x2]] can be labelled z and z′ in such a way one of the following two assertions holds:
[TABLE]
Proof.
From Lemma 8, there are two cases to consider: both z and z′ are in [[xi,x1∨x2]] for the same i, one of z and z′ is in [[x1,x1∨x2]] and the other is in [[x2,x1∨x2]].
Let us assume that z and z′ are both in [[x1,x1∨x2]] which, by Lemma 8, is a totally ordered set with respect the partial order of E. If the two points z and z′ are labeled such that x1⩽z⩽z′⩽x1∨x2 then z′∈[[z,x1∨x2]] and, from Proposition 1,
Dhu(z,z′)+Dhu(z′,x1∨x2)=Dhu(z,x1∨x2)
For the second case, label the points such that z∈[[x1,x1∨x2]] and z′∈[[x2,x1∨x2]]
that is:
x1⩽z⩽x1∨x2 and
x2⩽z′⩽x1∨x2 from which we have x1∨x2=z∨z′. Proposition 1 yields Dhu(z,z′)=Dhu(z,z∨z′)+Dhu(z′,z∨z′). □
Lemma 15**.**
If x1⩽x2 then the map t↦γ(t,x1,x2)=x1∨(x2+tu) is one to one and onto from the interval
[qu(x1−x2),0] to [[x1,x2]]. Furthermore, given z∈[[x1,x2]], the unique s∈[qu(x1−x2),0] such that z=x1∨(x2+su) is −Dhu(z,x2).
Proof.
The points x1 and x2 being fixed, write γ(t) for γ(t,x1,x2). If z∈[[x1,x2]] then either z=(x1+tu)∨x2 or z=x1∨(x2+tu) with t≤0 ; in the first case z=x2=x1∨x2=x1∨(x2+0u). This shows that γ is onto.
To see that γ is one to one on [qu(x1−x2),0] let z=x1∨(x2+su),
z′=x1∨(x2+tu) with qu(x1−x2)≤s≤t≤0 and assume that z=z′. We show that s=t.
First, x2+tu⩽x1∨(x2+tu)=z′=z from which we have
tu⩽z−x2 and therefore, from the definition of qu,
[TABLE]
Now, z-x_{2}=\big{[}x_{1}\vee(x_{2}+s\boldsymbol{u})\big{]}-x_{2}=(x_{1}-x_{2})\vee\big{(}(x_{2}+s\boldsymbol{u})-x_{2}\big{)}=(x_{1}-x_{2})\vee(s\boldsymbol{u}).
To complete the proof, we identify E with a Riesz subspace of the space C(Ω) containing the constant function 1, where Ω is a compact Hausdorff topological space, and we set
u=1.
[TABLE]
and therefore,
[TABLE]
We have shown that qu(z−x2)≤s which, with (18), gives s=t.
The last part follows from Lemma 12.□
For x1,x2∈E let αu(x1,x2)=min{0,qu(x1−x2)} and βu(x1,x2)=max{0,pu(x1−x2)} Then βu(x1,x2)=−αu(x2,x1),
αu(x1,x2)≤βu(x1,x2) and Dhu(x1,x2)=βu(x1,x2)−αu(x1,x2).
Lemma 16**.**
If x1 and x2 are two elements of E and s,t are real numbers such that αu(x1,x2)≤t≤0≤s≤βu(x1,x2) then, for
z=x1∨(x2+tu)∈[[x1,x1∨x2]] and z′=(x1−su)∨x2∈[[x2,x1∨x2]] one has
[TABLE]
Proof.
We have z=x_{1}\vee(x_{2}+t\boldsymbol{u})\leqslant x_{1}\vee\big{(}(x_{1}\vee x_{2})+t\boldsymbol{u}\big{)}=x_{1}\vee[(x_{1}+t\boldsymbol{u})\vee(x_{2}+t\boldsymbol{u})]=[x_{1}\vee(x_{1}+t\boldsymbol{u})]\vee(x_{2}+t\boldsymbol{u})=x_{1}\vee(x_{2}+t\boldsymbol{u}).
In conclusion, z=x_{1}\vee\big{(}(x_{1}\vee x_{2})+t\boldsymbol{u}\big{)}.
Let us see that
min{0,qu(x1−x2)}=qu(x1−x1∨x2).
By definition qu(x1−x2)=sup{t:tu⩽x1−x2}. If t≤0 and tu⩽x1−x2 then
x2⩽x1−tu and x1∨x2⩽(x1−tu)∨x1=x1−tu which shows that
min{0,qu(x1−x2)}≤qu(x1−x1∨x2).
Reciprocally, if t≤qu(x1−x1∨x2) then t≤0 and tu⩽(x1−x1∨x2)⩽x1−x2 and therefore,
t≤min{0,qu(x1−x2)}.
The conclusion follows from Lemma 15 and βu(x1,x2)=−αu(x2,x1). □
Lemma 17**.**
The map ηu defined on E×E×R by
[TABLE]
is uniformly continuous with respect to the product topology induced by the metric Dhu on E. Furthermore,
[TABLE]
Proof.
Since ∥⋅∥u is a Riesz norm, the lattice operations are uniformly continuous with respect to ∥⋅∥u from which it follows that ηu is uniformly continuous with respect to ∥⋅∥u and therefore with respect Dhu, since the norms ∥⋅∥u and ∥⋅∥hu are equivalent.
The verification of (23) is straightforward. □
Theorem 2**.**
For all x1,x2∈E and t∈R let γu be the restriction of ηu to [αu(x1,x2),βu(x1,x2)] that is,
[TABLE]
Then, for all x1,x2∈E and for all t1,t2∈[αu(x1,x2),βu(x1,x2)]
[TABLE]
In other words, \Gamma_{\boldsymbol{u}}=\big{(}\gamma_{\boldsymbol{u}}(x_{1},x_{2},-),[\alpha(x_{1},x_{2}),\beta(x_{1},x_{2})]\big{)}_{(x_{1},x_{2})\in X\times X} is a geodesic structure on \big{(}E,{\sf D}_{\boldsymbol{u}}\big{)} for which the geodesics are precisely the max-plus segments.
Proof.
Let z=γu(x1,x2,t) and z′=γu(x1,x2,s).
From Lemma 8, there are three cases to consider:
[TABLE]
In all cases, the conclusion follows from Lemma
16 and
Lemma 14. □
Corollary 2**.**
A subset C of E is max-plus convex if and only if it is a geodesically convex set with respect to the geodesic structure Γu.
Let γ^u:E×E×[0,1]→E be the affinely parametrized geodesic associated to γu that is,
[TABLE]
then
[TABLE]
If one defines the midpoint map μu:E×E→E by μu(x1,x2)=γ^u(x1,x2,1/2) then:
[TABLE]
A closed subset C on a topological vector space is convex (in the usual affine structure) if and only if, for all x1,x2∈C, 21x1+21x2∈C.
Proposition 2 below characterizes closed max-plus convex
sets as semilattices containing the (max-plus) midpoints of any pair of their points.
First, notice that, if x1⩽x2 then −αu(x1,x2)=Du(x1,x2)=∥x2−x1∥u=βu(x2,x1) and
x1⩽μu(x1,x2)⩽x2 since \mu_{\boldsymbol{u}}(x_{1},x_{2})=x_{1}\vee\big{(}x_{2}+(\alpha_{\boldsymbol{u}}(x_{1},x_{2})/2)\boldsymbol{u}\big{)}.
Lemma 18**.**
With respect to the metric topology associated to Du on E, the affinely parametrized geodesic γ^u:E×E×[0,1]→E is continuous on E×E×[0,1].
Proof.
The restriction of \eta_{\boldsymbol{u}}\big{(}x_{1},x_{2},\alpha_{\boldsymbol{u}}(x_{1},x_{2})+t{\sf D}_{\boldsymbol{u}}(x_{1},x_{2})\big{)} to E×E×[0,1] is γ^u(x1,x2,t) and, by Lemma 17, ηu:E×E×R→E is continuous. Showing that (x1,x2)↦αu(x1,x2) is continuous on E×E will complete the proof. We show that (x1,x2)↦βu(x1,x2) is uniformly continuous on E×E with respect to the topology of the norm ∥⋅∥u, which is a Riesz norm on E, which implies that x↦x+ is uniformly continuous on E, and therefore x↦∥x+∥u is uniformly continuous. The conclusion follows from
∥x+∥u=pu(x+)=max{0,pu(x)}=βu(x,0) and
βu(x1,x2)=βu(x1−x2,0). □
Corollary 3**.**
The midpoint map μu:E×E→E is continuous.
Proposition 2**.**
For all non empty closed subset C of E the first and the last of the three assertions below are equivalent; if C is complete then the three assertions are equivalent.
(A)* C is max-plus convex.*
(B)* ∀x0,x1∈Cμu(x0,x1)∈C.*
(C)*
∀x0,x1∈C{(1)(2)x0∨x1∈C and if x0⩽x1 then μu(x0,x1)∈C.*
Proof.
Clearly, (A) implies (B) and (C). We show that (C) implies (A).
We have to see that, for all x0,x1∈C, [[x0,x1]]⊂C. From Lemma 9 and hypothesis (1), it is sufficient to show that [[x0,x1]]⊂C whenever x0,x1∈C and x0⩽x1.
Let Dn={(k/2n):0≤k≤n}. If x0,x1∈C and x0⩽x1 then, by the second hypothesis, x1/2=μu(x0,x1)∈C and x0⩽x1/2⩽x1.
Let n≥1 and assume that, for each m≤n we have a sequence of points Sm={xm,t:t∈Dm}⊂[[x0,x1]] such that:
(a) If t∈Dm−1 then xm−1,t=xm,t
(b) If t,t′∈Dm and t≤t′ then xm,t⩽xm,t′
(c) If Dhu(xn,k/2n,xn,(k+1)/2n)=2−nDhu(x0,x1).
To construct Sn+1 such that (a),(b) and (c) hold consider t=(k/2n+1) and t∈Dn; there are then t′,t′′∈Dn such that t=(t′+t′′)/2; let xn+1,t=μu(xn,t′,xn,t′′).
Now, let S={xt:t∈D}=∪nSn where D⊂[0,1] is the set of dyadic numbers. For all given n, Sn is a linearly ordered subset of
[[x0,x1]]. Take x∈[[x0,x1]]; if x=x0 then Dhu(x,xn,1/2n)=(1/2n)Dhu(x0,x1); if x=x1 then Dhu(x,xn,2n−1/2n)=(1/2n)Dhu(x0,x1). If x is neither x0 nor x1, nor a point of Sn, there are two points xn,k/2n and xn,(k+1)/2n such that xn,k/2n⩽x⩽xn,(k+1)/2n, since, by Lemma 8, [[x0,x1]] is linearly ordered by the restriction of the partial of E. We have
[[x0,x1]]=[[x0,xn,k/2n]]∪[[xn,k/2n,xn,(k+1)/2n]]∪[[xn,(k+1)/2n,x1]] and since x∈Sn, x belongs to only one these max-plus segments, which is [[xn,k/2n,xn,(k+1)/2n]]. From (1/2n)=Dhu(xn,k/2n,xn,(k+1)/2n)=Dhu(xn,k/2n,x)+Dhu(x,xn,(k+1)/2n) we have Dhu(xn,k/2n,x)≤(1/2n).
We have shown that S is a dense subset of [[x0,x1]] and that S⊂C. Since C is closed we have
[[x0,x1]]⊂C.
Assuming that C is complete - with respect to Dhu - we show that (B) implies (A).
Since (C,Dhu,μu) is a complete midpoint space in the sense of [18] there exists an affinely parametrized geodesic φ:C×C×[0,1]→C such, for all (x0,x1)∈C×C, μu(x0,x1)=φ(x0,x1,1/2) which is obtained by dyadic approximation starting from μu(x1,x2), Lemma 3.0.1 and its proof in [18]; the restriction of γ^u to C×C×[0,1] is also an affinely parametrized geodesic. Furthermore, for all (x0,x1)∈C×C, γ^u(x0,x1,1/2)=μu(x0,x1)=φ(x0,x1,1/2). By dyadic approximation we have,
(x0,x1)∈C×C×[0,1], γ^u(x0,x1,t)=φ(x0,x1,t)∈C that is
[[x0,x1]]⊂C.
□
6. On the topology of max-plus convex sets
In this section, the topology on a given Riesz space E is the metric topology Dhu associated to a given unit u of E. Either of the first proposition or the first lemma of this section shows that in the metric space \big{(}E,{\sf D}_{\boldsymbol{hu}}\big{)} open and closed balls are max-plus convex, and therefore geodesically convex ; consequently, the topology is locally
max-plus convex. A max-plus convex set is an absolute retract from which we have the max-plus version of the classical Kakutani Fixed Point Theorem. There are also max-plus versions of some classical continuous (approximate) selection theorems for upper semicontinuous multivalued maps (here simply called “maps”).
Lemma 19**.**
Balls, open or closed with respect to ∥⋅∥hu, are max-plus convex.
Proof.
(A)
Let B=B_{\boldsymbol{hu}}(0,\delta)=\big{\{}x\in E:\|x\|_{\boldsymbol{hu}}<\delta\big{\}}; from Theorem 1 we have
x1∨x2∈B if {x1,x2}⊂B.
Since [[x1,x2]]=[[x1,x1∨x2]]∪[[x1,x1∨x2]] it is sufficient to prove that [[x1,x2]]⊂B whenever x1,x2∈B and x1 and x2 are comparable.
(1) Assume that x1⩽x2.
If t≤0 then x1+t1u≤x2 from which we have
(x1+t1u)∨x2=x2∈B.
(2)
Assume that x2⩽x1.
We have to see that, if t≤0 then (x1+tu)∨x2∈B or, equivalently, that
(x1−su)∨x2∈B if s≥0.
From s≥0 and x2⩽x1 we have (x1−su)∨x2≤x1∨x2=x1 and therefore
\boldsymbol{p}_{\boldsymbol{u}}\big{(}(x_{1}-s\boldsymbol{u})\vee x_{2}\big{)}\leq\boldsymbol{p}_{\boldsymbol{u}}(x_{1}) and
[TABLE]
From (su−x1)∧(−x2)∧(−x1)=(su−x1)∧(−x1)≤(−x1) and −[(x1−su)∨x2]=(su−x1)∧(−x2) we have −[(x1−su)∨x2]⩽(−x1)
from which, \boldsymbol{p}_{\boldsymbol{u}}\big{(}-[(x_{1}-s\boldsymbol{u})\vee x_{2}]\big{)}\leq\boldsymbol{p}_{\boldsymbol{u}}(-x_{1}) and
[TABLE]
Adding the inequalities from (28) and (29) gives ∥(x1−su)∨x2]∥hu≤∥x1∥hu.
We have shown that B is max-plus convex; the same procedure shows that closed balls centered at [math] are max-plus convex;
(B) We show that arbitrary balls are max-plus convex.
Let B={x∈E:Dhu(x0,x)≤δ} be a ball centered at x0 and let x1 and x2 be two points of B; from xi−x0∈(B−x0) and from the first part of the proof, we have, for all t≤0, \big{[}(x_{1}-x_{0})+t\boldsymbol{u}\big{]}\vee(x_{2}-x_{0})\in(B-x_{0}) and therefore, (x1+tu)∨x2∈B.
□
Proposition 3**.**
For all (y,x1,x2)∈E×E and for all x∈[[x1,x2]]
[TABLE]
and, more generally, for all non empty set S⊂E and for all y∈E
[TABLE]
Proof.
Let r=max{Dhu(y,x1),Dhu(y,x2)} and let B be the closed ball - with respect to
Dhu - of radius r centered at y; from xi∈B and Lemma 19 we have
[[x1,x2]]⊂B which establishes (30).
Assume S={x1,⋯,xm} with m>2 and let S1={x1,⋯,xm−1} and proceed by induction: if
x∈[[S1]] then {\sf D}_{\boldsymbol{hu}}\big{(}y,x\big{)}\leq\max_{1\leq i\leq m-1}{\sf D}_{\boldsymbol{hu}}\big{(}y,x_{i}\big{)}; if x∈[[S]] then, by Lemma 7, x∈[[x′,xm]] with x′∈[[S1]] and, by (30),
{\sf D}_{\boldsymbol{hu}}\big{(}y,x\big{)}\leq\max\{{\sf D}_{\boldsymbol{hu}}\big{(}y,x^{\prime}\big{)},{\sf D}_{\boldsymbol{hu}}\big{(}y,x_{m}\big{)}\}. We have shown that (31) holds for finite sets.
For the general case, from
[[S]]=A∈⟨S⟩⋃[[A]], (3) of Lemma 6, we have x∈[[A]] for some finite set
A⊂S from which the conclusion follows.
□
Corollary 4**.**
The diameter with respect to the metric Dhu of [[S]] is max{Dhu(x,y):(x,y)∈S×S} which is the diameter of S.
Lemma 19 and Proposition 3 are equivalent, they say that the metric
Dhu is (max-plus) quasiconvex. One can obviously define a max-plus quasiconvex function f:C→R, where C is a max-plus convex subset of E, by the property maxx∈[[x1,x2]]f(x)=max{f(x1),f(x2)} and show that, for such functions, maxx∈[[S]]f(x)=maxx∈Sf(x).
Given two subsets S1,S2 of E let S1∨S2={v1∨v2:(v1,v2)∈S1×S2} and let
Si+tu={vi+tu:vi∈Si}.
Lemma 20**.**
If (E,∥⋅∥u) is complete then,
[TABLE]
where Bu(x,δ) is the open ball with respect to ∥⋅∥u of radius δ centered at
x.
Proof.
We can assume that (E,∥⋅∥u) is C(Ω), for some compact topological space Ω, and that u:Ω→R is the constant function 1; ∥⋅∥u is then the sup-norm ∥x∥∞=maxω∈Ω∣x(ω)∣; we simply write B(x,δ) for the open ball with respect to the sup-norm. If ∥xi−yi∥∞<δ then, for all ω∈Ω, xi(ω)−δ<yi(ω)<xi(ω)+δ and therefore
max{x1(ω),x2(ω)}−δ<max{y1(ω),y2(ω)}<max{x1(ω),x2(ω)}+δ which shows that B(x1,δ)∨B(x2,δ)⊆B(x1∨x2,δ).
To prove the other inclusion let Ω1={ω∈Ω:x2(ω)≤x1(ω)} and similarly for Ω2.
If y∈Bu(x1∨x2,δ) then
[TABLE]
By the Tietze-Urysohn’s Theorem, there exists a continuous function vi:Ω→]−δ,δ[ such that,
[TABLE]
Let zi=vi+xi and notice that {∀ω∈Ωizi(ω)=y(ω)∀ω∈Ωxi(ω)−δ<zi(ω)<xi(ω)+δ
from which we have zi∈B(xi,δ) and y≤max{z1,z2}. Let yi=min{y,zi} then
yi∈B(xi,δ) and y=max{y1,y2}. □
Proposition 4**.**
If ∥⋅∥u is a complete norm on E then the interior of a max-plus convex subset of E is max-plus convex.
Proof.
Let C⊆E be a max-plus convex set whose interior C∘ is not empty; take x1,x2∈C∘ and δ>0 such that Bu(xi,δ)⊂C. For all t≤0,
B_{\boldsymbol{u}}(x_{1},\delta)\vee\big{(}B_{\boldsymbol{u}}(x_{2},\delta)+t\boldsymbol{u}\big{)}\subset C and Bu(x2,δ)+tu=Bu(x2+tu,δ) therefore, Bu(x1,δ)∨Bu(x2+tu,δ)⊂C which, from Lemma 20, gives
B_{\boldsymbol{u}}\big{(}x_{1}\vee(x_{2}+t\boldsymbol{u}),\delta)\subseteq C. □
Given δ>0 and a non empty set S⊆E let
Uδ(S)={x∈E:infy∈S∥x−y∥u<δ} and
Vδ(S)={x∈E:infy∈S∥x−y∥hu<δ}
Lemma 21**.**
For all non empty subset E of E one has Vδ(S)⊂Uδ(S)⊂V2δ(S) and, for all max-plus convex set C⊂E and for all δ>0, Uδ(C) is max-plus convex. As a consequence, the closure of a max-plus convex set is max-plus convex.
Proof.
The first part follows from ∥⋅∥u≤∥⋅∥hu≤2∥⋅∥u.
Given a non empty max-plus set C⊂E, take yi∈Uδ(C) and xi∈C, i=1,2, and η>0 such that ∥xi−yi∥u≤η<δ. From
∣xi−yi∣⩽ηu we have xi−ηu⩽yi⩽xi+ηu. For all t∈R,
x2+tu−ηu⩽y2+tu⩽x2+tu+ηu.
From x2+tu−ηu⩽y2+tu and
x1−ηu⩽y1 we have
(x1−ηu)∨(x2+tu−ηu)⩽y1∨(y2+tu) that is
x1∨(x2+tu)−ηu⩽y1∨(y2+tu). Similarly, from (y2+tu)⩽(x2+tu+ηu) and y1⩽x1+ηu we have
y1∨(y2+tu)⩽x1∨(x2+tu)+ηu. We have shown that
∣y1∨(y2+tu)−x1∨(x2+tu)∣⩽ηu. If t≤0 then
x1∨(x2+tu)∈C and ∥y1∨(y2+tu)−x1∨(x2+tu)∥u≤η which shows that y1∨(y2+tu)∈Uδ(C).
The last part follows from C=∩δ>0Uδ(C). □
Proposition 5**.**
(1)* If x1=x2 then [[x1,x2]] is a topological arc in the metric space
\big{(}E,{\sf D}_{\boldsymbol{u}}\big{)}.
(2) For all finite sets {x1,⋯,xm}⊂E, [[x1,⋯,xm]] is a compact subset of the metric space
\big{(}E,{\sf D}_{\boldsymbol{u}}\big{)}.*
Proof.
(1) If x1=x2 then αu<βu and γu:[αu(x1,x2),βu(x1,x2)]→[[x1,x2]] is a homeomorphism.
(2) By induction on m. We can assume that m≥3. By the induction hypothesis
K=[[x1,⋯,xm−1]] is compact. Take t1,t2∈R such that, for all x∈K,
t1u⩽x−xm⩽t2u, Lemma 5. We have, for all x∈K,
t1≤qu(x−xm) and pu(x−xm)≤t2; without loss of generality, we can assume that t1<0<t2 which yields, for all x∈K, t1≤α(x,xm)≤β(x,xm)≤t2.
On K×[t1,t2] define γ⋆ by γ⋆(x,t)=γu(x,xm,t); from
[α(x,xm),β(x,xm)]⊆[t1,t2] we have, for all x∈K, \gamma_{\star}\big{(}x,[t_{1},t_{2}]\big{)}=\boldsymbol{[\![}x,x_{m}\boldsymbol{]\!]} and, from Lemma 7, we have \gamma_{\star}\Big{(}K\times[t_{1},t_{2}]\Big{)}=\boldsymbol{[\![}x_{1},\cdots,x_{m}\boldsymbol{]\!]}.
To complete the proof, notice that by the definition of γu, (24), and Lemma 5,
γ⋆ is continuous. □
Lemma 22**.**
Non empty max-plus convex susbets of E are contractible.
Proof.
By Lemma 18, γ^:E×E×[0,1]→E is continuous ; if C be a max-plus subset of E then \hat{\gamma}\big{(}C\times C\times[0,1]\big{)}=C futhermore, for all (x,y)∈C×C, γ^(x,y,0)=x and γ^(x,y,1)=y. □
Proposition 6**.**
If C⊂E is a max-plus convex subset of E which is complete with respect to Dhu then, for all compact subsets K⊂C, [[K]] is compact.
Proof.
From Proposition 5 and Theorem 3.8 in [30]. □
Given a metric space (X,D) let Bd(X) (respectively, Comp(X)), be the family of non empty bounded (respectively, compact) subsets of X.
For S⊂X and δ>0 let
Nδ(S)={x∈X:D(x,S)<δ}; for X=E and D the distance associated to ∥⋅∥u (respectively, ∥⋅∥hu) this is Uδ(S) (respectively, Vδ(S)).
Recall that the Hausdorff metric on Bd(X) associated to the metric D on X is given by \mathcal{H}_{D}(S_{1},S_{2})=\inf\{\delta>0:S_{1}\subset\mathcal{N}_{\delta}(S_{2})\text{ and }S_{2}\subset\mathcal{N}_{\delta}(S_{1})\}=\max\big{\{}\sup_{x\in S_{1}}D(x,S_{2}),\sup_{x\in S_{2}}D(x,S_{1})\big{\}}.
For X=E and D the distance associated to ∥⋅∥u (respectively, the distance Dhu) the corresponding Hausdorff metric will be written Hu (respectively, Hhu). From the first part of Lemma 21, Hu≤Hhu≤2Hu.
Proposition 7**.**
With respect to either of the equivalent metrics Hhu or Hu, the convex hull operator S↦[[S]] is Lipschitz continuous from
Bd(E) to itself.
Proof.
First, from Corollary 4, [[S]] is bounded if S is bounded. Choose
δ>Hhu(S1,S2) then S1⊂Vδ(S2)⊂Uδ(S2); from S2⊂[[S2]] we have
[[S1]]⊂[[Uδ([[S2]])]] and finally, from Lemma 21,
[[Uδ([[S2]])]]=Uδ([[S2]])⊂V2δ([[S2]]). We have shown that
[[S1]]⊂V2δ([[S2]]) and similarly [[S2]]⊂V2δ([[S1]]) from which
Hhu([[S1]],[[S2]])≤2Hhu(S1,S2). □
Given a non empty max-plus convex C subset of E let MPCCu(C) be the family of non empty max-plus convex and compact subsets of C;
Corollary 5**.**
If C is a non empty compact max-plus convex subset of E then, MPCCu(C) is an absolute retract.
Proof.
Since C is compact it is, with respect to either of the metrics associated to the norms ∥⋅∥u or
∥⋅∥hu a Peano continuum777A compact, connected and locally connected metric space therefore, by Wojdislawki’s Theorem [31], Comp(C) is an absolute retract; by Proposition 6 and Proposition 7, K↦[[K]] is a continuous retraction from Comp(C) to
MPCCu(C) which is consequently an absolute retract. □
Corollary 6**.**
A non empty compact and max-plus convex subset is an absolute retract.
Proof.
Let C be a non empty compact and maxplus convex subset of E. The map x↦{x} is continuous from C to CCMPu(C). An arbitrary non empty max-plus K has a unique maximal element ⋁K and, for all x∈C, ⋁{x}=x; the map
K↦⋁K is continous and onto from MPCCu(C) to C. In conclusion, C is a retract of MPCCu(C). □
We will see in the next section that, in Corollary 6, the compactness assumption is superfluous, Theorem 6, but the proof of that result is somewhat more involved.
If C is a compact max-plus convex set Rn (u=(1,1⋯,1)), it has been shown by L. Bazylevych, M. Zarichnyi [2] that MPPm(C), the space of (non enmpty) max-plus polytopes of the form [[S]] with S⊂C and of cardinality at most m, is an absolute retract. In that same paper they also show that, for a compact and metrizable space Ω, whose unit is taken to be the constant map ω↦1, {\sf MPCC}\big{(}\mathcal{C}(\Omega)\big{)} is an absolute retract homeomorphic to l2.
The compact topological space Ω of the BBK Representation Theorem is unique up to homeomorphism; and it can be realized as a closed subspace of the unit ball of the dual space endowed with the weak topology (hence its compactness, by Alaoglu’s Theorem); also, if \big{(}E,\|\cdot\|_{\boldsymbol{u}}\big{)} is separable then the unit ball of the dual space is metrizable in the weak topology. The BBK Representation Theorem combined with the theorem of L. Bazylevych and M. Zarichnyi from [2] cited above yields the following proposition.
Proposition 8**.**
Let E be a Riesz space with unit u. If \big{(}E,\boldsymbol{u}\big{)} is complete and separable then MPCCu(E), the hyperspace of max-plus non empty compact subsets of E, is an absolute retract.
7. Fixed points and selections
From Proposition 3 one has a max-plus version of Fan’s Best Approximation Theorem, (A) of Proposition 9 below, from which one has the max-plus version of Brouwer’s Fixed Point Theorem. For the proof, in the context of geodesic spaces, the reader is referred to [18], and to [11] page 146 for the proof of the original Fan’s Theorem in normed spaces.
Proposition 9**.**
*Let f:C→E be a continuous function, with respect to Dhu, defined on a compact max-plus convex subset of E. If the metric Dhu is complete then the following hold:
(A) (Fan’s Best Approximation Theorem in max-plus) There exists x0∈C such that, for all y∈C,
Dhu(x0,f(x0))≤Dhu(y,f(x0)).
(B) (Fan’s Fixed Point Criteria in max-plus) For f to have a fixed point it is sufficient that, for all
x∈C such that x=f(x), C∩[[x,f(x)]] contains a point other than x.*
One could relax the completness assumption on the metric Dhu by assuming that C is contained in a complete max-plus convex subset X of E and that f(C)⊂X. If f takes its values in C itself then, either (A) or (B) of Proposition 9, implies that f has a fixed point. This “Brouwer’s Fixed Point Theorem in max-plus” follows also from the more general “Kakutani’s Fixed Point Theorem in max-plus”, Theorem 7 below.
Recall that the metric Dhu is equivalent to the metric associated to the norm ∥⋅∥u and if there is on E a complete Riesz norm then, for all u∈E+, Eu equipped with the norm ∥⋅∥u is complete, [12] page 65.
Theorem 3** (Michael’s Selection Theorem).**
If X⊂E is a max-plus convex subset of E which is complete with respect to Dhu then,
all lower semicontinuous maps Γ:Y→X with non empty closed
max-plus convex values defined a paracompact space Y have a continuous selection.
Furthermore, if A⊂Y is a closed set then any continuous selection of the resriction of Γ to A extends to a
continuous selection of Γ.
Proof.
From Theorem 3.4 in [17]. □
Theorem 4** (Approximate selections for usc maps).**
Let X be a non empty max-plus convex subset of E, Y a paracompact topological space and Γ:Y→X an upper
semicontinuous map with non empty max-plus convex values. Then, for all δ>0,
there exists a continuous map f:Y→X such that, for all y∈Y, f(y)∈Vδ(Γy).
Furthermore, if the values of Γ are max-plus convex and compact then any neighborhood
Θ⊂Y×X of the graph of Γ contains the graph of a continuous
map f:Y→X.
Proof.
From Theorem 3.5 in [17]. □
Theorem 5** (Dungundji’s Extension Theorem).**
Let A⊂X be non empty closed subset of an arbitrary metric space (X,d) and f:A→C a continuous map from A to an arbitrary non empty max-plus convex subset of E. Then, there exists a continuous maps
f^:X→[[f(A)]] whose restriction to A is f.
Proof.
From Theorem 4.1 in [17]. □
Theorem 5 says that max-plus convex subsets (with respect to a given unit u) of a Riesz space E are, with respect to the topology induced by either of the norms ∥⋅∥u or ∥⋅∥hu, absolute extensors for the class of metric spaces.
Theorem 6**.**
An arbitrary non empty max-plus convex subset of E, equipped with the metric topology associated to Dhu, is an
absolute retract.
Proof.
A metrizable absolute extensor for the class of metric spaces is an absolute retract. □
A map (single valued or multivalued) Γ:X→Y, where Y is a toplological space, is a compact map if there is a compact set K⊂Y such that Γ(Y)⊂K. A set X has the fixed point property for a given class
M of maps Γ:X→X if, for all Γ∈M there exists x∈X such that x∈Γx.
Theorem 7** (Kakutani-Fan - Himmelberg’s Theorem).**
An arbitrary non empty max-plus convex subset of E
has the fixed point property for upper semicontinuous compact maps with closed max-plus convex non empty values.
Proof.
From Proposition 5, Lemma 10 and Theorem 5.2 in [17]. □
Since a max-plus convex set is an absolute retract, Theorem 7 follows from the much harder Eilenberg-Montgomery Fixed Point Theorem, Corollary 7.4 in [11] or from (iv) of Corollary 7.5 on the same page of which the following statement is a particular instance :
If X is an absolute retract then, arbitrary compact upper semicontinous maps S:X→X with contactible values have a fixed point.
From the results of this section one can derive tropical versions of some classical results from mathematical economics, existence of Nash equilibria, existence of equilibria for abstract economies, existence of maximal elements for a preference relation. The question of their relevance in economics or game theory is left open.
8. A few drawings in R2
[TABLE]
The closed unit Dhu-ball in R2 about ∗; it is [[x1,x2,x3]].
The next example shows that the metric Dhu does not have the unique extension property.
[TABLE]
Three possible geodesic extensions of the geodesic [[x1,x2]]
[TABLE]
[[x1,x3]], [[x1,x3′]], [[x1,x3′′]] are geodesics.
8.1. A few max-plus polytopes in R2 and a max-plus convex set that is not a polytope
In each case the max-plus polytope in question is the max-plus convex hull of the points labeled x1,x2,x2,…
[TABLE]
This example shows that in R2 a max-plus convex polytopes with three extreme points (none of the three points is in the max-plus convex hull of the other two) can have empty interior and have topological dimension equal to 1.
[TABLE]
[TABLE]
In Rn a max-plus segment is piecewise linear, it is made of at most n affine segments. A max-plus polytope is a contractible finite union of affine convex polytopes, and consequently an absolute retract; it is also a contractible simplicial complex. What is the structure of max-plus polytopes in infinite dimensional Riesz spaces?