Abstract
The Hilbert metric is a widely used tool for analysing the convergence of Markov processes and the ergodic properties of deterministic dynamical systems. A useful representation formula for the Hilbert metric was given by Liverani. The goal of the present paper is to extend this formula to the non-compact and multidimensional setting with a different cone, taylored for sub-Gaussian tails.
1. Introduction
Let be a topological vector space and a closed convex cone inside enjoying the property that . Then, defines a partial ordering “⪯” by setting
Using this ordering, the Hilbert semi-metric on is given by
where
and
and and if the corresponding sets are empty. In the sequel, we will focus on the case where is the space of continuous integrable functions on with Euclidean norm denoted by .
The Hilbert metric, originally introduced in [1], has been very useful in ergodic theory for deterministic dynamical systems [2,3,4], for the analysis and application of Markov Chains to control systems statistics and information theory [5,6,7]. Robust routing problems have also been studied using the Hilbert metric view point [8].
The first application of the Hilbert metric to the field of dynamical systems is Birkhoff’s approach to the Perron-Frobenius theorem [9]; see also [10]. The ground-breaking result of Birkhoff is the following.
Theorem 1.
Let be a cone in a vector space and be a cone in a vector space . If is a linear mapping with and projective diameter . Then
where .
Birkhoff’s theorem provides an elegant way to prove that certain maps between cones are contracts and therefore obtain existence and uniqueness for certain problems such as in Perron-Frobenius theory for positive operators.
The goal of this short note is to extend to the noncompact and multidimensional setting a useful formula for the Hilbert semi-metric which was previously given by Liverani [2] in the case in which is the space of integrable functions of the interval . The cone in that result, which will be denoted in the sequel by , , is given by
In that setup, the Hilbert semi-metric is given by the following expression:
2. Main Result
The cone we use in the sequel is different from the cone chosen by Liverani in [1].
This cone is chosen to contain densities with subgaussian tails on . Our main result is the following theorem.
Theorem 2.
Let Θ be the Hilbert semi-metric associated to , ; when f, ,
Proof.
We have to compute and . Just as in the proof p. 247 of Lemma 2.2 of [2], we obtain
We now prove that
Let be a minimizing sequence for the left hand side of Equation (11). We have to split the analysis into two cases.
First case. Assume that has a bounded subsequence, denoted by . Moreover, by the Bolzano-Weierstrass Theorem we may assume without loss of generality that this subsequence converges to some limit point . Fix and let be such that
for all . Now take such that
Then, we get
Let n tend towards , and obtain
and the result follows by taking due to the assumption of Equation (13) on . The result is then easily seen to hold for all by continuity.
Second case. In this case, . Consider the unit vector given by
and extract a convergent subsequence denoting its limit by . Now take . Let us prove that
Letting tend towards zero will prove the desired result using continuity. As in the first case, one easily finds that for each there exists such that for all ,
Looking at this expression, we obviously wonder about the asymptotic behavior of
For this purpose, first notice that since f belongs to , we have
and
but
and since , we obtain that as , implying that the value one is not an accumulation point. Using this, we may deduce from Equation (18) that
Letting tend towards zero we obtain
Letting tend towards zero and using continuity, we finaly conclude that
implying the desired result. ☐
3. Conclusions
In this short note, we presented an extension of a formula for the Hilbert metric obtained in [2] to the multidimensional and non-compact case for a different reference cone. Using the presented formula and Theorem 1, applications to the study of Markov Chain Monte Carlo methods and the analysis of the Sinkhorn algorithms for Optimal Transportation will be undertaken in future work.
Author Contributions
Stéphane Chrétien and Juan-Pablo Ortega worked equally on the content and on the writing of the paper.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Hilbert, D. Über die gerade Linie als kürzeste Verbindung zweier Punkte. Math. Ann. 1895, 46, 91–96. [Google Scholar] [CrossRef]
- Liverani, C. Decay of correlations. Ann. Math. 1995, 142, 239–301. [Google Scholar] [CrossRef]
- Baladi, V. Positive Transfer Operators and Decay of Correlations; Advanced Series in Nonlinear Dynamics, 16; World Scientific Publishing Co., Inc.: River Edge, NJ, USA, 2000. [Google Scholar]
- Naud, F. Birkhoff cones, symbolic dynamics and spectrum of transfer operators. Discret. Contin. Dyn. Syst. 2004, 11, 581–598. [Google Scholar] [CrossRef]
- Bodnart, R.; Stettner, L. Asymptotics of controlled finite memory filters. Syst. Control Lett. 2002, 47, 181–190. [Google Scholar] [CrossRef]
- Di Masi, G.B.; Stettner, L. Ergodicity of hidden Markov models. Math. Control Signals Syst. 2005, 17, 269–296. [Google Scholar] [CrossRef]
- Le Gland, F.; Oudjane, N. Stability and uniform approximation of nonlinear filters using the Hilbert metric and application to particle filters. Ann. Appl. Probab. 2004, 14, 144–187. [Google Scholar]
- Chen, Y.; Georgiou, T.; Pavon, M.; Tannenbaum, A. Relaxed Schroedinger bridges and robust network routing. arXiv, 2018; arXiv:1801.07852. [Google Scholar]
- Birkhoff, G. Extensions of Jentzsch’s theorem. Trans. Am. Math. Soc. 1957, 85, 219–227. [Google Scholar]
- Kohlberg, E.; Pratt, J. The contraction mapping approach to the Perron-Frobenius theory: Why Hilbert’s metric? Math. Oper. Res. 1982, 7, 198–210. [Google Scholar] [CrossRef]
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).