Boundedness of iterated spherical average

Rui BU , Qiang HUANG , Yingjun SHAO

Front. Math. China ›› 2023, Vol. 18 ›› Issue (2) : 125 -137.

PDF (486KB)
Front. Math. China ›› 2023, Vol. 18 ›› Issue (2) : 125 -137. DOI: 10.3868/s140-DDD-023-0007-x
RESEARCH ARTICLE
RESEARCH ARTICLE

Boundedness of iterated spherical average

Author information +
History +
PDF (486KB)

Abstract

The iterated spherical average Δ(A1)N is an important operator in harmonic analysis, and has very important applications in approximation theory and probability theory, where Δ is the Laplacian, A1 is the unit spherical average and (A1)N is its iteration. In this paper, we mainly study the sufficient and necessary conditions for the boundedness of this operator in Besov-Lipschitz space, and prove the boundedness of the operator in Triebel-Lizorkin space. Moreover, we use above conclusions to improve the existing results of the boundedness of this operator in Lp space.

Keywords

Iterated spherical average / Besov-Lipschitz space / Triebel-Lizorkin space / $ L^{p} $ space

Cite this article

Download citation ▾
Rui BU, Qiang HUANG, Yingjun SHAO. Boundedness of iterated spherical average. Front. Math. China, 2023, 18(2): 125-137 DOI:10.3868/s140-DDD-023-0007-x

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

The average operator of functions f on the unit sphere is defined as

A1(f)(x)=Sn1f(xy)dσ(y),

where Sn1 is the unit sphere in Rn, dσ is the normalized surface Lebesgue measure on Rn. The generation of this operator can be traced back to the 1970s. It has a profound background and wide applications in harmonic analysis (see [10, 9]). Moreover, it is very important in the study of random walks in high dimensional spaces, which was originated by Pearson [8] about 120 years ago. The definition of random walks is the N-steps uniform walk in Rn starts at the origin and consists of N independent steps of length 1, each of which is taken into a uniformly random direction. By some calculations, the probability density function pN(n22,x) of uniform walk in Rn is the Fourier inverse of (A1)N[2]. Besides, this operator also plays a significant role in the approximation theory [1, 4]. In order to obtain some equivalent forms of the K-functional in Lp(Rn) spaces, Belinsky, Dai and Ditzian studied the operator (A1)N in [1] and obtained the following result.

Theorem A [1]  Let 1p, n2 and N>2(n+2)n1. The inequality

Δ(A1)N(f)Lp(Rn)fLp(Rn)

holds for all fLp(Rn).

In the proof of Theorem A, they proposed a meaningful question: what was the smallest positive integer N to guarantee the inequality

Δ(A1)N(f)L1(Rn)fL1(Rn).

This question was completely solved by Fan, Lou and Wang. In [3], they obtained the following theorem.

Theorem B [3]  Let n3,5, and N be positive integers. The inequality

Δ(A1)N(f)L1(Rn)fL1(Rn)

holds if and only if N>n+3n1.Let n=3,5, and N be positive integers. The inequality

Δ(A1)N(f)L1(Rn)fL1(Rn)

holds if and only if Nn+3n1.

In the proof of Theorem B, they used the fact that iterate steps N is an positive integer. But, if we extend the iterate steps N to real number by the Fourier transforms, the conclusion of Theorem B is not sharp. On the other hand, there is no regularity in L1 space. To study the boundedness of (A1)N for NR and the influence of the regularity of function space on the boundedness of this operator, Huang [6] studied the boundedness of (A1)N on modulation space and obtained the sufficient and necessary conditions of the boundedness of Δ(A1)N on the modulation space.

Theorem C [6]  Let σ=2n12N,1pi,qi,siR(i=1,2). When q1q2, the iterated spherical average Δ(A1)N is bounded from Mp1,q1s1(Rn) to Mp2,q2s2(Rn) if and only if

p1p2,s1s2+σ.

When q1>q2, the iterated spherical average Δ(A1)N is bounded from Mp1,q1s1(Rn) to Mp2,q2s2(Rn) if and only if

p1p2,s1+nq1s2+σ+nq2.

On the other hand, Besov-Lipschitz space Bp,qs and Triebel-Lizorkin space Fp,qs are very important spaces in the theory of function space. They can not only characterize many function spaces, such as Lp(Rn) space, Sobolev space, Hardy space, but also have important applications in the fields of partial differential equations and time-frequency analysis [5, 7, 11, 12]. Thus, it is significant to study the boundedness of Δ(A1)N in Besov space and Triebel space. Besides, by the Littlewood-Paley theorem, when s=0,1<p<,q=2, the Triebel space is equivalent to LP(Rn) space, that is,

Fp,20(Rn)Lp(Rn).

Therefore, the boundedness of Δ(A1)N in Triebel space can be used to study the boundedness of this operator in LP(Rn) space. In this paper, we study the boundedness of Δ(A1)N in Besov space and Triebel space, and improve the boundedness of Δ(A1)N in LP(Rn) space by the conclusion in Triebel space. The following theorems are our main results.

Theorem 1  Let σ1=2+n2n12N, 1pi,q,siR(i=1,2). If

p1p2,s1np1s2+σ1np2,

then Δ(A1)N is bounded from Bp1,qs1(Rn) to Bp2,qs2(Rn).

Theorem 2  Let σ2=2n2n12N, 1pi,q,siR(i=1,2). If the iterated spherical average Δ(A1)N is bounded from Bp1,qs1(Rn) to Bp2,qs2(Rn), then the following conditions must be hold:

p1p2,s1s2+σ2.

Theorem 3  Let σ1=2+n2n12N, 1pi,q,siR(i=1,2). If

p1p2,s1np1>s2+σ1+np2,

then Δ(A1)N is bounded from Fp1,qs1(Rn) to Fp2,qs2(Rn).

Corollary 1  Let 1<p<. When N>n+4n1, Δ(A1)N is bounded in Lp(Rn) space, that is

Δ(A1)N(f)Lp(Rn)⪯∥fLp(Rn).

Remark 1 We can find that the conclusion in Corollary 1 is better than Theorem A, since the smallest iterate steps N in Corollary 1 is smaller than Theorem A.

Remark 2 We can obtain the necessary conditions of boundedness of Δ(A1)N in Triebel space by a similar method, and the conclusion is also similar as Theorem 2. The proof follows the same pattern so that we leave the proof to the reader.

Throughout this paper, we use the inequality AB to mean that there is a positive number C independent of all main variables such that ACB, and use the notation AB to mean AB and BA.

2 Preliminaries and lemmas

In this section, we will give the definitions of Besov space and Triebel space, and discuss some basic properties of Besov space and Triebel space. Also, we will prove some estimates and lemmas which will be used in our proof.

Definition 1 [11] (Besov space) Let φ1(ξ) be a radial Schwartz function on Rn which satisfy φ1(ξ)C0(Rn) and suppφ1{ξ:12|ξ|2}. When 23|ξ|32, φ1(ξ)1. Assume φ0(ξ)C0(Rn), suppφ0{ξ:|ξ|2} and satisfy

k=0+φk1,

where φk(ξ)=φ(2kξ), kN+. Define

Δkf=(φkf^).

Let sR, 0<p,q. The Besov space is defined as follows:

Bp,qs(Rn):={fS:fBp,qs(Rn)=(k=02ksqΔkfLpq)1q<}.

Definition 2 [11] (Triebel space) Let sR, 0<p,q. The Triebel space is defined as follows:

Fp,qs(Rn):={fS:fFp,qs(Rn)=(k=02ksq|Δkf|q)1qLp<}.

Proposition 1 [7]  Let 0<pi,q, siR(i=1,2). When

p1p2,s1np1s2np2,

we have

Bp1,qs1Bp2,qs2,Fp1,qs1Fp2,qs2.

Proposition 2 [7]  If 1p,qi(i=1,2) and sR, then ε>0, we have

Fp,q1s+εFp,q2s.

The Fourier multiplier m(D) is a linear operator acting on the test function f, which is defined as:

m(D)f^(ξ)=m(ξ)f^(ξ).

The function m(ξ) is called the symbol or multiplier of m(D). By Fourier transform, it is known that m(D) is a convolution operator

m(D)=(m(ξ))f.

By the Young inequality, we have

m(D)fLp(m(ξ))(x)L1fLp

for any 1p. Thus, to obtain the boundedness of m(D) in Lp space, we only need to estimate (m(ξ))(x)L1. For this purpose, we need the following Bernstein multiplier theorem to estimate (m(ξ))(x)L1.

Lemma 1 [12] (Bernstein multiplier theorem)  Assume 0<p2 and γm(ξ)L2 for all multi-indices γ with |γ|[n(1p12)]+1. We have

(m(ξ))(x)Lp|γ|[n(1p12)]+1γm(ξ)L2.

By Fourier transform, ignoring constant factors, m(D) is a Fourier multiplier as follows:

Δ(A1)Nf^=|ξ|2(Vn22(|ξ|))Nf^(ξ),

where

Vδ(r)=Jδ(r)rδ

and Jδ(r) is the Bessel function of order δ which has following properties.

Lemma 2 [9]  When δ>12, we have

Vδ(r)=O(1),when|r|1,

dVδ(r)dr=rVδ+1(r).

Lemma 3 [9]  Let r>1 and δ>12. For any LZ+ and r[1,), we have

Jδ(r)=2πrcos(rδπ2π4)+j=1Lajeirr12j+j=1Lbjeirr12j+E(r),

where aj and bj are constants for all j, and E(r) is a C function satisfying

|E(k)(r)|r12L1

for any k=0,1,2,.

3 Proof of main results

We firstly prove Theorem 1. By the definition of Besov space, we need to estimate ΔkΔ(A1)NfLp. For this purpose, we obtain the following lemma.

Lemma 4  Let 1p, σ1=2+2nn12N. Then we have the following estimate

ΔkΔ(A1)NfLp(Rn)2kσ1ΔkfLp(Rn).

Proof  kN, ΔkΔ(A1)Nf is a convolution operator mk(D)(f)=Ωk(x)f, where

Ωk(x)=Rnφk(ξ)ξ2(Vn22(|ξ|))Neiξxdξ.

By the orthogonality of dyadic decomposition, when |lk|2, we haveφl(ξ)φk(ξ)=0. Since

kZnΔk=I,

by Young's inequality and Minkowski's inequality, we have

ΔkΔ(A1)NfLp=lNΔlΔkΔ(A1)NfLplN,lk∣⩽1ΔlΔ(A1)NΔkfLplN,lk∣⩽1(φl(ξ)ξ2(Vn22(ξ))N)ΔkfLplN,lk∣⩽1(φl(ξ)ξ2(Vn22(ξ))N)L1ΔkfLp=lN,lk∣⩽1ΩlL1ΔkfLp.

Thus, we only need to estimate

lN,lk∣⩽1Ωl(x)L1.

For every kN, the number of l which satisfy lN:|lk|1 is at most 3. So, we only need to estimate Ωl(x)L1 when lk. When |k|<100, by condition (7), we have |Ωl(x)|1, when |x|<100. If |x|100, without losing generality, assume |x1|xn. By the derivative of Vδ(t) (see (8)) and taking integration by part on ξ1, we have

|Ωl(x)|1x1n+11xn+1.

So, when |k|<100, Ωl(x)L11, by the fact that lk. Then, we choose L=1 in Lemma 3. We have the following asymptotic form of Vδ(r):

Vδ(r)=rδ122πcos(rδπ2π4)+O(rδ32)

for |r|<1. So, when |k|>100, lk and ξsuppφl(ξ), we have

|Vδ(|ξ|)|N|ξ|(δ12)N(2l)(δ12)N2(δ+12)Nk.

Then, by the chain rule and the derivative formula of Vδ(t), we obtain

ξi(Vδ(|ξ|))N=(Vδ(|ξ|))N1|ξ|Vδ+1(|ξ|)ξi|ξ|=(Vδ(|ξ|))N1Vδ+1(|ξ|)ξi.

By the asymptotic form of Vδ(r), we obtain that

|ξi(Vδ(|ξ|))N||ξ|(δ12)(N1)|ξ|(δ32)|ξ||ξ|(δ12)N2(δ+12)Nk

for ξsuppφl(ξ). By (10) and (11), when δ>12 and ξsuppφl(ξ), Vδ(|ξ|)N and ξi(Vδ(|ξ|))N share the same upper bound which is 2(δ+12)Nl. Since

γ(|ξ|2){|ξ|2|γ|,|γ|2;=0,|γ|>2,

we can obtain that

Ωl(x)L1=|γ|[n2]+1γ(φl(ξ)|ξ|2(Vn22(|ξ|))N)L2|γ|[n2]+1γ1+γ2+γ3=γγ1φl(ξ)γ2|ξ|2γ3(Vn22(|ξ|))NL2(suppφl(ξ))2kn222k2n12Nk=2(2+n2n12N)k.

By the definition of Besov space and above estimate, we have

Δ(A1)NfBp2,qs2=(k=0+2ks2qΔkΔ(A1N)fp2q)1q=(k=01002ks2qΔkΔ(A1N)fp2q+k>1002ks2qΔkΔ(A1N)fp2q)1q(k=01002ks2qΔkΔ(A1N)fp2q)1q+(k>1002ks2qΔkΔ(A1N)fp2q)1q(k=01002(s2+2+n2n12N)qkΔkΔ(A1N)fp2q)1q+(k>1002(s2+2+n2n12N)qkΔkΔ(A1N)fp2q)1qfBp2,qs2+2+n2n12N.

By the embedding property (3) of Besov space, when p1p2,s1np1s2+σ1np2, we can easily obtain that

Δ(A1)NfBp2,qs2fBp2,qs2+σ1fBp2,qs1.

Theorem 1 is proved.

Next, we will prove Theorem 2. From Lemma 3, we can find that the main term in asymptotic expansion of Bessel function is a trigonometric function which has zero points in every semiperiod. Thus, we can't estimate the dual operator of the iterated spherical average at these zero points. To solve this problem, we need the following lemmas.

Lemma 5  Assume iZ+ which is large enough. Then there exists a constant ε0>0, such that

Vn12(|ξ|)ε0|ξ|n12

for |ξ|[iπ+nπ434π+π20,(i+1)π+nπ434ππ20].

Proof Choosing L=1 in Lemma 3, we have

Vn22(r)=rn122πcos(rnπ4+π4)+O(rn+12)=rn122πsin(rnπ4+3π4)+O(rn+12).

Define

u(r)=sin(rnπ4+3π4)

and ε0=12sinπ20. When rnπ4+3π4[iπ+π20,(i+1)ππ20], we have

|u(r)|2ε0.

Moreover, when r is large enough, it is easy to obtain

O(rn+12)ε0rn12.

Thus, when |ξ|[iπ+nπ43π4+π20,(i+1)π+nπ43π4π20] and i is large enough, we have

|Vn22(|ξ|)|ε0|ξ|n12.

Lemma 6  Let 1p, σ2=2n2n12N. For k2, if the smooth function {fk} satisfy

suppfk^(ξ){ξ:|ξ|[ikπ+nπ434π+π20,(ik+1)π+nπ434ππ20]},

where ikZ+, and [ikπ+nπ434π,(ik+1)π+nπ434π](232k,322k), then we can obtain

2kσ2fkLpΔkΔ(A1)NfkLp.

Proof By the assumption of {fk}, it is obvious that |ξ|2k when ξsuppf^(ξ). Thus, by (12) and Lemma 5, when ξsuppf^(ξ), we have

ε0|ξ|n12|(Vn22(|ξ|))||ξ|n12,

that is, |Vn22(|ξ|)|2n12k. Then, by the chain rule and the derivative formula of Vδ(t), we can obtain

|ξi(Vn22(|ξ|))N|=|(Vn22(|ξ|))(N+1)Vn22(|ξ|)ξi||ξ|(n12)(N1)|ξ|n+12|ξ|2n12Nk.

Therefore, when ξsuppf^(ξ), |(Vn22(|ξ|))|N and |ξi(Vn22(|ξ|))N| share the same upper bound which is 2n12Nk.

By Definition 1, φk(ξ)1 when 232k|ξ|322k. So, when k is large enough, we can choose some suitable ikZ+ such that [ikπ+nπ434π,(ik+1)π+nπ434π](232k,322k). So, we have

φk(ξ)fk^(ξ)=fk^(ξ),

when suppfk^(ξ){ξ:|ξ|[ikπ+nπ434π+π20,(ik+1)π+nπ434ππ20]}. Thus, by (13), (14), Young’s inequality and Bernsteins Multiplier Theorem, we can obtain

fkLp=(fk^)Lp=(φk(ξ)φk(ξ)|ξ|2(Vn22(|ξ|))N|ξ|2(Vn22(|ξ|))Nfk^)Lp=(φk(ξ)|ξ|2(Vn22(|ξ|))Nφk(ξ)|ξ|2(Vn22(|ξ|))Nfk^)Lp(φk(ξ)|ξ|2(Vn22(|ξ|))N)L1ΔkΔ(A1)NfkLp|γ|[n2]+1γ(φk(ξ)|ξ|2(Vn22(|ξ|))N)L2ΔkΔ(A1)NfkLp|γ|[n2]+1γ1+γ2+γ3=γγ1φk(ξ)γ2|ξ|2γ3(Vn22(|ξ|))NL2ΔkΔ(A1)NfkLp|γ|[n2]+1γ1+γ2=γγ1φk(ξ)|ξ|2γ2(Vn22(|ξ|))NL2ΔkΔ(A1)NfkLp2(2+n2+n12N)kΔkΔ(A1)NfkLp,

which means

2(2n2n12N)kfkLpΔkΔ(A1)NfkLp.

Lemma 6 is proved.

Now, we continue to prove Theorem 2. Let fS(Rn) satisfy f^(ξ)C0(B), where B:={ξ=(ξ1,ξ2,,ξn):|ξ|1,ξ1<0}. Then choose ξk=(ikπ+nπ434π+π2,0,,0), where ik is defined in the proof of Lemma 6. For 0<λ<12, we define smooth function fk,λ by

f^k,λ(ξ)=f^(ξξkλ).

It is obvious that suppfk,λ^(ξ){ξ:|ξ|[ikπ+nπ43π4+π20,(ik+1)π+nπ43π4π20]}. By the definition of fki,λ, we can obtain

Δkfk,λ=fk,λ;

Δjfk,λ=0,jk.

By Lemma 6, we have

Δ(A1)Nfki,λBp2,qs2=2ks2ΔkΔ(A1)Nfki,λLp22k(s2+2n2n12N)fki,λLp22k(s2+σ2)λn(11p2).

Moreover, by some simple computation, we have

fki,λBp1,qs1=2ks1fki,λLp12ks1λn(11p1).

By the assumption that Δ(A1)N is bounded on Besov space, we can obtain Δ(A1)Nfki,λBp2,qs2fk,λBp1,qs1. Therefore, when 0<λ<12, we have

2k(s2+σ1)λn(11p2)2ks1λn(11p1).

Fixed kZ+, we have

λn(11p2)λn(11p1).

Then let λ0, we can obtain

p1p2.

On the other hand, when fixed λ(0,12) and letting k, we have

2k(s2+σ1)2ks1,

which means

s1s2+σ2.

Theorem 2 is proved.

Now, we prove the boundedness of Δ(A1)N on Triebel space. We firstly assume s=0, 1p=q, by the definition of Triebel space and orthogonality of {φk}k=1, we can obtain

Δ(A1)NfFp,p0p=(k=0+|ΔkΔ(A1)Nf|p)1pLp(Rn)p=(k=0+|jZ+{0}ΔjΔkΔ(A1)Nf|p)1pLp(Rn)p=(k=0+|j=(k1)0j=k+1ΔjΔkΔ(A1)Nf|p)1pLp(Rn)p

Rnk=0+j=(k1)0j=k+1|ΔjΔkΔ(A1)Nf|pdξk=0+j=(k1)0j=k+1Rn|Ωj(x)Δkf|pdξ=k=0+j=(k1)0j=k+1Ωj(x)ΔkfLp(Rn)p,

where Ωj(x) is defined in (9). By (11), when |jk|1, we have

ΩjL12(2+n2n12N)j2(2+n2n12N)k.

Combining the above estimates, we have

Δ(A1)NFp,p0pk=0+j=k1j=k+1Ωj(x)ΔkfLp(Rn)pk=0+j=k1j=k+1ΩjL1pΔkfLp(Rn)pk=0+2(2+n2n12N)kpΔkfLp(Rn)p=k=0+Rn2(2+n2n12N)kp|Δkf|pdξRn(k=0+2(2+n2n12N)kp|Δkf|p)dξ=fFp,p2+n2n12Np.

Therefore, when s1np1>s2np2+σ1, there exists ε>0 such that s1np1>s2np2+σ1+2ε. By Proposition 1 and Proposition 2, we can obtain

Δ(A1)NfFp2,q2s2Δ(A1)NfFp2,p2s2+εfFp2,p2s2+σ1+εfFp2,q1s2+σ1+2εfFp1,q1s1.

Theorem 3 is proved.

Finally, we prove Corollary 1. The condition N>n+4n1 yields,

σ1=2+n2n12N<0.

By choosing 1p1=p2=p, q1=q2=2, s1=s2=0 in Theorem 3, we have

Δ(A1)N(f)Fp,20(Rn)fFp,20(Rn).

By the equivalence between Triebel and Lp space (see (2)), we can obtain

Δ(A1)N(f)Lp(Rn)fLp(Rn).

Corollary 1 is proved.

References

[1]

Belinsky E, Dai F, Ditzian Z. Multivariate approximating average. J Approx Theory 2003; 125: 85–105

[2]

Borwein J, Straub A, Vignat C. Densities of short uniform random walks in higher dimensions. J Math Anal Appl 2016; 437(1): 668–707

[3]

Fan D, Lou Z, Wang Z. A note on iterated sperical average on Lebesgue spaces. Nonlinear Anal 2019; 180: 170–183

[4]

Fan D, Zhao F. Approximation properties of combination of multivariate averages on Hardy spaces. J Approx Theory 2017; 223: 77–95

[5]

GrafakosL. Modern Fourier Analysis. 2nd ed. Graduate Texts in Mathematics, Vol 250. New York: Springer, 2009

[6]

Huang Q. Boundedness of iterated spherical average on modulation spaces. Nonlinear Analysis 2020; 199: 111968

[7]

MiaoC. Harmonic Analysis and Its Applications on Partial Differential Equations. Beijing: Science Press, 1999 (in Chinese)

[8]

Pearson K. The problem of random walk. Nature 1905; 72: 342

[9]

Stein E M. Maximal functions: spherical means. Proc Nat Acad Sci USA 1976; 73(7): 2174–2175

[10]

SteinE M. Harmonic Analysis: Real-variable Methods, Orthogonality, and Oscillatory Integrals. Princeton N J: Princeton Univ Press, 1993

[11]

TriebelH. Theory of Function Spaces, Monographs in Mathematcis, Vol 78. Basel: Birkhäuser, 1983

[12]

WangBHuoZHaoCGuoZ. Harmonic Analysis Method for Nonlinear Evolution Equations I. Hackensack N J: World Scientific, 2011

RIGHTS & PERMISSIONS

Higher Education Press 2023

AI Summary AI Mindmap
PDF (486KB)

697

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/