Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T18:28:15.047Z Has data issue: false hasContentIssue false

Extension of order-preserving maps on a cone

Published online by Cambridge University Press:  12 July 2007

Andrew D. Burbanks
Affiliation:
School of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK
Roger D. Nussbaum
Affiliation:
Department of Mathematics, Hill Center, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ 08854-8019, USA
Colin T. Sparrow
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK

Abstract

We examine the problem of extending, in a natural way, order-preserving maps that are defined on the interior of a closed cone K1 (taking values in another closed cone K2) to the whole of K1.

We give conditions, in considerable generality (for cones in both finite- and infinite-dimensional spaces), under which a natural extension exists and is continuous. We also give weaker conditions under which the extension is upper semi-continuous.

Maps f defined on the interior of the non-negative cone K in RN, which are both homogeneous of degree 1 and order preserving, are non-expanding in the Thompson metric, and hence continuous. As a corollary of our main results, we deduce that all such maps have a homogeneous order-preserving continuous extension to the whole cone. It follows that such an extension must have at least one eigenvector in K – {0}. In the case where the cycle time χ(f) of the original map does not exist, such eigenvectors must lie in ∂K – {0}.

We conclude with some discussions and applications to operator-valued means. We also extend our results to an ‘intermediate’ situation, which arises in some important application areas, particularly in the construction of diffusions on certain fractals via maps defined on the interior of cones of Dirichlet forms.

Type
Research Article
Copyright
Copyright © Royal Society of Edinburgh 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)