Skip to main content
Springer logoLink to Springer
. 2018 Feb 6;2018(1):33. doi: 10.1186/s13660-018-1627-9

Endpoint regularity of discrete multisublinear fractional maximal operators associated with 1-balls

Feng Liu 1,
PMCID: PMC5801474  PMID: 29456416

Abstract

In this paper we investigate the endpoint regularity of the discrete m-sublinear fractional maximal operator associated with 1-balls, both in the centered and uncentered versions. We show that these operators map 1(Zd)××1(Zd) into BV(Zd) boundedly and continuously. Here BV(Zd) represents the set of functions of bounded variation defined on Zd.

Keywords: Discrete multisublinear fractional maximal function, 1-balls, Sobolev space, Bounded variation, Continuity

Introduction

Background

The regularity theory of maximal operators has been the subject of many recent articles in harmonic analysis. The first work was contributed by Kinnunen [1] who investigated the Sobolev regularity of the centered Hardy–Littlewood maximal function M and proved that M is bounded on the first order Sobolev spaces W1,p(Rd) for all 1<p. It was noticed that the W1,p-bound for the uncentered maximal operator M˜ also holds by a simple modification of Kinnunen’s arguments or [2, Theorem 1]. Subsequently, the above result was extended to a local version in [3], to a fractional version in [4], to a multisublinear version in [5, 6] and to a one-sided version in [7]. Due to the lack of sublinearity of weak derivatives of the maximal function, the continuity of M:W1,pW1,p for 1<p< is a certainly non-trivial problem. This question was resolved by Luiro in [8]. Later on, Luiro’s result was extended to the local version in [9] and to the multisublinear version in [5, 10]. Another way to extend the regularity theory of maximal operators is to study its behavior on different differentiable function spaces, such as fractional Sobolev spaces, Triebel–Lizorkin spaces, Besov spaces and so on. We refer the readers to consult [9, 1113]. We notice that the Lp-bounds for M is the crux of the W1,p-bounds for M for all 1<p. Due to the lack of the L1-bounds for M, the W1,1-regularity of maximal operators seems to be a deeper issue. A crucial question was posed by Hajłasz and Onninen in [2]:

Question A

([2])

Is the operator f|Mf| bounded from W1,1(Rd) to L1(Rd)?

This question was solved completely in dimension d=1. Tanaka [14] first proved that M˜f is weakly differentiable and satisfies

(M˜f)L1(R)2fL1(R) 1.1

if fW1,1(R). The above result was later refined by Aldaz and Pérez Lázaro [15] who showed that if f is of bounded variation on R, then M˜f is absolutely continuous and

Var(M˜f)Var(f), 1.2

where Var(f) denotes the total variation of f. The above result directly yields (1.1) with constant C=1 (see also [16]). For the centered version, Kurka [17] showed that if f is of bounded variation on R, then (1.2) holds for M with constant C=240,004. Kurka also observed that if fW1,1(R), then Mf is weakly differentiable and (1.1) also holds for M with constant C=240,004. Recently, inequalities (1.1) and (1.2) were extended to a fractional setting in [18] and to a multisublinear setting in [19]. In the remarkable work [20], Carneiro et al. proved that the operator f(M˜f) is continuous from W1,1(R) to L1(R). It is currently unknown whether the above continuity also holds for the centered version. For the general case d2, Question A remains open, and partial progress was obtained by Hajłasz and Malý [21], Luiro [22] and Saari [23]. Other works on the endpoint regularity of maximal operators include [7, 24, 25].

Discrete setting

We shall generally denote by n=(n1,n2,,nd) a vector in Zd. For a discrete function f:ZdR, we define the p(Zd)-norm for 1p< by fp(Zd)=(nZd|f(n)|p)1/p and the (Zd)-norm by f(Zd)=supnZd|f(n)|. We also let np=(i=1d|ni|p)1/p for all 1p<. Formally, we define the discrete analogue of the Sobolev spaces by

W1,p(Zd):={f:ZdRf1,p=fp(Zd)+fp(Zd)<},

where ∇f is the gradient of a discrete function f defined by f(n)=(D1f(n),,Ddf(n)) and Dlf(n) is the partial derivative of f denoted by

Dlf(n)=f(n+el)f(n)

and el=(0,,0,1,0,,0) is the canonical lth base vector, l=1,2,,d. It is clear that

fp(Zd)f1,p(2d+1)fp(Zd)1p, 1.3

which yields that the discrete Sobolev space W1,p(Zd) is just p(Zd) with an equivalent norm. We also denote by BV(Zd) the set of all functions of bounded variation defined on Zd, where the total variation of f:ZdR is defined by

Var(f)=l=1dDlf1(Zd).

It follows that

f1(Zd)Var(f)df1(Zd). 1.4

Recently, the study of the regularity properties of discrete maximal operators has also attracted many scholars. This progress began with Bober et al. [26] who proved that

Var(M˜f)Var(f) 1.5

and

Var(Mf)(2+146315)f1(Z), 1.6

where M (resp., ) is the usual discrete centered (resp., uncentered) Hardy–Littlewood maximal operator. We notice that inequality (1.5) is sharp. Subsequently, Temur [27] proved (1.5) for M (with constant C=294,912,004) following Kurka’s breakthrough [17]. Inequality (1.6) is not optimal, and it was asked in [26] whether the sharp constant for inequality (1.6) is in fact C=2. This question was resolved in the affirmative by Madrid in [28]. Recently, Carneiro and Madrid [18] extended inequality (1.5) to the fractional setting (also see [20, 2931] for the relevant results).

For general dimension d1, Carneiro and Hughes [32] studied the endpoint regularity of the discrete centered Hardy–Littlewood maximal operator associated with 2-balls

Mf(n)=supr>01N(Br(n))kBr(n)Zd|f(k)|,

where Br(n) is the open ball in Rd centered at n⃗ with radius r and N(Br(n)) is the number of the lattice points in the set Br(n). Carneiro and Hughes [32] first proved that M and its uncentered version map 1(Zd) into BV(Zd) boundedly and continuously. The above result was later extended to a fractional setting in [18] and to a multisublinear setting in [33]. In particular, Liu and Wu [33] investigated the regularity of the discrete centered multisublinear fractional maximal operator associated with 2-balls

Mα(f)(n)=supr>0j=1m1N(Br(n))1αmdkBr(n)Zd|fj(k)|,

where m1 and 0α<md. Precisely, they proved the following result.

Theorem B

([33])

Let d1 and 0α<(m1)d+1. Then Mα maps 1(Zd)××1(Zd) into BV(Zd) boundedly and continuously.

Main results

It is well known that the geometry of 1-balls in Zd is more intricate than that of 2-balls. Especially, the number of lattice points in the 1-ball is more complex than that of 2-ball. This makes the investigation of the discrete multisublinear maximal operators associated with 1-balls very complex and interesting. The primary purpose of this paper is to explore the regularity properties of the discrete multisublinear maximal operators associated with 1-balls. Let m1 and f=(f1,,fm) with each fj being a discrete function on Zd. For 0α<md, we define the discrete centered m-sublinear fractional maximal operator Mα associated with 1-balls by

Mα(f)(n)=supr>0j=1m1N(Γr(n))1αmdkΓr(n)|fj(k)|,

where Γr(n) is the 1-ball centered at n⃗ with radius r, i.e. Γr(n)={kZd;kn1<r}, and N(Γr(n)) denotes the number of elements in the set Γr(n). The uncentered version of Mα is given by

M˜α(f)(n)=supr>0,lZdnΓr(l)j=1m1N(Γr(l))1αmdkΓr(l)|fj(k)|.

Clearly, when α=0 and m=d=1, Mα=M and M˜α=M˜. For the bounds of Mα and M˜α, we have

M˜α(f)q(Zd)+Mα(f)q(Zd)α,m,dj=1mfjpj(Zd) 1.7

if 1<p1,,pm, 1q for α=0, and 1<p1,,pm<, 1q< for 0<α<md, and 1q1p1++1pmαd. To see (1.7), we notice that

Brd(n)ZdΓr(n)Br(n)Zd, 1.8
N(Brd(n))N(Γr(n))N(Br(n)). 1.9

Here Br(n) is the open ball in Rd centered at n⃗ with radius r and N(Br(n)) is the number of lattice points in the set Br(n). On the other hand, it was shown in [34] that

cd(rd2)dN(Br(0))cd(r+d2)dr>d2. 1.10

Here cd=2πd/2Γ(d/2)d. (1.10) yields that

N(Br(n))N(Brd(n))C0r>0. 1.11

Here C0>1 depends only on the dimension d. It follows from (1.8)–(1.9) and (1.11) that

C0m+αdMα(f)(n)Mα(f)(n)C0mαdMα(f)(n). 1.12

(1.8), (1.10) and (1.12) imply that

Mα(f)(n)M˜α(f)(n)α,m,dMα(f)(n)α,m,dMα(f)(n)nZd. 1.13

(1.13) together with the bounds for Mα leads to (1.7).

Based on the above, a natural question, which arises from the above results, is the following:

Question C

Are both Mα and M˜α bounded and continuous from 1(Zd)××1(Zd) to BV(Zd)?

This problem is the main motivation for this work. We will give an affirmative answer by our next theorem.

Theorem 1.1

Let d1 and 0α<(m1)d+1. Then Mα maps 1(Zd)××1(Zd) into BV(Zd) boundedly and continuously. Moreover, if f=(f1,,fm) with each fj1(Zd), then

Var(Mα(f))α,m,di=1mfi1(Zd). 1.14

The same results hold for the operator M˜α.

Remark 1.1

(i) By (1.4) and Theorem 1.1, we know that both f|Mα(f)| and f|M˜α(f)| are bounded and continuous from 1(Zd)×1(Zd)××1(Zd) to 1(Zd) if d1 and 0α<(m1)d+1.

(ii) Both Mα and M˜α are not bounded from 1(Zd)×1(Zd)××1(Zd) into BV(Zd) when (m1)d+1<α<md.

(iii) Both Mα and M˜α are not bounded from BV(Zd)×BV(Zd)××BV(Zd) into BV(Zd) when (m1)(d1)<α<md.

To see the above claims (ii) and (iii), let us only consider the centered case. Let lN{0} with l>2(Λ0+1) and f=(f1,,fm) with each fj(n)=χ{0n1l}(n). Here Λ0 is given as in (2.3). One can easily check that fj1(Zd)=N1,d(l)dld, f1(Zd)dld1 and Mα(f)(n)=(N1,d(ln1))αd when 0n1l. Then we have

D1Mα(f)1(Zd)Λ0(n,nd)1l12nd0((N1,d(ln1|nd|))α/d(N1,d(ln1|nd|1))α/d).

Since ln1|nd|1>Λ0 when Λ0(n,nd)1l12. Then, by (2.11) with γ=αd and (2.3),

Mα(f)1(Zd)α,dΛ0(n,nd)1l12nd0(ln1|nd|1)α1α,d(l12)α1((l12)dΛ0d).

Consequently,

Mα(f)1(Zd)j=1mfj1(Zd)α,m,dlα+d1Λ0dlα1lmdα,m,dlα+d1mdΛ0dlα1md,Mα(f)1(Zd)j=1mfj1(Zd)α,m,dlα+d1Λ0dlα1lm(d1)α,m,dlα(m1)(d1)Λ0dlα1m(d1).

Letting l+, the claims (ii) and (iii) follow.

Remark 1.2

It should be pointed out that our main results are new even in the special case m=1 and α=0.

The rest of this paper is organized as follows. Section 2 contains some notation and necessary lemmas. The proof of Theorem 1.1 is given in Section 3. It should be pointed out that the main method employed in this paper is a combination of ideas and arguments from [18, 33], but our methods and techniques in the proof of Theorem 1.1 are more simple, direct and different than those in [18, 33]. In particular, the proof of Theorem B is highly dependent on a summability argument over the sequence of local maximal and local minima of discrete multisublinear fractional maximal functions and two summability estimates (see [33, Lemmas 2.1–2.2]). In [18, 33], the proofs of the corresponding continuity results are highly dependent on the Brezis–Lieb lemma [35]. Moreover, the discrete versions of Luiro’s lemma (see [18, Lemmas 4–5]) have also played key roles in the proof of the corresponding continuity results in [18]. However, these tools and lemmas are unnecessary in our proof. We would like to remark that the proposed method in this paper can be extended to study the convergence of the parameter estimation algorithms for linear and bilinear systems (see [3638]). Throughout this paper, the letter C will denote a positive constant that may vary at each occurrence but is independent of the essential variables. If there exists a constant C>0 depending only on ϑ such that ACB, we then write AϑB or BϑA; and if AϑBϑA, we then write AϑB. We also use the conventions iai=1 and iai=0.

Preliminary notations and lemmas

Let N={0,1,2,}. For any rN, we denote by N1,d(r) the number of elements in the set {n=(n1,,nd)Zd:n1r}. It is obvious that N1,d(0)=1 and N1,d(r+1)>N1,d(r)1 for all rN. Fix nZd, since n2n1dn2, then

N(Br1d(0))N1,d(r)N(Br+1(0))rN{0,1}. 2.1

(2.1) and (1.10) give that

cd(r1dd2)+dN1,d(r)cd(r+d2+1)drN{0,1}. 2.2

Here cd is given as in (1.10) and r+:=max{r,cd1/d} for any r>0. By (2.2), there exists Λ0N{0} such that

N1,d(r)drdrΛ0; 2.3
N1,d(r+1)N1,d(r)drd1rΛ0. 2.4

The following lemmas will play key roles in the proof of Theorem 1.1.

Lemma 2.1

Let γ>0, d1 and Λ0 is given as in (2.3). Define the function Φγ:NR by Φγ(r)=(N1,d(r))γ(N1,d(r+1))γ. Then

  • (i)

    Φγ is strictly decreasing on N.

  • (ii)

    Φγ(r)γ,d,Λ0Φ(2r) for any rN.

  • (iii)

    Φγ(r)γ,d,Λ0(N1,d(r+1))γ1d for any rN.

Proof

When d=1. It is obvious that Φγ(r)=(2r+1)γ(2r+3)γ is strictly decreasing on rN. To prove (i) for the case d2, it suffices to show that

Φγ(r)>Φγ(r+1)rN. 2.5

(2.5) reduces to the following:

(N1,d(r+1))γ(N1,d(r))γ+(N1,d(r+1))γ(N1,d(r+2))γ>2rN. 2.6

It was shown in [28, Lemma 4] that

N1,d(r+1)N1,d(r)>N1,d(r+2)N1,d(r+1)rN. 2.7

Combining (2.7) with the arithmetic mean-geometric mean inequality yields (2.6).

To prove (ii), it suffices to show that

(N1,d(r))γ(N1,d(r+1))γγ,d,Λ0(r+1)1dγrN. 2.8

Let us begin with proving the following:

(N1,d(r+1))γ(N1,d(r))γγ,drdγ1rΛ0. 2.9

We consider the following two cases.

Case A. γN{0}. When γ=1, (2.9) is obvious by (2.4). When γ2, we have

(N1,d(r+1))γ(N1,d(r))γ=(N1,d(r+1)N1,d(r))(N1,d(r+1)γ1+N1,d(r+1)γ2N1,d(r)++(N1,d(r))γ1).

This together with (2.3) and (2.4) yields (2.9) for the case γ2.

Case B. γN. We can write γ=pq for some p,qN with p1 and q2. Observe that

ab=(a1n)n(b1n)n=(a1nb1n)(an1n+an2nb1n++a1nbn2n+bn1n)

for any a,b>0. It follows that

a1nb1n=aban1n+an2nb1n++a1nbn2n+bn1n

for any a,b>0. Then

aγbγ=(ap)1q(bp)1q=apbpap(q1)q+ap(q2)qbpq++apqbp(q2)q+bp(q1)q 2.10

for any a,b>0. From (2.3), (2.10) and Case A with γ=p, we have

(N1,d(r+1))γ(N1,d(r))γγ,drdp1q1rdp(q1)qγ,drdγ1rΛ0,

which establishes (2.9) in this case.

It follows from (2.3) and (2.9) that

(N1,d(r))γ(N1,d(r+1))γ=(N1,d(r+1))γ(N1,d(r))γ(N1,d(l+1))γ(N1,d(r))γγ,d(r+1)1dγrΛ0. 2.11

When 0r<Λ0. By (i) and (2.11), we get

(N1,d(r))γ(N1,d(r+1))γ(N1,d(Λ0))γ(N1,d(Λ0+1))γγ,d(Λ0+1)1dγγ,d,Λ0(r+1)1dγ.

This together with the trivial inequality (N1,d(r))γ(N1,d(r+1))γγ,d,Λ0(r+1)1dγ for any 0r<Λ0 yields that

(N1,d(r))γ(N1,d(r+1))γγ,d,Λ0(r+1)1dγ0r<Λ0. 2.12

Combining (2.12) with (2.11) yields (2.8).

It remains to prove (iii). By (2.3) and (2.8), we get

Φγ(r)γ,d(N1,d(r+1))γ1drΛ0. 2.13

On the other hand, we get from (2.2) that

(N1,d(r+1))γ1dγ,d(r+1)1dγ0r<Λ0.

This together with (2.10) and the trivial fact that (N1,d(r+1))γ1d1γ,d,Λ0(r+1)1dγ for 0r<Λ0 implies that

(N1,d(r+1))γ1dγ,d,Λ0Φγ(r)0r<Λ0,

which together with (2.13) yields (iii). □

Lemma 2.2

Let d2, γ>1 and RN with RΛ0. Then

n1R(N1,d(n1))γγ,dRddγ; 2.14
nZd(N1,d(n1))γγ,d1. 2.15

Proof

We only prove (2.14), since (2.15) follows from (2.14) and the following:

n1<Λ0(N1,d(n1))γN1,d(Λ0)dΛ0d,

where in the last inequality of the above inequality we have used (2.3). For sN, let r1,d(s) denote the number of elements in the set {n=(n1,n2,,nd)Zd:n1=s}. Since ddγ<0, then by (2.3) and (2.4) we have

n1R(N1,d(n1))γ=l=R+(N1,d(l))γr1,d(l)γ,dl=R+ldγ(N1,d(l)N1,d(l1))γ,dl=R+ldγ(l1)d1γ,dl=R+ld1dγγ,dRddγ,

which gives (2.14) and completes the proof of Lemma 2.2. □

Proof of Theorem 1.1

This section is devoted to the proof of Theorem 1.1. Let Φγ be defined as in Lemma 2.1. It is clear that

(N(Γr(n)))αdm(N(Γr+1(n)))αdm=Φmαd([r])nZd and r[0,). 3.1

Proof of Theorem 1.1—boundedness part

Let f=(f1,,fm) with each fj1(Zd). Without loss of generality, we assume that all fj0. We divide the proof of this part into two cases.

Centered case

To prove (1.14), it suffices to show that

DlMα(f)1(Zd)α,m,di=1mfi1(Zd) 3.2

for all 1ld. We shall work with (3.2) for l=d and the other cases are analogous. In what follows, we set n=(n,nd)Zd with n=(n1,,nd1)Zd1. It is clear that

DdMα(f)1(Zd)=nZd1ndZ|Mα(f)(n,nd+1)Mα(f)(n,nd)|.

For each nZd1, let

Xn={ndZ:Mα(f)(n,nd+1)=Mα(f)(n,nd)}.Xn+={ndZ:Mα(f)(n,nd+1)>Mα(f)(n,nd)},Xn={ndZ:Mα(f)(n,nd+1)<Mα(f)(n,nd)}.

Then we can write

DdMα(f)1(Zd)=nZd1ndXn+(Mα(f)(n,nd+1)Mα(f)(n,nd))+nZd1ndXn(Mα(f)(n,nd)Mα(f)(n,nd+1)).

Thus, to prove (3.2), it suffices to show that

nZd1ndXn+(Mα(f)(n,nd+1)Mα(f)(n,nd))α,m,di=1mfi1(Zd); 3.3
nZd1ndXn(Mα(f)(n,nd)Mα(f)(n,nd+1))α,m,di=1mfi1(Zd). 3.4

We only prove (3.3) since (3.4) can be obtained similarly. For rN, we define the function Ar(f):ZdR by

Ar(f)(n)=(N(Γr(n)))αdmj=1mkΓr(n)fj(k)nZd.

Since all fj1(Zd), then limrAr(f)(n)=0. It follows that for any nZd1 and ndXn+, there exists r(n,nd)>0 such that Mα(f)(n,nd)=Ar(n,nd)(f)(n,nd). This together with (3.1) yields that

Mα(f)(n,nd+1)Mα(f)(n,nd)Ar(n,nd+1)(f)(n,nd+1)Ar(n,nd+1)+1(f)(n,nd)Φ([r(n,nd+1)])j=1mkΓr(n,nd+1)(n,nd+1)fj(k)(i=1m1fi1(Zd))kΓr(n,nd+1)(n,nd+1)Φmαd([r(n,nd+1)])fm(k). 3.5

It follows that

nZd1ndXn+(Mα(f)(n,nd+1)Mα(f)(n,nd))(i=1m1fi1(Zd))nZd1ndXn+kΓr(n,nd+1)(n,nd+1)Φmαd([r(n,nd+1)])fm(k)(i=1m1fi1(Zd))kZdfm(k)×nZd1ndXn+Φmαd([r(n,nd+1)])χ{k(n,nd+1)1[r(n,nd+1)]}(n,nd). 3.6

Fix kZd. Invoking Lemmas 2.12.2, we have

nZd1ndXn+Φmαd([r(n,nd+1)])χ{k(n,nd+1)1[r(n,nd+1)]}(n,nd)nZd1ndXn+Φmαd(k(n,nd+1)1)nZdΦmαd(n1)α,m,dnZd(N1,d(n1))α1dmα,m,d1. 3.7

In the last inequality of (3.7) we have used the fact α<(m1)d+1. Then (3.3) follows from (3.6) and (3.7).

Uncentered case

In this case the arguments are similar to those in the centered case, but the arguments are more complex than those in the centered case. We want to show that

DdM˜α(f)1(Zd)α,m,di=1mfi1(Zd). 3.8

For each nZd1, let

Yn={ndZ:M˜α(f)(n,nd+1)=M˜α(f)(n,nd)},Yn+={ndZ:M˜α(f)(n,nd+1)>M˜α(f)(n,nd)},Yn={ndZ:M˜α(f)(n,nd+1)<M˜α(f)(n,nd)}.

Fix nZd1. Since all fj1(Zd), then for any ndYn+, there exist r(n,nd+1)>0 and lZd such that M˜α(f)(n,nd+1)=Ar(n,nd+1)(f)(l) and (n,nd+1)l1<r(n,nd+1). By the arguments similar to those used in deriving (3.5), we obtain

M˜α(f)(n,nd+1)M˜α(f)(n,nd)Ar(n,nd+1)(f)(l)Ar(n,nd+1)+1(f)(led)Φ([r(n,nd+1)])j=1mkΓr(n,nd+1)(l)fj(k)(i=1m1fi1(Zd))kΓ2r(n,nd+1)(n,nd+1)Φmαd([r(n,nd+1)])fm(k). 3.9

Note that 8[r][2r] for r2 and Φ(r)1 for all rN. By Lemma 2.1, one can get that

kΓ2r(n,nd+1)(n,nd+1)Φmαd([r(n,nd+1)])fm(k)α,m,dkΓ2r(n,nd+1)(n,nd+1)Φmαd(8[r(n,nd+1)])fm(k)α,m,dkΓ2r(n,nd+1)(n,nd+1)fm(k)χ{k(n,nd+1)1<2r(n,nd+1)<4}(n,nd)α,m,d+kΓ2r(n,nd+1)(n,nd+1)Φmαd([2r(n,nd+1)])fm(k)χ{r(n,nd+1)2}(n,nd)α,m,dkZdfm(k)χ{k(n,nd+1)1<4}(n,nd)α,m,d+kZdfm(k)Φmαd([2r(n,nd+1)])χ{k(n,nd+1)1[2r(n,nd+1)]}(n,nd). 3.10

By the arguments similar to those used to derive (3.7), we get

supkZdnZd1ndXn+Φmαd([2r(n,nd+1)])χ{k(n,nd+1)1[2r(n,nd+1)]}(n,nd)α,m,d1. 3.11

It follows from (3.9)–(3.11) that

nZd1ndYn+(M˜α(f)(n,nd+1)M˜α(f)(n,nd))α,m,d(i=1m1fi1(Zd))α,m,d×(nZd1ndYn+kΓ2r(n,nd+1)(n,nd+1)fm(k)χ{k(n,nd+1)1<4}(n,nd)α,m,d+nZd1ndYn+kZdfm(k)Φmαd([2r(n,nd+1)])α,m,d×χ{k(n,nd+1)1[2r(n,nd+1)]}(n,nd))α,m,d(i=1mfi1(Zd))(supkZdnZd1ndYn+χ{k(n,nd+1)1<4}(n,nd)α,m,d+supkZdnZd1ndYn+Φmαd([2r(n,nd+1)])α,m,d×χ{k(n,nd+1)1[2r(n,nd+1)]}(n,nd))α,m,di=1mfi1(Zd). 3.12

Similarly, we can obtain

nZd1ndYn(M˜α(f)(n,nd)M˜α(f)(n,nd+1))α,m,di=1mfi1(Zd). 3.13

It follows from (3.12) and (3.13) that

DdM˜α(f)1(Zd)=nZd1ndYn+(M˜α(f)(n,nd+1)M˜α(f)(n,nd))+nZd1ndYn(M˜α(f)(n,nd)M˜α(f)(n,nd+1))α,m,di=1mfi1(Zd).

This proves (3.8) and completes the proof of the boundedness part.

Proof of Theorem 1.1—continuity part

Centered case

Let f=(f1,,fm) with each fj1(Zd) and gi,jfj in 1(Zd) for any 1jm as i. Let gi=(gi,1,,gi,m) for iZ. We may assume without loss of generality that all gi,j0 and fj0 since ||gi,j||fj|||gi,jfj| for all 1jd. Without loss of generality, we shall prove that

limiDdMα(gi)DdMα(f)1(Zd)=0. 3.14

Given ϵ(0,1), there exists N1=N1(ϵ,f)N such that

gi,jfj1(Zd)<ϵandgi,j1(Zd)fj1(Zd)+1iN1 and 1jm. 3.15

By the boundedness part, we have that DdMα(f)1(Zd). We also note that α<(m1)d+1. Then, for above ϵ>0, there exists an integer Λ with Λ>Λ0 such that

max{DdMα(f)χ{n14Λ}1(Zd),sup1imfiχ{n1Λ}1(Zd),Λα(m1)d1}<ϵ. 3.16

One can easily check that

|Mα(gi)(n)Mα(f)(n)|supr>0N(Γr(n))αdm|j=1mkΓr(n)gi,j(k)j=1mkΓr(n)fj(k)|l=1m(μ=1l1fμ1(Zd))(ν=l+1mgi,ν1(Zd))gi,lfl1(Zd)nZd.

This together with (3.15) implies that Mα(gi)(n)Mα(f)(n) as i for any nZ. Therefore, we have

DdMα(gi)(n)DdMα(f)(n)as inZd.

It follows that there exists N2=N2(ϵ,f,Λ)>0 such that

|DdMα(gi)(n)DdMα(f)(n)|ϵN(Γ4Λ(0))iN2 and nΓ4Λ(0). 3.17

(3.17) together with (3.16) implies that

DdMα(gi)DdMα(f)1(Zd)=(DdMα(gi)DdMα(f))χ{n1<4Λ}1(Zd)+(DdMα(gi)DdMα(f))χ{n14Λ}1(Zd)2ϵ+DdMα(gi)χ{n14Λ}1(Zd)iN2. 3.18

We now prove

DdMα(gi)χ{n12Λ}1(Zd)α,m,d,fϵiN1. 3.19

Fix iN1. We can write

DdMα(gi)χ{n14Λ}1(Zd)n12ΛnZd1ndZ|Mα(gi)(n,nd+1)Mα(gi)(n,nd)|+nZd1|nd|2ΛndZ|Mα(gi)(n,nd+1)Mα(gi)(n,nd)|=:A1+A2. 3.20

For A1, fix i{1,2,,m} and nZd1 with |n|2Λ, let

Zn={ndZ;Mα(gi)(n,nd+1)=Mα(gi)(n,nd)};Zn+={ndZ;Mα(gi)(n,nd+1)>Mα(gi)(n,nd)};Zn={ndZ;Mα(gi)(n,nd+1)<Mα(gi)(n,nd)}.

We can write

A1=n12ΛnZd1ndZn+(Mα(gi)(n,nd+1)Mα(gi)(n,nd))+n12ΛnZd1ndZn(Mα(gi)(n,nd)Mα(gi)(n,nd+1)). 3.21

By the arguments similar to those used in deriving (3.6), we have

n12ΛnZd1ndZn+(Mα(gi)(n,nd+1)Mα(gi)(n,nd))(i=1m1gi,j1(Zd))n12ΛnZd1ndZn+kΓr(n,nd+1)(n,nd+1)Φ([r(n,nd+1)])gi,m(k)(j=1m1gi,j1(Zd))kZdgi,m(k)I(k), 3.22

where

I(k):=n12ΛnZd1ndZn+Φmαd([r(n,nd+1)])χ{k(n,nd+1)1[r(n,nd+1)]}(n,nd).

Fix k=(k,kd)Zd. By a similar argument as that in getting (3.7), we can get

I(k,kd)α,m,d1. 3.23

When k1<Λ and n12Λ, then k(n,nd+1)1knΛ. Note that m+1αd>1. Then, by Lemmas 2.12.2 and (3.16),

I(k,kd)n12ΛnZd1ndZn+Φmαd([r(n,nd+1)])χ{Λk(n,nd+1)1[r(n,nd+1)]}(n,nd)n12ΛnZd1ndZn+Φmαd(k(n,nd+1)1)χ{Λk(n,nd+1)1}(n,nd)n1ΛΦmαd(n1)α,m,dn1Λ(N1,d(n1))α1dmα,m,dΛα(m1)d1α,m,dϵ. 3.24

Combining (3.24) with (3.23) and (3.15)–(3.16) implies that

kZdgi,m(k)I(k)k1ΛkdZdgi,m(k,kd)I(k,kd)+k1<ΛkdZdgi,m(k,kd)I(k,kd)α,m,d(gi,mχ{k1Λ}1(Zd)+gi,m1(Zd)ϵ)α,m,d((gi,mfm)χ{k1Λ}1(Zd)+fmχ{k1Λ}1(Zd)+(fm1(Zd)+1)ϵ)α,m,d,fmϵ.

This together with (3.22) and (3.15) yields that

n12ΛnZd1ndZn+(Mα(gi)(n,nd+1)Mα(gi)(n,nd))α,m,d,fϵ. 3.25

Similarly,

n12ΛnZd1ndZn(Mα(gi)(n,nd)Mα(gi)(n,nd+1))α,m,d,fϵ. 3.26

It follows from (3.21) and (3.25)–(3.26) that

A1α,m,d,fϵiN1. 3.27

By the arguments similar to those used to derive (3.27),

A2α,m,d,fϵiN1. 3.28

Then (3.19) follows from (3.20) and (3.27)–(3.28). From (3.18) and (3.19) we have

DdMα(gi)DdMα(f)1(Zd)α,m,d,fϵimax{N1,N2},

which yields (3.14).

Uncentered case

The proof is essentially analogous to Section 3.2.1. We leave the details to the interested reader.

Acknowledgements

The author would like to express his deep gratitude to the referee for his/her carefully reading and invaluable comments. This work was partially supported by the NNSF of China (No. 11701333) and Support Program for Outstanding Young Scientific and Technological Top-notch Talents of College of Mathematics and Systems Science (No. Sxy2016K01).

Authors’ contributions

The author worked on drafting and approving the final manuscript.

Competing interests

The author declares that they have no competing interests.

Footnotes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Kinnunen J. The Hardy–Littlewood maximal function of a Sobolev function. Isr. J. Math. 1997;100:117–124. doi: 10.1007/BF02773636. [DOI] [Google Scholar]
  • 2.Hajłasz P., Onninen J. On boundedness of maximal functions in Sobolev spaces. Ann. Acad. Sci. Fenn., Math. 2004;29:167–176. [Google Scholar]
  • 3.Kinnunen J., Lindqvist P. The derivative of the maximal function. J. Reine Angew. Math. 1998;503:161–167. [Google Scholar]
  • 4.Kinnunen J., Saksman E. Regularity of the fractional maximal function. Bull. Lond. Math. Soc. 2003;35(4):529–535. doi: 10.1112/S0024609303002017. [DOI] [Google Scholar]
  • 5.Carneiro E., Moreira D. On the regularity of maximal operators. Proc. Am. Math. Soc. 2008;136(12):4395–4404. doi: 10.1090/S0002-9939-08-09515-4. [DOI] [Google Scholar]
  • 6.Liu F., Wu H. On the regularity of the multisublinear maximal functions. Can. Math. Bull. 2015;58(4):808–817. doi: 10.4153/CMB-2014-070-7. [DOI] [Google Scholar]
  • 7.Liu F., Mao S. On the regularity of the one-sided Hardy–Littlewood maximal functions. Czechoslov. Math. J. 2017;67(142):219–234. doi: 10.21136/CMJ.2017.0475-15. [DOI] [Google Scholar]
  • 8.Luiro H. Continuity of the maximal operator in Sobolev spaces. Proc. Am. Math. Soc. 2007;135(1):243–251. doi: 10.1090/S0002-9939-06-08455-3. [DOI] [Google Scholar]
  • 9.Luiro H. On the regularity of the Hardy–Littlewood maximal operator on subdomains of Rd. Proc. Edinb. Math. Soc. 2010;53(1):211–237. doi: 10.1017/S0013091507000867. [DOI] [Google Scholar]
  • 10.Liu F. Continuity and approximate differentiability of multisublinear fractional maximal functions. Math. Inequal. Appl. 2018;21(1):25–40. [Google Scholar]
  • 11.Korry S. Boundedness of Hardy–Littlewood maximal operator in the framework of Lizorkin–Triebel spaces. Rev. Mat. Complut. 2002;15(2):401–416. doi: 10.5209/rev_REMA.2002.v15.n2.16899. [DOI] [Google Scholar]
  • 12.Korry S. A class of bounded operators on Sobolev spaces. Arch. Math. 2004;82(1):40–50. doi: 10.1007/s00013-003-0416-x. [DOI] [Google Scholar]
  • 13.Liu F., Wu H. On the regularity of maximal operators supported by submanifolds. J. Math. Anal. Appl. 2017;453:144–158. doi: 10.1016/j.jmaa.2017.03.058. [DOI] [Google Scholar]
  • 14.Tanaka H. A remark on the derivative of the one-dimensional Hardy–Littlewood maximal function. Bull. Aust. Math. Soc. 2002;65(2):253–258. doi: 10.1017/S0004972700020293. [DOI] [Google Scholar]
  • 15.Aldaz J., Pérez Lázaro J. Functions of bounded variation, the derivative of the one dimensional maximal function, and applications to inequalities. Transl. Am. Math. Soc. 2007;359(5):2443–2461. doi: 10.1090/S0002-9947-06-04347-9. [DOI] [Google Scholar]
  • 16.Liu F., Chen T., Wu H. A note on the endpoint regularity of the Hardy–Littlewood maximal functions. Bull. Aust. Math. Soc. 2016;94(1):121–130. doi: 10.1017/S0004972715001392. [DOI] [Google Scholar]
  • 17.Kurka O. On the variation of the Hardy–Littlewood maximal function. Ann. Acad. Sci. Fenn., Math. 2015;40:109–133. doi: 10.5186/aasfm.2015.4003. [DOI] [Google Scholar]
  • 18.Carneiro E., Mardid J. Derivative bounds for fractional maximal functions. Transl. Am. Math. Soc. 2017;369(6):4063–4092. doi: 10.1090/tran/6844. [DOI] [Google Scholar]
  • 19.Liu F., Wu H. Endpoint regularity of multisublinear fractional maximal functions. Can. Math. Bull. 2017;60(3):586–603. doi: 10.4153/CMB-2016-044-9. [DOI] [Google Scholar]
  • 20.Carneiro E., Mardid J., Pierce L.B. Endpoint Sobolev and BV continuity for maximal operators. J. Funct. Anal. 2017;273(10):3262–3294. doi: 10.1016/j.jfa.2017.08.012. [DOI] [Google Scholar]
  • 21.Hajłasz P., Malý J. On approximate differentiability of the maximal function. Proc. Am. Math. Soc. 2010;138(1):165–174. doi: 10.1090/S0002-9939-09-09971-7. [DOI] [Google Scholar]
  • 22. Luiro, H.: The variation of the maximal function of a radial function. arXiv:1702.00669
  • 23. Saari, O.: Poincaré inequalities for the maximal function. arXiv:1605.05176
  • 24. Carneiro, E., Finder, R., Sousa, M.: On the variation of maximal operators of convolution type II. arXiv:1512.02715
  • 25. Ramos, J.P.G.: Sharp total variation results for maximal functions. arXiv:1703.00362
  • 26.Bober J., Carneiro E., Hughes K., Pierce L.B. On a discrete version of Tanaka’s theorem for maximal functions. Proc. Am. Math. Soc. 2012;140(5):1669–1680. doi: 10.1090/S0002-9939-2011-11008-6. [DOI] [Google Scholar]
  • 27. Temur, F.: On regularity of the discrete Hardy–Littlewood maximal function. arXiv:1303.3993
  • 28.Madrid J. Sharp inequalities for the variation of the discrete maximal function. Bull. Aust. Math. Soc. 2017;95(1):94–107. doi: 10.1017/S0004972716000903. [DOI] [Google Scholar]
  • 29.Carneiro E., Svaiter B.F. On the variation of maximal operators of convolution type. J. Funct. Anal. 2013;265:837–865. doi: 10.1016/j.jfa.2013.05.012. [DOI] [Google Scholar]
  • 30.Liu F. A remark on the regularity of the discrete maximal operator. Bull. Aust. Math. Soc. 2017;95(1):108–120. doi: 10.1017/S0004972716000940. [DOI] [Google Scholar]
  • 31. Liu, F., Wu, H.: A note on the endpoint regularity of the discrete maximal operator. Proc. Am. Math. Soc. (in press). 10.1090/proc/13962
  • 32.Carneiro E., Hughes K. On the endpoint regularity of discrete maximal operators. Math. Res. Lett. 2012;19(6):1245–1262. doi: 10.4310/MRL.2012.v19.n6.a6. [DOI] [Google Scholar]
  • 33.Liu F., Wu H. Regularity of discrete multisublinear fractional maximal functions. Sci. China Math. 2017;60(8):1461–1476. doi: 10.1007/s11425-016-9011-2. [DOI] [Google Scholar]
  • 34. Pierce, Discrete, L.P.: Analogues in harmonic analysis. Ph.D. Thesis, Princeton University (2009)
  • 35.Brezis H., Lieb E. A relation between pointwise convergence of functions and convergence of functionals. Proc. Am. Math. Soc. 1983;88:486–490. doi: 10.2307/2044999. [DOI] [Google Scholar]
  • 36.Li M., Liu X., Ding F. The gradient based iterative estimation algorithms for bilinear systems with autoregressive noise. Circuits Syst. Signal Process. 2017;36(11):4541–4568. doi: 10.1007/s00034-017-0527-4. [DOI] [Google Scholar]
  • 37.Li M., Liu X., Ding F. The maximum likelihood least squares based iterative estimation algorithm for bilinear systems with autoregressive moving average noise. J. Franklin Inst. 2017;354(12):4861–4881. doi: 10.1016/j.jfranklin.2017.05.017. [DOI] [Google Scholar]
  • 38.Li M., Liu X., Ding F. Least-squares-based iterative and gradient-based iterative estimation algorithms for bilinear systems. Nonlinear Dyn. 2017;89(1):197–211. doi: 10.1007/s11071-017-3445-x. [DOI] [Google Scholar]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES