Convex analysis on polyhedral spaces

We introduce notions of concavity for functions on balanced polyhedral spaces, and we show that concave functions on such spaces satisfy several strong continuity properties.


Introduction
Convex analysis studies properties of convex functions and convex sets. The notion of convexity is a simple and natural one which has been increasingly important in both pure and applied mathematics. One of the main advantages of working with convex functions is that they have nice topological properties. For instance, a convex function on a open subset U ⊂ R n is continuous on U , and Lipschitz continuous on every compact subset of it. The aim of this article is to transfer the notion of convexity of functions to balanced polyhedral spaces, and to extend to this setting the strong continuity properties of convex functions on open subsets of R n .
There are algebraic objects to which one can naturally attach a balanced polyhedral space. The results of this article can be applied directly to such spaces, and we hope that this serves to a better understanding of the algebraic objects involved. Important examples arise in tropical geometry. Here, the procedure of tropicalization attaches a tropical cycle to an algebraic cycle, and the tropical cycle has a structure of a balanced polyhedral space [AR10].
Related examples arise in the theory of toroidal embeddings. As a particular case, to a pair (X, D) consisting of an algebraic variety X and a simple normal crossings divisor D on X one can associate its Clemens complex (also called the dual complex), which is also a balanced polyhedral space [Gro18,BB21].
In [AR10], Allerman and Rau developed an intersection theory between piecewise affine functions and tropical cycles. This theory was recently extended by Gross to a tropical intersection theory on weakly embedded conical polyhedral complexes associated to toroidal embeddings, between combinatorially principal piecewise affine functions and tropical cycles [Gro18].
A balanced polyhedral space X is an (abstract) polyhedral space of pure dimension n, which we equip with additional structure that allows to define a balancing condition. More precisely, it can be identified with a 5-tuple (X, Π, N, ι, b), where X is a second countable n-dimensional topological space, Π is a polyhedral complex on X, N is a Euclidean vector space, ι is a continuous map ι : X → N whose restriction to each polyhedron σ ∈ Π is injective and affine, and b is an n-dimensional Minkowski weight on Π satisfying b(σ) > 0 for every n-dimensional cone σ ∈ Π. The map ι is called the quasi-embedding and b the balancing condition (Definition 3.24).
The additional structure considered in the present article differs from the ones considered in [AR10] and [Gro18] in the following two aspects: on the one side, the authors in loc. cit. consider an integral structure whereas in this article, a Euclidean structure is considered. This turns out to be more convenient when dealing with convexity notions. On the other side, a tropical variety as in [AR10] comes with an embedding into a real vector space, while a weak embedding as in [Gro18] does not need to be injective when restricted to a cone. By contrast, a quasi-embedding does not need to be globally injective but its restriction to every polyhedron is assumed to be injective. A consequence of this difference is that we do not have to care about piecewise affine functions being combinatorially principal when doing intersection theory. Indeed, injectivity on each polyhedra implies that any piecewise affine function on the complex is combinatorially principal.
We will work with concave functions instead of convex ones, because the applications we have in mind come from toroidal geometry and positive divisors in this theory are described by concave functions on balanced polyhedral spaces [BB21]. Indeed, the functions associated to positive divisors in toric geometry are concave in the sense of convex analysis, although they are usually called convex in the toric literature [Ful93].
A first approach to concavity on polyhedral spaces is to declare that a function f on a balanced polyhedral space X is concave if it is the pullback by the quasiembedding ι of a concave function on the Euclidean space N . But this notion of concavity is not optimal because it is not local (Example 4.3). The variant that declares f to be concave if it is locally of the above type, is not stable under the operation of taking the infimum of a family of such functions. More crucially, given a toroidal embedding, the piecewise affine function on the Clemens complex associated to a nef toroidal divisor on the algebraic variety is not necessarily concave in this sense.
Hence it makes sense to explore other notions of concavity. In this article, we give several notions of concavity in terms of convex combinations. A convex combination of points in X is a triple where I is a finite set, x ∈ X is the central point, the x i 's are also points in X and the ν i 's are nonnegative real numbers such that i∈I ν i = 1 and ι(x) = i∈I ν i ι(x i ).
A convex combination is polyhedral if there is a polyhedral structure Π on X such that the central point x belongs to a polyhedron τ and the remaining points belong to polyhedra having τ as a face. Finally, a convex combination is balanced if it is polyhedral and, roughly speaking, the location of the x i 's is dictated by the balancing condition (Definition 5.1).
Then, a function f on X is strongly concave if for all convex combinations, the concavity condition is satisfied. This is equivalent to asking that f is the pullback by the quasiembedding ι of a concave function on the Euclidean space N (Proposition 5.7).
The function f is concave if the concavity condition (1.1) is satisfied for all polyhedral convex combination, and it is weakly concave if this concavity condition is only assumed to hold for balanced convex combinations (Definition 5.5). Clearly, strongly concave functions are concave and, in turn, concave functions are weakly concave. The three notions of concavity are different (Examples 4.17, 4.18 and 4.19) but, when restricted to R n , they all agree with the usual one. Moreover, in the piecewise affine case, these notions of concavity can be reformulated in terms of intersection products with Minkowski cycles (Proposition 5.7).
The main results of this article show that weakly concave functions (hence also concave and strongly concave functions) on a balanced polyhedral space satisfy the same nice continuity properties satisfied by concave functions on R n .
The first result in this direction is Theorem 6.2 that states that, if f is a weakly concave function on an open subset U ⊂ X, then it is continuous. Even more, in Corollary 6.22 we see that such a function is Lipschitz continuous in every compact subset K ⊂ U . More precisely, the Lipschitz constant of f in K can be bounded in terms of the sup-norm of the function on a slightly bigger open subset (Theorem 6.18).
Once we have proven Lipschitz continuity on compact subsets, we can prove some strong uniformity and convergence results for families of weakly concave functions (Theorems 6.23, 6.24 and 6.25). For instance, Theorem 6.24 states that, if (f i ) i≥0 is a sequence of weakly concave functions that converge pointwise on a dense subset to finite limits, then the sequence of functions converges pointwise to a weakly concave function and the convergence is uniform on compact subsets.
As we mentioned earlier, our motivation comes from toroidal geometry. In the subsequent article by the first and the second authors [BB21], the strong continuity properties of concave functions in open subsets of polyhedral complexes are used to show that the degree of a nef toroidal b-divisor is well-defined and to prove a Hilbert-Samuel type theorem for such b-divisors. However, we believe that the results of this article are general enough to be of interest in other areas of mathematics.
The article is organized as follows. In Section 2 we gather several definitions concerning polyhedral spaces, including the key notions of quasi-embedded and of Euclidean polyhedral spaces and complexes. We define morphisms between these spaces and show that they satisfy nice topological properties (Proposition 2.9).
In Section 3 we introduce the space of Minkowski weights on a Euclidean polyhedral complex (Definition 3.3) and the space of Minkowski cycles on a Euclidean polyhedral space (Definition 3.23). We also introduce balanced polyhedral spaces, that is, Euclidean polyhedral spaces endowed with a full-dimensional strictly positive Minkowski cycle (Definition 3.24). We end this section by defining an intersection product between Minkowski cycles and piecewise affine functions, and we show that it is well-defined and symmetric (Proposition 3.15). This intersection product is the Euclidean translation of that in [Rau16] and [Gro18].
In Section 4 we discuss different notions of concavity for piecewise affine functions related to preserving the positivity of the intersection product. We end this section by introducing the notions of regular polyhedral structures on a balanced polyhedral space X and of strictly concave function. This is inspired by the correspondence between normal fans of polytopes and projective toric varieties. We then show the analogue of the toric Chow lemma from toric geometry, providing existence of regular structures whenever X satisfies a natural finiteness condition (Theorem 4.34).
In Section 5 we discuss the different notions of concavity of functions on X that are not necessarily piecewise affine, in terms of convex combinations of points. We show that in the piecewise affine case, these notions agree with those introduced in the previous section (Proposition 5.7).
Finally, in Section 6 we prove the strong continuity properties of weakly concave (and hence also of concave and strongly concave) functions on a balanced polyhedral space.

Polyhedral spaces
In this section we gather several definitions concerning polyhedral and complexes. For convex sets and functions we will use the notations and definitions in [Roc72]. In particular, the empty set is a face of every convex set.
Definition 2.1. Let X be a second countable topological space. A polyhedral structure on X is a pair consisting of (1) a collection {σ α } α∈Λ of different closed subsets giving a locally finite covering of X, (2) a collection {M α } α∈Λ where each M α is a finite dimensional vector space of continuous R-valued functions on σ α such that, setting N α = Hom(M α , R), the evaluation map φ α : σ α −→ N α sends σ α homeomorphically onto a full-dimensional convex polyhedron of a hyperplane H α of this dual vector space not passing through the origin. The closed subsets σ α are the polyhedra of Π, and the preimages under φ α of the faces of φ α (σ α ) are the faces of σ α . We assume that the pair Π satisfies the conditions: (3) every face of a polyhedron σ α of Π is a polyhedron σ α of Π for an index α ∈ Λ, and the corresponding vector space M α consists of the restriction to σ α of the functions in M α , (4) every two polyhedra of Π intersect in a common face (possibly the empty one). A polyhedral structure is finite if its set of polyhedra is finite.
For simplicity, we identify a polyhedral structure Π with its underlying set of polyhedra. For a polyhedron σ ∈ Π we write M σ , N σ , H σ and φ σ for its corresponding vector space, dual space, hyperplane and evaluation map, respectively.
Identifying each σ ∈ Π with its image in N σ , we can translate to it the objects and notions of polyhedra in vector spaces. In particular, we denote by relint(σ) the relative interior of σ, that is, the preimage under φ σ of the interior of the polyhedron φ σ (σ) ⊂ N σ . Likewise the affine structure of N σ gives an affine structure on σ, and therefore we can talk about affine maps between polyhedra.
Remark 2.2. The condition (2) in Definition 2.1 implies that the space of affine functions on σ coincides with M σ . Definition 2.3. Let X be a second countable topological space and Π, Π two polyhedral structures on X. Then Π is a subdivision of Π, denoted by Π ≥ Π, if for every σ ∈ Π there exists a σ ∈ Π with σ ⊂ σ, the inclusion being an affine map. Two polyhedral structures on X are equivalent if they admit a common subdivision.
Proposition 2.4. Let X be a second countable topological space. Then (1) the relation ≥ is a partial order on the set of polyhedral structures on X, (2) the subdivisions of a given polyhedral structure on X form a directed set, (3) "being equivalent" is an equivalence relation between polyhedral structures on X.
Proof. The statement in (1) is clear from the definitions. In particular, the antisymmetric property follows from the fact that the polyhedra in a given polyhedral structure are different, and so two polyhedral structures that subdivide each other are necessarily equal.
To prove the statement in (2), let Π be polyhedral structure on X, and let Π 1 and Π 2 be two subdivisions of Π. For i = 1, 2 and each τ i ∈ Π i there is σ i ∈ Π such that τ i ⊂ σ i . We have that σ = σ 1 ∩ σ 2 is a polyhedron of Π containing the intersection τ 1 ∩ τ 2 , and for each i we have that τ i ∩ σ is a polyhedron of the vector space N σ . Hence τ 1 ∩ τ 2 = (τ 1 ∩ σ) ∩ (τ 2 ∩ σ) is also a polyhedron of N σ , and its space of affine functions M τ1∩τ2 consists of the functions in M σ restricted to it. The pair is a polyhedral structure on X that subdivides both Π 1 and Π 2 , and so the subdivisions of Π form a directed set, as stated.
The relation "being equivalent" is clearly both symmetric and and reflexive. To check the transitivity property, let Π, Π and Π be three polyhedral structures on X such that Π and Π are both equivalent to Π. Then there are polyhedral structures Π 1 and Π 2 that are a common subdivision of Π and Π and of Π and Π , respectively. Since Π 1 and Π 2 are subdivisions of Π, by (2) there is a further polyhedral structure Π 3 that subdivides both of them, and by (1) we have that Π 3 subdivides both Π and Π . Hence the later polyhedral structures are equivalent, proving (3).
Definition 2.5. A polyhedral space X is a second countable topological space equipped with an equivalence class of polyhedral structures. A polyhedral complex on X is the choice of a representative of the class of polyhedral structures of X.
Remark 2.6. By Proposition 2.4, the set of polyhedral complexes on a polyhedral space is a directed set ordered by subdivision.
Definition 2.7. The dimension of a polyhedral space X is defined as for any polyhedral complex Π on X. We say that X has pure dimension n when every polyhedron of Π that is maximal (with respect to the inclusion) has dimension n. These notions do not depend on the choice of Π.
Definition 2.8. Let X and X be polyhedral spaces. Given polyhedral complexes Π on X and Π on X , a morphism of a polyhedral complexes between Π and Π is a continuous map f : X → X such that for every σ ∈ Π there is σ ∈ Π with f (σ) ⊂ σ , and the restriction f | σ : σ → σ is an affine map.
A morphism of polyhedral spaces between X and X is a continuous map f : X → X that becomes a morphism of polyhedral complexes after a suitable choice of polyhedral complexes Π on X and Π on X as above.
Proposition 2.9. The underlying topological space of a polyhedral space is Hausdorff.
Proof. Let X be a polyhedral space and Π a polyhedral complex on X. Let x, y ∈ X be two different points. Since the covering {σ} σ∈Π is locally finite, we can choose an open subset W of X containing both x and y and such that the set of polyhedra Each σ ∈ Σ is homeomorphic to a polyhedron and so a Hausdorff topological subset of X. Hence there are open subsets U σ and V σ of X that are disjoint on σ, and contain x and y respectively, and so are disjoint neighborhoods of x and y respectively, proving the statement.
A standard way to construct polyhedral spaces is by gluing polyhedra through their faces, as we explain in the next example.
Proposition 2.13. Every polyhedral complex on a polyhedral space is isomorphic to one constructed gluing polyhedra through faces as in Example 2.10.
Proof. With notation as in Definition 2.1, let Π = ({σ α } α∈Λ , {M α } α∈Λ ) be a polyhedral complex on a polyhedral space X. For each α ∈ Λ consider the polyhedron in the dual space N α = Hom(M α , R) given by and, for α, β ∈ Λ, consider the faces of ∆ α and ∆ β respectively defined as and the affine map j β,α : F α,β → F β,α given by the restriction of φ β • (φ α ) −1 to the face F α,β . This data satisfies the conditions in Example 2.10 and in particular, the hypothesis that the covering {σ α } α∈Λ is locally finite implies the condition (3). Hence we can consider its associated polyhedral complex Γ on the polyhedral space Y as in (2.12) and (2.11). The isomorphisms φ −1 α : ∆ α → σ α , α ∈ Λ, induce a bijective map f : Y −→ X that is continuous, by the universal property of the quotient topology.
Since the set of polyhedra σ α , α ∈ Λ, forms a locally finite covering of X by closed subsets and the restriction f −1 | σα = φ α to each of them is continuous, the inverse map f −1 is also continuous. Hence f is a homeomorphism that is affine between each pair of polyhedra ∆ α and σ α , and so it is an isomorphism of polyhedral complexes.
To do convex analysis on a polyhedral space, we need a notion encoding how its different polyhedra are placed with respect to each other. For this, we first need to map it to a fixed ambient space. The definition below is a variant of [Gro18, Definition 2.1].
Definition 2.14. A quasi-embedded polyhedral space is a triple (X, N, ι) where X is a polyhedral space, N a finite dimensional R-vector space, and ι a map X → N such that ι(X) is contained in an affine hyperplane H not containing zero and there is a polyhedral complex on X for which the restriction of ι to each of its polyhedra is affine and injective. The map ι is called the quasi-embedding of X in N .
A polyhedral complex Π on the quasi-embedded polyhedral space (X, N, ι) is a polyhedral complex on X satisfying the above condition, namely that ι is affine and injective on each of its polyhedra. For each σ ∈ Π, its image with respect to the evaluation map φ σ spans a full-dimensional polyhedral cone of N σ , and so the quasi-embedding ι induces a linear injective map We will usually denote a quasi-embedded polyhedral space by its underlying polyhedral space X and, in this case, we will denote the corresponding quasiembedding, vector space and hyperplane by ι X , N X and H X , respectively.
Definition 2.15. A Euclidean polyhedral space is a quasi-embedded polyhedral space X for which the vector space N X is equipped with a Euclidean metric.
A polyhedral complex on a Euclidean polyhedral space is a polyhedral complex Π on the associated quasi-embedded polyhedral space. In this situation, for each polyhedron σ ∈ Π the Euclidean metric on N X induces a Euclidean metric on the vector space N σ .
Definition 2.16. A morphism between two quasi-embedded polyhedral spaces f : X → X is a pair f = (f 1 , f 2 ) where f 1 : X → X is a morphism of polyhedral spaces and f 2 : N X → N X is an affine map such that the diagram A morphism between Euclidean polyhedral spaces is a morphism between their underlying quasi-embedded polyhedral spaces.
Remark 2.17. The main differences between the notions of quasi-embedded polyhedral complex in Definition 2.14 and that of weakly embedded polyhedral complex in [Gro18, Definition 2.1] are that for the latter, first the affine maps ι σ are not required to be injective and second, the vector spaces M and M σ are equipped with a lattice and the affine maps ι σ are lattice maps. Here we shift the focus from lattices to Euclidean metrics because it is more convenient to do convex analysis.

Minkowski weights and Minkowski cycles
In this section we introduce Minkowski weights on polyhedral complexes and Minkowski cycles on Euclidean polyhedral spaces. This will allow us to define balanced polyhedral spaces, the spaces on which we consider the different notions of concavity. We also define and study the basic operations on Minkowski weights and cycles, including their restriction to open subsets, pullback to subdivisions, and product with piecewise affine functions.
Throughout this section, we denote by X a Euclidean polyhedral space and U an open subset of it.
Definition 3.1. Let Π be a polyhedral complex on X. The restriction of Π to U , denoted by Π| U , is the set of polyhedra given by For k ∈ Z ≥0 , we denote by Π| U (k) the set of polyhedra of Π| U of dimension k. The skeleton of Π| U of dimension k, denoted by Sk k (Π| U ), is the subset of X given by the union of these polyhedra. Definition 3.2. Let Π be a polyhedral complex on X and let σ, τ ∈ Π such that τ is nonempty and a facet of σ, that is, a face of σ of codimension 1. With notation as in Definition 2.14, the affine subspace ι X (H σ ) of the Euclidean space N X contains ι X (H τ ) as a hyperplane. The unit vector normal to τ in the direction of σ, denoted by v σ\τ , is defined as the unique unit vector in N X that is orthogonal to ι X (H τ ), parallel to ι X (H σ ) and points towards σ from τ .
The next definition of Minkowski weights is the adaptation to our setting of the classical notion for lattice fans introduced by Fulton and Sturmfels in [FS97]. For σ, τ ∈ Π, we write either τ ≺ σ or σ τ to indicate that τ is a face of σ. Definition 3.3. Let Π be a polyhedral complex on X and k ∈ Z ≥0 . A weight on Π| U of dimension k is a map c : Π| U (k) → R. Its support is the subset of X given by |c| = This weight is positive if c(σ) ≥ 0 for all σ ∈ Π| U (k). For convenience, any weight c on Π| U of dimension k is extended to a function c : Π| U → R by setting c(σ) = 0 for all σ ∈ Π| U ( ) with = k. A weight c on Π| U of dimension k is a Minkowski weight if for each τ ∈ Π| U (k−1), The set of weights on Π| U of dimension k, denoted W k (Π| U ), is an Abelian group under the addition of functions. The subgroup of its Minkowski weights is denoted by M k (Π| U ), and the cone of those that are positive is denoted by M + k (Π| U ). For short, when U = X we denote this Abelian group, subgroup and cone by W k (Π), M k (Π) and M + k (Π), respectively. Definition 3.5. A piecewise affine function on the open subset U of the polyhedral space X is a function f : U → R for which there is a polyhedral complex Π on X such that for each σ ∈ Π| U the restriction f | σ∩U is affine or equivalently, it is given by an element of M σ . In this situation, we say that f is defined on Π.
For each σ ∈ Π| U , we denote by f σ a linear function on N X satisfying Since the image of σ in N σ spans a full-dimensional polyhedral cone, the restriction of f σ to ι X,σ (N σ ) does not depend on the choice of this linear function. We denote by PA(U ) the Abelian group of piecewise affine functions on U , and by PA Π (U ) the subgroup of those piecewise affine functions that are defined on Π.
Remark 3.6. Piecewise affine functions on polyhedral spaces are continuous, because they are continuous on the restriction to U of each polyhedron of the polyhedral complex Π, and these polyhedra form a locally finite closed covering of the polyhedral space X.
We next define the basic operations on weights on polyhedral complexes and study their interplay. Definition 3.8 (Pullback to subdivisions). Let Π, Π be polyhedral complexes on X with Π ≥ Π and c a k-dimensional weight on Π| U . The pullback of c to Π , denoted by c Π , is the k-dimensional weight on Π | U defined, for σ ∈ Π | U , by Definition 3.9 (Product with piecewise affine functions). Let Π be a polyhedral complex on X, f a piecewise affine function on U defined on Π, and c a k-dimensional weight on Π| U . The product of f and c, denoted by f · c, is the (k − 1)-dimensional weight on Π| U defined, for each τ ∈ Π| U (k − 1), by the sum being over the k-dimensional polyhedra σ ∈ Π| U having τ as a facet.
Choosing any point x ∈ τ , the formula in (3.10) can be alternatively written as Proposition 3.12. Let Π be a polyhedral complex on X, V an open subset of U , Π a subdivision of Π, f a piecewise affine function on U defined on Π, and c a weight on Π| U . Then Proof. The first equality, that is, the compatibility between the restriction to an open subset and the pullback to a subdivision, follows almost immediately from the definitions. Both (c Π )| V and (c| V ) Π are k-dimensional weights on Π | V and for each σ ∈ Π | V , their possibly nonzero values are respectively defined by Since σ ∩ V = ∅ and σ ⊃ σ, we have that σ ∈ Π| V . Hence σ = σ and both weights coincide, as stated.
The second equality is also direct from the definitions, since the product of a weight with a piecewise affine function is defined in local terms.
Hence we turn to the third equality, giving the compatibility between the pullback to a subdivision and the product with a piecewise affine function. Both (f ·c) Π and f · c Π are (k − 1)-dimensional weights on Π | U , and so it is enough to consider their values on the set of polyhedra Π | U (k − 1).
When dim(τ ) = k, there are two polyhedra σ , σ ∈ Π | U (k) contained in τ and having τ as a facet. We have that and also that f σ and f σ coincide with f τ on ι X,σ (N σ ) = ι X,σ (N σ ) = ι X,τ (N τ ). Hence, the contributions of these two polyhedra to the sum in (3.14) cancel. For any other polyhedron in Π | U (k) having τ as a facet, the minimal polyhedron in Π| U containing it has dimension greater than k and so its value for the weight c Π is zero. Thus again (f · c Π )(τ ) = 0 in this case.
Finally suppose that dim(τ ) = k −1. To each polyhedron σ ∈ Π | U (k) contained in the k-dimensional skeleton Sk k (Π| U ) and having τ as a facet, we associate the minimal polyhedron σ ∈ Π| U containing it. This assignment gives a bijection between this set of k-dimensional polyhedra of Π | U and that of polyhedra in Π| U (k) having τ as a facet, and we have that and also that f σ and f σ coincide on ι X,σ (N σ ) = ι X,σ (N σ ). Hence the sum in (3.14) coincides with that in (3.13), since the value of the weight c Π at the polyhedra in Π | U (k) that are not contained in Sk k (Π| U ) is zero. Thus in this case (f · c) Π (τ ) = f · c Π (τ ), which concludes the proof.
We next prove that the product of several piecewise affine functions with a weight is commutative. This result is similar to [AR10, Proposition 3.7a], and its proof is done in a similar way.
Proposition 3.15. Let Π be a polyhedral complex on X, f, g piecewise affine functions on U defined on Π, and c a k-dimensional weight on Π| U . Then Proof. The proof is based on the following observation. Let v 1 and v 2 be two linearly independent unit vectors in a Euclidean space. Denote by v ⊥ 1 and v ⊥ 2 the unit vectors in the plane generated by v 1 and v 2 , that are respectively orthogonal to v 1 and to v 2 , and that both v 1 , v ⊥ 1 and v ⊥ 2 , v 2 have the same orientation as v 1 , v 2 . Then for a, b ∈ R, the equations Indeed, consider the reflection on the plane generated by v 1 and v 2 by the bisector of the angle between these two vectors. This reflection interchanges v 1 with v 2 and v ⊥ 1 with v ⊥ 2 and respects linear relations. Applying it to any of the two equations in (3.16) gives the other one, proving that they are equivalent. Now let ρ ∈ Π| U (k −2). For each τ ∈ Π| U (k −1) and σ ∈ Π| U (k) with ρ ≺ τ ≺ σ, we denote by τ the unique polyhedron different from τ that lies in Π| U (k − 1) and verifies that ρ ≺ τ ≺ σ. The vectors v τ \ρ , v τ \ρ , v σ\τ and v σ\τ satisfy the conditions of the vectors v 1 , v 2 , v ⊥ 1 and v ⊥ 2 in the previous discussion, and so there are real numbers a σ,ρ and b σ,ρ such that We compute where the indexes τ and σ go over the sets of polyhedra Π| U (k − 1) and Π| U (k), respectively. The first equality is the definition of the product, the second follows from the first equation in (3.17), and the third comes from the linearity of g σ combined with the fact that g σ | Nτ = g τ and g σ | N τ = g τ . Next, we interchange the roles of τ and τ in the inner sum of the second term of the last expression and revert the previous argument, applying this time the linearity of f σ , the second equation in (3.17) and again the definition of the product to obtain that which proves the statement.
In view of the definition of the product, we give the following interpretation of the condition for an arbitrary weight to be a Minkowski weight.
Lemma 3.18. Let Π be polyhedral complex on X and c a weight on Π| U . Then c is a Minkowski weight if and only if for every linear function : N X → R, The statement follows from the fact that, for a vector v ∈ N X , the condition v = 0 is equivalent to (v) = 0 for every linear function .
Proposition 3.19. Let Π be a polyhedral complex on X and c a k-dimensional Minkowski weight on Π| U .
Proof. The statement in (1) is direct from the definitions. To prove (2), take a linear form on N X and set h = • ι X for short. Proposition 3.12 and Lemma 3.18 imply that Since this holds for every , Lemma 3.18 implies that c Π | U is a k-dimensional Minkowski weight on Π | U , proving the statement.
For (3), taking again a linear form on N X and setting h = • ι X , we get from Proposition 3.12 and Lemma 3.18 that Since this holds for every , Lemma 3.18 again implies that f · c is a (k − 1)dimensional Minkowski weight on Π| U , as stated.
Hence the operations of restriction to an open subset, pullback to a subdivision and product with piecewise affine functions induce the families of homomorphisms that in the notation of Proposition 3.19, write down, for each k ∈ Z ≥0 , as Definition 3.23. For k ∈ Z ≥0 , the space of Minkowski cycles on U of dimension k is defined as the direct limit taken over the directed set of polyhedral complexes on X ordered by subdivision, and where the map corresponding to each pair Π ≥ Π is the pullback homomorphism in (3.21). Given a Minkowski weight c ∈ M k (Π| U ), we denote by [c] ∈ Z k (U ) the associated Minkowski cycle. Conversely, given a Minkowski cycle γ ∈ Z k (U ) and a polyhedral complex Π on X, we say that . The support of a Minkowski cycle γ is the support of any Minkowski weight representing it.
The Minkowski cycle γ is positive if it can be represented by a positive Minkowski weight on Π| U . We denote by Z + k (U ) the cone of positive Minkowski cycles on U of dimension k.
The compatibility between the pull-back of Minkowski weights to subdivisions on the one hand and the restriction to open subsets and the product with piecewise affine functions on the other (Proposition 3.12) allows to define the corresponding operations for Minkowski cycles. Namely, from (3.20) and (3.22) we derive the families of homomorphisms given, for k ∈ Z ≥0 , by for any polyhedral complex Π on X and c ∈ M k (Π| U ) with γ = [c].
We next introduce the notions of balancing condition and balanced polyhedral space.
Definition 3.24. Suppose that the Euclidean polyhedral space X has pure dimension n. A balancing condition on U is an n-dimensional Minkowski cycle β on U that is represented by an n-dimensional Minkowski weight b on Π| U for a polyhedral complex Π on X, and such that b(σ) > 0 for all σ ∈ Π| U (n). The pair (U, β) is called a balanced open subset. When U = X, the pair (X, β) is called a balanced polyhedral space. A polyhedral complex Π on a balanced open subset (U, β) is a polyhedral complex such that the balancing condition β is defined on Π.
The Euclidean polyhedral space X is balanceable if it admits a balancing condition on X. It is locally balanceable if there is an open covering X = i U i admitting a balancing condition on each U i .
We will usually denote a balanced open subset by its underlying subset U and, in this case, we will denote the corresponding balancing condition by β U .
Example 3.25. For n ∈ Z ≥0 , the vector space R n can be given a structure of a balanced polyhedral space by considering the polyhedral complex Π consisting of the single polyhedron σ = R n embedded in the Euclidean vector space R n+1 through the map x → (x, 1), and the Minkowski weight defined by β R n (σ) = 1. Remark 3.26. As in Example 3.25, in many situations the space N will consist of the Euclidean space R n+1 and H of the hyperplane (x n+1 = 1). In those situations we will only explicit the hyperplane H, whereas the space N will be tacitly assumed.
Example 3.27. Let X be a Euclidean polyhedral space, U ⊂ X an open subset and γ ∈ Z + k (U ) a positive Minkowski cycle. Then the support |γ| has an induced structure of Euclidean polyhedral space of pure dimension k with a balancing condition on |γ|∩U , given by the restriction of the cycle γ to its support. In particular, if U = X then |γ| is balanced.
Example 3.28. Not every Euclidean polyhedral space is balanceable. For instance, the ray R ≥0 with its standard structure of a Euclidean polyhedral space given by the polyhedra {0} and R ≥0 , is not balanceable. Indeed, let Π be a polyhedral complex on R ≥0 and set τ = {0} ∈ Π(0). There is a unique polyhedron σ ∈ Π(1) with τ ≺ σ and, for any c ∈ M 1 (Π), the condition (3.4) boils down to Hence c(σ) = 0 and so no balancing condition can be defined on Π.
More generally, any convex polyhedron ∆ ⊂ R n of maximal dimension is a Euclidean polyhedral space with the structure induced from that of R n in Example 3.25 but, unless ∆ = R n , it is not balanceable.
Example 3.29. Let X be the Euclidean polyhedral space depicted in Figure 1, where ABC is an equilateral triangle, L is the bisector of the angle opposed to A and M is the bisector of the angle opposed to B. Then X is balanceable if and only if N is the bisector of the angle opposed to C, while it is locally balanceable if an only if N is contained in the interior of the angle opposed to C. We end this section discussing the change of Euclidean structure.
Definition 3.30. Let X be another Euclidean polyhedral space that has the same underlying quasi-embedded polyhedral space of X and a possibly different Euclidean structure. Let Π be a polyhedral complex on X and Π the corresponding polyhedral complex on X . For k ∈ Z ≥0 , the change of Euclidean structure on the open subset U is the morphism ϕ X ,X : where vol X (σ)/ vol X (σ) denotes the ratio between the Haar measures on the affine space N σ induced by the Euclidean structures of X and X.
Remark 3.31. It follows directly form the definition that for three Euclidean structures X, X and X on the same polyhedral space, the change of Euclidean structure maps induced by a polyhedral complex on X verify that Proposition 3.32. With notation as in Definition 3.30, let c ∈ M k (Π| U ) and f ∈ PA Π (U ). Then Proof. We denote with a prime the objects relative to X . For instance, for τ ∈ Π| U (k − 1) and σ ∈ Π| U (k) with τ ≺ σ, the symbol v σ\τ denotes the unit normal vector to τ in the direction of σ for the Euclidean structure of X , while v σ\τ denotes that for X.
We decompose this vector as where the scalar product is computed in X and w σ\τ is a vector parallel to ι X,τ (H τ ). The ratio between the Haar measures induced on the affine spaces H τ and H σ are related by vol To prove that ϕ X ,X (c) is a Minkowski weight we compute, for τ ∈ Π| U (k − 1), for some vector w τ parallel to ι X,τ (H τ ). Since w τ is a linear combination of the vectors v σ\τ , σ τ , and these vectors are orthogonal to the affine subspace ι X,τ (H τ ) with respect to the Euclidean structure of X , we deduce that w τ = 0, proving the first statement.
To prove the second statement, we compute, using the notation in (3.33) and the fact that w τ = 0, Thanks to this result, we can consider the change of Euclidean structure map from Definition 3.30 at the level of Minkowski weights and Minkowski cycles: They also satisfy the composition property of Remark 3.31.

Concave piecewise affine functions on polyhedral spaces
In this section we introduce and discuss the different notions of concavity for a piecewise affine function on an open subset of a polyhedral space. We denote by X a quasi-embedded polyhedral space and U an open subset of it.
First we recall the definition of a concave function defined on a vector space and possibly taking infinite values.
For a function f : R n → R ∪ {−∞}, being concave in the sense of Definition 4.1 is equivalent to the usual condition that, for all x, x ∈ R n and ν 1 , ν 2 ∈ R ≥0 with ν 1 + ν 2 = 1, However, this definition cannot be directly extended to functions on the open subset U , as we do not dispose of a notion of convexity for subsets of a polyhedral space. Instead, we can use the quasi-embedding to pullback the notion of concavity for functions on the vector space N X .
The piecewise affine function f is locally strongly concave if there is an open covering U = i U i such that f | Ui is strongly concave for every i.
Similar definitions have been proposed in the context of tropical geometry, as in [Rau16, Section 1.5]. However, neither of them is completely satisfactory. On the one hand, the notion of being strongly concave is not local as shown by the next example but, as we will see in Proposition 5.11, can be extended to a notion that is stable under the operation of taking the infimum. On the other hand, the notion of being locally strongly concave is local, but as also shown in the next example, cannot be extended to a notion that is stable under the operation of taking the infimum.
Example 4.3. Let X be the 1-dimensional polyhedral space shown in Figure 2 and consisting of the four polyhedra σ i = R ≥0 × {i}, i = 1, . . . , 4, glued together by the points (0, i). Set H = R 2 and let ι : X → H be the quasi-embedding defined, for x ∈ R ≥0 and i ∈ {1, 2, 3, 4}, by For each integer n ≥ 2 consider the piecewise affine function f n : X → R given by It is not strongly concave because for the points x 1 = ι(1, 1), x 3 = ι(1, 3) and x 4 = ι(1, 4) shown in Figure 2 we have that ι(x 1 ) = 1 2 x 3 + 1 2 x 4 and Hence f n is not the pullback to X of a concave function on H. On the other hand, this piecewise affine function is locally strongly concave, as it can be seen by considering the covering X = U n ∪ V n with U n = (x, i) | i = 1 or x < 2 3 n and V n = (x, i) | i = 1 and x > 1 3 n .
This shows that the notions of being strongly concave and of being locally strongly concave do not agree, and the notion of being strongly concave is not local. Moreover, consider the piecewise affine function f : X → R defined by It is the infimum of the family {f n } n≥2 , but it is not locally strongly concave. Indeed, for any ε > 0 we have that ι(ε, 1) = 1 2 ι(ε, 3) + 1 2 ι(ε, 4) and It is concave according to Definition 4.1 and since f = f • ι, we deduce that f is strongly concave in the sense of Definition 4.2. Moreover, any concave function for all x ∈ R. Hence, such a concave function necessarily takes the value +∞ at the point 0, 1 2 . In view of the issues concerning these notions of concavity, we propose two other ones based on the idea of preserving the positivity of Minkowski cycles. For the rest of this section, we assume that X is a Euclidean polyhedral space and that U is an open subset of it. These are cones in PA(U ). Similarly, for a polyhedral complex Π on X, the cones of strongly concave, of concave, and of weakly concave piecewise affine functions on U that are defined on Π are respectively denoted by When we want to stress the dependency of the class of weakly concave piecewise affine functions on the balancing condition, we denote its corresponding spaces by WCPA(U, β U ) and WCPA Π (U, β U ).
Clearly, the notion of strongly concave piecewise affine function does not depend on the choice of the Euclidean structure of X . The next result shows the dependency of the other notions of concavity with respect to changes on the Euclidean structure.
Proposition 4.7. Let X be a Euclidean polyhedral space with the same quasiembedded polyhedral space of X, let U be the open subset of X corresponding to U and ϕ X ,X : Z k (U ) → Z k (U ), k ∈ Z ≥0 , the change of Euclidean structure maps as in (3.34). Then
Proof. This is a direct consequence of Proposition 3.32.
We have seen in Example 4.3 that, for a piecewise affine function on an open subset of a polyhedral space, the notion of being strongly concave is not local. By contrast, the notions of being concave and of being weakly concave are local. (1) f is concave if and only if f | Ui is concave for all i.
(2) When U is balanced, f is weakly concave if and only if f | Ui is weakly concave for all i.
Proof. This follows directly from the definitions and the compatibility between the restriction to open subsets and the product of piecewise affine functions with Minkowski weights (Proposition 3.12).
The next result motivates our terminology for the different notions of concavity.
Proposition 4.9. Let f be a piecewise affine function on U .
(1) If f is locally strongly concave, then f is concave.
(2) If U is balanced and f is concave, then f is weakly concave.
Proof. To prove (1), let Π be a polyhedral complex on X where f is defined, V ⊂ U an open subset, k ∈ Z ≥0 , and c ∈ M + k (Π| V ). Let τ ∈ Π| V (k − 1) and set (4.10) If S = 0 then c(σ) = 0 for all σ ∈ Π| V (k) with σ τ because c is positive. Therefore (f · c)(τ ) = 0 in this case. Else S > 0, and pick then x ∈ relint(τ ) ∩ V . Since f is locally strongly concave, we can choose an open neighborhood V in V of the point x, a convex subset C of N X and a concave function f : C → R such that Choose also ε > 0 so that ι X (x)+ε v σ\τ ∈ ι X (σ ∩V ) for all σ ∈ Π| V (k) with σ τ . By (4.10) we have that σ τ c(σ) S = 1 and, since c is a Minkowski weight, we also have that σ τ c(σ) v σ\τ = 0. Therefore, the concavity of f implies that From the formula in (3.11) and the fact that f is affine on each polyhedron σ ∈ Π| V we get that and so (4.11) implies that (f · c)(τ ) ≥ 0. Hence f · c is positive, and thus f is concave.
The statement in (2) is immediate from the definitions, because the balancing condition β U is a positive Minkowski cycle.
The next result shows that, for a given piecewise affine function, the condition of being concave can be checked in any polyhedral complex where it is defined.
Proposition 4.12. Let f be a piecewise affine function on U defined on a polyhedral complex Π. The following conditions are equivalent: (1) f is concave, is a positive Minkowski cycle, we deduce that f · c is a positive Minkowski weight, and so f satisfies the condition (2).
To prove the converse, suppose that f satisfies the condition (2) and choose an open subset V ⊂ U , k ∈ Z ≥0 and γ ∈ Z + k (V ). Let Π be a subdivision of Π and c ∈ M + k (Π | V ) a positive Minkowski weight representing γ. Let τ ∈ Π | V (k − 1) and set µ for the minimal polyhedron of Π| V containing τ . For each σ ∈ Π | V (k) with σ τ , let λ(σ) be the minimal polyhedron of Π| V containing σ. We decompose the unit normal vector to τ in the direction of σ as with v σ,µ parallel to the affine subspace ι X (H µ ) and v σ,µ ⊥ orthogonal to it. Then Since this decomposition is orthogonal, we deduce that (4.14) Put l = dim(µ), and for each σ as above write with a σ,ν ∈ R ≥0 and where the sum goes over the polyhedra ν ∈ Π| V (l + 1) with µ ≺ ν ≺ λ(σ). Such a decomposition does exist because µ ≺ λ(σ), and the cone of vectors that are orthogonal to µ and point towards λ(σ) contains v σ,µ ⊥ and is generated by the vectors v ν\µ for ν ∈ Π| V (l + 1) with µ ≺ ν ≺ λ(σ).
Let W be an open subset of V such that Π | W consists only of the polyhedra having τ as a face. We then define a positive Minkowski weight c ∈ M + l+1 (Π| W ) by setting, for each ν ∈ Π| W (l + 1), the sum being over the polyhedra σ ∈ Π | V (k) with σ τ and λ(σ) ν. Since Π| W (l) = {µ}, to see that the formula in (4.16) defines a positive Minkowski weight we only need to check the balancing condition at this polyhedron: where the sums are taken over the polyhedra ν ∈ Π| W (l + 1) and σ ∈ Π | W (k) subject to the conditions stated therein. Moreover, the product (f · c )(τ ) coincides with (f · c)(µ): where the indexes ν and σ denote polyhedra in Π| W (l + 1) and in Π | W (k), respectively: the first equality is the definition of the product, the second follows from the decomposition in (4.13) and the fact that f σ and f λ(σ) coincide on ι X (N σ ), the third from the decomposition in (4.15) and the fact that f λ(σ) and f µ coincide on ι X (N µ ), the fourth from the first equation in (4.14), the definition of the Minkowski weight c and the fact that f λ(σ) and f ν coincide on ι X (N ν ), and the fifth from the definition of the product.
Since c is positive, by hypothesis (f · c)(µ) ≥ 0. Hence (f · c )(τ ) ≥ 0 and since τ ∈ Π | V (k − 1) is arbitrary, we deduce that f · c is positive and so is also positive. Varying V , k and γ, we conclude that f is concave.
The next three examples show that the proposed classes of concave piecewise affine functions are different.
A piecewise affine function f : (1) f is strongly concave if and only if −a 1 ≥ a 2 = a 3 , (2) f is concave if and only if −a 1 ≥ a 2 and −a 1 ≥ a 3 , (3) f is weakly concave if and only if −(γ 2 + γ 3 ) a 1 ≥ γ 2 a 2 + γ 3 a 3 . Hence these classes of concave piecewise affine functions are different, and the notion of being weakly concave depends on the choice of the balancing condition.
The quasi-embedding in the previous example is not globally injective. In the next examples we will see that even when the quasi-embedding is a injective, the three notions of concavity can differ. The cone of positive Minkowski weights on Π| U of dimension 1 is generated by the weights c 1 and c 2 given by The piecewise affine function f : X → R given by the formula (4.4) is defined on Π and we have that (f · c 1 )(τ ) = 1 and (f · c 2 )(τ ) = 0.
By Proposition 4.12 it is concave although, as it was explained in Example 4.3, it is not strongly concave.
In the next example we construct a weakly concave piecewise affine function that multiplied twice with the balancing condition gives a negative weight. In particular, such a piecewise affine function is not concave. We have that Hence the 1-dimensional Minkowski weight f · b is positive, and so f is weakly concave. On the other hand (f · (f · b))({0}) = −1, and therefore f is not concave.
We next show that weakly concave piecewise affine functions preserve the positivity of the Minkowski weights given by products of concave piecewise affine functions with the balancing condition. By contrast, the product of several weakly concave piecewise affine functions with the balancing condition is not necessarily positive, as already shown in Example 4.19. Proposition 4.21. Suppose that U ⊂ X is balanced, and let f be a weakly concave piecewise affine function and γ a β U -positive Minkowski cycle on U . Then f · γ is a β U -positive Minkowski cycle on U .
Proof. It is enough prove the statement for Minkowski cycles of the form with 0 ≤ k ≤ n and f i ∈ CPA(U ), i = 1, . . . , n − k. By Proposition 3.15, we have that f · γ = f 1 · · · f n−k · f · β U and the definitions of concave and weakly concave piecewise affine functions imply that this product is positive, as stated. Proof. Let f be a piecewise affine function on U . If f is concave in the usual sense, then it is also locally strongly concave and, by Proposition 4.9, it also satisfies the other notions of concavity.
For the converse, it is enough to show that the notion of being weakly concave implies that of being concave in the usual sense. Let Π be a polyhedral complex on R n with the induced balancing condition b ∈ M + n (Π| U ), and let f ∈ WCPA Π (U ). For each τ ∈ Π| U (n − 1) denote by σ, σ ∈ Π| U (n) the two polyhedra containing τ as a facet. Since f is weakly concave, The linear functions f σ and f σ coincide on ι X,τ (N τ ) and v σ\τ = −v σ \τ , and so the inequality in (4.23) implies that the restriction of f to any convex subset of the union σ ∪ σ is concave in the usual sense. Now let x, x ∈ U be two different points such that the segment xx does not intersect the (n − 2)-dimensional skeleton of Π| U . Then every point y ∈ xx has a convex neighborhood that is contained in a subset of the form σ ∪ σ as above, and the restriction of f to such a neighborhood is concave in the usual sense. Since this condition is local, we deduce that f is concave on the segment xx .
Hence, f is concave on each segment xx for the pairs (x, x ) in a dense open subset of U × U . Since f is continuous (Remark 3.6), this property extends to every segment in U and so f is concave therein, as stated.
Corollary 4.24. Let X be a Euclidean polyhedral space of pure dimension, U a balanced open subset of X, and f a weakly concave piecewise affine function on U . Let Π be a polyhedral complex on X and σ ∈ Π a polyhedron contained in U . Then the restriction f | σ is concave in the usual sense.
Proof. We can assume without loss of generality that σ is of maximal dimension. The balancing condition on U induces a balancing condition on the interior of σ that is a positive multiple of the standard balancing condition of a polyhedron of R n . By Proposition 4.22 the restriction of f to the interior of σ is concave in the usual sense. Since f is continuous, it is also concave on the whole of σ.
Definition 4.25. Let Π be a polyhedral complex on the Euclidean polyhedral space X. A piecewise affine function f on the open subset U is strictly concave on Π| U if it is defined on Π and for every integer k, every τ ∈ Π| U (k), every open subset V ⊂ U with V ∩ τ = ∅ and every c ∈ M + k+1 (Π| V ) with c(σ) > 0 for some σ ∈ Π| V (k + 1) with σ τ , we have that The polyhedral complex Π is regular on U if there is a piecewise affine function f on U that is strictly concave on Π| U .
Indeed, this is the minimal polyhedral complex on ∆ where f is defined. Classically, a polyhedral complex on a convex polyhedron is called regular if it is of the form Π(f ) for a concave piecewise affine function on it, see for instance [DRS10,Definition 2.2.10]. The next result shows that Definition 4.25 is a generalization of this notion to arbitrary Euclidean polyhedral complexes. Proof. First assume that f is strictly concave on Π| U , and let b ∈ M n (Π| U ) be the balancing condition on Π| U induced from the standard one of R n , given in Example 3.25. Since b(σ) > 0 for all σ ∈ Π| U (n), the condition (4.26) implies that f is weakly concave on U . By Proposition 4.22, it is concave on U in the usual sense and by continuity, it is also concave on the whole of ∆. Since f is defined on Π, we have that Π(f ) ≤ Π. Moreover, the condition that (f · b)(τ ) > 0 for all τ ∈ Π| U (n − 1) implies that Π(f ) = Π, proving the first implication.
This shows that f is strictly concave on Π and completes the proof.
Remark 4.31. The proof of Proposition 4.30 shows that in order to check that a piecewise affine function f defined on a polyhedral complex Π on an n-dimensional polyhedron ∆ is strictly concave, it suffices to show that (f · b)(τ ) > 0 for every τ ∈ Π(n − 1). This is not the case when ∆ is replaced by an arbitrary polyhedral space.
Let Π be a polyhedral complex on X, and f a piecewise affine function on this Euclidean polyhedral space whose restriction to each polyhedron of Π is concave. Then we consider the set of polyhedra in X defined as where for each σ ∈ Π we denote by Π(f | σ ) the polyhedral complex on σ given by the affinity loci of the restriction of f to this polyhedron as in (4.28).
Proposition 4.33. The set S(Π, f ) is the minimal subdivision of Π where the piecewise affine function f is defined.
Proof. For each τ, σ ∈ Π with τ ≺ σ, the restriction to τ of the polyhedral complex Π(f | σ ) agrees with Π(f | σ ). This implies that S(Π, f ) is a polyhedral complex on X, and Proposition 4.30 implies that it is the minimal subdivision of Π where f is defined.
We next show that any polyhedral complex satisfying a finiteness condition admits a regular subdivision.
Theorem 4.34. Let Π be a polyhedral complex on X such that Π| U is finite. Then there is a strongly concave piecewise affine function f on X such that S(Π, f )| U is finite and f is strictly concave on S(Π, f )| U . In particular, S(Π, f ) is a subdivision of Π that is regular on U .
Proof. For each σ ∈ Π| U choose linear functions σ,j on N X , j = 1, . . . , m σ , defining the polyhedron ι X (σ) as the subset of points x ∈ H X such that σ,j (x) ≥ 0 for all j. Consider the concave piecewise affine function f σ : H X → R defined, for x ∈ H X , as Since Π| U is finite, f is well-defined, concave and piecewise linear. Since f is the pull-back to X of the concave function f on H X , it is a strongly concave piecewise affine function on X. By Proposition 4.33, we can then consider the associated subdivision S(Π, f ) of Π. By construction, the restriction of S(Π, f ) to the open subset U is also finite. We need to show that f is strictly concave on S(Π, f ).
Write α i = c(σ i )/ r j=1 c(σ j ). Since c is a Minkowski weight, we have that ι X (x) = α i ι X (x i ). Moreover, Since τ ⊂ ρ, dim(τ ) = dim(ρ) and x i ∈ relint(σ i ) where dim(σ i ) > dim(τ ) and σ i τ , we deduce that x i ∈ ρ. Let f ρ be the function defined as (4.35) for ρ. Then f ρ (ι X (x)) = 0 and, for each i, we also have that f ρ (ι X (x i )) < 0 because x i / ∈ ρ. This implies that Since f is obtained from f ρ by adding to it a concave piecewise affine function, we deduce that Hence f is strictly concave on S(Π, f )| U and S(Π, f ) is a subdivision of Π that is regular on U , as stated.
Theorem 4.37. Let Π be a polyhedral complex on X such that Π| U is finite. Then there is a subdivision Π of Π such that for every piecewise affine function g ∈ PA Π (U ) there are concave piecewise affine functions f 1 , f 2 ∈ CPA Π (U ) with Proof. By Theorem 4.34, there is a subdivision Π of Π and a strictly concave function f on Π | U . The set PA Π (U ) is a finite dimensional vector space, and CPA Π (U ) is a cone inside it. For each k ∈ Z ≥0 and τ ∈ Π(k − 1) choose an open subset V ⊂ U such that τ is the only polyhedron of Π(k − 1) intersecting V . Each Minkowski weight c ∈ M k (Π| V ) gives a functional k,τ,V,c : PA Π (U ) → R defined, for g ∈ PA Π (U ), by (4.38) k,τ,V,c (g) = (g · c)(τ ). Since f is strictly concave on Π| V , we have that k,τ,V,c (f ) > 0 for all k, τ , V and c as above. Hence f lies in the interior of the cone CPA Π (U ), and so the interior of this cone is nonempty. Thus which gives the result.
Remark 4.39. The class of concave piecewise affine functions satisfies two fundamental properties, as it follows from its definition and Theorem 4.37: (1) they preserve the positivity of Minkowski weights, (2) piecewise affine functions can be written as a difference of concave piecewise affine functions.
By contrast, strongly concave piecewise affine functions do not satisfy the condition (2) and weakly concave functions do not satisfy the condition (1), as it can be verified in the situation of Example 4.17

Concave functions on polyhedral spaces
In this section we given different notions of concavity for functions on polyhedral spaces, extending the previous notions for piecewise affine functions. We denote by X a quasi-embedded polyhedral space with quasi-embedding ι : X → N , and U an open subset of it.
First we first introduce notions of convex combinations of points.
with x ∈ U , and where (x i ) i∈I and (ν i ) i∈I respectively denote finite collections of points of U and of nonnegative real numbers satisfying i∈I ν i = 1 and A convex combination in U is polyhedral if there is a polyhedral complex Π on X and polyhedra τ ∈ Π with x ∈ τ and σ i ∈ Π, i ∈ I, such that σ i τ , σ i ⊂ U and x i ∈ σ i . If X is Euclidean and of pure dimension, and U is balanced, a convex combination in U is balanced if it is polyhedral and, with notation as above and setting k = dim(τ ) + 1, satisfies the following conditions: (1) the polyhedra σ i , i ∈ I, are the different polyhedra in Π(k) having τ as a face, (2) there is a β U -positive Minkowski weight c ∈ M k (Π| U ) (Definition 4.20) such that ν i d(x i , τ ) = c(σ i ), i ∈ I, where d(x i , τ ) denotes the distance between the point ι(x i ) and the affine subspace ι τ (H τ ) of N .
We next give examples illustrating the distinction between the different notions of convex combination.
Then (x, (x 1 ), (ν 1 )) is a convex combination since ι(x) = ι(x 1 ) = p and so we have that 1 i=1 ν i ι(x i ) = ι(x). However, this convex combination is not polyhedral: there is no polyhedral complex on X such that x 1 lies in a polyhedron with a face containing the point x.
This is a polyhedral convex combination for the polyhedral complex Π in Example 4.17: we have that x ∈ τ and x i ∈ σ i , i = 1, 2, and so 2 i=1 ν i ι(x i ) = 0 = ι(x). This polyhedral convex combination is not balanced: setting ν 3 = 0, the vectors The basic example of balanced convex combination arises when the β U -positive Minkowski cycle in Definition 5.1 is the balancing condition itself.

Figure 5. A balanced convex combination
Example 5.3. Suppose that X is Euclidean, of pure dimension n and balanced, and let Π be a polyhedral complex on X with balancing condition b. For τ ∈ Π(n − 1) let σ i , i = 1, . . . , r, be the different polyhedra in Π(n) having τ as a facet and set Let x ∈ relint(τ ) and (x, (y i ) 1≤i≤r , (ν i ) 1≤i≤r ) a convex combination contained in relint(τ ). Let ε > 0 so that the point Remark 5.4. The construction in Example 5.3 provides balanced convex combinations centered at any point in the relative interior of a polyhedron of dimension n − 1. Considering arbitrary β U -positive Minkowski weights as in Definition 5.1 allows to produce balanced convex combinations centered at any point of U .
Definition 5.5. Let f : U → R be a function. Then f is strongly concave if for every convex combination in U , the inequality holds. It is locally strongly concave if there is an open covering U = i U i such that f | Ui is strongly concave for every i.
The function f is concave if the inequality (5.6) is satisfied for all polyhedral convex combinations in U .
If X is a Euclidean polyhedral space of pure dimension and U is balanced, then f is weakly concave when this inequality is satisfied for all balanced convex combinations in U .
The next result shows that Definition 5.5 generalizes the notions of concavity for piecewise affine functions from Definitions 4.2 and 4.6.
Proposition 5.7. Let f be a piecewise affine function on U . Then f is strongly concave in the sense of Definition 4.2 (respectively concave, weakly concave in the sense of Definition 4.6) if and only if it is strongly concave (respectively concave, weakly concave) in the sense of Definition 5.5.
Proof. We prove separately each implication. Strong concavity in the sense of Definition 4.2 implies strong concavity in the sense of Definition 5.5: Let f be strongly concave in the sense of Definition 4.2. Then there is a function that is concave in the sense of Definition 4.1 and such that f = f • ι| U . Since f takes only finite values, then f also takes only finite values on ι(U ). Given a convex combination (x, (x i ) i∈I , (ν i ) i∈I ) in U , the concavity of f and this finiteness condition imply that and so f is strongly concave in the sense of Definition 5.5. Strong concavity in the sense of Definition 5.5 implies strong concavity in the sense of Definition 4.2: Let now f be strongly concave in the sense of Definition 5.5. Let g : ι(U ) → R be the function defined, for y ∈ ι(U ), by for any x ∈ U with ι(x) = y. It is well-defined, because for x 1 , x 2 ∈ U such that ι(x 1 ) = ι(x 2 ) we have that (x 1 , (x 2 ), (1)) is a convex combination in U and so Consider the function f : H → R ∪ {±∞} defined, for y ∈ H, by the supremum being over the collections of points (y i ) i∈I in ι(U ) and of nonnegative real numbers (ν i ) i∈I with i∈I ν i = 1 and i∈I ν i y i = y. In particular, if y does not belong to the convex hull of ι X (U ) then f (y) = −∞. By construction, the hypograph of f coincides with the convex hull of the subset {(y, z) | y ∈ ι(U ), z ≤ g(y)} of H × R. In particular, this hypograph is a convex set and so f is concave in the the sense of Definition 4.1.
We claim that f = f • ι| U . To prove this, let x ∈ U and set y = ι(x). On the one hand, let (y i ) i∈I and (ν i ) i∈I as in (5.8) and write y i = ι(x i ) with x i ∈ U , i ∈ I. Then (x, (x i ) i∈I , (ν i ) i∈I ) is a convex combination in U and so which implies that f (y) ≤ f (x). On the other hand, choosing the collections (y) and (1) in the definition of f in (5.8), we deduce that and so f (y) = f (x). Hence f = f • ι| U and so f is strongly concave in the sense of Definition 4.2. Concavity in the sense of Definition 4.6 implies concavity in the sense of Definition 5.5: Now suppose that f is concave in the sense of Definition 4.6 and consider a polyhedral convex combination (x, (x i ) i∈I , (ν i∈I )) in U . By definition, there is a polyhedral complex Π on X and polyhedra τ ∈ Π with x ∈ τ and σ i ∈ Π, i ∈ I, such that σ i τ , σ i ⊂ U and x i ∈ σ i . Choose a subdivision Π of Π where f is defined and such that x is a vertex of Π | U and, for each i ∈ I, there is a segment ρ i in Π | U having x as a vertex and pointing in the direction of x i from x. Choose also ε > 0 such that the point lies in ρ i . Let V ⊂ U be an open neighborhood of x such that Π | V (0) = {x} and c the positive 1-dimensional weight on Π | V given, for ρ ∈ Π | V , by the sum being over the indexes i ∈ I such that ρ i = ρ. We have that and so c ∈ M + 1 (Π | V ). By Proposition 4.12, (f · c) ({x}) ≥ 0, and so the formula for the product in (3.11) implies that By Corollary 4.24, for each i ∈ I the piecewise affine function f is convex on σ i in the usual sense and so f ( , proving that f is concave in the sense of Definition 5.5. Concavity in the sense of Definition 5.5 implies concavity in the sense of Definition 4.6: Suppose that f is concave in the sense of Definition 5.5. Let Π be a polyhedral complex on X where f is defined, V ⊂ U an open subset, k ∈ Z ≥0 and c ∈ M + k (Π| V ). For each τ ∈ Π| V (k − 1) let σ i , i ∈ I, be the polyhedra of Π| V (k) having τ as a face and set S = i∈I c(σ i ).
If S = 0 then c(σ i ) = 0 for all i ∈ I because c is positive, and therefore (f · c)(τ ) = 0 in this case. Else S > 0, and then we choose x ∈ relint(τ ) and ε > 0 so that for each i ∈ I, the point Then (x, (x i ) i∈I , (c(σ i )/S) i∈I ) is a polyhedral convex combination in V and so The formula in (3.11) then implies that We deduce that f ·c ∈ M + k−1 (Π| V ) and so Proposition 4.12 implies that f is concave in the sense of Definition 4.6. Weak concavity in the sense of Definition 4.6 implies weak concavity in the sense of Definition 5.5 Suppose now that f is weakly concave in the sense of Definition 4.6 and let (x, (x i ) i∈I , (ν i ) i∈I ) be a balanced convex combination as in Definition 5.1. With notation as in that latter definition, let Π be a subdivision of Π where f is defined and choose a polyhedron τ ∈ Π (k − 1) with x ∈ τ ⊂ τ . For each i ∈ I there is a unique σ i ∈ Π (k) with τ ≺ σ i and σ i ⊂ σ i . Consider the subset K = i σ i and let g : K → R be the unique function such that the restriction g| σi is affine and agrees with f in the smaller polyhedra σ i , that is for all i. Since x ∈ τ ⊂ σ i for all i, we have that g(x) = f (x). By Corollary 4.24 we have that f is concave on σ i in the usual sense, and so g(y) ≥ f (y) for all y ∈ K. Moreover We deduce that f (x) = g(x) ≥ i∈I ν i g(x i ) ≥ i∈I ν i f (x i ), and so f is weakly concave in the sense of Definition 5.5.
Weak concavity in the sense of Definition 5.5 implies weak concavity in the sense of Definition 4.6: Finally assume that f is weakly concave in the sense of Definition 5.5. Let Π be a polyhedral complex on X where f is defined and denote by b U the balancing condition on Π| U .
For each τ ∈ Π| U (n − 1) let σ i , i ∈ I, be the maximal polyhedra of Π having τ as a facet and set S = i∈I b U (σ i ). Choose x ∈ relint(τ ) and ε > 0 so that, for each i ∈ I, the point and so f is weakly concave in the sense of Definition 4.6.
The next result extends Corollary 4.24 to concave functions that are not necessarily piecewise affine.
Proposition 5.10. Let X be a Euclidean polyhedral space of pure dimension, U a balanced open subset of X, and f a weakly concave function on U . Let Π be a polyhedral complex on X and σ ∈ Π a polyhedron contained in U . Then the restriction f | σ is concave in the usual sense.
Proof. We assume without loss of generality that σ is of maximal dimension. Let x, y ∈ σ be different points and 0 < t < 1 a real number, and set z = t x + (1 − t) y. Since ι is injective on σ, we have that ι(x) = ι(y).
Consider the function g : H → R defined by g (u) = min(0, ι(z) − ι(y), u − ι(z) ) and set g = g • ι. This is a strongly concave piecewise affine function that takes the value 0 at x and at z, and is strictly negative at y. Let S(Π, g) be the subdivision of Π associated to g as in (4.32) and denote by b U the pullback to this subdivision of the balancing condition on U . In this subdivision, σ gets broken into two polyhedra of maximal dimension σ 1 and σ 2 such that x ∈ σ 1 , y ∈ σ 2 and z ∈ σ 1 ∩σ 2 . Moreover Since t d(x, z) = t (1−t) d(x, y) = (1−t) d(y, z) and the points x, z, y are aligned, the triple (z, (x, y), (t, 1 − t)) is a balanced convex linear combination in U . Since f is weakly concave on U , and so f | σ is concave, as stated.
As in the classical case, the three notions of concavity are stable under sums, product by a positive number and taking infimum. The next proposition follows directly from the definitions.
Proposition 5.11. Let f 1 and f 2 be strongly concave (respectively concave, weakly concave) functions on U and α ∈ R ≥0 . Then αf 1 and f 1 + f 2 are also strongly concave (respectively concave, weakly concave) functions on U .
Proof. Set for short f = inf λ∈Λ f λ . Suppose that each function f λ is strongly concave and consider a convex combination (x, (x i ) i∈I , (ν i ) i∈I ) in U . We have that which shows that f is strongly concave. The proofs for concave and weakly concave functions are done in a similar way.
We next show that the conditions of being concave and weakly concave are local.
Proposition 5.13. Let f : U → R be a function and U = λ U λ an open covering. Then f is concave (respectively weakly concave) if and only if f | U λ is concave (respectively weakly concave) for all λ.
Proof. We give the proof for concave functions. The case of weakly concave functions can be treated similarly, by adding the condition that the considered polyhedral convex combination are balanced. If f is concave on U then clearly it is also concave on U λ for all λ, and so we only have to consider the reverse implication. Hence we suppose that f | U λ is concave for all λ. Let then s = (x, (x i ) i∈I , (ν i ) i∈I ) be a polyhedral convex combination in U , and τ and σ i , i ∈ I, the polyhedra appearing in the definition of such a convex combination. Since the classical notion of concavity is local and each polyhedron σ i is contained in U , Proposition 5.10 implies that f is concave in the usual sense on σ i . As the segment x x i is contained in σ i , this implies that f is concave in the usual sense on x x i .
For ε ∈ [0, 1] the point x + ε (x i − x) lies in U for all i ∈ I, and so the triple is also a polyhedral convex combination in U . Let λ such that x ∈ U λ . Since U λ is open, there is 0 < ε ≤ 1 such that ε s is a polyhedral convex combination in U λ . Since f is concave on U λ in the sense of Definition 5.5 and f is concave in the usual sense on x x i for each i ∈ I, then This readily implies that f (x) ≥ i ν i f (x i ) and so f is concave.
As shown in Example 4.3, the property of being strongly concave is not local. The argument in the proof of Proposition 5.13 relied on the fact that if s is a polyhedral convex combination, so is the triple ε s defined in (5.14). This property fails for arbitrary convex combinations, as in the case of that example.
Remark 5.15. An alternative approach to define concavity on polyhedral spaces would be in terms of double polars of cones of concave piecewise affine functions. More precisely, we say that a signed Radon measure µ on U with compact support is convex if for every concave piecewise affine function f on U the inequality (5.16) f dµ ≥ 0 is satisfied. If U is balanced, this measure µ is strongly convex if the inequality (5.16) is satisfied for every weakly concave piecewise affine function f on U . A function f : U → R is * -concave if the inequality (5.16) is satisfied for every convex measure µ, and it is weakly * -concave if the inequality is satisfied for every strongly convex measure µ. By Proposition 5.7, any polyhedral (respectively, balanced) convex combination gives rise to a discrete convex (respectively, strongly convex) measure, and so it is clear that being * -concave (respectively, being weakly * -concave) implies being concave (respectively, being weakly concave).
By the bipolar theorem, any * -concave function can be approximated by concave piecewise affine functions. By contrast, it is not clear yet whether the notion of being * -concave is local, or if the infimum of two * -concave functions is also *concave. If one can prove that any concave function can be approximated by concave piecewise affine functions, then every concave function would be * -concave and both definitions would agree. Similar considerations can be done concerning weakly concave and weakly * -concave. This is still an open question which we hope to continue studying.

Continuity properties
In this section we study the continuity properties of weakly concave functions on balanced open subsets of polyhedral spaces. We denote by X a Euclidean polyhedral space of pure dimension n and U ⊂ X an open subset that, unless otherwise stated, will be assumed to be balanced, with balancing condition β U .
Before discussing the different continuity properties we prove a technical lemma.
Lemma 6.1. Let y ∈ U and let Π be a polyhedral complex in X such that the set σ is a neighborhood of y. Then, for each point x 0 ∈ V there is a balanced convex combination (y, (x i ) 0≤i≤r , (ν i ) 0≤i≤r ) centered at y, with x 0 as one of the points of the combination and ν 0 > 0.
Proof. Let σ be the minimal polyhedron of Π containing both x 0 and y. Consider the segment L = y x 0 and choose linear functions j , j = 1, . . . , m, on N X defining the image ι X (L) as the subset of points x ∈ H X such that j (x) ≥ 0 for all j. Consider the concave piecewise affine function g : H X → R defined, for x ∈ H X , by g (x) = min(0, 1 (x), . . . , m (x)) and set g = g • ι X . This is a strongly concave piecewise affine function on X and it determines a subdivision Π := S(Π, g) of Π, as in (4.32).
By construction {y} ∈ Π (0) and there is a 1-dimensional polyhedron τ 0 ∈ Π (1) having y and x 0 as vertices. Let τ i , i = 1, . . . , r, be the other 1-dimensional polyhedra of Π (1) having y as a vertex. Let b U be the Minkowski weight on Π defining the balancing condition β U on on U and consider the 1-dimensional β U -positive Minkowski weight c = g n−1 · b U . By Proposition 4.30 applied to the polyhedron σ and the concave piecewise affine function g| σ , we deduce that c(τ 0 ) > 0.
For i = 1, . . . , r set x i for the vertex of τ i different from y, and put Then the triple (y, (x i ) 0≤i≤r , (ν i ) 0≤i≤r ) is a balanced convex combination on U satisfying the conditions of the lemma.
The next result is the analogue of the fact that a concave function on an open subset of R n is continuous [Roc72, Theorem 10.1].
Theorem 6.2. Let f be a weakly concave function on U . Then f is continuous.
Proof. Let y ∈ X and choose a polyhedral complex Π on X such that the union of the polyhedra σ ∈ Π with y ∈ σ and σ ⊂ U is a neighborhood of y. To prove that f is continuous at y, it is enough to prove that for each such σ, the restriction f | σ is continuous at y.
By Proposition 5.10, f | σ is concave. Let f = cl(f | σ ) be its closure, that is, the upper semicontinuous hull of the concave function f | σ , see [Roc72,§7] for the analogous notion for convex functions. The function f is concave and, by [Roc72, Theorem 10.2], it is continuous and agrees with f | σ in the relative interior of σ. Hence, to prove the continuity of f | σ at y it is enough to show that f | σ (y) = f (y).
For x 0 ∈ relint(σ) let Π be the subdivision of Π and (y, (x i ) 0≤i≤r , (ν i ) 0≤i≤r ) the balanced convex combination given by Lemma 6.1. For each i write v i = x i − y for the vector spanning the segment τ i . The weak concavity of f then implies that for every 0 < η ≤ 1, By Proposition 5.10, the restriction of f to each τ i is concave and so, by [Roc72, Theorem 10.2], it is lower semicontinuous. Hence given ε > 0 there is η 0 > 0 such that for each 0 < η < η 0 and each 0 ≤ i ≤ r we have that Combining the inequalities (6.3) and (6.4) and the fact that r i=0 ν i = 1, we deduce that, for 0 < η ≤ η 0 , Therefore f | τ0 is upper semicontinuous at y and so it is continuous at this point, completing the proof.
Corollary 6.5. Suppose that X is a locally balanceable polyhedral space, U ⊂ X an open subset that is not necessarily balanced, and f a concave function on U . Then f is continuous. Since the condition of being continuous is local, it is enough to show that f | Ui is continuous for each i. Since f is concave, the restriction f | Ui is weakly concave with respect to any balancing condition on U i and, by Theorem 6.2, it is continuous.
Example 6.6. The condition of being locally balanceable in Corollary 6.5 is necessary for the validity of its conclusion. For instance, the ray R ≥0 is not locally balanceable (Example 3.28) and the function f : R ≥0 → R defined by f (x) = 1 for x > 0 and f (0) = 0 is concave but not continuous. A consequence of Theorem 6.2 is that weakly concave functions satisfy a minimum principle. The next result extends [Roc72,Theorem 32.1] to balanced open subsets of polyhedral spaces.
Proposition 6.8. Suppose that U is connected and let f be a weakly concave function on U . If there is a point y ∈ U such that f (y) = inf x∈U f (x), then f is constant.
Proof. Assume that there is a point y ∈ U realizing the infimum of f on U and set m = f (y). By Theorem 6.2, f is continuous and so f −1 (m) is a nonempty closed subset of U . Since U is connected, to complete the proof it suffices to show that this subset is also is open.
Choose a polyhedral complex Π on X such that every σ ∈ Π containing the point y, is contained in U . Hence the subset V := σ y σ is a neighborhood of y contained in U . By Lemma 6.1, for each point x 0 ∈ V there is a balanced convex combination (y, (x i ) 0≤i≤r , (ν i ) 0≤i≤r ) with ν 0 > 0. Since f is weakly concave, we have that Moreover, since with the convention that, if V consists of a single point, then For a polytope τ in X, the Euclidean structure of X induces a metric on τ . Given a function f : τ → R, we denote by the Lipschitz constant of f on τ with respect to this metric. Following [BFJ14,§2] and [BFJ16, Appendix A], given two points u, v ∈ τ , we also denote by the derivative of f at v in the direction of u, whenever the limit exists. This holds when f is concave, in which case this derivative is as an element of R ∪ {+∞}.
Lemma 6.9. There exists a constant C > 0 depending only on τ such that, for each continuous concave function f : τ → R and each subset A ⊂ τ such that τ \ A has Lebesgue measure zero, the following estimate holds (6.10) u v f Figure 6. The derivative of f at v in the direction of u Proof. If f is Lipschitz continuous, this is [BFJ16, Lemma A.2]. Otherwise, the argument in the proof of this result also shows that sup v,e |D v f (e)| = +∞, and so the inequalities in (6.10) are also satisfied in this case.
For a function f : τ → R we set Lemma 6.11. There is a constant C > 0 depending only on τ such that, for each continuous concave function f : τ → R, the supremum being over the facets F of τ , the points v ∈ relint(F ) and the vertices e of τ that are not contained in F .
Our next task is to estimate the derivatives D v f (e) that appear in Lemma 6.11 for a polytope in a balanced open subset.
Lemma 6.13. Let Π be a polyhedral complex on X such that Π| U is finite and Π is regular on U . Then for every polytope τ ∈ Π contained in U there is a constant C > 0 such that for every weakly concave function f : U → R, Proof. By possibly shrinking the open subset U , we can assume without loss of generality that its closure is compact.
We prove the result by induction on the dimension of τ . If dim(τ ) = 0 the result is clear. So we assume that dim(τ ) = k ≥ 1 and that the result is true for every polytope of smaller dimension. Let F be a facet of τ , v ∈ relint(F ) and e a vertex of τ not contained in F . By Proposition 5.10, f is concave on τ in the usual sense. This implies that D v (e) ≥ f (e) − f (v) and so (6.14) Let τ and σ i , i = 1, . . . , r, be the k-dimensional polyhedra of Π containing F . Write v 0 = v τ \F and v i = v σi\F , i = 1, . . . , r. Put e 0 = e and for each i, pick a vertex e i of σ i that is not contained in F . Then for i = 0, . . . , r write with α i > 0 and v F,i ∈ N F , the vector space associated to F (Definition 2.1).
Let g be a strictly concave function on Π| U (Definition 4.25), and consider the β U -positive k-dimensional Minkowski weight c = g n−k · b U . Set c 0 = c(τ ) and c i = c(σ i ), i = 1, . . . , r. Since c is a Minkowski weight, Denote this last vector by −v F , which implies pi=31415 that v F + r i=0 ci αi v F,i = 0. Choose λ > 0 small enough so that p F := v + λ v F ∈ F and p i := v + λ c i α i (e i − v) ∈ V, i = 0, . . . , r.
Then the convex combination in V v, (p F , p 0 , . . . , p k ), 1 r + 2 , . . . , 1 r + 2 is balanced. Since f is weakly concave, we deduce that Using the inductive hypothesis on F , Lemma 6.9 and the analogues of the inequalities (6.14) for σ i ∩ V , i = 1, . . . , r, we deduce that In the last inequalities, the α i 's depend on v, but they can be extended to a continuous non-vanishing function on the compact set F . Therefore they attain a strictly positive minimum and a finite maximum. Similarly, v F depends on v, but again can be extended to a continuous function on F , where it attains a maximum. Joining this discussion with the inequality (6.14), there is a constant C τ such that |D v (e))| ≤ C τ |f C 0 (V ) , and so the result follows from Lemma 6.11. We next discuss metric structures on polyhedral spaces. Definition 6.15. A polyhedral metric on X is a metric induced by an injective morphism of polyhedral spaces of X into a Euclidean vector space. For a compact subset K ⊂ X, a polyhedral metric on K is the restriction to this subset of a polyhedral metric on a polyhedral subspace of X containing it.
Every compact subset of a polyhedral space admits a polyhedral metric and all of these metrics are equivalent, as the next result shows.
Lemma 6.16. Let K ⊂ X be a compact subset. Then K admits a polyhedral metric, and for any pair d, d of these metrics on K, there is a constant C > 0 such that, for all x, y ∈ K, (6.17) C −1 d(x, y) ≤ d (x, y) ≤ C d(x, y).
Proof. Let Π be a simplicial polyhedral complex on X, that is, a polyhedral complex such that its polyhedra are simplices. Then Π 0 = {σ ∈ Π | σ ∩ K = ∅} is a finite collection of simplices of Π, and X 0 = σ∈Π0 σ is a polyhedral subspace of X containing K. Let V be the set of vertices of Π 0 and consider the embedding X 0 −→ R V that sends each vertex v ∈ V to the corresponding vector e v in the standard basis of R V and that is affine on the simplices of X 0 . Then the Euclidean metric of R V induces a polyhedral metric on X 0 and, a fortiori on K. By Theorem [LV77, Theorem 2.18] any polyhedral map between compact polyhedral spaces with polyhedral metrics is Lipschitz. This implies the existence of the constant C satisfying the inequalities (6.17).
Theorem 6.18. Let K ⊂ U be a compact subset and d a polyhedral metric on it. Then there is a constant C > 0 such that, for every weakly concave function f on U , Proof. Without loss of generality we can assume that the closure of U is compact and, by Lemma 6.16, that the polyhedral metric is defined on the closure of U . Let X 0 be a polyhedral subspace of X containing U and X 0 → N an injective morphism of polyhedral spaces into a Euclidean vector space inducing the polyhedral metric d on U . Let Π 0 be a polyhedral complex on X 0 , such that every polyhedron σ ∈ Π 0 with σ ∩ K = ∅ is contained in U . By Theorem 4.34 we can assume that Π 0 is regular on U . Set B = min{d(σ, σ ) | σ, σ ∈ Π 0 with σ ∩ K, σ ∩ K = ∅ and σ ∩ σ = ∅} > 0. Let x, y ∈ K. If there is σ ∈ Π 0 such that x, y ∈ σ then where Lip σ (f ) denotes the Lipschitz constant of f with respect to the metric on σ induced by the Euclidean structure of X, and C 0 > 0 depends only on X and d.
As a consequence we obtain the following stronger version of Theorem 6.2, extending [Roc72, Theorem 10.4].
Corollary 6.22. Let f be a weakly concave function on U . Then f is Lipschitz continuous on any compact subset of U .
The following is the analogue of [Roc72, Theorem 10.6] for weakly concave functions on a balanced open subset of a polyhedral space.
Theorem 6.23. Let {f i } i∈I be a family of weakly concave functions on U and C , C ⊂ U dense subsets such that inf i∈I f i (x) and sup i∈I f i (x) are finite for every x ∈ C and x ∈ C , respectively. Then {f i } i∈I is uniformly bounded and equi-Lipschitz on any compact subset of U .
Proof. Let K ⊂ U be a compact subset and V ⊂ U an open subset with compact closure containing K. By Theorem 6.18, if the family {f i } i∈I is uniformly bounded on V then it is equi-Lipschitz in K. So we only need to prove that this family is uniformly bounded on V .
For x ∈ U set f (x) = inf i f i (x) ∈ R ∪ {−∞}. Let Π be a polyhedral complex on X. For every τ ∈ Π(n), the functions f i | τ are concave in the classical sense and since C is dense in τ , [Roc72,Theorem 10.6] implies that f (x) > −∞ for x ∈ relint(τ ).
For x ∈ X, there is a balanced convex combination (x, (x i ), (ν i )) such that the points x i belong to the relative interior of a polyhedron in Π(n). Therefore By Proposition 5.12, f is a weakly concave function on U and by Theorem 6.2 it is continuous on U . Hence f is uniformly bounded in K, which implies that the family {f i} i∈I is uniformly bounded below in K.
Making K bigger and Π finer, we can assume that K is a finite union of polyhedra of Π of maximal dimension contained in V . For each τ ∈ Π(n) with τ ⊂ K there is a point x ∈ C ∩ relint(τ ). We then follow the proof of [Roc72, Theorem 10.6]. Choose ε such that x + ε B ⊂ τ , where B denotes the unit ball. Since x ∈ C , there is α ∈ R such that f i (x) ≤ α for all i. Moreover, since we have already proved the existence of a uniform lower bound, there is also β ∈ R such that f (z) ≥ β for all z ∈ τ .
Then z ∈ x + ε B ⊂ τ and x = (1 − λ)z + λy. Hence, by concavity, Thus Note that the term on the right hand side is a continuous function with respect to y on the compact set τ . Therefore there is a constant γ τ such that for all i ∈ I and y ∈ τ we have that f i (y) ≤ γ τ . Since K is compact, the number of maximal polyhedra contained in K is finite. Hence, we obtain a uniform upper bound on the whole of K which concludes the proof.
Theorem 6.23 has the following important consequence, which is an analogue of [Roc72, Theorem 10.8] on polyhedral spaces.
Theorem 6.24. Let (f i ) i≥0 be a sequence of weakly concave functions on U and C ⊂ U a dense subset such that, for all x ∈ C, the sequence f i (x) converges to a number f (x) ∈ R. Then the sequence (f i ) i≥0 converges to a function f on the whole U , the limit function f is weakly concave, and the convergence is uniform on compact subsets.
Proof. By Theorem 6.23, the family (f i ) i≥0 is equi-Lipschitz on each compact subset of U . Therefore the statement can be proven as in [Roc72,Theorem 10.8].
On the same spirit, other results of [Roc72, Chapter 10] can be translated to the current setting. For instance we particularize the analogue of [Roc72, Theorem 10.7]. It is a consequence of theorems 6.18 and 6.23, its proof is similar to the one in loc. cit. and is left to the reader.
Theorem 6.25. Let T be a locally compact topological space. If f : U × T → R is a function such that f (·, t) is weakly concave for each t ∈ T and f (x, ·) is continuous for each x ∈ U , then f is continuous on U × T .