Some functional (H¨olderian)limit theorems and their applications (I)
Alfredas Raˇckauskas
Vilnius University
Outils Statistiques et Probabilistes pour la Finance Universit´ede Rouen June 1–5, Rouen
(Rouen 2015) Some functional limit theorems 1 / 94 2 To demonstrate possible applications of the weak invariance principle. This include detection of changed segment in a sample, e.g. epidemic change of a mean, of a variance and some other parameters.
Aims of the lectures
1 To introduce the weak invariance principle in a H¨olderian framework (Lamperti’s type IP) by considering large family of random structures including independent identically distributed random variables, linear processes, random fields and others.
(Rouen 2015) Some functional limit theorems 2 / 94 Aims of the lectures
1 To introduce the weak invariance principle in a H¨olderian framework (Lamperti’s type IP) by considering large family of random structures including independent identically distributed random variables, linear processes, random fields and others. 2 To demonstrate possible applications of the weak invariance principle. This include detection of changed segment in a sample, e.g. epidemic change of a mean, of a variance and some other parameters.
(Rouen 2015) Some functional limit theorems 2 / 94 Aims of the lectures
1 To introduce the weak invariance principle in a H¨olderian framework (Lamperti’s type IP) by considering large family of random structures including independent identically distributed random variables, linear processes, random fields and others. 2 To demonstrate possible applications of the weak invariance principle. This include detection of changed segment in a sample, e.g. epidemic change of a mean, of a variance and some other parameters.
(Rouen 2015) Some functional limit theorems 2 / 94 Outline of the lecture Lamperti’s invariance principle
1 Introduction
2 H¨olderspaces
3 Weak convergence and tightness
4 Lamperti’s invariance principle
5 Adaptive FCLT
6 FCLT for triangular arrays
(Rouen 2015) Some functional limit theorems 3 / 94 Motto of the lecture
Theory without practice is empty Practice without theory is blind (adapted from Immanuel Kant)
(Rouen 2015) Some functional limit theorems 4 / 94 Introduction
First example
Suppose we have a population (e.g., monthly earnings, pass-rates etc.) whose mean, µ, is unknown. In order to learn something about µ, one takes a large independent sample X1,..., Xn from the population under consideration, and constructs the sample average 1 X := (X + ··· + X ). n n 1 n
By the strong law of large numbers, X n ≈ µ. In order to find a more quantitative estimate one can use the central limit theorem (CLT) which is most rudimentary example from which one could start the story named ,,invariance principle”.
(Rouen 2015) Some functional limit theorems 5 / 94 CLT [classical] If σ2 ∈ (0, ∞), then
1 D √ (Sn − nµ) −−−→ N (0, 1), nσ n→∞
where −−−→D means convergence in distribution and N (m, σ2) denotes the n→∞ normal random variable with mean m and variance σ2.
−−−→D n→∞
Let X1, X2,... be independent identically distributed (i.i.d.) random 2 2 variables, EX1 = µ, EX1 = σ . Denote their partial sums by
k X S0 = 0, Sk = Xj , j ≥ 1. j=1
(Rouen 2015) Some functional limit theorems 6 / 94 −−−→D n→∞
Let X1, X2,... be independent identically distributed (i.i.d.) random 2 2 variables, EX1 = µ, EX1 = σ . Denote their partial sums by
k X S0 = 0, Sk = Xj , j ≥ 1. j=1
CLT [classical] If σ2 ∈ (0, ∞), then
1 D √ (Sn − nµ) −−−→ N (0, 1), nσ n→∞ where −−−→D means convergence in distribution and N (m, σ2) denotes the n→∞ normal random variable with mean m and variance σ2.
(Rouen 2015) Some functional limit theorems 6 / 94 Let X1, X2,... be independent identically distributed (i.i.d.) random 2 2 variables, EX1 = µ, EX1 = σ . Denote their partial sums by
k X S0 = 0, Sk = Xj , j ≥ 1. j=1
CLT [classical] If σ2 ∈ (0, ∞), then
1 D √ (Sn − nµ) −−−→ N (0, 1), nσ n→∞ where −−−→D means convergence in distribution and N (m, σ2) denotes the n→∞ normal random variable with mean m and variance σ2.
−−−→D n→∞
(Rouen 2015) Some functional limit theorems 6 / 94 By this CLT we have for a < b ∈ R Z b √ 1 −x2/2 lim P( n(X n − µ)/σ ∈ (a, b)) = √ e dx. n→∞ 2π a One can then use this to derive approximate confidence bounds for µ. Since P(N (0, 1) ∈ [−1.96, 1.96]) ≈ 0.95, we deduce
1.96 1.96 P(µ ∈ (X − √ , X + √ ) ≈ 0.95 n σ n n σ n provided the sample size n is ,,large enough”.
(Rouen 2015) Some functional limit theorems 7 / 94 This was precisely asymptotic analysis of tn that initiated the so-called self-normalized CLT.
If σ2 is unknown we can use its estimator
n 1 X σ2 = (X − X )2 b n k n k=1 and explore the so called Student’s t-statistics √ n(X n − µ) tn = . σb
(Rouen 2015) Some functional limit theorems 8 / 94 If σ2 is unknown we can use its estimator
n 1 X σ2 = (X − X )2 b n k n k=1 and explore the so called Student’s t-statistics √ n(X n − µ) tn = . σb
This was precisely asymptotic analysis of tn that initiated the so-called self-normalized CLT.
(Rouen 2015) Some functional limit theorems 8 / 94 Recall that X1 belongs to the domain of attraction of a normal distribution (denoted by X1 ∈ DAN) if there exists a norming sequence bn ↑ ∞ such that −1 D b Sn −−−→ N (0, 1). n n→∞
Theorem (Selfnormalized CLT [Gin´e,G¨otze,Mason (1997)])
Let X1,..., Xn be iid random variables. Then the convergence
Sn D q −−−→ N (0, 1) 2 2 n→∞ X1 + ··· + Xn holds if and only if X1 ∈ DNA and EX1 = 0.
(Rouen 2015) Some functional limit theorems 9 / 94 More precisely we have a sample X1, X2,..., Xn and we wish to know whether there is a k∗, 1 < k∗ < n, such that
EX1 = ··· = EXk∗ = µ,
0 EXk∗+1 = ··· = Xn = µ Figure: Annual temperature and µ 6= µ0.
1
Second example
Now suppose you are drawing samples as time passes, and wish to know if the mean of the underlying population (e.g., annual temperature) has changed over time.
(Rouen 2015) Some functional limit theorems 10 / 94 Second example
Now suppose you are drawing samples as time passes, and wish to know if the mean of the underlying population (e.g., annual temperature) has changed over time. More precisely we have a sample X1, X2,..., Xn and we wish to know whether there is a k∗, 1 < k∗ < n, such that
EX1 = ··· = EXk∗ = µ,
0 EXk∗+1 = ··· = Xn = µ Figure: Annual temperature and µ 6= µ0.
1
(Rouen 2015) Some functional limit theorems 10 / 94 The simplest way to construct a required test is to take two parts of the given sample, one X1,..., Xk and the second one Xk+1,..., Xn, and to compare their sample averages 1 1 (X + ··· + X ) and (X + ··· + X ). k 1 k n − k k+1 n Calculating their difference gives the quantity
k n h X i T (k) := X − kX n k(n − k) j n j=1 which should be large provided the equality of means before and after the moment k∗ = k fails. ∗ As the point of change k is not known one has to look at Tn(k) for all possible k = 1,..., n.
(Rouen 2015) Some functional limit theorems 11 / 94 Thus, it turns out that one needs to investigate the quantity
Tn := max (Sk − kX n). 1≤k≤n
This is CUSUM test statistics which is one of the most frequently used method to detect change points. Actually it might be easier to start with
Mn := max (Sj − jµ), n ≥ 1 1≤j≤n and ask the question whether there is a limit distribution for Mn as n → ∞ under the assumption that X1,..., Xn all have the same distribution? It turns out that the answer is positive, and involves an invariance principle.
(Rouen 2015) Some functional limit theorems 12 / 94 Erd¨osand Kac described their method of proof as follows: ,,The proof of all these theorems follow the same pattern. It is first proved that the limiting distribution exists and is independent of the distribution of the Xi ’s; then the distribution of Xi ’s is chosen conveniently so that the limiting distribution can be calculated explicitly.” Perhaps the story ,,invariance principle” have realy started with their providence.
Erd¨os1 and Kac2contribution
The limit behavior of Mn = max1≤j≤n(Sj − jµ) was precisely the question that were interested Erd¨osand Kac (1946) in. They found
r Z x √ 2 −y 2/2 lim P( max (Sj − jµ) ≤ nx) = e dy n→∞ 1≤j≤n π 0
for all x ≥ 0, provided X1, X2,... are iid with mean µ and var(X1) = 1.
1Paul Erd¨os(26 March 1913 – 20 September 1996) was a Jewish-Hungarian mathematician 2Mark Kac (3 August 1914 – 26 October 1984) was a Polish American mathematician (Rouen 2015) Some functional limit theorems 13 / 94 Perhaps the story ,,invariance principle” have realy started with their providence.
Erd¨os1 and Kac2contribution
The limit behavior of Mn = max1≤j≤n(Sj − jµ) was precisely the question that were interested Erd¨osand Kac (1946) in. They found
r Z x √ 2 −y 2/2 lim P( max (Sj − jµ) ≤ nx) = e dy n→∞ 1≤j≤n π 0
for all x ≥ 0, provided X1, X2,... are iid with mean µ and var(X1) = 1. Erd¨osand Kac described their method of proof as follows: ,,The proof of all these theorems follow the same pattern. It is first proved that the limiting distribution exists and is independent of the distribution of the Xi ’s; then the distribution of Xi ’s is chosen conveniently so that the limiting distribution can be calculated explicitly.”
1Paul Erd¨os(26 March 1913 – 20 September 1996) was a Jewish-Hungarian mathematician 2Mark Kac (3 August 1914 – 26 October 1984) was a Polish American mathematician (Rouen 2015) Some functional limit theorems 13 / 94 Erd¨os1 and Kac2contribution
The limit behavior of Mn = max1≤j≤n(Sj − jµ) was precisely the question that were interested Erd¨osand Kac (1946) in. They found
r Z x √ 2 −y 2/2 lim P( max (Sj − jµ) ≤ nx) = e dy n→∞ 1≤j≤n π 0
for all x ≥ 0, provided X1, X2,... are iid with mean µ and var(X1) = 1. Erd¨osand Kac described their method of proof as follows: ,,The proof of all these theorems follow the same pattern. It is first proved that the limiting distribution exists and is independent of the distribution of the Xi ’s; then the distribution of Xi ’s is chosen conveniently so that the limiting distribution can be calculated explicitly.” Perhaps the story ,,invariance principle” have realy started with their providence. 1Paul Erd¨os(26 March 1913 – 20 September 1996) was a Jewish-Hungarian mathematician 2Mark Kac (3 August 1914 – 26 October 1984) was a Polish American mathematician (Rouen 2015) Some functional limit theorems 13 / 94 It is worth to note that Erd¨osand Kac worked out a number of other interesting functionals h((Sk , k = 1,..., n)). For example, they established arcsin law
n −1 X 2 √ lim P(n 1S >0 ≤ x) = arcsin( x), 0 ≤ x ≤ 1 n→∞ k π k=1
−2 Pn 2 and considered also limit behavior of functionals n k=1 Sk and −3/2 Pn n k=1 |Sk |.
(Rouen 2015) Some functional limit theorems 14 / 94 It is worth to note that Erd¨osand Kac worked out a number of other interesting functionals h((Sk , k = 1,..., n)). For example, they established arcsin law
n −1 X 2 √ lim P(n 1S >0 ≤ x) = arcsin( x), 0 ≤ x ≤ 1 n→∞ k π k=1
−2 Pn 2 and considered also limit behavior of functionals n k=1 Sk and −3/2 Pn n k=1 |Sk |.
(Rouen 2015) Some functional limit theorems 14 / 94 Consider the stochastic process
ζn(t) = Sbntc+(nt−bntc)Xbntc+1,
t ∈ [0, 1], where bac denotes the integer part of the number a.
Donsker’s3 contribution
Donsker (1951) provided a full generalization of Erd¨osand Kac technique by providing explicit embeddings of the sequance Sk , k = 1,..., n into a continuous time stochastic process ζn(t), t ∈ [0, 1] and by establishing the limiting distribution of a −1/2 general continuous functional h(n ζn).
3Monroe David Donsker (October 17, 1924 – June 8, 1991) was an American mathematician and a professor of mathematics at New York University. (Rouen 2015) Some functional limit theorems 15 / 94 Donsker’s3 contribution
Donsker (1951) provided a full generalization of Erd¨osand Kac technique by providing explicit embeddings of the sequance Sk , k = 1,..., n into a continuous time stochastic process ζn(t), t ∈ [0, 1] and by establishing the limiting distribution of a −1/2 general continuous functional h(n ζn).
Consider the stochastic process
ζn(t) = Sbntc+(nt−bntc)Xbntc+1,
t ∈ [0, 1], where bac denotes the integer part of the number a.
3Monroe David Donsker (October 17, 1924 – June 8, 1991) was an American mathematician and a professor of mathematics at New York University. (Rouen 2015) Some functional limit theorems 15 / 94 BackLIP
Theorem [Donsker’s IP (sometimes Donsker-Prohorov IP)] 2 2 If (Xi ) are i.i.d. zero mean random variables and EXi = σ > 0, then
−1/2 −1 D n σ ζn −−−→ W n→∞
in the space C[0, 1], where W = (Wt , t ∈ [0, 1]) is a standard Wiener process.
Donsker (1951) established the first universal functional limit theorem, called by him an invariance principle. To be more precise let us remind, that C[0, 1] is a Banach space of continuous functions x : [0, 1] → R endowed with the sup-norm
||x|| = sup |x(t)|, x ∈ C[0, 1]. t∈[0,1]
(Rouen 2015) Some functional limit theorems 16 / 94 Donsker (1951) established the first universal functional limit theorem, called by him an invariance principle. To be more precise let us remind, that C[0, 1] is a Banach space of continuous functions x : [0, 1] → R endowed with the sup-norm
||x|| = sup |x(t)|, x ∈ C[0, 1]. t∈[0,1]
BackLIP
Theorem [Donsker’s IP (sometimes Donsker-Prohorov IP)] 2 2 If (Xi ) are i.i.d. zero mean random variables and EXi = σ > 0, then
−1/2 −1 D n σ ζn −−−→ W n→∞ in the space C[0, 1], where W = (Wt , t ∈ [0, 1]) is a standard Wiener process.
(Rouen 2015) Some functional limit theorems 16 / 94 This result means particularly, that for any continuous function f : C[0, 1] → R we have
−1/2 −1 lim P(f (n σ ζn) ≤ x) = P(f (W ) ≤ x) n→∞ for all continuity points x of the limit distribution. The set of interesting examples of functions f includes
f (x) = sup x(t), f (x) = sup |x(s) − x(t)|, 0≤t≤1 0<|t−s|≤δ Z 1 Z 1 f (x) = x2(t) dt, f (x) |x(t)| dt 0 0 and many others.
(Rouen 2015) Some functional limit theorems 17 / 94 Taking f (x) = max0≤t≤1[x(t) − tx(1)] we deduce from Donsker’s IP theorem (assuming σ2 = 1), for each a ∈ R,
√ −2a2 lim P( max (Sj − jX n) > na) = P( max [Wt − tW1] > a) = e . n→∞ 1≤j≤n 0≤t≤1
Going back to Example 2 we find that an approximate rejection region ∗ ∗ 0 for H0 : k = 0 against H1 : k > 1 and µ > µ is given by q −1/2 −1/2 n max (Sj − jX n) ≥ log(α ) 1≤j≤n and has an asymptotic level α.
(Rouen 2015) Some functional limit theorems 18 / 94 Theorem (self-normalized version (b) of Donsker’s IP)
If (Xi ) are i.i.d. random variables. Then the convergence
ζn D q −−−→ W 2 2 n→∞ X1 + ··· + Xn
in the space C[0, 1] holds if and only if EX1 = 0 and X1 ∈ DNA.
2 2 In the case where σ = var(X1) is unknown one can use its estimator σb as in the CLT. This leads to the following self-normalized extensions of Donsker’s result. Theorem (self-normalized version (a) of Donsker’s IP) 2 2 If (Xi ) are i.i.d. zero mean random variables and σ = EXi < ∞ then
1 D √ ζn −−−→ W nσb n→∞ in the space C[0, 1].
(Rouen 2015) Some functional limit theorems 19 / 94 2 2 In the case where σ = var(X1) is unknown one can use its estimator σb as in the CLT. This leads to the following self-normalized extensions of Donsker’s result. Theorem (self-normalized version (a) of Donsker’s IP) 2 2 If (Xi ) are i.i.d. zero mean random variables and σ = EXi < ∞ then
1 D √ ζn −−−→ W nσb n→∞ in the space C[0, 1].
Theorem (self-normalized version (b) of Donsker’s IP)
If (Xi ) are i.i.d. random variables. Then the convergence
ζn D q −−−→ W 2 2 n→∞ X1 + ··· + Xn in the space C[0, 1] holds if and only if EX1 = 0 and X1 ∈ DNA.
(Rouen 2015) Some functional limit theorems 19 / 94 Latter Prokhorov (1956) completed the general theory of weak convergence of measures in metric spaces and gave general conditions for convergence of continuous stochastic processes.
Before we pass to an other example let us shortly look at the follow-up of the ,,invariance principle” story. After Donsker’s paper Kolmogorov4 and Prokhorov5 (1954) connected the invariance principle with theorems about weak convergence of measures.
4Andrey Nikolaevich Kolmogorov (25 April 1903 20 October 1987) was a 20th-century Soviet mathematician who made significant contributions to the mathematics of probability theory, topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and computational complexity. 5Yuri Vasilyevich Prokhorov (15 December 1929 16 July 2013) was a Russian mathematician, active in the field of probability theory. (Rouen 2015) Some functional limit theorems 20 / 94 Before we pass to an other example let us shortly look at the follow-up of the ,,invariance principle” story. After Donsker’s paper Kolmogorov4 and Prokhorov5 (1954) connected the invariance principle with theorems about weak convergence of measures. Latter Prokhorov (1956) completed the general theory of weak convergence of measures in metric spaces and gave general conditions for convergence of continuous stochastic processes.
4Andrey Nikolaevich Kolmogorov (25 April 1903 20 October 1987) was a 20th-century Soviet mathematician who made significant contributions to the mathematics of probability theory, topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and computational complexity. 5Yuri Vasilyevich Prokhorov (15 December 1929 16 July 2013) was a Russian mathematician, active in the field of probability theory. (Rouen 2015) Some functional limit theorems 20 / 94 ,,The ”invariance principles” of probability theory are mathematically of (n) the following form: a sequence of stochastic processes {xt } induces a sequence of measures µn on some suitable topological function space S, and one proves that the measures converge weakly to a measure µ corresponding to a limiting process {xt }. Weak convergence of measures means here that Z Z lim fdµn = fdµ (wc definition (a)) n→∞ S S for all bounded continuous real-valued functions f on S.
Lamperti’s 6contribution
Next Lamperti explained his viewpoint on the story: John Lamperti. On convergence of stochastic processes. Trans. Amer. Math. Soc. 104, 430–435 (1962).
6Professor (emeritus), Department of Mathematics, Dartmouth College (Rouen 2015) Some functional limit theorems 21 / 94 Lamperti’s 6contribution
Next Lamperti explained his viewpoint on the story: John Lamperti. On convergence of stochastic processes. Trans. Amer. Math. Soc. 104, 430–435 (1962).
,,The ”invariance principles” of probability theory are mathematically of (n) the following form: a sequence of stochastic processes {xt } induces a sequence of measures µn on some suitable topological function space S, and one proves that the measures converge weakly to a measure µ corresponding to a limiting process {xt }. Weak convergence of measures means here that Z Z lim fdµn = fdµ (wc definition (a)) n→∞ S S for all bounded continuous real-valued functions f on S.
6Professor (emeritus), Department of Mathematics, Dartmouth College (Rouen 2015) Some functional limit theorems 21 / 94 This is equivalent to the condition that
(n) lim L(f (xt )) = L(f (xt ))), (wc definition (b)) n→∞ where L(X ) is the distribution function of the random variable X , f () is a real-valued function S-continuous almost everywhere (µ), and the limit is in the sense of the usual weak convergence of distributions. Equation (wc definition (b)) is usually the real center of interest, for many ,,limit-distribution theorems” are implicit in it.” Lamperti also points:
,,It is clear that for given (µn) and µ, the better theorem of this kind would be the one in which (wc definition (b)) is proved for the larger class of functions f .”
(Rouen 2015) Some functional limit theorems 22 / 94 One can think about say log-returns of certain financial instrument.
Third example (number of big claims)
Let Y1, Y2,..., Yn be a sequence of independent and identically distributed random variables with cumulative distribution function F
and denote by Xi (u) = 1{Yi ≥u} the indicator variable. The quantity u ∈ (0, ∞) is a fixed threshold which is exceeded by Yi with probability
p = P(Xi (u) = 1) = E(Xi (u)) = P(Yi > u) = F (u),
where F denotes the tail probability of Yi .
(Rouen 2015) Some functional limit theorems 23 / 94 Third example (number of big claims)
Let Y1, Y2,..., Yn be a sequence of independent and identically distributed random variables with cumulative distribution function F
and denote by Xi (u) = 1{Yi ≥u} the indicator variable. The quantity u ∈ (0, ∞) is a fixed threshold which is exceeded by Yi with probability
p = P(Xi (u) = 1) = E(Xi (u)) = P(Yi > u) = F (u),
where F denotes the tail probability of Yi .
One can think about say log-returns of certain financial instrument.
(Rouen 2015) Some functional limit theorems 23 / 94 Let us consider all the moving windows of length k in the sequence Y1, Y2,..., Yn, namely,
Yi , Yi+1,..., Yi+k−1, i = 1, 2,..., n − k + 1.
Define the k-scan exceeds process as follows:
i+k−1 i+k−1 (i) X X Sk (u) = Xj (u) = 1(u,∞)(Yi ), i = 1,..., n − k + 1. j=i j=i
This process counts the number of random variables, among Yi , Yi+1,..., Yi+k−1, whose value exceeds threshold u, while
(i) Sn,k (u) = max S (u) 1≤i≤n−k+1 k expresses the maximum number of exceeds occurrence among all possible moving windows of length k, in the sequence Y1, Y2,..., Yn.
(Rouen 2015) Some functional limit theorems 24 / 94 Asymptotic distributions of
Sn,k (u) and max q(k)Sn,k (u) n 1≤k≤n where q(k) is a windows lengths of interest are of great importance. To understand asymptotic behaviour of these quantities one needs to consider polygonal line processes on function spaces with stronger topology as that of the space of continuous functions.
(Rouen 2015) Some functional limit theorems 25 / 94 Asymptotic distributions of
Sn,k (u) and max q(k)Sn,k (u) n 1≤k≤n where q(k) is a windows lengths of interest are of great importance. To understand asymptotic behaviour of these quantities one needs to consider polygonal line processes on function spaces with stronger topology as that of the space of continuous functions.
(Rouen 2015) Some functional limit theorems 25 / 94 H¨olderspaces The introduction of H¨older7 spaces answers the purpose to quantify the global smoothness of functions by controlling their modulus of uniform continuity. We shall discuss 1 definition of H¨olderspaces; 2 some geometry of this space, including characterization of compact sets; 3 weak convergence of probability measures on these spaces; 4 conditions for random processes to have versions with H¨olderianpaths;
5 general conditions of tightness of measures induced by polygonal line processes.
7 Otto Ludwig H¨older(December 22, 1859 – August 29, 1937) was a German mathematician born in Stuttgart. Noted for many results and ideas including: H¨older’s inequality, the Jordan-H¨older theorem, H¨oldercondition (or H¨oldercontinuity) which are used in many areas of analysis and stochastic processes.
(Rouen 2015) Some functional limit theorems 26 / 94 The set Hα is a Banach space when endowed with the norm
kxkα = |x(0)| + ωα(x, 1), x ∈ Hα.
However neither of Hα is separable. [To see this it is enough to consider the set of functions {fs : 0 ≤ s ≤ 1} α where for each s, fs (t) = |t − s| , 0 ≤ t ≤ 1, and observe that the distance 0 kfs − fs0 kα ≥ 2 for s 6= s .] If 0 ≤ α < β ≤ 1, Hβ is topologically embedded in Hα and all these H¨olderspaces are topologically embedded in the classical Banach space C[0, 1].
o The spaces Hα
For fixed 0 ≤ α ≤ 1, denote by Hα := Hα[0, 1] the set of real-valued continuous functions x : [0, 1] → R such that ωα(x, 1) < ∞, where |x(t) − x(s)| ωα(x, δ) := sup α , 0 ≤ δ < 1 0<|t−s|<δ |t − s| is so called H¨olderianmodulus of continuity of the function x.
(Rouen 2015) Some functional limit theorems 27 / 94 However neither of Hα is separable. [To see this it is enough to consider the set of functions {fs : 0 ≤ s ≤ 1} α where for each s, fs (t) = |t − s| , 0 ≤ t ≤ 1, and observe that the distance 0 kfs − fs0 kα ≥ 2 for s 6= s .] If 0 ≤ α < β ≤ 1, Hβ is topologically embedded in Hα and all these H¨olderspaces are topologically embedded in the classical Banach space C[0, 1].
o The spaces Hα
For fixed 0 ≤ α ≤ 1, denote by Hα := Hα[0, 1] the set of real-valued continuous functions x : [0, 1] → R such that ωα(x, 1) < ∞, where |x(t) − x(s)| ωα(x, δ) := sup α , 0 ≤ δ < 1 0<|t−s|<δ |t − s| is so called H¨olderianmodulus of continuity of the function x. The set Hα is a Banach space when endowed with the norm
kxkα = |x(0)| + ωα(x, 1), x ∈ Hα.
(Rouen 2015) Some functional limit theorems 27 / 94 If 0 ≤ α < β ≤ 1, Hβ is topologically embedded in Hα and all these H¨olderspaces are topologically embedded in the classical Banach space C[0, 1].
o The spaces Hα
For fixed 0 ≤ α ≤ 1, denote by Hα := Hα[0, 1] the set of real-valued continuous functions x : [0, 1] → R such that ωα(x, 1) < ∞, where |x(t) − x(s)| ωα(x, δ) := sup α , 0 ≤ δ < 1 0<|t−s|<δ |t − s| is so called H¨olderianmodulus of continuity of the function x. The set Hα is a Banach space when endowed with the norm
kxkα = |x(0)| + ωα(x, 1), x ∈ Hα.
However neither of Hα is separable. [To see this it is enough to consider the set of functions {fs : 0 ≤ s ≤ 1} α where for each s, fs (t) = |t − s| , 0 ≤ t ≤ 1, and observe that the distance 0 kfs − fs0 kα ≥ 2 for s 6= s .]
(Rouen 2015) Some functional limit theorems 27 / 94 o The spaces Hα
For fixed 0 ≤ α ≤ 1, denote by Hα := Hα[0, 1] the set of real-valued continuous functions x : [0, 1] → R such that ωα(x, 1) < ∞, where |x(t) − x(s)| ωα(x, δ) := sup α , 0 ≤ δ < 1 0<|t−s|<δ |t − s| is so called H¨olderianmodulus of continuity of the function x. The set Hα is a Banach space when endowed with the norm
kxkα = |x(0)| + ωα(x, 1), x ∈ Hα.
However neither of Hα is separable. [To see this it is enough to consider the set of functions {fs : 0 ≤ s ≤ 1} α where for each s, fs (t) = |t − s| , 0 ≤ t ≤ 1, and observe that the distance 0 kfs − fs0 kα ≥ 2 for s 6= s .] If 0 ≤ α < β ≤ 1, Hβ is topologically embedded in Hα and all these H¨olderspaces are topologically embedded in the classical Banach space C[0, 1].
(Rouen 2015) Some functional limit theorems 27 / 94 o For any 0 ≤ α < 1, the subspace Hα is closed and separable. [The closeness follows straightforward. The separability follows from the o existence of Schauder basis in each Hα (to be stated below).] o Hence, for any 0 ≤ α < 1, the space Hα is a separable Banach space with the norm k · kα,
|x(t) − x(s)| o kxkα = |x(0)| + sup α , x ∈ Hα. 0<|t−s|<1 |t − s|
o H0 ' C[0, 1].
To remedy the non separability drawback of Hα, one introduces its o subspace Hα:
o Hα = {x ∈ Hα : lim ωα(x, δ) = 0}. δ→0
(Rouen 2015) Some functional limit theorems 28 / 94 o Hence, for any 0 ≤ α < 1, the space Hα is a separable Banach space with the norm k · kα,
|x(t) − x(s)| o kxkα = |x(0)| + sup α , x ∈ Hα. 0<|t−s|<1 |t − s|
o H0 ' C[0, 1].
To remedy the non separability drawback of Hα, one introduces its o subspace Hα:
o Hα = {x ∈ Hα : lim ωα(x, δ) = 0}. δ→0
o For any 0 ≤ α < 1, the subspace Hα is closed and separable. [The closeness follows straightforward. The separability follows from the o existence of Schauder basis in each Hα (to be stated below).]
(Rouen 2015) Some functional limit theorems 28 / 94 o H0 ' C[0, 1].
To remedy the non separability drawback of Hα, one introduces its o subspace Hα:
o Hα = {x ∈ Hα : lim ωα(x, δ) = 0}. δ→0
o For any 0 ≤ α < 1, the subspace Hα is closed and separable. [The closeness follows straightforward. The separability follows from the o existence of Schauder basis in each Hα (to be stated below).] o Hence, for any 0 ≤ α < 1, the space Hα is a separable Banach space with the norm k · kα,
|x(t) − x(s)| o kxkα = |x(0)| + sup α , x ∈ Hα. 0<|t−s|<1 |t − s|
(Rouen 2015) Some functional limit theorems 28 / 94 To remedy the non separability drawback of Hα, one introduces its o subspace Hα:
o Hα = {x ∈ Hα : lim ωα(x, δ) = 0}. δ→0
o For any 0 ≤ α < 1, the subspace Hα is closed and separable. [The closeness follows straightforward. The separability follows from the o existence of Schauder basis in each Hα (to be stated below).] o Hence, for any 0 ≤ α < 1, the space Hα is a separable Banach space with the norm k · kα,
|x(t) − x(s)| o kxkα = |x(0)| + sup α , x ∈ Hα. 0<|t−s|<1 |t − s|
o H0 ' C[0, 1].
(Rouen 2015) Some functional limit theorems 28 / 94 Let us denote by Dj the set of dyadic numbers in [0, 1] of level j, i.e. −j j−1 D0 = {0, 1}, Dj = (2l − 1)2 ; 1 ≤ l ≤ 2 , j ≥ 1.
Write for r ∈ Dj , j ≥ 0, r − := r − 2−j , r + := r + 2−j .
For r ∈ Dj , j ≥ 1, the triangular Faber-Schauder functions Λr are continuous, piecewise affine with support [r −, r +] and taking the value 1 at r: 2j (t − r −) if t ∈ (r −, r]; j + + Λr (t) = 2 (r − t) if t ∈ (r, r ]; 0 else.
o Schauder basis in Hα o One of the most interesting features of the spaces Hα is the existence of a basis of triangular functions8.
8Ciesielski (1960) (Rouen 2015) Some functional limit theorems 29 / 94 For r ∈ Dj , j ≥ 1, the triangular Faber-Schauder functions Λr are continuous, piecewise affine with support [r −, r +] and taking the value 1 at r: 2j (t − r −) if t ∈ (r −, r]; j + + Λr (t) = 2 (r − t) if t ∈ (r, r ]; 0 else.
o Schauder basis in Hα o One of the most interesting features of the spaces Hα is the existence of a basis of triangular functions8.
Let us denote by Dj the set of dyadic numbers in [0, 1] of level j, i.e. −j j−1 D0 = {0, 1}, Dj = (2l − 1)2 ; 1 ≤ l ≤ 2 , j ≥ 1.
Write for r ∈ Dj , j ≥ 0, r − := r − 2−j , r + := r + 2−j .
8Ciesielski (1960) (Rouen 2015) Some functional limit theorems 29 / 94 o Schauder basis in Hα o One of the most interesting features of the spaces Hα is the existence of a basis of triangular functions8.
Let us denote by Dj the set of dyadic numbers in [0, 1] of level j, i.e. −j j−1 D0 = {0, 1}, Dj = (2l − 1)2 ; 1 ≤ l ≤ 2 , j ≥ 1.
Write for r ∈ Dj , j ≥ 0, r − := r − 2−j , r + := r + 2−j .
For r ∈ Dj , j ≥ 1, the triangular Faber-Schauder functions Λr are continuous, piecewise affine with support [r −, r +] and taking the value 1 at r: 2j (t − r −) if t ∈ (r −, r]; j + + Λr (t) = 2 (r − t) if t ∈ (r, r ]; 0 else.
8Ciesielski (1960) (Rouen 2015) Some functional limit theorems 29 / 94 Λr (t) 6 1 £C £ C £ C £ C £ C £ C £ C £ C £ C - − + 0 r r -r t 2−j
Figure: The Faber-Schauder triangular function Λr
When j = 0, Λ0(t) = 1 − t, Λ1(t) = t, t ∈ [0, 1].
(Rouen 2015) Some functional limit theorems 30 / 94 o Theorem (existence of Schauder basis in Hα)
For each 0 ≤ α < 1, the sequence {Λr ; r ∈ Dj , j ≥ 0} is a Schauder basis o o in Hα: each x ∈ Hα has a unique expansion
∞ X X x(t) = λr (x)Λr (t), t ∈ [0, 1],
j=0 r∈Dj where the Schauder scalar coefficients λr (x) are given by
x(r +) + x(r −) λ (x) = x(r) − , r ∈ D , j ≥ 1, r 2 j and in the special case j = 0 by
λ0(x) = x(0), λ1(x) = x(1).
(Rouen 2015) Some functional limit theorems 31 / 94 Proof. o Let x ∈ Hα. The partial sum
J X X EJ (x)(t) := λr (x)Λr (t), t ∈ [0, 1],
j=0 r∈Dj gives the linear interpolation of x by a polygonal line between the dyadic points of level at most J. One can check that
−J kx − EJ xkα ≤ 4ωα(x, 2 ).
This estimate proves the result.
(Rouen 2015) Some functional limit theorems 32 / 94 Equivalent norm
o Theorem (equivalent sequential norm in Hα)[Ciesielski (1960)]
The norm kxkα is equivalent to the following sequence norm :
seq jα kxkα := sup 2 max |λr (x)|, j≥0 r∈Dj
that is, there exist two positive constants c, C > 0 such that
seq seq ckxkα ≤ kxkα ≤ Ckxkα
o for any x ∈ Hα.
(Rouen 2015) Some functional limit theorems 33 / 94 Proof. It is enough to follow along the lines of the proof of Arzela-Ascoli theorem.
Compact sets
o Next we characterize compact sets in Hα.
o Theorem (compact sets in Hα) o Let 0 ≤ α < 1. The set K ⊂ Hα is compact if and only if (i) K is bounded: sup ||x|| < ∞; x∈K (ii) K is α-equicontinuous:
lim sup ωα(x, δ) = 0. δ→0 x∈K
(Rouen 2015) Some functional limit theorems 34 / 94 Compact sets
o Next we characterize compact sets in Hα.
o Theorem (compact sets in Hα) o Let 0 ≤ α < 1. The set K ⊂ Hα is compact if and only if (i) K is bounded: sup ||x|| < ∞; x∈K (ii) K is α-equicontinuous:
lim sup ωα(x, δ) = 0. δ→0 x∈K
Proof. It is enough to follow along the lines of the proof of Arzela-Ascoli theorem.
(Rouen 2015) Some functional limit theorems 34 / 94 We associate to ρ the H¨olderspace
o Hρ := {x ∈ C[0, 1] : lim ωρ(x, δ) = 0}, δ→0 equiped with the norm
kxkρ := |x(0)| + ωρ(x, 1).
Generalized H¨olderspaces
Let ρ be a real valued non decreasing function on [0, 1], null and right continuous at 0, positive on (0, 1]. For a function x : [0, 1] → R put
|x(t) − x(s)| ωρ(x, δ) := sup . s,t∈[0,1], ρ(t − s) 0 (Rouen 2015) Some functional limit theorems 35 / 94 Generalized H¨olderspaces Let ρ be a real valued non decreasing function on [0, 1], null and right continuous at 0, positive on (0, 1]. For a function x : [0, 1] → R put |x(t) − x(s)| ωρ(x, δ) := sup . s,t∈[0,1], ρ(t − s) 0 We associate to ρ the H¨olderspace o Hρ := {x ∈ C[0, 1] : lim ωρ(x, δ) = 0}, δ→0 equiped with the norm kxkρ := |x(0)| + ωρ(x, 1). (Rouen 2015) Some functional limit theorems 35 / 94 o Under some restrictions on ρ ( denoted ρ ∈ R), the space Hρ is a separable Banach space and its norm is equivalent to sequential one: seq 1 o kxkρ := sup −j max |λj,t (x)|, x ∈ Hρ. j≥0 ρ(2 ) t∈Dj Particularly the function ρ = ρα,β, 0 < α < 1, β ∈ R, defined by: α β ρα,β(h) := h ln (c/h), 0 < h ≤ 1, for a suitable constant c belongs to R. o o o o We write Hα,β for Hρ when ρ = ρα,β and we abbreviate Hα,0 in Hα. (Rouen 2015) Some functional limit theorems 36 / 94 o Compact sets in Hρ Theorem o Let ρ ∈ R. The set K ⊂ Hρ is compact if and only if (i) K is bounded: sup ||x|| < ∞; x∈K (ii) K is ρ-equicontinuous: lim sup ωρ(x, δ) = 0. δ→0 x∈K (Rouen 2015) Some functional limit theorems 37 / 94 The first result in this direction goes back to the Kolmogorov’s sufficient condition for the existence of a continuous version of ξ. In fact, the same condition gives a version of ξ with some α-H¨older regularity. Theorem [Kolmogorov’s, on the existence of a continuous version] Assume that the process ξ = (ξt , t ∈ [0, 1]} satisfies the condition: there exists δ > 0 and γ > 1 such that for each t ∈ [0, 1] and h > 0 such that t + h ∈ [0, 1] −γ 1+δ P(|ξt+h − ξt | > λ) ≤ cλ h . o Then ξ admits a version with almost all paths in the space Hα for α < δ/γ. Random processes with paths in H¨olderspaces As random processes induce probability measures on function spaces, it is natural to ask the question, when a random process, say, o ξ = (ξt , t ∈ [0, 1]), induces a probability measure on Hα? (Rouen 2015) Some functional limit theorems 38 / 94 In fact, the same condition gives a version of ξ with some α-H¨older regularity. Theorem [Kolmogorov’s, on the existence of a continuous version] Assume that the process ξ = (ξt , t ∈ [0, 1]} satisfies the condition: there exists δ > 0 and γ > 1 such that for each t ∈ [0, 1] and h > 0 such that t + h ∈ [0, 1] −γ 1+δ P(|ξt+h − ξt | > λ) ≤ cλ h . o Then ξ admits a version with almost all paths in the space Hα for α < δ/γ. Random processes with paths in H¨olderspaces As random processes induce probability measures on function spaces, it is natural to ask the question, when a random process, say, o ξ = (ξt , t ∈ [0, 1]), induces a probability measure on Hα? The first result in this direction goes back to the Kolmogorov’s sufficient condition for the existence of a continuous version of ξ. (Rouen 2015) Some functional limit theorems 38 / 94 Theorem [Kolmogorov’s, on the existence of a continuous version] Assume that the process ξ = (ξt , t ∈ [0, 1]} satisfies the condition: there exists δ > 0 and γ > 1 such that for each t ∈ [0, 1] and h > 0 such that t + h ∈ [0, 1] −γ 1+δ P(|ξt+h − ξt | > λ) ≤ cλ h . o Then ξ admits a version with almost all paths in the space Hα for α < δ/γ. Random processes with paths in H¨olderspaces As random processes induce probability measures on function spaces, it is natural to ask the question, when a random process, say, o ξ = (ξt , t ∈ [0, 1]), induces a probability measure on Hα? The first result in this direction goes back to the Kolmogorov’s sufficient condition for the existence of a continuous version of ξ. In fact, the same condition gives a version of ξ with some α-H¨older regularity. (Rouen 2015) Some functional limit theorems 38 / 94 Random processes with paths in H¨olderspaces As random processes induce probability measures on function spaces, it is natural to ask the question, when a random process, say, o ξ = (ξt , t ∈ [0, 1]), induces a probability measure on Hα? The first result in this direction goes back to the Kolmogorov’s sufficient condition for the existence of a continuous version of ξ. In fact, the same condition gives a version of ξ with some α-H¨older regularity. Theorem [Kolmogorov’s, on the existence of a continuous version] Assume that the process ξ = (ξt , t ∈ [0, 1]} satisfies the condition: there exists δ > 0 and γ > 1 such that for each t ∈ [0, 1] and h > 0 such that t + h ∈ [0, 1] −γ 1+δ P(|ξt+h − ξt | > λ) ≤ cλ h . o Then ξ admits a version with almost all paths in the space Hα for α < δ/γ. (Rouen 2015) Some functional limit theorems 38 / 94 Examples Wiener process (Brownian motion) Definition A standard Wiener process (also called Brownian motion ) is a stochastic process W = (Wt , t ≥ 0) with the following properties: (1) W0 = 0 (2) the process has stationary and independent increments (3) the increment Wt+h − Wt ∼ N (0, h) (4) with probability 1, the function t → Wt is continuous. (Rouen 2015) Some functional limit theorems 39 / 94 o Hence, W has version with paths in Hα for any α < 1/2 − 1/q. Since o q > 2 is arbitrary we conclude that W has a version with paths in Hα for any α < 1/2. This is the best possible regularity power of Wiener process. o In the class {Hα,β}, the best possible H¨olderspace for a version of o Wiener process is H1/2.β, where β > 1/2. Consider W = (W (t), t ∈ [0, 1]). Since W (t + h) − W (t) has normal distribution with zero mean and variance h, we find −q q −q q/2 P(|W (t +h)−W (t)| > λ) ≤ λ E|W (t +h)−W (t)| ≤ cqλ |h| . (Rouen 2015) Some functional limit theorems 40 / 94 Consider W = (W (t), t ∈ [0, 1]). Since W (t + h) − W (t) has normal distribution with zero mean and variance h, we find −q q −q q/2 P(|W (t +h)−W (t)| > λ) ≤ λ E|W (t +h)−W (t)| ≤ cqλ |h| . o Hence, W has version with paths in Hα for any α < 1/2 − 1/q. Since o q > 2 is arbitrary we conclude that W has a version with paths in Hα for any α < 1/2. This is the best possible regularity power of Wiener process. o In the class {Hα,β}, the best possible H¨olderspace for a version of o Wiener process is H1/2.β, where β > 1/2. (Rouen 2015) Some functional limit theorems 40 / 94 Fractional Brownian motion Definition Standard fractional Brownian motion is a Gaussian process BH = (BH (t), t ∈ [0, 1]) with expectation zero and the following covariance function: 1 2H 2H 2H E[BH (t)BH (s)] = 2 (|t| + |s| − |t − s| ), where H is a real number in (0, 1), called the Hurst index or Hurst exponent associated with the fractional Brownian motion. (Rouen 2015) Some functional limit theorems 41 / 94 Since W is a Gaussian process and W (t + h) − W (t) has normal distribution with mean zero and variance h2H , we have −q q P(|WH (t + h) − WH (t)| > λ) ≤ λ E|W (t + h) − W (t)| −q Hq ≤ cqλ |h| . o Hence, W has a version with paths in Hα for any α < H − 1/q. Since q > 2 is arbitrary we conclude that W has a version with paths o in Hα for any α < H. Let WH = (WH (t), t ∈ [0, 1]) be a standard fractional Brownian motion with Hurst exponent H, 0 < H < 1. (Rouen 2015) Some functional limit theorems 42 / 94 o Hence, W has a version with paths in Hα for any α < H − 1/q. Since q > 2 is arbitrary we conclude that W has a version with paths o in Hα for any α < H. Let WH = (WH (t), t ∈ [0, 1]) be a standard fractional Brownian motion with Hurst exponent H, 0 < H < 1. Since W is a Gaussian process and W (t + h) − W (t) has normal distribution with mean zero and variance h2H , we have −q q P(|WH (t + h) − WH (t)| > λ) ≤ λ E|W (t + h) − W (t)| −q Hq ≤ cqλ |h| . (Rouen 2015) Some functional limit theorems 42 / 94 Let WH = (WH (t), t ∈ [0, 1]) be a standard fractional Brownian motion with Hurst exponent H, 0 < H < 1. Since W is a Gaussian process and W (t + h) − W (t) has normal distribution with mean zero and variance h2H , we have −q q P(|WH (t + h) − WH (t)| > λ) ≤ λ E|W (t + h) − W (t)| −q Hq ≤ cqλ |h| . o Hence, W has a version with paths in Hα for any α < H − 1/q. Since q > 2 is arbitrary we conclude that W has a version with paths o in Hα for any α < H. (Rouen 2015) Some functional limit theorems 42 / 94 Definition of weak convergence of probability measures A sequence of probability measures (Pn) ⊂ P(S) converges weakly to a w probability measure P ∈ P(S) (denoted Pn −−−→ P) if n→∞ Z Z lim f (x)Pn(dx) = f (x)P(dx) n→∞ S S for each bounded continuous function f : S → R. Weak convergence and tightness: general Let (S, d) be a complete separable metric space where S denotes the set and d is the metric. Let BS denote the σ-algebra of Borel sets associated with the topology induced on S by d. Let P(S) denote the set of all probability measures on (S, BS ). (Rouen 2015) Some functional limit theorems 43 / 94 Weak convergence and tightness: general Let (S, d) be a complete separable metric space where S denotes the set and d is the metric. Let BS denote the σ-algebra of Borel sets associated with the topology induced on S by d. Let P(S) denote the set of all probability measures on (S, BS ). Definition of weak convergence of probability measures A sequence of probability measures (Pn) ⊂ P(S) converges weakly to a w probability measure P ∈ P(S) (denoted Pn −−−→ P) if n→∞ Z Z lim f (x)Pn(dx) = f (x)P(dx) n→∞ S S for each bounded continuous function f : S → R. (Rouen 2015) Some functional limit theorems 43 / 94 There is a metric ρ for P(S) that induces weak convergence, that is, w Pn −−−→ P if and only if limn→∞ ρ(Pn, P) = 0. n→∞ Examples provide Bounded Lipschitz metric n Z Z o dBL(P, Q) = sup fdP − fdQ : f ∈ L1 |f (x) − f (y)| f ∈ L1 : sup |f (x)| + sup ≤ 1. x x6=y d(x, y) and Prohorov metric π(P, Q) = inf{ε > 0 : P(A) ≤ Q(Aε) + ε, A ∈ B(S)}, where Aε = {x : d(x, A) ≤ ε}. (Rouen 2015) Some functional limit theorems 44 / 94 Definition of tightness of a set of probability measures A family of probability measures P0 ⊂ P(S) is tight if for each ε > 0 there is a compact set Kε ⊂ S such that P(Kε) > 1 − ε for all P ∈ P0. Definition of relative compactness of a set of probability measures A family of probability measures P0 ⊂ P(S) is (weakly) relatively compact if each sequence (Pn) ⊂ P0 has a subsequence that converges weakly to a probability measure P ∈ P(S). (Rouen 2015) Some functional limit theorems 45 / 94 Definition of relative compactness of a set of probability measures A family of probability measures P0 ⊂ P(S) is (weakly) relatively compact if each sequence (Pn) ⊂ P0 has a subsequence that converges weakly to a probability measure P ∈ P(S). Definition of tightness of a set of probability measures A family of probability measures P0 ⊂ P(S) is tight if for each ε > 0 there is a compact set Kε ⊂ S such that P(Kε) > 1 − ε for all P ∈ P0. (Rouen 2015) Some functional limit theorems 45 / 94 Corollary (mostly used in asymptotic theory) Suppose that (Pn) is a tight family of probability measures on (S, BS ) and that there is a probability measure P on (S, BS ) such that each weakly convergent subsequence of (Pn) has limit P. Then w Pn −−−→ P. n→∞ Prohorov’s theorem A family of probability measures on (S, BS ) is tight if and only if it is (weakly) relatively compact. (Rouen 2015) Some functional limit theorems 46 / 94 Prohorov’s theorem A family of probability measures on (S, BS ) is tight if and only if it is (weakly) relatively compact. Corollary (mostly used in asymptotic theory) Suppose that (Pn) is a tight family of probability measures on (S, BS ) and that there is a probability measure P on (S, BS ) such that each weakly convergent subsequence of (Pn) has limit P. Then w Pn −−−→ P. n→∞ (Rouen 2015) Some functional limit theorems 46 / 94 backtorf o Theorem [tightness of probability measures in Hρ] o o The sequence (Pn) of probability measures on (Hρ, BHρ ) is tight if and only if the following two conditions hold: (i) lima→∞ supn Pn(x : |x(0)| > a) = 0; (ii) for each positive ε lim sup Pn(x : ωρ(x, δ) ≥ ε) = 0. δ→0 n Weak convergence and tightness in H o o By BHρ we denote the Borel σ-algebra of subsets of Hρ. o Since Hα is separable and complete it follows by Prohorov’s theorem that relative compactness of a family of probability measures on o o (Hρ, BHρ ) is equivalent to its tightness. (Rouen 2015) Some functional limit theorems 47 / 94 Weak convergence and tightness in H o o By BHρ we denote the Borel σ-algebra of subsets of Hρ. o Since Hα is separable and complete it follows by Prohorov’s theorem that relative compactness of a family of probability measures on o o (Hρ, BHρ ) is equivalent to its tightness. backtorf o Theorem [tightness of probability measures in Hρ] o o The sequence (Pn) of probability measures on (Hρ, BHρ ) is tight if and only if the following two conditions hold: (i) lima→∞ supn Pn(x : |x(0)| > a) = 0; (ii) for each positive ε lim sup Pn(x : ωρ(x, δ) ≥ ε) = 0. δ→0 n (Rouen 2015) Some functional limit theorems 47 / 94 o Tightness of random processes in Hρ o Suppose now that (Zn) is a sequence of random functions in Hρ. The sequence (Zn) is by definition tight when the sequence of corresponding distributions (PZn ) is tight. o Theorem [Tightness of random functions in Hα] The sequence (Zn) of random processes with paths in the H¨olderspace o Hα is tight if and only if the following two conditions are satisfied: (i) limb→∞ supn P(|Zn(0)| > b) = 0; (ii) for each ε > 0 lim sup P(ωρ(Zn, δ) ≥ ε) = 0. δ→0 n (Rouen 2015) Some functional limit theorems 48 / 94 This theorem can be recast by using the equivalent norm. Theorem [Tightness of random functions using sequential norm] o The sequence (Zn)n≥1 of random elements in Hρ is tight if and only if the two following conditions are fulfilled: (i) limb→∞ supn P(|Zn(0)| > b) = 0; (TCond. 1) (ii) For each positive ε, ! 1 lim sup Pr sup −j max kλr (Zn)k > ε = 0. (TCond. 2) J→∞ n≥1 j>J ρ(2 ) r∈Dj proof:1 proof:2 (Rouen 2015) Some functional limit theorems 49 / 94 Polygonal line process Let X1, X2,... be random variables on some probability space (Ω, F, P). For the present, they need not to be independent or stationary. We define S0 = 0, Sk = X1 + ··· + Xk , k ≥ 1. Next we construct from the partial sums S0, S1,..., Sn the polygonal line process ζn = (ζn(t), t ∈ [0, 1]): ζ (t) = S + (nt − [nt])X , t ∈ [0, 1]. §n [nt] [nt]+1 ¤ Note that ζn(k¦/n) = Sk for k = 0, 1,..., n. ¥ backto:1 backto:2 backto:3 (Rouen 2015) Some functional limit theorems 50 / 94 Lemma [H¨oldernorm of polygonal line function] Let ρ : [0, 1] → R be a weight function satisfying the following properties. 1 ρ is concave. 2 ρ(0) = 0 and ρ is positive on (0, 1]. 3 ρ is non decreasing on [0, 1]. 4 ρ(1) ≥ 1. Let t0 = 0 < t1 < ··· < tn = 1 be a partition of [0, 1] and f be a real valued polygonal line function on [0, 1] with vertices at the ti ’s, i.e. f is continuous on [0, 1] and its restriction to each interval [ti , ti+1] is an affine function. Define |f (t) − f (s)| R(s, t) := , 0 ≤ s < t ≤ 1. ρ(t − s) Then sup R(s, t) = max R(ti , tj ). (ρ-norm) 0≤s (Rouen 2015) Some functional limit theorems 51 / 94 Proof Obviously (ρ-norm) will be established if we prove that R(s, t) ≤ max R(ti , tj ), (ρ-norm bound) 0≤i