Interpolation Methods for Stochastic Processes Spaces
Abstract
The scales of classes of stochastic processes are introduced. New interpolation theorems and boundedness of some transforms of stochastic processes are proved. Interpolation method for generously monotonous processes is entered. Conditions and statements of interpolation theorems concern the fixed stochastic process, which differs from the classical results.
1. Introduction
Interpolation methods of functional spaces are one of the basic tools to get inequalities in parametrical spaces. These methods are widely applied in the theory of stochastic processes (see [1–5] and other).
In this paper classes of stochastic processes are considered, which, in some sense, are analogues of the net spaces which were investigated in [6–8].
Assume that (Ω, 𝔊, P) is a complete probability space. A family G = {𝔊n} n⩾1 of σ-algebras 𝔊n such that 𝔊1⊆⋯⊆𝔊n⊆⋯⊆𝔊 is called a filtration.
Let G be a filtration, a sequence {Xn} n⩾1 of random variables Xn measurable function with respect to the σ-algebra 𝔊n. Then we say that the set X = (Xn, 𝔊n) n⩾1 is a stochastic process.
Let us give some examples of a choice of a system of sets F = {𝔉n} n⩾1: 𝔉n = Ω, in this case the sequence is a sequence of averages of a process X = {Xn}; for 𝔉n = 𝔊n−1 it is a majorant of sequence of conditional averages M(Xn∣Gn−1); and for 𝔉n = 𝔊n it is a majorant of a process X = {Xn}. The following cases are interesting: (1) 𝔉n = 𝔊n∧τ, where τ = τ(ω) is the fixed stopping time, and 𝔊n∧τ = {A ∈ 𝔊 : A∩{τ = n} ∈ 𝔊n}; (2) , where τn = τn(ω), and n ∈ ℕ is the sequence of the stopping times.
We consider the classes of stochastic processes defined on F, which characterize the speed of convergence of sequence to zero.
A random variable τ, which takes values in the set (1,2, …, ∞), is called the Markov time of the filtration G = {𝔊n} n⩾1, if {ω : τ(ω) = n} ∈ 𝔊n for any n ∈ ℕ. The Markov time τ, for which τ(ω) < ∞ (a.p.) [9], is called the stopping time.
Let X = (Xn, 𝔊n) n⩾1 be a stochastic process and τ be the Markov time. By Xτ we denote the stopped process Xτ = (Xn∧τ, 𝔊n), where and χA(ω) is the characteristic function of the set A.
The spaces are spaces of converging stochastic processes, where parameters α, q, and p characterize the speed and the metrics, in which a given process converges.
In this paper we prove a Marcinkiewicz-type interpolation theorem for the introduced space. An interpolation method, essentially related to the properties of the Markov stopping times, is introduced. In the last paragraph the given interpolation method is applied to Besov type space with variable approximation properties. Part of the results were announced in [10].
We write A≲B (or A ≳ B) if A ⩽ cB (or cA⩾B) for some positive constant c independent of appropriate quantities involved in the expressions A and B. Notation A≍B means that A≲B and A ≳ B.
2. Properties of the Spaces Np,q(F) and
We say [9] that stochastic process (Xn, 𝔊n) n⩾1 is a martingale if for every n ∈ ℕ the following conditions hold: (1) E|Xn| < ∞; (2) E(Xn+1∣𝔊n) = Xn (a.p.). If instead of property (2) it is assumed that E(Xn+1∣𝔊n)⩾Xn(E(Xn+1∣𝔊n) ⩽ Xn), then we say that a process is a submartingale (supermartingale).
Definition 1. Let F = {𝔉n} n be a fixed system of sets, X = (Xn, 𝔊n) n be a stochastic process defined on F. We say that a process X belongs to the class W(F) if there exists a constant c such that for every k ⩽ m and for every A ∈ 𝔉k
This inequality implies that for every k ⩽ m. The class W(F) contains martingales, nonnegative submartingales, and nonpositive supermartingales. The stochastic process from W(F) we call generalized monotone.
Lemma 2. Let α > 0, 0 < q ⩽ ∞, and 1 < p < ∞. If , then there exists a random variable X∞ such that (a.p.).
Proof. Let Lp,∞(Ω) be the Marcinkiewicz-Lorentz space and 2ν−1 ⩽ n < 2ν. Using the equivalent norm of Lp,∞(Ω) spaces (see [6]) and measurability of function Xn with respect to σ-algebra 𝔊n, we get the following:
Taking into account that , for α > 0, we have .
But , therefore by the Doob theorem ([11]), the process Xn converges almost surely.
Lemma 3. Let α > 0, 0 < q ⩽ ∞, 1 < p < ∞, and X = (Xn, 𝔊n) n⩾1 ∈ W(G). Then
Proof. The existence of X∞ follows from Lemma 2. Further, we have
Lemma 4. Let X ∈ W(F). Then
- (1)
for 0 < q ⩽ q1 ⩽ ∞,
()() - (2)
for ε > 0, 0 < q, q1 ⩽ ∞,
()()
Proof. Let us prove inequalities (16), (18). The proof of inequalities (17), (19) is similar. Let ε > 0. By Minkowski’s inequality and by the generalized monotonicity of a process X = (Xn, 𝔊n) n⩾1 we get the following:
Remark 5. Properties of the Np,q(F) spaces given in Lemma 4 show that the second parameter q is weak with respect to the first p. These properties of the spaces are important in the interpolation.
Lemma 6. Let 0 < p < ∞, a > 1. If X ∈ W(F), then for 0 < q < ∞
Proof. Using the generalized monotonicity of a process X, we have the following:
Lemma 7 (Hölder inequality). Let 0 < p1, p2, q < ∞, 0 < t, s1, s2 ⩽ ∞ and (1/q) = (1/p1)+(1/p2), (1/t) = (1/s1)+(1/s2). If stochastic processes and , then XY = (XnYn, 𝔊n) ∈ Nq,t(F) and
Proof. Since Yn is measurable with respect to an algebra 𝔊n, we have and hence
We will need the following Hardy-type inequalities.
Lemma 8. Let s⩾1, ν > 0, α > 0, β > 0, and γ > 0; then for a nonnegative sequence a = {ak} k the following inequalities hold:
3. Interpolation Method for Stochastic Processes
It is known ([9]) that if a process X = (Xn, 𝔊n) n⩾1 is a martingale (submartingale), then the process Xτ = (Xn∧τ, 𝔊n) n⩾1 is also a martingale (submartingale).
Denote and .
The transforms Xτ and X* of the stochastic process X are examples of quasilinear transforms.
Let A = (A0(F), A1(F)) be a pair of quasinormed own subspaces of linear Hausdorff stochastic processes spaces 𝔑(F), which is defined on a probability space (Ω, 𝔉, P) with a filtration F = {𝔉n} n⩾1. Obviously, this pair is compatible pair and hence the scale of interpolation spaces is defined with respect to the real method ([12]).
Theorem 9. Let (A0(F), A1(F)), (B0(Φ), B1(Φ)) be two compatible pairs of stochastic processes and let R = {τ(ω)} be some fixed family of Markov times with respect to a filtration F. If T is a quasilinear map for stochastic processes X = (Xn, 𝔉n) n⩾1 and
Proof. Consider the following:
Lemma 10. Let a > 1 and R = {k} k∈ℕ be stopping times. Then for 0 < q < ∞
The proof is similar to the proof of the Lemma 4.
4. Interpolation Properties of the Spaces Np,q(F)
Theorem 11. Let 1 < p0 < p1 < ∞, 1 ⩽ q0, q1, q ⩽ ∞, 0 < θ < 1, (1/p) = ((1 − θ)/p0)+(θ/p1), and R = {k} k∈ℕ be the stopping times. Then for any stochastic process X = (Xn, 𝔉n) n⩾1,
If X = (Xn, 𝔉n) n⩾1 ∈ W(F), then
Proof. Let X = Y + Z be any representation of a process X, where , . To prove the first statement of the theorem, we use the following inequality: .
For any a > 1 we have the following:
Thus, we obtain the following:
Further, we have the following:
Corollary 12. Let 0 < p0 < p1 < ∞, 0 < q0 < q1 < ∞, 0 < θ < 1, 1 ⩽ s ⩽ ∞, (1/q) = ((1 − θ)/q0)+(θ/q1), (1/p) = ((1 − θ)/p0)+(θ/p1), X ∈ W(F), and be a quasilinear transform. If for any k ∈ ℕ ∪ {0} the following conditions hold:
Taking into account that the measurable function may be considered as a martingale, by corollary we may receive Marcinkiewicz-Calderon interpolation theorem (see [13]).
Corollary 13 (Marcinkiewicz-Calderon theorem). Let 0 < p0 < p1 < ∞, 0 < q0 < q1 ⩽ ∞, θ ∈ (0,1), 1/p = (1 − θ)/p0 + θ/p1, and 1/q = (1 − θ)/q0 + θ/q1. If T is a quasilinear map and
Corollary 14. Let be a quasilinear transform such that for any p ∈ (a, b) and for any X ∈ Np,1(F)∩W(F) the following weak inequality holds:
5. Boundedness of Some Operators in Class Np,q(F)
Theorem 15. Let 0 < q < p < ∞, 1 ⩽ τ ⩽ ∞ and 1/r = 1/q − 1/p. Let V · Y be a martingale transform of a martingale Y by predicted sequence V = (Vn, 𝔉n−1). If
Proof. Let V · Y be a martingale transform of a martingale Y by predicted sequence V = (Vn, 𝔉n−1); that is,
Let 0 < q < p < ∞, (1/r) = (1/q)−(1/p), 0 < q0 < q < q1 < ∞ and 0 < p0 < p < p1 < ∞. Let a pair of numbers (p0, p1) and (q0, q1) satisfy the following condition:
Taking into account that for any stopping time k ∈ N processes Yk and Y − Yk are martingales, it is possible to apply Theorem 9. Then
Note that there exists θ ∈ (0,1) such that (1/pθ) = (1/p). Then it follows from (63) that (1/qθ) = (1/q).
Theorem 16. Let 0 < p < ∞, 1 ⩽ q ⩽ ∞ and X = (Xn, 𝔊n) n⩾1 ∈ W(G) and τ(ω) be the Markov time and let Xτ = (Xn∧τ, 𝔊n) n⩾1 be a stopped process. Then
Proof. Denote
If 2s ⩽ n < 2s+1, then
Corollary 17. Let 0 < p < ∞, 1 ⩽ q ⩽ ∞ and a process X = (Xn, 𝔊n) n⩾1 be a nonnegative submartingale. Then the process is also submartingale and
Proof. It follows from Theorem 16 that
6. Interpolation Properties of the Space , the Embedding Theorems
Theorem 18. Let 1 ⩽ p, q, q0, q1 ⩽ ∞, α0 < α1, 0 < θ < 1, α = (1 − θ)α0 + θα1, and R = {r} r∈ℕ. Then
Proof. Using Lemmas 10 and 4 we have the following:
Theorem 19. Let 1 < r ⩽ p < ∞, 1 ⩽ q ⩽ ∞ and α = (1/r)−(1/p) and let the filtration G = {𝔊n} n⩾1 be such that for every k = 1,2… and for all A ∈ 𝔊k the following condition holds:
Proof. Let us show that
Now, let α0 < α1, 1 < p0 < p1 < ∞, and θ ∈ (0,1) such that
7. Spaces with Variable Approximation Properties by Haar System
In this paragraph we consider some applications of the introduced interpolation method to Besov type spaces with variable approximation properties.
Conceptually, the introduced spaces are close to spaces with variable smoothness. Here we mention works of Leopold [15], Cobos and Fernandez [16], and Besov [17–20].
Lemma 20. Let 1 < p < ∞, f ∈ Lp[0,1], and let S(f, τ) be the Fourier-Haar partial sum with respect to the Markov time τ. Then
Proof. Denote
Lemma 21. Let 1 < p < ∞, 0 < q ⩽ ∞, α ∈ ℝ, and
Proof is similar to the proof of Lemma 3.
Theorem 22. Let 1 ⩽ q0, q1, q ⩽ ∞, 0 < α0 < α1, 0 < θ < 1, and α = (1 − θ)α0 + θα1. Then
Proof. By using Lemma 21 we have the following:
Acknowledgment
This research was partially supported by Ministry of Education and Science of the Republic of Kazakhstan (0112RK02176, 0112RK00608).