Large Deviations in Discrete-Time Renewal Theory
Marco Zamparo111Dipartimento Scienza Applicata e Tecnologia, Politecnico di Torino,
Corso Duca degli Abruzzi 24, Torino, I-10129, Italy
aaz E-mail: [email protected]
Abstract
We establish sharp large deviation principles for cumulative rewards
associated with a discrete-time renewal model, supposing that each
renewal involves a broad-sense reward taking values in a real
separable Banach space. The framework we consider is the pinning
model of polymers, which amounts to a Gibbs change of measure of a
classical renewal process and includes it as a special case. We first
tackle the problem in a constrained pinning model, where one of the
renewals occurs at a given time, by an argument based on convexity and
super-additivity. We then transfer the results to the original pinning
model by resorting to conditioning.
Keywords: Large deviations; Cramér’s theorem;
Renewal processes; Polymer pinning models; Renewal-reward processes;
Banach space valued random variables
Mathematics Subject Classification 2020: 60F10; 60K05; 60K35
1 Introduction
1.1 Renewals and Cramér’s theorem
Renewal models are widespread tools of probability, finding
application in Queueing Theory [1], Insurance
[2], and Finance [3] among others. A
renewal model describes some event that occurs at the renewal
times T1,T2,… involving the rewards X1,X2,…
respectively. If S1,S2,… are the waiting times for a
new occurrence of the event, then the renewal time Ti can be
expressed for each i≥1 in terms of waiting times as
Ti=S1+⋯+Si. This paper deals with cumulative rewards in
renewal models with waiting times taking discrete values and rewards
taking values in a Banach space. Specifically, we assume that the
waiting time and reward pairs (S1,X1),(S2,X2),… form an
independent and identically distributed sequence of random variables
on a probability space (Ω,F,P), the waiting times
being valued in {1,2,…}∪{∞} and the rewards being
valued in a real separable Banach space (X,∥⋅∥) equipped
with the Borel σ-field B(X). Any dependence between Xi
and Si is allowed. The cumulative reward by the integer time
t≥0 is the random variable Wt:=∑i≥1Xi\mathds1{Ti≤t}, which is measurable because X
is separable [4]. The stochastic process t↦Wt
is the so-called renewal-reward process or compound renewal
process, which plays an important role in applications
[1, 2, 3]. The strong law of large
numbers can be proved for a renewal-reward process under the optimal
hypotheses E[S1]<+∞ and E[∥X1∥]<+∞, E
denoting expectation with respect to the law P, by combining the
argument of renewal theory [1] with the classical
strong law of large numbers of Kolmogorov in separable Banach spaces
[4].
In this paper we characterize the large fluctuations of the cumulative
reward Wt by establishing large deviation principles that
generalize the Cramér’s theorem to discrete-time renewal models.
Cramér’s theorem describes the large fluctuations of non-random sums
of random variables, such as the total reward versus the number of
renewals n given by ∑i=1nXi. It involves the rate
function IC that maps each point w∈X in the extended real
number
IC(w):=supφ∈X⋆{φ(w)−lnE[eφ(X1)]},
where X⋆ is the topological dual of X. The following
sharp form of Cramér’s theorem has been obtained by Bahadur and
Zabell [5] through an argument based on convexity and
sub-additivity.
Cramér’s theorem**.**
The following conclusions hold:
- (a)
the function IC is lower semicontinuous and proper convex;
2. (b)
if G⊆X is open, then
[TABLE]
3. (c)
if F⊆X is compact, open convex, or closed convex,
then
[TABLE]
Furthermore, if X is finite-dimensional, then this bound is valid
for any closed set F provided that E[eξ∥X1∥]<+∞ for
some number ξ>0.
Earlier, Donsker and Varadhan [6] proved Cramér’s theorem
under the stringent exponential moment condition
E[eξ∥X1∥]<+∞ for all ξ>0. Importantly, they
showed that under this condition the upper bound in part (c) holds for
any closed set F even when X is infinite-dimensional.
Along with the use as stochastic processes, discrete-time renewal
models find application in Equilibrium Statistical Physics with a
different interpretation of the time coordinate. In particular, they
are employed in studying the phenomenon of polymer pinning, whereby a
polymer consisting of t≥1 monomers is pinned by a substrate at
the monomers T1,T2,… that represent renewed events along the
polymer chain [7, 8]. Supposing that the
monomer Ti contributes an energy −v(Si) provided that Ti≤t, v being a real function over {1,2,…}∪{∞}
called the potential, the state of the polymer is described by
the perturbed law Pt defined on the measurable space
(Ω,F) by the Gibbs change of measure
[TABLE]
where Ht:=∑i≥1v(Si)\mathds1{Ti≤t} is the Hamiltonian and the normalizing constant Zt:=E[eHt] is the
partition function. The model (Ω,F,Pt) is
called the pinning model (PM) and generalizes the original
renewal model corresponding to the potential v=0. The theory of
large deviations we develop in this paper is framed within the PM
supplied with the hypotheses of aperiodicity and extensivity. The
waiting time distribution p:=P[S1=⋅] is said to be
aperiodic if P[S1<∞]>0 and there is no proper
sublattice of {1,2,…} containing the support of p. We
point out that a generic p can be made aperiodic when
P[S1<∞]>0 by simply changing the time unit.
Assumption 1.1**.**
The waiting time distribution p is aperiodic.
We say that the potential v is extensive if there exists a
real number zo such that ev(s)p(s)≤ezos for all
s. For instance, any potential v with the property that
sups≥1{v(s)/s}<+∞ is extensive. Extensive potentials
are the only that serve Equilibrium Statistical Physics, where the
partition function
Zt≥E[eHt\mathds1{S1=t}]=ev(t)p(t) is expected to
grow exponentially in t in order to define the free energy
[7, 8].
Assumption 1.2**.**
The potential v is extensive.
Together with the PM we consider the constrained pinning model
(CPM) where the last monomer is always pinned by the substrate
[7, 8]. It corresponds to the law Ptc
defined on the measurable space (Ω,F) through the
change of measure
[TABLE]
where Ut:=∑i≥1\mathds1{Ti=t} is the renewal
indicator, which takes value 1 if t is a renewal and value 0
otherwise, and Ztc:=E[UteHt] is the partition function.
Our interest in the CPM is twofold. On the one hand, it turns out to
be an effective mathematical tool to tackle the PM. Indeed, we can
obtain a large deviation principle within the CPM by an argument based
on convexity and super-additivity, and then transfer it to the PM by
conditioning. The mentioned argument is a generalization of the
approach to Cramér’s theorem by Bahadur and Zabell [5],
which in turn can be traced back to the method of Ruelle [9]
and Lanford [10] for proving the existence of various
thermodynamic limits. On the other hand, the CPM is a significant
framework in itself because it is the mathematical skeleton of the
Poland-Scheraga model of DNA denaturation and of some relevant lattice
models of Statistical Mechanics, as discussed by the author in
Ref. [11] where use of the theory developed in the present
paper is made. These models are the cluster model of fluids proposed
by Fisher and Felderhof, the model of protein folding introduced
independently by Wako and Saitô first and Muñoz and Eaton later,
and the model of strained epitaxy considered by Tokar and Dreyssé.
The macroscopic observables that enter the thermodynamic description
of these systems turn out to be cumulative rewards corresponding to
rewards of the order of magnitude of the waiting times [11].
Before introducing our main results, we must say that the CPM is not
well-defined a priori. In fact, it may happen with full probability
that the time t is not a renewal, so that Ztc=0. However,
assumption 1.1 resulting in Ztc>0 for every sufficiently
large t settles the problem at least for all those t. To verify
this fact, we observe that aperiodicity of p entails that there
exist m coprime integers σ1,…,σm such that
p(σl)>0 for each l. The bound Ztc≥E[UteHt∏i=1n\mathds1{Si=si}]=∏i=1nev(si)p(si) if t=∑i=1nsi yields Ztc>0 whenever t
is an integer conical combination of σ1,…,σm. On
the other hand, the Frobenius number tc≥0 associated with
σ1,…,σm is finite since these integers are coprime
and by definition any t>tc can be expressed as an integer conical
combination of them. It follows that Ztc>0 for all t>tc.
1.2 Statement of main results
This section reports the main results of the paper. In the sequel,
assumptions 1.1 and 1.2 are tacitly supposed to be
satisfied and the topological dual X⋆ of X is
understood as a Banach space with the norm induced by ∥⋅∥.
Let z be the function that maps each linear functional
φ∈X⋆ in the extended real number z(φ)
defined by
[TABLE]
where the infimum over the empty set is customarily interpreted as
+∞. The following proposition puts this function into context
by relating z to the scaled cumulant generating function of Wt
within the CPM. According to this proposition, z(0) turns out to be
the free energy of the CPM [7, 8] and, more in
general, z(φ) can be regarded as the free energy of a CPM with
the (possibly non-extensive) potential
v+lnE[eφ(X1)∣S1=⋅].
Proposition 1.1**.**
The function z is proper convex and lower semicontinuous. The following limit holds
for every φ∈X⋆:
[TABLE]
Denoting the expectation with respect to the law Ptc by
Etc, proposition 1.1 entails that
limt↑∞(1/t)lnEtc[eφ(Wt)]=z(φ)−z(0)
for all φ∈X⋆, so that z−z(0) is exactly the scaled
cumulant generating function of Wt within the CPM. We stress that
the number z(0) is finite. Indeed, we have E[ev(S1)−ζS1\mathds1{S1<∞}]>1 for all sufficiently negative
ζ as P[S1<∞]>0 by assumption 1.1 and, at the
same time, E[ev(S1)−ζS1\mathds1{S1<∞}]=∑s≥1ev(s)−ζsp(s)≤1 for all ζ≥zo+ln2, zo being the number
introduced by assumption 1.2. The function z is finite
everywhere in the following case, which is relevant for Statistical
Mechanics as it comprises the macroscopic observables that enter the
thermodynamic description of the system [11].
Example 1.1**.**
The function z is finite everywhere if the reward X1 is dominated
by the waiting time S1 in the sense that ∥X1∥≤MS1 with
full probability for some constant M<+∞. This follows from the
facts that, for any given φ∈X⋆,
E[eφ(X1)+v(S1)−ζS1\mathds1{S1<∞}]≥E[e−M∥φ∥S1+v(S1)−ζS1\mathds1{S1<∞}]>1 for all sufficiently negative
ζ, as P[S1<∞]>0 by assumption 1.1, and
E[eφ(X1)+v(S1)−ζS1\mathds1{S1<∞}]≤∑s≥1eM∥φ∥s+v(s)−ζsp(s)≤1 for all ζ≥zo+M∥φ∥+ln2 with zo given by assumption 1.2.
We use the function z to construct a rate function. Let I be the
Fenchel-Legendre transform of z−z(0), which associates every point
w∈X with the extended real number I(w) given by
[TABLE]
The following theorem extends Cramér’s theorem to the cumulative
reward Wt with respect to the CPM and constitutes our first main
result. It is proved together with proposition
1.1 in Section 2.
Theorem 1.1**.**
The following conclusions hold:
- (a)
the function I is lower semicontinuous and proper convex;
2. (b)
if G⊆X is open, then
[TABLE]
3. (c)
if F⊆X is compact, open convex, closed convex, or
any convex set in B(X) when X is finite-dimensional, then
[TABLE]
Furthermore, if X is finite-dimensional, then this bound is valid
for any closed set F provided that E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ for some numbers
ζ≥0 and ξ>0.
The lower bound in part (b) and the upper bound in part (c) are
called, respectively, large deviation lower bound and large
deviation upper bound [12, 13]. When a lower
semicontinuous function I exists so that the large deviation lower
bound holds for each open set G and the large deviation upper bound
holds for each compact set F, then Wt is said to satisfy a weak large deviation principle (weak LDP) with rate function
I [12, 13]. If the large deviation upper bound
holds more generally for every closed set F, then Wt is said to
satisfy a full large deviation principle (full LDP)
[12, 13]. Theorem 1.1 states that the
cumulative reward Wt satisfies a weak LDP with rate function I
given by (1.2) within the CPM. If in addition X is
finite-dimensional and the exponential moment condition
E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ is fulfilled for some
ζ≥0 and ξ>0, as certainly occurs in example
1.1 for any ξ>0 and ζ>Mξ+zo, then Wt
satisfies a full LDP. Regarding the validity of a full LDP for
general infinite-dimensional Banach spaces X, finding sufficient
conditions is a harder problem that will be the focus of future
studies. Trying to sketch an analogy with Cramér’s theorem and the
work by Donsker and Varadhan [6], one should probably
investigate situations where there exists ζ≥0 such that
E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ for all ξ>0.
Let us move now to the PM, where there is no constraint on the last
monomer. At variance with the CPM, the scaled cumulant generating
function of Wt may not exist in the PM, but the following
proposition, which is proved in Section 3, shows
that at least some bounds hold true. Set
ℓi:=liminft↑∞(1/t)lnP[S1>t] and
ℓs:=limsupt↑∞(1/t)lnP[S1>t], and bear in
mind that −∞≤ℓi≤ℓs≤0.
Proposition 1.2**.**
The following bounds hold for all φ∈X⋆:
[TABLE]
Denoting by Et the expectation with respect to Pt,
proposition 1.2 entails that the limit
limt↑∞(1/t)lnEt[eφ(Wt)] exists, and
equals z(φ)∨ℓs−z(0)∨ℓs, if either ℓi=ℓs or
z(φ)≥ℓs. Thus, the scaled cumulant generating function of
Wt with respect to the PM is defined if either ℓi=ℓs, which
includes the case ℓs=−∞, or the condition
z(φ)≥ℓs>−∞ is met for all φ∈X⋆, as
in the following example.
Example 1.2**.**
The bound z(φ)≥ℓs>−∞ holds for all
φ∈X⋆ if P[S1<∞]=1,
liminfs↑∞v(s)/s=0, and there exists a positive real
function g on {1,2,…}∪{∞} such that
lims↑∞g(s)/s=0 and ∥X1∥≤g(S1) with full
probability. Indeed, given any ζ<ℓs, under these hypotheses
one can find ϵ>0 such that ζ+ϵ<ℓs≤0 and
−∥φ∥g(s)+v(s)≥−ϵs for all sufficiently large
s. Then, E[eφ(X1)+v(S1)−ζS1\mathds1{S1<∞}]≥∑s≥1e−∥φ∥g(s)+v(s)−ζsp(s)≥∑s>te−(ζ+ϵ)sp(s)≥e−(ζ+ϵ)tP[S1>t] for all sufficiently large t as
P[S1=∞]=0. It follows that
E[eφ(X1)+v(S1)−ζS1\mathds1{S1<∞}]=+∞ since
ζ+ϵ<ℓs, which results in z(φ)≥ℓs
according to definition (1.1).
In order to establish large deviation bounds with respect to the PM,
it is convenient to distinguish the case ℓs=−∞ from the case
ℓs>−∞. The following theorem, which represents our second
main result, provides weak and full LDPs for the renewal-reward
process t↦Wt with respect to the PM when ℓs=−∞.
The proof is given in Section 3.
Theorem 1.2**.**
Assume ℓs=−∞. The following conclusions hold:
- (a)
if G⊆X is open, then
[TABLE]
2. (b)
if F⊆X is compact, then
[TABLE]
If F⊆X is open convex, closed convex, or any convex set
in B(X) when X is finite-dimensional, then this bound is valid
whenever I(0)<+∞. Furthermore, if X is finite-dimensional,
then it is valid for any closed set F provided that
E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ for some numbers
ζ≥0 and ξ>0.
In general, the large deviation upper bound in part (b) cannot be
extended to convex sets if ℓs=−∞ and I(0)=+∞. Examples
with an open convex set and a closed convex set where such bound fails
will be shown at the end of Section 3.
The case ℓs>−∞ is more involved and calls for two rate
functions, Ii and Is, which are defined for each w∈X by
the formulas
[TABLE]
and
[TABLE]
The following theorem, which is our third and last main result,
provides large deviation bounds with respect to the PM when
ℓs>−∞. The proof is reported in Section
3.
Theorem 1.3**.**
Assume ℓs>−∞. The following conclusions hold:
- (a)
the functions Ii and Is are lower
semicontinuous and proper convex;
2. (b)
if G⊆X is open, then
[TABLE]
3. (c)
if F⊆X is compact, open convex, closed convex, or
any convex set in B(X) when X is finite-dimensional, then
[TABLE]
Furthermore, if X is finite-dimensional, then this bound is valid
for any closed set F provided that E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ for some numbers
ζ≥0 and ξ>0.
Theorem 1.3 states that the renewal-reward process t↦Wt satisfies a weak LDP with rate function Is within the PM
provided that Ii=Is. The exponential moment condition
E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ for some ζ≥0
and ξ>0 gives a full LDP with rate function Is when X is
finite-dimensional and Ii=Is. We have Ii=Is if ℓi=ℓs,
as expected in most applications, or if the condition
z(φ)≥ℓs is fulfilled for all φ∈X⋆, as
in example 1.2. In the latter case, Ii=Is=I.
1.3 Discussion
Large deviations for renewal-reward processes have been investigated
by many authors over the past decades. Their attention has been
focused on both discrete-time and continuous-time frameworks and, in
most cases, on rewards taking real values. In order to fix ideas, when
talking about renewal systems in the domain of time we think of a PM
with waiting times satisfying P[S1<∞]=1 and potential
v=0. An almost omnipresent hypothesis in previous works is the
Cramér condition E[eξ∥X1∥+ξS1]<+∞ for some
number ξ>0.
The simplest example of renewal-reward process has unit rewards and
corresponds to the counting renewal process t↦Nt:=∑i≥1\mathds1{Ti≤t}. Glynn and Whitt [14]
investigated the connection between LDPs of the inverse processes
t↦Nt and i↦Ti, providing a full LDP for Nt
under the Cramér condition. This condition was later relaxed by
Duffield and Whitt [18]. Jiang [20] studied
the large deviations of the extended counting renewal process
t↦∑i≥1\mathds1{Ti≤iαt} with
α∈[0,1) under the Cramér condition. Glynn and Whitt
[14] and Duffield and Whitt [18],
together with Puhalskii and Whitt [17], also
investigated the connection between sample-path LDPs of the
processes t↦Nt and i↦Ti under the Cramér
condition.
Starting from sample-path LDPs of inverse and compound processes,
Duffy and Rodgers-Lee [19] sketched a full LDP for
renewal-reward processes with real rewards by means of the contraction
principle under the stringent exponential moment condition
E[eξ∥X1∥+ξS1]<+∞ for all ξ>0. Some full LDPs
for real renewal-reward processes were later proposed by Macci
[15, 16] under existence and essentially smoothness
of the scaled cumulant generating function, which allow for an
application of the Gärtner-Ellis theorem [12, 13].
Essentially smoothness of the scaled cumulant generating function has
been recently relaxed by Borovkov and Mogulskii
[21, 22], which used the Cramér’s theorem to
establish a full LDP under the Cramér condition. Under the Cramér
condition, they [23, 24, 25]
have also obtained sample-path LDPs for real renewal-reward processes.
A different approach based on empirical measures has been considered
by Lefevere, Mariani, and Zambotti [26], which have
investigated large deviations for the empirical measures of forward
and backward recurrence times associated with a renewal process, and
have then derived by contraction a full LDP for renewal-rewards
processes with rewards determined by the waiting times: Xi:=f(Si)
for each i with a bounded real function f. Later, Mariani and
Zambotti [27] have developed a renewal version of
Sanov’s theorem by studying the empirical law of rewards that take
values in a generic Polish space. By appealing to the contraction
principle, this result could give a full LDP for a renewal-reward
process with rewards valued in a real separable Banach space, but only
provided that the strong exponential moment condition
E[eξ∥X1∥]<+∞ for all ξ>0 is satisfied as
discussed by Schied [28].
We conclude this brief review of previous contributions by mentioning
that a moderate deviation principle for real renewal-reward processes
was obtained by Tsirelson [29] under an exponential
moment condition. Exact asymptotics for the counting renewal process
and real renewal-reward processes has been investigated under the
Cramér condition and several additional smoothness hypotheses by
Serfozo [30], Kuczek and Crank [31], Chi
[32], and Borovkov and Mogulskii
[33, 34].
Previous works leave open the question of whether some large deviation
principles free from exponential moment conditions can be established
for renewal-reward processes, in the wake of the sharp version of
Cramér’s theorem demonstrated by Bahadur and Zabell [5]. The
present paper gives a positive answer to this question at the price of
restricting to the discrete-time framework. Indeed, through theorems
1.1, 1.2, and 1.3 we supply weak LDPs
and large deviation upper bounds for measurable convex sets that are
completely free from hypotheses. Moreover, when finite-dimensional
rewards are considered, and when P[S1<∞]=1 and v=0 to
make a comparison with previous studies, we provide full LDPs under
the exponential moment condition E[eξ∥X1∥−ζS1]<+∞ for some numbers ζ≥0 and ξ>0, which is
weaker than the Cramér condition E[eξ∥X1∥+ξS1]<+∞ for some ξ>0. For instance, rewards of example
1.1 that define the macroscopic observables of Statistical
Mechanics [11] always satisfy our weak exponential moment
condition, whereas in general they do not fulfill the Cramér
condition.
In order to drop exponential moment conditions, a novel approach with
respect to past methods had to be devised to tackle the problem, and a
new approach was suggested to us by the theory of polymer pinning
[7, 8]. This new approach is based on
super-additivity, but requires discrete time to be implemented. It
came from here the need to focus on the discrete-time framework. In
such framework, conditioning on the event that the last time is a
renewal time is a meaningful procedure and enables a super-additivity
property of renewal-reward processes to emerge. This procedure
introduces a constrained model similarly to what is done with
polymers. This way, we were able to find a successful strategy for
investigating large deviations and we were naturally led to link
renewal-reward processes to the PM and the CPM. Importantly, the CPM
is not a merely mathematical tool to tackle the PM, but it also
represents the renewal models of Statistical Mechanics [11],
such as the Poland-Scheraga model, the Fisher-Felderhof model, the
Wako-Saitô-Muñoz-Eaton model, and the Tokar-Dreyssé model. In
this respect, the large deviation theory developed in this paper must
be added to those already existing for other models of Statistical
Mechanics, including the Curie-Weiss model [35], the
Curie-Weiss-Potts model [36], the mean-field
Blume-Emery-Griffiths model [37], and, to some extent, the
Ising model as well as general Gibbs measures relative to an
interaction potential [38, 39, 40, 41].
Going back for a moment to the domain of time with
P[S1<∞]=1 and v=0, it is interesting to point out that
Duffy and Rodgers-Lee [19], Lefevere, Mariani, and
Zambotti [26], and Borovkov and Mogulskii
[21, 22] found, with increasing level of
generality, an apparently different rate function. They constructed
the rate function for renewal-reward processes from the Cramér rate
function ΥC of the waiting time and reward pair (S1,X1),
defined for each pair (β,w)∈R×X by
[TABLE]
Starting from ΥC, they considered the function
infγ>0{γΥC(⋅/γ,⋅/γ)}, whose
lower-semicontinuous regularization Υ is given for every
(β,w)∈R×X by
[TABLE]
Here Bw,δ:={u∈X:∥u−w∥<δ} is the open ball of
center w and radius δ. Duffy and Rodgers-Lee
[19] dealt with the case X=R and ℓs=−∞
under a strong exponential moment condition, obtaining the rate
function Λ:=Υ(1,⋅). In this case we have the
rate function I by theorem 1.2 with
z(φ)=inf{ζ∈R:E[eφ(X1)−ζS1]≤1}
for all φ as S1<∞ with full probability and v=0.
Lefevere, Mariani, and Zambotti [26] too found the rate
function Λ when X1=f(S1) with a bounded real function
f. This instance falls under the umbrella of example
1.2, and so we get again the rate function I by
theorem 1.3. Borovkov and Mogulskii
[21, 22] studied the case X=R under the
Cramér condition. They obtained the rate function Λ when
ℓs=−∞ and the rate function
Λs:=infβ∈[0,1]{Υ(β,⋅)−(1−β)ℓs}
when ℓi=ℓs>−∞ or z(φ)≥ℓs>−∞ for all
φ∈X⋆. In these cases we have the rate functions I
and Is, respectively, by theorem 1.2 and 1.3.
Despite different expressions, our results are consistent with all the
findings of these authors. Indeed, while uniqueness of the rate
function [12, 13] suggests that there is at least
some situation where I=Λ and Is=Λs, a direct
comparison shows that these identities hold in general, as established
by the following lemma which is proved in A.
Lemma 1.1**.**
Assume that P[S1<∞]=1 and that v=0. Then, the
following conclusions hold for every w∈X:
- (a)
I(w)=Λ(w):=Υ(1,w);
2. (b)
Is(w)=Λs(w):=infβ∈[0,1]{Υ(β,w)−(1−β)ℓs}* provided that ℓs>−∞.*
As a final remark, we stress that Borovkov and Mogulskii
[21, 22] opted for not introducing two
different rate functions for the large deviation lower and upper
bounds, thus considering only problems where Ii=Is. At variance
with them, we decided to provide optimal large deviation bounds with
possibly different rate functions in order to even address situations
where the tail of the waiting time distribution is very
oscillating. For instance, a physical renewal model giving rise to two
possibly different rate functions has been found by Lefevere, Mariani,
and Zambotti [42, 43] in the description of
a free particle interacting with a heat bath.
2 Proof of proposition 1.1 and theorem 1.1
We prove proposition 1.1 and theorem
1.1 as follows. In Section 2.1 we show the
existence of a weak LDP with a convex rate function. This is the step
where convexity and super-additivity arguments come into play. In
Section 2.2 we introduce the generalized renewal equation
formalism, which allows us to express the scaled cumulative generating
function in terms of the function z defined by
(1.1). Then, we use this formalism in Section
2.3 to also relate the rate function to z. Finally, in
Section 2.4 we summarize the results linking them to
proposition 1.1 and to parts (a), (b), and
(c) of theorem 1.1.
Our theory of large deviations take advantage of the fact that a
renewal process forgets the past and starts over at every renewal.
Concretely, this means that
(Uτ+t,ΔτtH,ΔτtW)t≥1 with
ΔτtH:=Hτ+t−Hτ and
ΔτtW:=Wτ+t−Wτ is independent of
(Hτ,Wτ) and distributed as (Ut,Ht,Wt)t≥1
conditional on the event that a given integer τ≥1 is a
renewal, namely
[TABLE]
A formal proof of (2.1) can be drawn by noticing that if
τ=Tn for some positive integer n, then Ti≤τ for each
i≤n and Ti>τ for any i>n. It follows that
Hτ=∑i=1nv(Si) and Wτ=∑i=1nXi, so that the
random vector (Hτ,Wτ) depends only on
(S1,X1),…,(Sn,Xn). At the same time, for any t≥1 we
have Uτ+t=∑i≥n+1\mathds1{Ti=τ+t}=∑i≥1\mathds1{Sn+1+⋯+Sn+i=t},
ΔτtH=∑i≥n+1v(Si)\mathds1{Ti≤τ+t}=∑i≥1v(Sn+i)\mathds1{Sn+1+⋯+Sn+i≤t}, and
analogously ΔτtW=∑i≥n+1Xi\mathds1{Ti≤τ+t}=∑i≥1Xn+i\mathds1{Sn+1+⋯+Sn+i≤t}, showing that the
vector (Uτ+t,ΔτtH,ΔτtW) depends only on
(Sn+1,Xn+1),(Sn+2,Xn+2),… through the same formula
that connects (Ut,Ht,Wt) to (S1,X1),(S2,X2),….
2.1 Weak LDP in the constrained setting
We leave the normalizing constant Ztc aside for the moment and
focus on the measure μt over B(X) defined for each time t≥1 by
[TABLE]
We have μt(X)=E[UteHt]=Ztc>0 for all t>tc and
some tc≥0 thanks to assumption 1.1 about aperiodicity, as
we have seen at the end of Section 1.1.
Of fundamental importance is the following super-multiplicativity
property, which is not fulfilled by
Ptc[Wt/t∈⋅]=μt/Ztc precisely because of
normalization.
Lemma 2.1**.**
Let C∈B(X) be convex and let τ≥1 and t≥1 be two
integers. Then, μτ+t(C)≥μτ(C)⋅μt(C).
Proof.
Writing Wτ+t/(τ+t)=λWτ/τ+(1−λ)ΔτtW/t with
λ:=τ/(τ+t), we recognize that Wτ+t/(τ+t)∈C
whenever Wτ/τ∈C and ΔτtW/t∈C since C is
convex. It follows that
[TABLE]
A looser lower bound is obtained by introducing the renewal indicator
Uτ with the motivation that
(Uτ+t,ΔτtH,ΔτtW) is independent of
(Uτ,Hτ,Wτ) and distributed as (Ut,Ht,Wt) when
τ is a renewal. This way, invoking (2.1) we find
[TABLE]
which proves the lemma.
∎
Super-multiplicativity, which becomes super-additivity once logarithms
are taken, makes it possible to describe in general terms the
exponential decay with t of the measure μt. To this purpose, we
denote by L the extended real function over B(X)
defined by the formula
[TABLE]
If C∈B(X) is convex, then the super-additivity of lnμt(C)
immediately gives limsupt↑∞(1/t)lnμt(C)=L(C). The following lemma improves this result
when C is open as well as convex. Hereafter we denote by
Bw,δ:={u∈X:∥u−w∥<δ} the open ball of center
w and radius δ, which is an example of open convex set.
Lemma 2.2**.**
Let C⊆X be open and convex. Then,
limt↑∞(1/t)lnμt(C) exists as an extended real
number and is equal to L(C).
Proof.
We shall show in a moment that the hypothesis that C is open entails
that either μt(C)=0 for all t>tc or there exists τ≥tc
such that μt(C)>0 for all t>τ. Lemma 2.2 is obvious
in the first case. The second case is solved as follows. Pick an
integer s>tc. Then, fix an integer γ≥1 such that γs>τ and a constant M>−∞ such that lnμr(C)≥M when
γs≤r<2γs, which exists because γs>τ. Expressing any t≥2γs as t=qγs+r with q≥1 and γs≤r<2γs, super-additivity gives
lnμt(C)≥qγlnμs(C)+lnμr(C)≥qγlnμs(C)+M, thus showing that
liminft↑∞(1/t)lnμt(C)≥(1/s)lnμs(C). The
arbitrariness of s yields
liminft↑∞(1/t)lnμt(C)≥sups>tc{(1/s)lnμs(C)}=:L(C).
We now prove that either μt(C)=0 for all t>tc or there exists
τ≥tc with the property that μt(C)>0 for all
t>τ. Assume that μτo(C)>0 for some τo>tc. To
begin with, we notice that if for every w∈C it were possible to
find a number δw>0 such that μτo(Bw,δw)=0,
then the open covering {Bw,δw}w∈C of C would
contain a countable subcollection covering C by separability of
X and Lindelöf’s lemma with the consequence that
μτo(C)=0. This argument shows that there exists at least
one point wo∈C such that μτo(Bwo,δ)>0 for
all δ>0. Since C is open, there is δo>0 such that
Bwo,2δo⊆C. This way, we have constructed open
balls Bk:=Bwo,kδo so that μτo(B1)>0 and
B2⊆C. Furthermore, since
limk↑∞μr(Bk)=μr(X)=Zrc>0 for all
r>tc, there exists an integer ko≥1 such that
μr(Bko)>0 if r satisfies τo≤r<2τo. Set
τ:=2koτo.
Let us pick an arbitrary t>τ and let us show that μt(C)>0.
The fact that t>τ≥2τo makes it possible to express t as
t=qτo+r with integers q and r such that q≥1 and
τo≤r<2τo. We notice that Wt/t∈B2 whenever
Wqτo/qτo∈B1 and ΔqτorW/r∈Bko,
as the following bounds demonstrate:
[TABLE]
Then, recalling that B2⊆C we get
[TABLE]
As in the proof of lemma 2.2, a convenient looser lower bound
is obtained by introducing Uqτo. Since
(Uqτo+r,ΔqτorH,ΔqτorW) is independent of
(Uqτo,Hqτo,Wqτo) and distributed as
(Ur,Hr,Wr) when qτo is a renewal we find
[TABLE]
where the last inequality is due to super-multiplicativity because
B1 is convex. We deduce from here that μt(C)>0 as both
μτo(B1)>0 and μr(Bko)>0 by construction.
∎
Lemma 2.2 suggests to consider the putative rate function J
that maps any w∈X in the extended real number J(w) defined
by
[TABLE]
In fact, the function J controls the measure decay of open and
compact sets as follows.
Proposition 2.1**.**
The following conclusions hold:
- (i)
t↑∞liminft1lnμt(G)≥−w∈Ginf{J(w)}* for each G⊆X open;*
2. (ii)
t↑∞limsupt1lnμt(K)≤−w∈Kinf{J(w)}* for each K⊆X compact.*
Proof.
Part (i) is immediate. Let G⊆X be open, let w∈G be
an arbitrary point, and let δ>0 be such that
Bw,δ⊆G. Since μt(G)≥μt(Bw,δ) and
since Bw,δ is open and convex, lemma 2.2 gives
liminft↑∞(1/t)lnμt(G)≥limt↑∞(1/t)lnμt(Bw,δ)=L(Bw,δ)≥−J(w). The conclusion
follows from the arbitrariness of w.
Moving to part (ii), pick a compact set K in X and assume
infw∈K{J(w)}>−∞, otherwise there is nothing to
prove. Let λ<infw∈K{J(w)} be a real number. Since
there exists ϵ>0 such that λ+ϵ≤J(w)=−infδ>0{L(Bw,δ)} for every w∈K, a number δw>0 can be found for each w∈K in such a way
that L(Bw,δw)≤−λ. Then, lemma
2.2 yields
limt↑∞(1/t)lnμt(Bw,δw)≤−λ for
such δw. Due to the compactness of K, there exist finitely
many points w1,…,wn in K such that K⊆∪i=1nBwi,δwi. It follows that
μt(K)≤∑i=1nμt(Bwi,δwi), which in turn
gives limsupt↑∞(1/t)lnμt(K)≤−λ. This
way, we get the desired upper bound by sending λ to
infw∈K{J(w)}.
∎
The first important properties of J are presented in the following
lemma.
Lemma 2.3**.**
The function J is lower semicontinuous and convex.
Proof.
Pick w∈X and let {wi}i≥0 be a sequence of points
converging to w. We show that
liminfi↑∞J(wi)≥−L(Bw,δ) for all
numbers δ>0, which results in
liminfi↑∞J(wi)≥J(w) and proves the lower
semicontinuity of J. Given δ>0 there exists io≥0 such
that ∥wi−w∥≤δ/2 if i≥io. Then, monotonicity of
L inherited from the measures μt entails that
−J(wi)≤L(Bwi,δ/2)≤L(Bw,δ)
for each i≥io since Bwi,δ/2⊆Bw,δ.
The bound
liminfi↑∞J(wi)≥−L(Bw,δ) follows
from here.
As far as the proof of the convexity of J is concerned, lower
semicontinuity combined with the fact that dyadic rationals in [0,1]
are dense in [0,1] makes it sufficient to verify that for each u
and w in X
[TABLE]
To this aim, we notice that for each number δ>0 and integer
t≥1 the conditions Wt/t∈Bu,δ and ΔttW/t∈Bw,δ imply W2t/(2t)∈B(u+w)/2,δ, as one can
easily verify. It follows that
[TABLE]
Inserting Ut and exploiting the fact that
(U2t,ΔttH,ΔttW) is independent of (Ut,Ht,Wt)
and distributed as (Ut,Ht,Wt) when t is a renewal we get
[TABLE]
This way, taking logarithms, dividing by 2t, and sending t to
infinity, we find
L(B(u+w)/2,δ)≥(1/2)L(Bu,δ)+(1/2)L(Bw,δ)≥−(1/2)J(u)−(1/2)J(w) thanks to lemma 2.2 because open balls
are open convex sets. Inequality (2.2) follows from here by
the arbitrariness of δ.
∎
We conclude the section strengthening proposition 2.1 for
convex sets. We know that
limsupt↑∞(1/t)lnμt(C)=L(C) for every
C∈B(X) convex thanks to super-additivity. The following lemma
draws a link between L(C) and infw∈C{J(w)}.
Lemma 2.4**.**
Let C⊆X be open convex, closed convex, or any convex set
in B(X) when X is finite-dimensional. Then,
L(C)≤−infw∈C{J(w)}.
Proof.
The lemma is trivial if L(C)=−∞. Assume
L(C)>−∞ and pick ϵ>0. Since
limsupt↑∞(1/t)lnμt(C)=L(C) there
exists an integer τ≥1 such that
L(C)≤(1/τ)lnμτ(C)+ϵ. Completeness and
separability of X entail that μτ is tight as it is
bounded from above by Zτc<+∞ (see [44],
theorem 7.1.7). Consequently, a compact set Ko⊆C can be
found so that μτ(C)≤μτ(Ko)+[1−exp(−ϵτ)]μτ(C). Thus,
μτ(C)≤exp(ϵτ)μτ(Ko) and
L(C)≤(1/τ)lnμτ(Ko)+2ϵ follows. We
shall show in a moment that there exists a compact convex set K with
the property that Ko⊆K⊆C. Then, using the fact
that Ko⊆K we reach the further bound
L(C)≤(1/τ)lnμτ(K)+2ϵ≤L(K)+2ϵ.
At this point, we notice that on the one hand
L(K)=limsupt↑∞(1/t)lnμt(K) by
super-additivity as K is convex, and on the other hand
limsupt↑∞(1/t)lnμt(K)≤−infw∈K{J(w)}
by part (ii) of proposition 2.1 as K is compact. Thus,
L(C)≤−infw∈K{J(w)}+2ϵ≤−infw∈C{J(w)}+2ϵ because K⊆C and the lemma follows
from the arbitrariness of ϵ.
Let us prove now that there exists a compact convex set K with the
property that Ko⊆K⊆C. The hypothesis that the
convex set C is either open or closed when X if
infinite-dimensional comes into play here. Let Co be the convex
hull of Ko and let K:=\mboxclCo, \mboxclA denoting the closure of a
set A. Clearly, Ko⊆Co⊆C and Co⊆K. Since Ko is compact, Co is convex and compact whenever
X is finite-dimensional, whereas K is convex and compact in any
circumstance (see [45], theorem 3.20). We want to demonstrate
that K⊆C. If X is finite-dimensional, then K=Co
and we get the desired result from Co⊆C. If X is
infinite-dimensional and C is closed, then K⊆C follows
from Co⊆C by taking closures. The only nontrivial case is
when X is infinite-dimensional and C is open. Assume that C
is open from now on and for each w∈C let δw>0 be such
that Bw,2δw⊆C. As Ko is compact, there exist
finitely many points w1,…,wn in Ko so that
Ko⊆∪i=1nBwi,δwi. Let K′ be the convex
hull of ∪i=1n(\mboxclBwi,δwi∩K). We have
K′⊆C because ∪i=1n(\mboxclBwi,δwi∩K)⊆∪i=1n\mboxclBwi,δwi⊆C thanks to
the fact that Bwi,2δwi⊆C for every i and
because C is convex. This way, K⊆C is verified if we show
that K=K′. The inclusion K′⊆K is immediate since
∪i=1n(\mboxclBwi,δwi∩K)⊆K and K is
convex. In order to show the opposite inclusion K⊆K′ we
observe that the set K′ is convex and compact since it is the convex
hull of the union of the compact convex sets \mboxclBw1,δw1∩K,…,\mboxclBwn,δwn∩K (see
[45], theorem 3.20). Then, we observe that Ko⊆K′
as ∪i=1n(\mboxclBwi,δwi∩K)=(∪i=1n\mboxclBwi,δwi)∩K and both ∪i=1n\mboxclBwi,δwi and K contain Ko. This way, we first
realize that Co⊆K′ since Co is the smallest convex set
that contains Ko, and by taking closures we later deduce that
K⊆K′ as K′ is closed.
∎
2.2 Expectations and generalized renewal equation
Let (S1,V1),(S2,V2),… be a sequence of independent and
identically distributed random vectors on
(Ω,F,P), the Vi’s taking values in
[0,+∞), and for each time t≥1 denote by Ψt the
expected value
[TABLE]
Here we determine the asymptotic exponential rate of growth of
Ψt with respect to t. The solution to this problem is a needed
preliminary step to relate the rate function J to the function z
defined by (1.1). The computation of Ψt takes
advantage of the generalized renewal equation
[TABLE]
satisfied for each t≥1 with the initial condition Ψ0:=1,
where as:=E[V1\mathds1{S1=s}] is a non-negative extended real
number. This equation is deduced conditioning on S1 and then using
the fact that the renewal process starts over at the renewal time
T1. We are only interested in the case where aσl>0 for
each l, σ1,…,σm being the m coprime integers
introduced in Section 1.1 to make effective aperiodicity
of the waiting time distribution.
The expected value A(ζ):=E[V1e−ζS1\mathds1{S1<∞}]=∑s≥1ase−ζs exists
as an extended real number and defines a lower semicontinuous function
A that maps ζ∈R in A(ζ). The
number ψ given by
[TABLE]
where the infimum over the empty set is customarily interpreted as
+∞, exactly is the exponential rate of growth we are looking for
as stated by the next proposition. The level set
{ζ∈R:A(ζ)≤1} is bounded from below since
A(ζ)≥∑l=1maσle−ζσl>1 for all
ζ sufficiently negative and closed due to lower
semicontinuity. Consequently, ψ>−∞ and A(ψ)≤1 if
ψ<+∞. It follows that Ψt≤eψt for all t≥1, which is trivial if ψ=+∞ and is easily verified by
induction starting from (2.4) when ψ<+∞.
Proposition 2.2**.**
limt↑∞(1/t)lnΨt* exists as an extended real
number and is equal to ψ>−∞. Moreover, the bound Ψt≤eψt holds for all t≥1.*
Proof.
The bound Ψt≤eψt for all t≥1 gives
limsupt↑∞(1/t)lnΨt≤ψ. Let us show that
[TABLE]
We have Ψt≥E[Ut∏i≥1(\mathds1{Ti>t}+Vi\mathds1{Ti≤t})∏i=1n\mathds1{Si=si}]=∏i=1nasi
if t=∑i=1nsi . This way, the same arguments used in Section
1.1 to deduce Ztc>0 for all t>tc yield Ψt>0
for all t>tc as aσl>0 by hypothesis for each l. This
property allows us to prove (2.6) as follows. Pick a
real number ζ<ψ and notice that there exists an integer
τ≥1 so that ∑s=1τase−ζs≥1. On the
contrary we would have A(ζ)≤1, which contradicts the
assumption that ζ<ψ. Since Ψt>0 for all t>tc, we can
find a constant M>−∞ such that lnΨt≥M+ζt for
every t satisfying tc<t≤tc+τ. As a matter of fact, this
bound is valid for all t>tc. Indeed, an argument by induction based
on the generalized renewal equation (2.4) shows that
if t>tc+τ and lnΨt−s≥M+ζ(t−s) for any positive
s≤τ, then
[TABLE]
It follows that liminft↑∞(1/t)lnΨt≥ζ, giving
(2.6) once ζ is sent to ψ.
∎
The first application of proposition 2.2 we consider is
concerned with the function z defined by (1.1). To this
aim we pick a linear functional φ∈X⋆ and we set
Vi:=eφ(Xi)+v(Si) for every i. In this case, we have
aσl=E[eφ(X1)+v(S1)\mathds1{S1=σl}]>0
for each l as p(σl)>0 and
Ψt=E[Uteφ(Wt)+Ht] for all t since
[TABLE]
Moreover, a direct comparison with (1.1) shows that the
number ψ associated with the present V1 by formula
(2.5) is nothing but z(φ). Consequently, proposition
2.2 gives
limt↑∞(1/t)lnE[Uteφ(Wt)+Ht]=z(φ)
and z(φ)>−∞. It follows from here thanks to the
arbitrariness of φ that z is convex and that z never
attains −∞, thus resulting in a proper convex function since
z is finite at least in 0 due to assumption 1.2 as we have
seen at the beginning of Section 1.2. Proposition
2.2 also shows that E[Uteφ(Wt)+Ht]≤ez(φ)t for all t≥1. The function z is lower
semicontinuous because if {φi}i≥0 is a sequence
converging to φ and t is any positive integer, then the
bound ez(φi)t≥E[Uteφi(Wt)+Ht] and Fatou’s
lemma give liminfi↑∞z(φi)≥liminfi↑∞(1/t)lnE[Uteφi(Wt)+Ht]≥(1/t)lnE[Uteφ(Wt)+Ht], which results in
liminfi↑∞z(φi)≥z(φ) when t is sent
to infinity. We have thus proved the following lemma.
Lemma 2.5**.**
The function z is proper convex and lower semicontinuous. Given
any φ∈X⋆, the bound
E[Uteφ(Wt)+Ht]≤ez(φ)t is valid for all
t≥1 and the limit
limt↑∞(1/t)lnE[Uteφ(Wt)+Ht]=z(φ)
holds.
2.3 Connection with the function z
In this section we prove that the rate function J is the
Fenchel-Legendre transform of z, namely that
J(w)=supφ∈X⋆{φ(w)−z(φ)} for all
w∈X. Lemma 2.3 states that J is convex and lower
semicontinuous. Actually, J is proper convex. Indeed, by combining
lemma 2.2 with C:=X and lemma 2.5 with
φ:=0 we get
L(X)=limt↑∞(1/t)lnμt(X)=limt↑∞(1/t)lnE[UteHt]=z(0).
This way, part (i) of proposition 2.1 with G:=X gives
z(0)≥−infw∈X{J(w)} and lemma 2.4 with
C:=X yields z(0)≤−infw∈X{J(w)}, with the
consequence that infw∈X{J(w)}=−z(0). As z(0) is finite,
this equality shows that J is finite at some point and that it never
attains −∞. Proper convexity and lower semicontinuity allow us
to express J in terms of its convex conjugate J⋆ as follows
(see [46], theorem 2.3.3):
[TABLE]
for every w∈X with
J⋆(φ):=supw∈X{φ(w)−J(w)} for all
φ∈X⋆. This way, in order to demonstrate that J
is the Fenchel-Legendre transform of z it suffices to show that
J⋆=z. Basically, this argument is the same argument used by
Cerf and Petit [47] for a short proof of Cramér’s theorem
in R.
Proving the bound J⋆(φ)≤z(φ) for all
φ∈X⋆ is not difficult. To do this, we fix
φ∈X⋆ and we observe that lemma 2.5 together
with the fact that φ(Wt−tw)≥−∥Wt−tw∥∥φ∥≥−tδ∥φ∥ if Wt/t∈Bw,δ gives for every t≥1, w∈X, and δ>0
[TABLE]
Taking logarithms, dividing by t, and sending t to infinity, we
get from here
z(φ)≥φ(w)+L(Bw,δ)−δ∥φ∥≥φ(w)−J(w)+δ∥φ∥ thanks to lemma 2.2. Thus,
sending δ to zero first and appealing to the arbitrariness of
w later we reach the bound
z(φ)≥supw∈X{φ(w)−J(w)}=:J⋆(φ). A
more sophisticated use of proposition 2.2 leads to the opposite
bound, and hence to equality as stated by the following proposition.
Proposition 2.3**.**
The convex conjugate J⋆ of J equals z.
Proof.
Pick a linear functional φ∈X⋆. As z(φ)≥J⋆(φ), in order to show that
z(φ)=J⋆(φ) we must prove that z(φ)≤J⋆(φ). Assume that J⋆(φ)<+∞, otherwise
there is nothing to prove. We are going to obtain the bound
z(φ)≤J⋆(φ) in two steps. At first we verify
that for each K⊆X compact
[TABLE]
Then, we demonstrate that for each real number ζ<z(φ)
there exists a compact convex set K⊆X with the property
that
[TABLE]
The proposition follows by combining (2.9) with
(2.8) first and by sending ζ to z(φ) later.
Let us prove (2.8) for a given compact set K in X.
Let λ>J⋆(φ) and ρ>0 be two real numbers. Since
there exists ϵ>0 such that
φ(w)+infδ>0{L(Bw,δ)}=φ(w)−J(w)≤J⋆(φ)≤λ−ϵ for all w, for each w∈X
we can find δw>0 in such a way that δw∥φ∥<ρ
and L(Bw,δw)≤λ−φ(w). Lemma
2.2 gives
limt↑∞(1/t)lnμt(Bw,δw)≤λ−φ(w) for such δw. Furthermore, we have
φ(Wt−tw)≤∥Wt−tw∥∥φ∥≤tδw∥φ∥<tρ if Wt/t∈Bw,δw. From the
compactness of K there exist finitely many points w1,…,wn
in K so that K⊆∪i=1nBwi,δwi. It
follows that for all t≥1
[TABLE]
By combining this bound with
limt↑∞(1/t)lnμt(Bwi,δwi)≤λ−φ(wi) for each i we find
[TABLE]
This way, we reach (2.8) by sending λ to
J⋆(φ) and ρ to 0.
We now verify (2.9). Pick a real number ζ<z(φ)
and observe that necessarily E[eφ(X1)+v(S1)−ζS1\mathds1{S1<∞}]>1 by definition of
z(φ). Recall that
E[eφ(X1)+v(S1)\mathds1{S1=σl}]>0 for all
l since the m coprime integers σ1,…,σm satisfy
p(σl)>0 for every l. We shall show at the end that there
exists a compact convex set K⊆X such that
[TABLE]
and
[TABLE]
for each l. This way, setting
Vi:=eφ(Xi)+v(Si)\mathds1{Xi/Si∈K} for all
i and introducing the number ψ defined by
[TABLE]
we have ζ<ψ from (2.10). At the same time, if
as:=E[V1\mathds1{S1=s}] for all s, then (2.11)
gives aσl>0 for each l. Consequently, we can invoke
proposition 2.2 with the present Vi to get
[TABLE]
On the other hand, as K is convex, the condition Xi/Si∈K for
all i such that Ti≤t entails Wt/t∈K when t is a
renewal. To understand this point, we write Wt/t=∑i≥1(Xi/Si)(Si/t)\mathds1{Ti≤t} and we notice that when
there exists a positive integer n such that Tn=t, then
∑i≥1(Si/t)\mathds1{Ti≤t}=∑i=1n(Si/t)=Tn/t=1. It follows that
[TABLE]
which proves (2.9).
To conclude the proof of the proposition, we must show the validity of
(2.10) and (2.11) for some compact convex set
K. To this aim, consider the finite measure
πR:=E[eφ(X1)+v(S1)−ζS1\mathds1{X1/S1∈⋅}\mathds1{∥X1∥≤R}\mathds1{S1≤R}] on B(X), R being a positive
real number. The fact that E[eφ(X1)+v(S1)−ζS1\mathds1{S1<∞}]>1 implies that there exists a
sufficiently large R so that πR(X)>1 and completeness and
separability of X entail that πR is tight (see
[44], theorem 7.1.7). It follows that there exists a
compact set Ko such that πR(Ko)>1, which gives
E[eφ(X1)+v(S1)−ζS1\mathds1{X1/S1∈Ko}\mathds1{S1<∞}]≥πR(Ko)>1. Similar
arguments with
πR:=E[eφ(X1)+v(S1)\mathds1{X1/S1∈⋅}\mathds1{∥X1∥≤R}\mathds1{S1=σl}] in combination with
E[eφ(X1)+v(S1)\mathds1{S1=σl}]>0 yield
E[eφ(X1)+v(S1)\mathds1{X1/S1∈Kl}\mathds1{S1=σl}]>0 for some compact set
Kl. Let K be the closed convex hull of Ko∪K1∪⋯∪Km. The set K is convex and compact (see
[45], theorem 3.20) and satisfies (2.10) and
(2.11) as Ko⊆K and Kl⊆K for each
l.
∎
2.4 Proposition 1.1 and theorem 1.1 point by point
In this section we explicitly verify proposition
1.1 and theorem 1.1 point by
point, but the former simply is part of lemma 2.5 and does not
need other demonstrations. Lemma 2.3 states that J is
convex and lower semicontinuous. Moreover, we have seen that J is
proper convex at the beginning of the last section. As
J(w)=supφ∈X⋆{φ(w)−z(φ)} for all
w∈X thanks to (2.7) and proposition 2.3, the
rate function I defined by (1.2) equals J+z(0) and
inherits the lower semicontinuity and proper convexity of J. These
facts prove part (a) of theorem 1.1. Part (b) of theorem
1.1 follows from part (i) of propositions 2.1 bearing
in mind that lnPt[Wt/t∈⋅]=lnμt−lnZtc for
each t>tc, that limt↑∞(1/t)lnZtc=limt↑∞E[UteHt]=z(0) by lemma
2.5, and that I=J+z(0). Similarly, part (c) of theorem
1.1 concerning compact sets is due to part (ii) of
proposition 2.1. Part (c) regarding convex sets follows from
the limit limsupt↑∞(1/t)lnμt(C)=L(C)
valid for any C∈B(X) convex and lemma 2.4. Finally,
part (c) for closed sets in the finite-dimensional case is
demonstrated by the following proposition. Let us observe that the
exponential moment condition E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞ for some numbers
ζ≥0 and ξ>0 implies z(φ)<+∞ for all
φ∈X⋆ such that ∥φ∥≤ξ. Indeed, the
validity of this condition with certain ζ≥0 and ξ>0
entails that a number h large enough can be found so that
e−hE[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]≤1. It follows that
E[eφ(X1)+v(S1)−(ζ+h)S1\mathds1{S1<∞}]≤e−hE[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]≤1 if ∥φ∥≤ξ as
S1≥1 with full probability, which gives z(φ)<+∞
according to definition (1.1). It is easy to verify that
if X is finite-dimensional, then the above exponential moment
condition is tantamount to the existence of ξ>0 such that
z(φ)<+∞ for all φ fulfilling ∥φ∥≤ξ.
Proposition 2.4**.**
Assume that X has finite dimension and that there exist numbers
ζ≥0 and ξ>0 such that E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞. Then, for each
F⊆X closed
[TABLE]
Proof.
Fix a closed set F in X and observe that infw∈F{J(w)}≥infw∈X{J(w)}=−z(0)>−∞. Then, pick
a real number λ<infw∈F{J(w)}. Let d be the
dimension of X, let {w1,…,wd} be a basis of X,
and let {ϑ1,…,ϑd}⊂X⋆ be the
dual basis: ϑi(wj) equals 1 if i=j and 0 otherwise for
all i and j. For i ranging from 1 to d, set
φi:=ϑi/∥ϑi∥ and
φd+i:=−φi. Since z(φ)<+∞ if
∥φ∥≤ξ, ξ>0 being the number associated with the
hypothesized exponential moment condition, there exists a real
number ρ>0 with the property that z(ξφi)−ξρ≤−λ for each i. Denoting by K the compact set
K:=∩i=12d{w∈X:φi(w)≤ρ}, we have
Kc=∪i=12d{w∈X:φi(w)>ρ}. This way, by
making use of the Chernoff bound first and of the bound
E[Uteξφi(Wt)+Ht]≤ez(ξφi)t due to
lemma 2.5 later, we obtain
[TABLE]
giving μt(F)=μt(F∩K)+μt(F∩Kc)≤μt(F∩K)+2de−λt for each t. On the other hand, part (ii) of
proposition 2.1 with the compact set F∩K shows that
limsupt↑∞(1/t)lnμt(F∩K)≤−infw∈F∩K{J(w)}≤−infw∈F{J(w)}≤−λ. It follows that
limsupt↑∞(1/t)lnμt(F)≤−λ, which proves
the proposition once λ is sent to infw∈F{J(w)}.
∎
3 Proof of proposition 1.2 and of theorems 1.2 and 1.3
Large deviation bounds within the PM can be made a consequence of the
corresponding bounds in the CPM by exploiting conditioning as follows.
Pick an integer time t≥1 and notice that if T1≤t, then
there is one and only one positive integer n≤t such that Tn≤t and Tn+1>t. Thus, Ω={T1>t}∪{T1≤t} and
{T1≤t}=∪n=1t{Tn≤t\mboxandTn+1>t}=∪n=1t∪τ=nt{Tn=τ\mboxandTn+1>t}, the events {Tn=τ\mboxandTn+1>t} for
1≤n≤τ≤t being disjoint. The condition T1>t is
tantamount to S1>t and implies that Ht=0 and Wt=0. The
condition Tn=τ and Tn+1>t is tantamount to Tn=τ and
Sn+1>t−τ and implies that Ht=∑i=1nv(Si)=Hτ and
Wt=∑i=1nXi=Wτ are independent of Sn+1. This way,
for every φ∈X⋆ we find the identity between measures
[TABLE]
Formula (3.1) connects the free setting with the
constrained setting and is the starting point to prove proposition
1.2 and theorems 1.2 and
1.3. Once again, we leave normalization aside at the
beginning and focus on the measure
νt:=ZtPt[Wt/t∈⋅] on B(X). Identity
(3.1) with φ=0 results in the expression
[TABLE]
We use this expression to derive a lower large deviation bound in
Section 3.1 and an upper large deviation bound in
Section 3.2. Theorem 1.2 is verified point
by point in Section 3.3, where two counterexamples are also
shown to demonstrate that the upper large deviation bound for open
convex sets and closed convex sets cannot hold in general when
ℓs=−∞ and I(0)=+∞. Finally, theorem 1.3 is
verified point by point in Section 3.4.
Regarding proposition 1.2, it is an
immediate consequence of formula (3.1), which entails
E[eφ(Wt)+Ht]=P[S1>t]+∑τ=1tE[Uτeφ(Wτ)+Hτ]⋅P[S1>t−τ] for each t and
φ. Indeed, recalling the definitions
liminft↑∞(1/t)lnP[S1>t]=:ℓi and
limsupt↑∞(1/t)lnP[S1>t]=:ℓs, as well as the
limit limt↑∞(1/t)lnE[Uteφ(Wt)+Ht]=z(φ) due to lemma 2.5, for all
φ∈X⋆ we get
[TABLE]
and
[TABLE]
3.1 The lower large deviation bound
In this section we prove the following lower bound without
restrictions on ℓi and ℓs.
Proposition 3.1**.**
For each G⊆X open
[TABLE]
Proof.
Pick an open set G in X. In order to demonstrate the
proposition it suffices to verify that for all w∈G
[TABLE]
This bound is immediate when ℓi=−∞. Indeed, keeping only
the term corresponding to τ=t in the r.h.s. of
(3.2) we get νt(G)≥μt(G), which shows that
liminft↑∞(1/t)lnνt(G)≥−J(w) for any w∈G
thanks to part (i) of proposition 2.1. On the other hand,
J(w) is the r.h.s. of (3.5) if ℓi=−∞ by
formula (2.7) and proposition 2.3.
The proof of (3.5) is more laborious when
ℓi>−∞ and we assume that ℓi>−∞ from now on. Let
\mboxdomz:={φ∈X⋆:z(φ)<+∞} be the effective
domain of z and consider the function F that for a given w∈G
maps (β,φ)∈[0,1]×\mboxdomz in the real number
F(β,φ):=φ(w)−βz(φ)−(1−β)ℓi. The
function F is concave and upper semicontinuous with respect to
φ for each fixed β∈[0,1], inheriting these properties
from z, and convex and continuous with respect to β for each
fixed φ∈\mboxdomz. Then, due to compactness of the closed
interval [0,1], Sion’s minimax theorem allows us to exchange the
infimum over β∈[0,1] and the supremum over φ∈\mboxdomz:
\sup_{\varphi\in\scriptsize{\mbox{dom}\,}z}\inf_{\beta\in[0,1]}\big{\{}F(\beta,\varphi)\big{\}}=\inf_{\beta\in[0,1]}\sup_{\varphi\in\scriptsize{\mbox{dom}\,}z}\big{\{}F(\beta,\varphi)\big{\}}.
As infβ∈[0,1]{φ(w)−βz(φ)−(1−β)ℓi}=φ(w)−z(φ)∨ℓi and
z(φ)∨ℓi=+∞ when φ∈/\mboxdomz, this
identity can be written as
[TABLE]
This way, we get the bound (3.5) if we prove that for
every w∈G and β∈[0,1]
[TABLE]
We prove (3.6) considering the case β>0 first.
Pick a point w∈G and a number β∈(0,1] and denote by
τt the greatest integer that is less than or equal to βt. Let δ>0 be such that Bw,2δ⊆G and focus
on all those sufficiently large integers t such that τt>0 and
∥w∥<βδt. Within this setting, we have that the event
Wτt/τt∈Bw/β,δ implies Wτt/t∈Bw,2δ⊆G. Indeed, since 0≤t−τt/β<1/β
and ∥w∥<βδt we find
∥Wτt−tw∥≤∥Wτt−(τt/β)w∥+(t−τt/β)∥w∥<∥Wτt−(τt/β)w∥+δt. It follows that if ∥Wτt−(τt/β)w∥<δτt,
then ∥Wτt−tw∥<δτt+δt≤2δt. This
way, keeping only the term corresponding to τ=τt>0 in the
r.h.s. of (3.2), we obtain
[TABLE]
We have
limt↑∞(1/τt)lnμτt(Bw/β,δ)=L(Bw/β,δ)≥−J(w/β)
by lemma 2.2. We also have
limt↑∞τt/t=β and
liminft↑∞(1/t)lnP[S1>t−τt]=(1−β)ℓi. The
latter limit is trivial in the case β=1 to which τt=t
corresponds, whereas it follows from
liminft↑∞(1/t)lnP[S1>t]=:ℓi when β<1
due to the fact that t−τt is now diverging as t is sent to
infinity. These arguments in combination with (3.7)
prove that
[TABLE]
which is (3.6) under the hypothesis that β>0.
In order to settle the case β=0, we take a point u∈X such
that c:=J(u) is finite, which exists because J is proper
convex. We have
z(φ)=J⋆(φ):=supw∈X{φ(w)−J(w)}≥φ(u)−c
for all φ∈X⋆ by proposition 2.3. As G is
open, for a given w∈G we can find a number δ∈(0,1) such
that w+ϵu∈G whenever ϵ∈(0,δ). Then, the
bound (3.6) applies with a positive
ϵ<δ<1 in place of β and w+ϵu in place of
w to give
[TABLE]
We obtain (3.6) corresponding to β=0 from here
by sending ϵ to zero.
∎
3.2 The upper large deviation bound
An upper large deviation bound for compact sets can be proved by means
of standard arguments from large deviation theory without
distinguishing the case ℓs>−∞ from the case ℓs=−∞.
The following result holds.
Proposition 3.2**.**
For each compact set K⊆X
[TABLE]
Proof.
Let K be a compact set in X and notice that infw∈Ksupφ∈X⋆{φ(w)−z(φ)∨ℓs}≥−z(0)∨ℓs>−∞. Let
λ<infw∈Ksupφ∈X⋆{φ(w)−z(φ)∨ℓs}
and ρ>0 be real numbers. As there exists ϵ>0 such that
supφ∈X⋆{φ(w)−z(φ)∨ℓs}≥λ+ϵ
for all w∈K, a linear functional φw∈X⋆ can
be found for each w∈K with the property that
φw(w)−z(φw)∨ℓs≥λ. It is manifest
that z(φw)<+∞ for such φw. Let δw>0
be a number that satisfies δw∥φw∥≤ρ. Then, for
every positive integers t and τ≤t the condition
Wτ/t∈Bw,δw entails
φw(Wτ−tw)≥−∥Wτ−tw∥∥φw∥>−δw∥φw∥t≥−ρt, namely
φw(Wτ)−tφw(w)+ρt≥0. This way, bearing in
mind that E[Uτeφw(Wτ)+Hτ]≤ez(φw)τ by lemma 2.5 we get for each w∈K
and integers t and τ≤t
[TABLE]
We also have for each w∈K and t
[TABLE]
because if 0∈Bw,δw, then ∥w∥<δw so that
φw(w)≤δw∥φw∥≤ρ.
Due to the compactness of K, there exist finitely many points
w1,…,wn in K such that K⊆∪i=1nBwi,δwi. The facts that
limsupt↑∞(1/t)lnP[S1>t]=:ℓs and
z(φwi)∨ℓs>−∞ for each i ensure the
existence of a positive constant M<+∞ such that for all t and
i≤n
[TABLE]
At this point, identity (3.2) combined with
(3.8), (3.9), and
(3.10) shows that for every t
[TABLE]
which in turn yields limsupt↑∞(1/t)lnνt(K)≤−λ+2ρ. The proposition follows from here by sending ρ
to zero and λ to infw∈Ksupφ∈X⋆{φ(w)−z(φ)∨ℓs}.
∎
The upper bound stated by proposition 3.2 cannot be
extended in general to convex sets when ℓs=−∞. However, at
least the following weaker upper bound holds for them.
Lemma 3.1**.**
Let C⊆X be open convex, closed convex, or any convex set
in B(X) when X is finite-dimensional. Then, for each real
number ℓ≥ℓs
[TABLE]
Proof.
Pick a real number ℓ≥ℓs and notice that infw∈Csupφ∈X⋆{φ(w)−z(φ)∨ℓ}≥−z(0)∨ℓ>−∞. Fix
a real number λ<infw∈Csupφ∈X⋆{φ(w)−z(φ)∨ℓ}.
To begin with, we observe that for any given real number η≥1
and integer τ≥1 we have the bound
[TABLE]
where ηC:={ηw:w∈C}∈B(X), which is convex, open if
C is open, and closed if C is closed. Indeed, as there exists
ϵ>0 such that
λ+ϵ≤supφ∈X⋆{φ(w)−z(φ)∨ℓ}
for all w∈C, for every w∈C we can find
φw∈X⋆ satisfying λ≤φw(w)−z(φw)∨ℓ. This way, for each w∈C
we obtain
[TABLE]
On the other hand, if γ is a large enough integer so that
γτ>tc, then the convexity of ηC allows us to invoke
super-additive properties to obtain (1/τ)lnμτ(ηC)≤(1/γτ)lnμγτ(ηC)≤L(ηC).
Consequently, lemma 2.4 with the set ηC entails
lnμτ(ηC)≤−τinfv∈ηC{J(v)}, which proves
(3.11) because infv∈ηC{J(v)}=infw∈C{J(ηw)}≥λη+ℓ(η−1).
We use the bound (3.11) as follows. Given any positive
integers t and τ≤t, setting η:=t/τ we have that
Wτ/τ∈ηC is tantamount to Wτ/t∈C. This way,
(3.11) yields
[TABLE]
For each t we also find
[TABLE]
because if 0∈C, then
λ<supφ∈X⋆{φ(w)−z(φ)∨ℓ}
with w=0 gives
λ≤supφ∈X⋆{−z(φ)∨ℓ}≤−ℓ.
Finally, recalling that
limsupt↑∞(1/t)lnP[S1>t]=:ℓs≤ℓ we
realize that for any fixed number ρ>0 there exists a positive
constant M<+∞ such that P[S1>t]≤Me(ℓ+ρ)t for
all t≥0. By making use of this bound in (3.2) as
well as bounds (3.12) and (3.13) we find
[TABLE]
Thus limsupt↑∞(1/t)lnνt(C)≤−λ+ρ,
which proves the lemma once λ is sent to infw∈Csupφ∈X⋆{φ(w)−z(φ)∨ℓ}
and ρ is sent to zero.
∎
We conclude the section demonstrating an upper large deviation bound
for closed sets under the hypothesis that X is finite-dimensional
and that an exponential moment condition holds. No restriction on
ℓs is needed here.
Proposition 3.3**.**
Assume that X has finite dimension and that there exist numbers
ζ≥0 and ξ>0 such that E[eξ∥X1∥+v(S1)−ζS1\mathds1{S1<∞}]<+∞. Then, for each
F⊆X closed
[TABLE]
Proof.
Fix a closed set F in X and observe that infw∈Fsupφ∈X⋆{φ(w)−z(φ)∨ℓs}≥−z(0)∨ℓs>−∞. Pick
a real number λ<infw∈Fsupφ∈X⋆{φ(w)−z(φ)∨ℓs}. Let d be the dimension of X and
let φ1,…,φ2d be the linear functionals
introduced in the proof of proposition
2.4. Since z(φ)<+∞ if
∥φ∥≤ξ by hypothesis, as we have seen in Section
2.4, there exists a positive number M<+∞ with the
property that z(ξφi)≤M for each i. Pick a number
ρ>0 such that M−ξρ≤−λ. Denoting by K the
compact set ∩i=12d{w∈X:φi(w)≤ρ} we
have Kc=∪i=12d{w∈X:φi(w)>ρ}. This
way, starting from (3.2) and noticing that
0∈/{w∈X:φi(w)>ρ} for all i, by using the
Chernoff bound first and the bound
E[Uteξφ(Wt)+Ht]≤ez(ξφi)t due to
lemma 2.5 later we obtain
[TABLE]
which gives νt(F)=νt(F∩K)+νt(F∩Kc)≤νt(F∩K)+2dte−λt for each t. On the other hand, proposition
3.2 with the compact set F∩K shows that
limsupt↑∞(1/t)lnνt(F∩K)≤−infw∈F∩Ksupφ∈X⋆{φ(w)−z(φ)∨ℓs}≤−infw∈Fsupφ∈X⋆{φ(w)−z(φ)∨ℓs}≤−λ. Thus,
limsupt↑∞(1/t)lnνt(F)≤−λ and the
proposition is proved by sending λ to infw∈Fsupφ∈X⋆{φ(w)−z(φ)∨ℓs}.
∎
3.3 Theorem 1.2 point by point and counterexamples
Now we explicitly verify theorem 1.2 point by point. Assume
ℓs=−∞. Then, ℓi=−∞ and starting from the facts
that lnPt[Wt/t∈⋅]=lnνt−lnZt and
Zt:=E[eHt] for all t≥1 we get part (a) of theorem
1.2 thanks to proposition 3.1 and formula
(3.4) with φ=0. Similarly, part (b) of theorem
1.2 for compact and closed sets is obtained by combining
propositions 3.2 and 3.3 with formula
(3.3). As far as convex sets is concerned, we observe that
z(0)−I(0)=−supφ∈X⋆{−z(φ)}=infφ∈X⋆{z(φ)}
so that z(φ)≥z(0)−I(0) for all φ∈X⋆. This
way, part (b) of theorem 1.2 for convex sets follows when
I(0)<+∞ by invoking lemma 3.1 with
ℓ:=z(0)−I(0) and, again, formula (3.3) with φ=0.
The upper large deviation bound for convex sets cannot hold in general
when ℓs=−∞ and I(0)=+∞. We show two examples where it
fails, involving an open convex set and a closed convex set,
respectively. In these examples we assume P[1<S1<∞]=1 and
v=0, so that Ht=0, Zt=1, and Pt[Wt/t∈⋅]=νt
for every t. The following is the counterexample with an open convex
set.
Example 3.1**.**
Consider the reward Xi:=Si for each i. In this example we have
X=R, so that for any φ∈X⋆ there exists one
and only one real number k such that φ(w)=kw for all w.
As P[S1<∞]=1 and v=0, by identifying φ with k
definitions (1.1) and (1.2) give
z(k)=inf{ζ∈R:E[ekS1−ζS1]≤1}=k for all
k∈R, I(1)=0, and I(w)=+∞ for each
w∈R∖{1}. The rate function I is consistent with the
fact that ∑i≥1Si\mathds1{Ti≤t}=t if a renewal
occurs at time t. The upper bound
limsupt↑∞(1/t)lnPt[Wt/t∈C]≤−infw∈C{I(w)} does not hold with the open convex set C:=(−∞,1),
for which infw∈C{I(w)}=+∞. Indeed, keeping only the
term corresponding to τ=t−1 in the r.h.s. of
(3.2), observing that Wt−1/t=1−1/t∈C if
Ut−1=1, and recalling that P[S1>1]=1 by assumption, we
find for each t≥2
[TABLE]
giving limt↑∞(1/t)lnPt[Wt/t∈C]=0 by lemma
2.5 as z(0)=0.
The following is the counterexample with a closed convex set.
Example 3.2**.**
Consider the reward Xi:=(Si,Yi) for each i with Yi
independent of Si and distributed according to the standard Cauchy
law: P[Yi≤y]=(1/π)[π/2+arctan(y)] for all y∈R. In
this example X=R2, so that for any φ∈X⋆
there exists one and only one pair of real numbers k=(kS,kY) such
that φ(w)=kSwS+kYwY for all w=(wS,wY). As
P[S1<∞]=1 and v=0, and as Y1 has no exponential
moments, by identifying φ with k definition
(1.1) gives z(k)=inf{ζ∈R:E[ekSS1−ζS1]⋅E[ekYY1]≤1}=kS if kY=0 and
z(k)=+∞ if kY=0. It follows from definition
(1.2) that I(w)=0 if wS=1 and I(w)=+∞
otherwise. The upper bound
limsupt↑∞(1/t)lnPt[Wt/t∈C]≤−infw∈C{I(w)} does not hold with the closed convex set
C:={w∈R2:wS<1\mboxandwY≥1/(1−wS)}, for which
infw∈C{I(w)}=+∞. Indeed, as we shall show in a moment
we have for every t≥2
[TABLE]
giving limt↑∞(1/t)lnPt[Wt/t∈C]=0 by lemma
2.5 as z(0)=0.
In order to prove (3.14) we pick an integer t≥2 and
observe that when a renewal occurs at the time t−1, so that
∑i≥1Si\mathds1{Ti≤t−1}=t−1, then Wt−1/t∈C if and only if ∑i≥1Yi\mathds1{Ti≤t−1}≥t2. This way, keeping only the term corresponding to τ=t−1 in
the r.h.s. of (3.2) and recalling that
P[S1>1]=1 we get
[TABLE]
On the other hand, (1/n)∑i=1nYi is distributed as Y1 by
the stability property of the Cauchy law so that
[TABLE]
3.4 Theorem 1.3 point by point
To conclude, we explicitly verify theorem 1.3 point by
point. Assume ℓs>−∞. The functions Ii and Is defined
by (1.3) and (1.4) are the Fenchel-Legendre
transform of z∨ℓi−z(0)∨ℓs and
z∨ℓs−z(0)∨ℓi, respectively. Convexity and lower
semicontinuity of Ii and Is are immediate to check. The
functions Ii and Is are proper convex. Indeed, considering for
instance Ii, we have on the one hand
Ii(w)≥−z(0)∨ℓi+z(0)∨ℓs>−∞ for all w∈X,
and on the other hand Ii(u)≤J(u)+z(0)∨ℓs<+∞ at some
point u because J is proper convex. These arguments demonstrate
part (a) of theorem 1.3. As far as part (b) and part (c) is
concerned, we recall that lnPt[Wt/t∈⋅]=lnνt−lnZt and that Zt:=E[eHt] for all t in such a way that part
(b) follows from proposition 3.1 and formula
(3.4) with φ=0. Part (c) for compact and closed sets
is due to propositions 3.2 and 3.3
combined with formula (3.3). Finally, part (c) for convex
sets follows from lemma 3.1 with ℓ=ℓs and,
again, formula (3.3).
Acknowledgements
The author is grateful to Paolo Tilli for useful discussions about the
counterexamples presented in Section 3.3 and to Francesco
Caravenna and Paolo Dai Pra for valuable overall comments.
Appendix A Proof of lemma 1.1
Since S1<∞ with full probability and v=0, according to
definition (1.1) we have
z(φ)=inf{ζ∈R:E[eφ(X1)−ζS1]≤1} for all φ∈X⋆. We shall show that
for every β≥0 and w∈X
[TABLE]
where \mboxdomz:={φ∈X⋆:z(φ)<+∞} is the
effective domain of the function z. The identity I=Λ
immediately follows from (A.1) by taking β=1 and
proves part (a) of the lemma. Regarding part (b), assume
ℓs>−∞ and consider the function F that for a given
w∈X maps (β,φ)∈[0,1]×\mboxdomz in the real
number F(β,φ):=φ(w)−βz(φ)−(1−β)ℓs.
The function F is concave and upper semicontinuous with respect to
φ for each fixed β∈[0,1], inheriting these properties
from z, and convex and continuous with respect to β for each
fixed φ∈\mboxdomz. Then, due to compactness of the closed
interval [0,1], Sion’s minimax theorem allows us to exchange the
infimum over β∈[0,1] and the supremum over φ∈\mboxdomz:
\sup_{\varphi\in\scriptsize{\mbox{dom}\,}z}\inf_{\beta\in[0,1]}\big{\{}F(\beta,\varphi)\big{\}}=\inf_{\beta\in[0,1]}\sup_{\varphi\in\scriptsize{\mbox{dom}\,}z}\big{\{}F(\beta,\varphi)\big{\}}.
Since z(0)=0 and z(φ)=+∞ if φ∈\mboxdomz,
this identity yields
[TABLE]
This way, part (b) of the lemma is demonstrated as w is an arbitrary
point.
Let us prove (A.1). Pick β≥0 and
w∈X. To begin with, we point out that the function that
associates ζ with E[eφ(X1)−ζS1] for a given
φ∈X⋆ is lower semicontinuous by Fatou’s lemma, so
that E[eφ(X1)−z(φ)S1]≤1 if
z(φ)<+∞. It follows that for any φ∈\mboxdomz
[TABLE]
so that
infγ>0{γΥC(β/γ,w/γ)}≥φ(w)−βz(φ). Continuity of φ results in
Υ(β,w)≥φ(w)−βz(φ) and the
arbitrariness of φ gives
[TABLE]
The opposite bound, which leads us to the proof of
(A.1), is more involved and is achieved through the
following two inequalities:
[TABLE]
where
D:={(ζ,φ)∈R×X⋆:E[eφ(X1)−ζS1]<+∞}. To get at (A.2) we observe that
the definition of Υ immediately gives
[TABLE]
for all γ>0. The lower-semicontinuous regularization procedure
used to construct Υ entails that this bound also holds for
γ=0, as we now show, thus giving (A.2). The
rate function ΥC is proper convex by Cramér’s theorem, so that
there exist βo∈R and wo∈X such that
ΥC(βo,wo) is finite. It follows that
φ(wo)−βoζ−lnE[eφ(X1)−ζS1]≤ΥC(βo,wo)=:c≥0, that is lnE[eφ(X1)−ζS1]≥φ(wo)−βoζ−c for all ζ∈R and
φ∈X⋆. Then, for every δ>0 and
γo∈(0,δ) such that γo∣βo∣<δ and
γo∥wo∥<δ we find
[TABLE]
It follows that
[TABLE]
which exactly is (A.4) when γ=0.
Let us move to bound (A.3), which we prove by invoking
Sion’s minimax theorem once again. The function that associates
(ζ,φ)∈D with E[eφ(X1)−ζS1]
is lower semicontinuous by Fatou’s lemma and convex, so that the real
function that maps
(γ,ζ,φ)∈[0,β]×D in
φ(w)−βζ−γlnE[eφ(X1)−ζS1] is
concave and upper semicontinuous with respect to (ζ,φ) for
each fixed γ∈[0,β] and convex and continuous with respect
to γ for each fixed pair (ζ,φ)∈D. Then,
Sion’s theorem ensures us that
[TABLE]
On the other hand, if (ζ,φ)∈D, then
φ∈\mboxdomz because E[eφ(X1)−(ζ+h)S1]≤e−hE[eφ(X1)−ζS1]≤1 for all sufficiently large
h as S1≥1 with full probability. It follows that
[TABLE]
where the last bound demonstrates (A.3) and is
justified as follows. Pick any φ∈\mboxdomz and recall that
E[eφ(X1)−ζS1]≤1 or E[eφ(X1)−ζS1]>1 depending on whether ζ≥z(φ) or
ζ<z(φ) by definition of z(φ). The function that
associates ζ with ζ+ln1∨E[eφ(X1)−ζS1] is lower semicontinuous and increasing for ζ≥z(φ). It is not increasing for ζ<z(φ) because
ζ+ln1∨E[eφ(X1)−ζS1]=lnE[eφ(X1)−ζ(S1−1)] in this case and
S1≥1 with full probability. Then, this function attains a global
minimum at ζ=z(φ), so that ζ+ln1∨E[eφ(X1)−ζS1]≥z(φ) for all
ζ∈R.