Introduction
In [3], Nguyen et al. used a novel application of ordinary and sharp Hardy-Littlewood maximal functions to prove that for s1−p1N=s2−p2N, s2<s1 the embedding
W˙s1,p1(RN)↪W˙s2,p2(RN)
of homogeneous Sobolev spaces holds. This result was derived by applying the inequality
∫RN∫RN∥h∥N+σq∣u(x+h)−u(x)∣qdhdx≲
∫RN(M(u)(x))(1−θ)q(r>0suprN1∫B(0,r)∥z∥σ∣u(x+z)−u(x)∣dz)θqdx,
where 1≤q<∞ and 0<θ,σ<1, in combination with the Sobolev-Gagliardo-Nirenberg embedding. This method relies on the intrinsic Gagliardo semi-norm,
∣u∣Ws,p(RN)=(∫RN∫RN∥h∥N+sp∣u(x+h)−u(x)∣pdhdx)p1,
where 1≤p,q<∞ and 0<s<1. The method offers a simpler alternative to classical proofs, including those from [6] and [4]. The former is presented as Theorem 17.85 of [1] and uses the Littlewood-Paley decomposition to prove the critical and supercritical cases, that is, when s1−p1N=0 and s1−p1N>0 respectively. The latter is presented as Theorem 7.35 in [2] and uses anisotropic Lp spaces to prove the general case in Besov spaces.
Although the proof from Nguyen et al. is simpler, their analysis cannot cover the critical and supercritical cases when s1<1 and s2<1. In these settings, standard embeddings are not sufficiently compatible with maximal functions for an identical approach.
The first author extended the result of Nguyen et al. in Theorem 7.34 of [2] by modifying the Hardy–Littlewood maximal function. He proved the inequality
∫RN(∥h∥N1∫B(0,2∥h∥)∣u(x+z)−u(x)∣dz)p2∥h∥N+s2p2dh≲∣u∣C0,αp2−p1(RN)(r>0suprN1∫B(0,r)∣u(x+z)−u(x)∣(∥z∥s1dz)p1)
where 0<s2<s1<1, 1≤p1,p2≤∞, s1−p1N=s2−p2N=α>0. After an application of Morrey’s embedding theorem, this handles the supercritical case. Nevertheless, the first author resorted to Solonnikov’s long and classical method from [4] to prove the critical case in Theorem 7.35. An alternative proof akin to Nguyen et al.’s result may be available through the space BMO(RN), although no such proof is forthcoming. Instead, in this paper, we succinctly prove the critical case using standard results of interpolation and the short theorems taken from both [2] and [3]. Our result is as follows.
Theorem 1.1. For 0<s2<s1<1, 1≤p1,p2<∞ where s1−p1N=s2−p2N=0,
W˙s1,p1(RN)↪W˙s2,p2(RN).(1)
Preliminaries
In this paper, we write A(x)≲B(x) if for some constant c>0 independent of x, A(x)≤cB(x) for all x∈dom(A).
Combining the aforementioned results of [2] and [3], the statement is proven in the noncritical case.
Theorem 2.1. For 0<s2<s1<1, 1≤p1,p2<∞ where s1−p1N=s2−p2N=0,
W˙s1,p1(RN)↪W˙s2,p2(RN).(2)
We make use of several classical results on interpolation, which are extended to interpolation on semi-normed spaces. A more comprehensive discussion of the subject can be found in [1] and [5], although we present a brief overview of the relevant terms and theorems in this paper.
Definition 2.1. Two semi-normed spaces (X0,∣⋅∣X0) and (X1,∣⋅∣X1) are compatible if both embed into the same larger vector space X.
Both the intersection and the sum of compatible spaces inherit natural semi-norm structures. The real interpolation spaces defined below are particular examples of intermediate spaces between X0∩X1 and X0+X1.
Definition 2.2. For compatible semi-normed spaces (X0,∣⋅∣X0) and (X1,∣⋅∣X1) and any x∈X0+X1, define the semi-norm K(x,t;X0,X1)=inf(∣x0∣X0+t∣x1∣X1), where the infimum is taken over all x0∈X0, x1∈X1 with x0+x1=x. Where X0 and X1 are apparent, we write K(x,t) instead.
Definition 2.3 (K Method of Interpolation). For compatible semi-normed spaces (X0,∣⋅∣X0) and (X1,∣⋅∣X1), 0<θ<1, and 1≤p≤∞, define
∣x∣(X0,X1)θ,p=(∫0∞t1+θpK(x,t)pdt)p1(3)
if p<∞, and
∣x∣(X0,X1)θ,p=t>0supt−θK(x,t)
otherwise. (X0,X1)θ,p is the set of all x∈X0+X1 such that this value is finite.
Spaces generated by the K-method have several useful properties, the most important of which is the following.
Theorem 2.2 (Reiteration). Let (X0,∣⋅∣X0) and (X1,∣⋅∣X1) be compatible complete semi-normed spaces with complete intersection. For 0≤s0<s1≤1, 0<θ<1, s=θs1+(1−θ)s0, 1≤q0,q1,q2≤∞,
(Xs0,q0,Xs1,q1)θ,q2=(X0,X1)s,q2(4) with equivalence of seminorms, where
Xsi,qi={Xsi(X0,X1)si,qisi∈{0,1},si∈/{0,1}.(5)
The reiteration theorem is proved in [5]. Although it requires a few tricks, the method is largely long algebraic manipulation. We also use a few standard inclusions of interpolation spaces.
Theorem 2.3. Let (X0,∣⋅∣X0),(X1,∣⋅∣X1) be an admissible pair of semi-normed spaces, 0<θ<1, 1≤p≤q<∞. In this setting,
(X0,X1)θ,p↪(X0,X1)θ,q↪(X0,X1)θ,∞.(6)
Proof. We present a proof taken from [1]. As K(x,⋅) is increasing, for t>0, by (3),
t−θK(x,t)≲(∫t∞(K(x,t))qz1+θqdz)1/q≤(∫t∞(K(x,z))qz1+θqdz)1/q≤∣x∣(X0,X1)θ,q.
Taking the supremum of the left side yields the second embedding. Further,
∣x∣(X0,X1)θ,qq=∫0∞(K(x,t))qt1+θqdt=∫0∞(t−θK(x,t))q−p(K(x,t))pt1+θpdt≲∣x∣(X0,X1)θ,∞q−p∫0∞(K(x,t))pt1+θpdt≲∣x∣(X0,X1)θ,∞q−p∣x∣(X0,X1)θ,pp,
where the final inequality uses the second embedding applied to (X0,X1)θ,p. □
Theorem 2.4. Let (X0,∣⋅∣X0),(X1,∣⋅∣X1) and (Y0,∣⋅∣Y0),(Y1,∣⋅∣Y1) be two pairs of compatible semi-normed spaces, and let T:X0+X1→Y0+Y1 be linear. Suppose T:Xi→Yi and ∣T(xi)∣Yi≲∣xi∣Xi for all xi∈Xi, i=0,1. For all 0<θ<1, 1≤p≤∞, ∣T(x)∣(Y0,Y1)θ,p≲∣x∣(X0,X1)θ,p for all x∈(X0,X1)θ,p.
Proof. We present an adapted proof from [1]. Let x0∈X0, x1∈X1 be such that x0+x1=x. By linearity,
K(T(x),t;Y0,Y1)≤∣T(x0)∣Y0+t∣T(x1)∣Y1≲∣x0∣X0+t∣x1∣X1
Taking the infimum yields K(T(x),t;Y0,Y1)≲K(x,t;X0,X1). The result follows. □
We conclude our preliminaries with a specific application of the K-method to Sobolev spaces.
Theorem 2.5. For 1≤p<∞, 0<θ<1,
(Lp(RN),W˙1,p(RN))θ,p=W˙θ,p(RN).(7) This result is proven in [2] using mollification to decompose an arbitrary function. Note that W˙1,p(RN)∩Lp(RN)=W1,p(RN) is a Banach space. Thus, we may apply the reiteration theorem to Sobolev spaces.
Proof
Proof of Theorem 1.1. Observe that 1<p1=s1N<p2=s2N<∞. Let 0<d1<s1<t1<1 and let 0<θ<1 such that θt1+(1−θ)d1=s1. Define d2=d1+p2N−p1N and t2=t1+p2N−p1N. Because
d1−p1N=d2−p2N=d1−s1<0,t1−p1N=t2−p2N=t1−s1>0,
we may apply Theorems 2.2 and 2.5 to write
W˙s1,p1(RN)=(W˙d1,p1(RN),W˙t1,p1(RN))θ,p1.
By taking d1,t1 close to s1, we ensure 0<d2,t2<1, since 0<s2=s1+p2N−p1N<1. By Theorems 2.1 and 2.4,
(W˙d1,p1(RN),W˙t1,p1(RN))θ,p1↪(W˙d2,p2(RN),W˙t2,p2(RN))θ,p1,
where we use the identity map as our linear transformation. By Theorem 2.3
(W˙d2,p2(RN),W˙t2,p2(RN))θ,p1↪(W˙d2,p2(RN),W˙t2,p2(RN))θ,p2.
A final application of Theorems 2.2 and 2.5 completes the proof, since
s2=s1+p2N−p1N=θt2+(1−θ)d2.
□
Acknowledgments
Asher Wheaton was supported by the summer research support of NSF grant DMS #2508400 This paper was written without using AI.
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213-3890, USA
Email address: [email protected]
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213-3890, USA
Email address: [email protected]