Next Article in Journal
Role of Bi-Directional Migration in Two Similar Types of Ecosystems
Next Article in Special Issue
Chaotic Itinerancy in Random Dynamical System Related to Associative Memory Models
Previous Article in Journal
Forecast Combinations in the Presence of Structural Breaks: Evidence from U.S. Equity Markets
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone

by
Stéphane Chrétien
1,* and
Juan-Pablo Ortega
2
1
National Physical Laboratory, Hampton Road, Teddinton TW11 0LW, UK
2
Faculty of Mathematics and Statistics, University of St. Gallen, CH-9000 St. Gallen, Switzerland
*
Author to whom correspondence should be addressed.
Mathematics 2018, 6(3), 35; https://doi.org/10.3390/math6030035
Submission received: 11 January 2018 / Revised: 18 February 2018 / Accepted: 19 February 2018 / Published: 2 March 2018

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 V be a topological vector space and C a closed convex cone inside V enjoying the property that C C = . Then, C defines a partial ordering “⪯” by setting
f g g f C { 0 } .
Using this ordering, the Hilbert semi-metric Θ on C is given by
Θ ( f , g ) = log β ( f , g ) α ( f , g ) ,
where
α ( f , g ) = sup { λ R + λ f g } ,
and
β ( f , g ) = inf { μ R + g μ f }
and α = 0 and β = + if the corresponding sets are empty. In the sequel, we will focus on the case where V is the space of continuous integrable functions on R n 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 C be a cone in a vector space V and K be a cone in a vector space W . If L : V W is a linear mapping with L ( C ) K and projective diameter Δ ( L ) = sup x , y C , L ( x ) K L ( y ) d ( L x , L y ) . Then
inf x C y C d ( L x , L y ) / d ( x , y ) tanh 1 4 Δ ( L )
where tanh ( ) = 1 .
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 V is the space L 1 ( [ 0 , 1 ] ) of integrable functions of the interval [ 0 , 1 ] . The cone C in that result, which will be denoted in the sequel by C a , a > 0 , is given by
C a ( [ 0 , 1 ] ) = g C 0 ( [ 0 , 1 ] ) L 1 ( [ 0 , 1 ] ) x , y [ 0 , 1 ] g > 0 and g ( x ) g ( y ) e a | x y | .
In that setup, the Hilbert semi-metric is given by the following expression:
Θ ( f , g ) = ln sup x , y , u , v [ 0 , 1 ] e a | x y | 2 g ( y ) g ( x ) e a | u v | 2 f ( v ) f ( u ) e a | x y | 2 f ( y ) f ( x ) e a | u v | 2 g ( v ) g ( u ) .

2. Main Result

The cone we use in the sequel is different from the cone chosen by Liverani in [1].
C a ( R n ) = g C 0 ( R n ) L 1 ( R n ) x , y R n g > 0 and g ( x ) g ( y ) e a x y 2
This cone is chosen to contain densities with subgaussian tails on R n . Our main result is the following theorem.
Theorem 2.
Let Θ be the Hilbert semi-metric associated to C a , a > 0 ; when f, g C a ,
Θ ( f , g ) = ln sup x , y , u , v E e a x y 2 g ( y ) g ( x ) e a u v 2 f ( v ) f ( u ) e a x y 2 f ( y ) f ( x ) e a u v 2 g ( v ) g ( u ) .
Proof.
We have to compute α ( f , g ) and β ( f , g ) . Just as in the proof p. 247 of Lemma 2.2 of [2], we obtain
α ( f , g ) = min inf x R n g ( x ) f ( x ) ; inf x , y R n e a x y 2 g ( y ) g ( x ) e a x y 2 f ( y ) f ( x ) .
We now prove that
inf x R n g ( x ) f ( x ) inf x , y R n e a x y 2 g ( y ) g ( x ) e a x y 2 f ( y ) f ( x )
Let ( x n ) n N R n 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 ( x n ) n N has a bounded subsequence, denoted by ( x σ ( n ) ) n N . Moreover, by the Bolzano-Weierstrass Theorem we may assume without loss of generality that this subsequence converges to some limit point x . Fix ϵ > 0 and let N N be such that
g ( x σ ( n ) ) f ( x σ ( n ) ) inf x R n g ( x ) f ( x ) + ϵ
for all n N . Now take x such that
| sup n N e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( x ) | < + .
Then, we get
e a x x σ ( n ) 2 g ( x σ ( n ) ) g ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( x ) = e a x x σ ( n ) 2 g ( x σ ( n ) ) f ( x σ ( n ) ) f ( x σ ( n ) ) g ( x ) f ( x ) f ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( x ) e a x x σ ( n ) 2 g ( x ) f ( x ) f ( x σ ( n ) ) + ϵ g ( x ) f ( x ) f ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( x ) = g ( x ) f ( x ) + ϵ e a x x σ ( n ) 2 f ( x σ ( n ) ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( x ) .
Let n tend towards + , and obtain
e a x x 2 g ( x ) g ( x ) e a x x 2 f ( x ) f ( x ) g ( x ) f ( x ) + ϵ e a x x 2 f ( x ) e a x x 2 f ( x ) f ( x )
and the result follows by taking ϵ 0 due to the assumption of Equation (13) on x . The result is then easily seen to hold for all x by continuity.
Second case. In this case, x n x + . Consider the unit vector d n given by
d n = x n x x n x
and extract a convergent subsequence ( d σ ( n ) ) n N denoting its limit by d . Now take z δ = x δ d . Let us prove that
lim n + e a z δ x σ ( n ) 2 g ( x σ ( n ) ) g ( z δ ) e a z δ x σ ( n ) 2 f ( x σ ( n ) ) f ( z δ ) g ( z δ ) f ( z δ )
Letting δ tend towards zero will prove the desired result using continuity. As in the first case, one easily finds that for each ϵ > 0 there exists N N such that for all n N ,
e a z δ x σ ( n ) 2 g ( x σ ( n ) ) g ( z δ ) e a z δ x σ ( n ) 2 f ( x σ ( n ) ) f ( z δ ) g ( z δ ) f ( z δ ) + ϵ 1 1 f ( z δ ) e a z δ x σ ( n ) 2 f ( x σ ( n ) ) = g ( z δ ) f ( z δ ) + ϵ 1 1 f ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( z δ ) e a x x σ ( n ) 2 e a z δ x σ ( n ) 2 f ( x σ ( n ) ) .
Looking at this expression, we obviously wonder about the asymptotic behavior of
c n = f ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( z δ ) e a x x σ ( n ) 2 e a z δ x σ ( n ) 2 f ( x σ ( n ) ) .
For this purpose, first notice that since f belongs to C a , we have
f ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) 1 .
and
f ( z δ ) e a x x σ ( n ) 2 e a z δ x σ ( n ) 2 f ( x σ ( n ) ) e a x x σ ( n ) 2 e a x z δ 2 e a z δ x σ ( n ) 2
but
e a x x σ ( n ) 2 a z δ x σ ( n ) 2 + a x z δ 2 = e 2 a x x σ ( n ) x z δ ,
and since x n x + , we obtain that c n 0 as n + , implying that the value one is not an accumulation point. Using this, we may deduce from Equation (18) that
e a z δ x σ ( n ) 2 g ( x σ ( n ) ) g ( z δ ) e a z δ x σ ( n ) 2 f ( x σ ( n ) ) f ( z δ ) g ( z δ ) f ( z δ ) + ϵ .
Letting ϵ tend towards zero we obtain
inf n N e a z δ x σ ( n ) 2 g ( x σ ( n ) ) g ( z δ ) e a z δ x σ ( n ) 2 f ( x σ ( n ) ) f ( z δ ) g ( z δ ) f ( z δ ) .
Letting δ tend towards zero and using continuity, we finaly conclude that
inf n N e a x x σ ( n ) 2 g ( x σ ( n ) ) g ( x ) e a x x σ ( n ) 2 f ( x σ ( n ) ) f ( x ) g ( x ) f ( x ) ,
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

  1. Hilbert, D. Über die gerade Linie als kürzeste Verbindung zweier Punkte. Math. Ann. 1895, 46, 91–96. [Google Scholar] [CrossRef]
  2. Liverani, C. Decay of correlations. Ann. Math. 1995, 142, 239–301. [Google Scholar] [CrossRef]
  3. 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]
  4. Naud, F. Birkhoff cones, symbolic dynamics and spectrum of transfer operators. Discret. Contin. Dyn. Syst. 2004, 11, 581–598. [Google Scholar] [CrossRef]
  5. Bodnart, R.; Stettner, L. Asymptotics of controlled finite memory filters. Syst. Control Lett. 2002, 47, 181–190. [Google Scholar] [CrossRef]
  6. Di Masi, G.B.; Stettner, L. Ergodicity of hidden Markov models. Math. Control Signals Syst. 2005, 17, 269–296. [Google Scholar] [CrossRef]
  7. 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]
  8. Chen, Y.; Georgiou, T.; Pavon, M.; Tannenbaum, A. Relaxed Schroedinger bridges and robust network routing. arXiv, 2018; arXiv:1801.07852. [Google Scholar]
  9. Birkhoff, G. Extensions of Jentzsch’s theorem. Trans. Am. Math. Soc. 1957, 85, 219–227. [Google Scholar]
  10. 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]

Share and Cite

MDPI and ACS Style

Chrétien, S.; Ortega, J.-P. A Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone. Mathematics 2018, 6, 35. https://doi.org/10.3390/math6030035

AMA Style

Chrétien S, Ortega J-P. A Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone. Mathematics. 2018; 6(3):35. https://doi.org/10.3390/math6030035

Chicago/Turabian Style

Chrétien, Stéphane, and Juan-Pablo Ortega. 2018. "A Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone" Mathematics 6, no. 3: 35. https://doi.org/10.3390/math6030035

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop