Volume 2013, Issue 1 152043
Research Article
Open Access

Interpolation Methods for Stochastic Processes Spaces

E. Nursultanov

Corresponding Author

E. Nursultanov

Lomonosov Moscow State University (Kazakh Branch) and Gumilyov Eurasian National University, Munatpasova 7, Astana 010010, Kazakhstan enu.kz

Search for more papers by this author
T. Aubakirov

T. Aubakirov

Autonomous Organization of Education Nazarbayev Intellectual Schools, Astana 010010, Kazakhstan

Search for more papers by this author
First published: 26 December 2013
Citations: 4
Academic Editor: Henryk Hudzik

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 [15] 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 [68].

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 F = {𝔉n} n⩾1 be a system of sets satisfying the condition 𝔉1⊆⋯⊆𝔉n⊆⋯⊆𝔊. We say that a stochastic process X = (Xn, 𝔊n) n⩾1 is defined on a system F = {𝔉n} n⩾1 if 𝔉n𝔊n,  n. For a stochastic process X, which is defined on a system F = {𝔉n} n⩾1, we define the sequence of numbers , where
()
We call this sequence a majorant of a process X on a system of sets F.

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(XnGn−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.

By Np,q(F), 0 < p < ,  0 < q we denote the set of all stochastic processes X, defined on F for which
()
if 0 < q < and
()
if q = .
Let us denote
()
for 0 < q < , and
()
for q = , where
()
We consider that
()
where [α] is the integer part of the number α. In particular X1/2(ω) ≡ 0.

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.

We assume also that
()
.

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 AB (or AB) if AcB (or cAB) for some positive constant c independent of appropriate quantities involved in the expressions A and B. Notation AB means that AB and AB.

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 km and for every A𝔉k

()

This inequality implies that for every km. 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ν−1n < 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⩾1W(G). Then

()
where
()

Proof. The existence of X follows from Lemma 2. Further, we have

()
Therefore, using Lemma 8, we obtain
()
The reverse inequality follows from the expression:
()
The lemma is proved.

Lemma 4. Let XW(F). Then

  • (1)

    for 0 < qq1,

    ()
    ()

  • (2)

    for ε > 0, 0 < q, q1,

    ()
    ()

where ,   depend only on the indicated parameters.

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:

()
To prove the second statement it is enough to show that and apply the first statement. Since p1 < p, we have 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 XW(F), then for 0 < q <

()
and for q =
()

Proof. Using the generalized monotonicity of a process X, we have the following:

()
One can prove the reverse estimate in a similar way.

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

Let be a transform that transforms a stochastic process X, which is defined on the system , to the stochastic process , which is defined on the system . We say that the transform T is quasilinear if there exists a constant C > 0 such that for any n the following inequality holds almost surely:
()

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]).

Moreover, let for 0 < θ < 1,   0 < q <
()
and for q =
()
where
()
is the Peetre functional.
Let be a sequence of stopping times with respect to a filtration F and A(F) = (A0(F), A1(F)) be a pair of quasinormed own subspaces 𝔑(F). Let X𝔑(F) and t ∈ (0, ). We define the following:
()
Here the infimum is taken over all stopping times from R. Moreover for 0 < q <
()
and for q =
()

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

()
for all stopping times τR, then
()
where the constant C is from the definition of quasilinearity of the operator T.

Proof. Consider the following:

()
The theorem is proved.

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,

()
where the constant c depends only on parameters pi,  qi,  θ, i = 0,1.

If X = (Xn, 𝔉n) n⩾1W(F), then

()
where the constant c also depends only on parametres pi, qi, θ,  i = 0,1.

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:

()
By putting , we get . Therefore, using (22) and Lemma 8, we have the following:
()
Let us prove the second statement of the theorem. Let X = (Xn, 𝔉n) n⩾1W(F). By using Lemmas 8 and 3 we have the following:
()
Let k = [2nγ], then taking into account that ,  n ⩽ −1, we obtain the following:
()

Thus, we obtain the following:

()

Further, we have the following:

()
()
By using Lemma 8 for (1/γ) = (1/p0)−(1/p1), (46), and (47), we have the following:
()
By applying Minkowski’s inequality to (45) and using Lemma 4, estimates (48), we obtain
()

Corollary 12. Let 0 < p0 < p1 < , 0 < q0 < q1 < , 0 < θ < 1, 1 ⩽ s, (1/q) = ((1 − θ)/q0)+(θ/q1), (1/p) = ((1 − θ)/p0)+(θ/p1), XW(F), and be a quasilinear transform. If for any k ∪ {0} the following conditions hold:

()
then
()
where C > 0 depends only on p0,  p1,  q0,  q1, and θ.

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

()
then
()

Corollary 14. Let be a quasilinear transform such that for any p ∈ (a, b) and for any XNp,1(F)∩W(F) the following weak inequality holds:

()
Then
()
for any p and s such that p ∈ (a, b),  1 ⩽ s.

5. Boundedness of Some Operators in Class Np,q(F)

Let be a stochastic sequence and V = (Vn, 𝔊n−1) be a predicted sequence (𝔊−1 = 𝔊0). A stochastic sequence V · Y = ((V·Y)n, 𝔊n) such that
()
where ΔYi = YiYi−1 is called the transform of Y with respect to V. If Y is a martingale then we say that V · Y is the martingale transform.

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

()
then
()
where a constant c depends only on parametres p, q, and τ.

Proof. Let V · Y be a martingale transform of a martingale Y by predicted sequence V = (Vn, 𝔉n−1); that is,

()
where Y0 = 0,  ΔYk = YkYk−1. By Abel’s transform , we get the following:
()
Taking into account that ΔVk, Yk are measurable functions with respect to the algebra 𝔊k, we have and
()
Hence the weak inequality is proved as follows:
()
for 1 < q < p < .

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:

()
Then from that is proved above it follows that
()
for 0 < p < q < .

Taking into account that for any stopping time kN processes Yk and YYk are martingales, it is possible to apply Theorem 9. Then

()
where
()

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⩾1W(G) and τ(ω) be the Markov time and let Xτ = (Xnτ, 𝔊n) n⩾1 be a stopped process. Then

()

Proof. Denote

()
Let us show that .

If 2sn < 2s+1, then

()
Now, using Corollary 12 we get the statement of the Theorem 16.

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

()
The reverse inequality is trivial.

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:

()
Putting r = [2nγ],  γ = α1α0 we get the following:
()
It follows from the definition that for for for for kr; therefore,
()
Substituting these equalities in (74) and applying Lemmas 4 and 8, we get the following:
()
For the proof of reverse estimate we use the fact that for any r and k the following equality holds:
()
Then we have the following:
()
Substituting and using Lemma 4, we have the following:
()
since , the proof is complete.

Theorem 19. Let 1 < rp < ,  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:

()
where the constant C > 0 does not depend on k. Then
()

Proof. Let us show that

()
()
According to the condition (80), for we have that P(A)>(C/2m). Therefore for α = (1/r)−(1/p) we get the following:
()
Thus, (82) is proved.

Now, let α0 < α1,  1 < p0 < p1 < , and θ ∈ (0,1) such that

()
Then using interpolation Theorems 18 and 11 we obtain the following:
()
It follows from (82) that . Hence, , where α = (1/r)−(1/p). The proof is complete.

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.

Let Ω = [0,1] and let 𝔉 be a σ-algebra of Borel subsets of set Ω, P a linear Lebesgue measure on 𝔉, F = {𝔉n} n⩾1 the Haar filtration, and a sequence of stopping times such that for any k⩾0 the following conditions hold: τ0 ≡ 0, τk + 1 ⩽ τk+1 (a.p.) and
()
For a function f(x) ∈ L[0,1] we denote by {ck(f)} k⩾1 the Fourier coefficients by Haar functions system {Hk(x)} k⩾1 ([14]). For the given stopping time τk(ω) we denote
()
which we call the Fourier-Haar partial sum of a function f, corresponding to the Markov time τk.
Let 1 < p < , 0 < q, α. By we denote the set of functions fL[0,1], for which
()
for 0 < q < ,
()
for q = .

Conceptually, the introduced spaces are close to spaces with variable smoothness. Here we mention works of Leopold [15], Cobos and Fernandez [16], and Besov [1720].

Lemma 20. Let 1 < p < ,  fLp[0,1], and let S(f, τ) be the Fourier-Haar partial sum with respect to the Markov time τ. Then

()

Proof. Denote

()
Let Lp,[0,1] be the Marcinkiewicz-Lorentz space. Using the equivalent norm of Lp,[0,1] spaces (see [6]) and martingale properties of Fourier-Haar partial sums we get the following:
()
Now, applying the interpolation theorem (see [12]), we obtain the statement of the lemma.

Lemma 21. Let 1 < p < , 0 < q, α, and

()
Then
()

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:

()
By applying Lemma 8 we get the following:
()
Let us prove the reverse embedding. Let , f = f0 + f1 be an arbitrary representation of a function, and . Then
()
Since the representation f = f0 + f1 is arbitrary, we have the following:
()
Hence, putting we get the following:
()
The theorem is proved.

Acknowledgment

This research was partially supported by Ministry of Education and Science of the Republic of Kazakhstan (0112RK02176, 0112RK00608).

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.