A sharp variant of the Marcinkiewicz theorem with multipliers in Sobolev spaces of Lorentz type

preprint2020arXivOpen access

Abstract

Given a bounded measurable function σσ on Rn\mathbb{R}^n, we let TσT_σ be the operator obtained by multiplication on the Fourier transform by σσ. Let 0<s1≤s2≤⋯≤sn<10<s_1\le s_2\le \cdots \le s_n<1 and ψψ be a Schwartz function on the real line whose Fourier transform ψ^\widehatψ is supported in [−2,−1/2]∪[1/2,2][-2,-1/2]\cup[1/2,2] and which satisfies ∑j∈Zψ^(2−jξ)=1\sum_{j \in \mathbb{Z}} \widehatψ\left(2^{-j} ξ\right)=1 for all ξ≠0ξ\neq 0. In this work we sharpen the known forms of the Marcinkiewicz multiplier theorem by finding an almost optimal function space with the property that, if the function \begin{equation*} (ξ_1,\dots, ξ_n)\mapsto \prod_{i=1}^n (I-\partial_i^2)^{\frac {s_i}2} \Big[ \prod_{i=1}^n \widehatψ(ξ_i) σ(2^{j_1}ξ_1,\dots , 2^{j_n}ξ_n)\Big] \end{equation*} belongs to it uniformly in j1,…,jn∈Zj_1,\dots , j_n \in \mathbb Z, then TσT_σ is bounded on Lp(Rn) {L}^p(\mathbb R^n) when ∣1p−12∣<s1 |\frac{1}{p}-\frac{1}{2} | < s_1 and 1<p<∞1<p<\infty. In the case where si≠si+1s_i\neq s_{i+1} for all ii, it was proved in [Grafakos, Israel J. Math., to appear] that the Lorentz space L1s1,1(Rn)L ^{\frac{1}{s_1},1} (\mathbb{R}^n) is the function space sought. In this work we address the significantly more difficult general case when for certain indices ii we might have si=si+1s_i=s_{i+1}. We obtain a version of the Marcinkiewicz multiplier theorem in which the space L1s1,1L ^{\frac{1}{s_1},1} is replaced by an appropriate Lorentz space associated with a certain concave function related to the number of terms among s2,…,sns_2,\dots , s_n that equal s1s_1. Our result is optimal up to an arbitrarily small power of the logarithm in the defining concave function of the Lorentz space.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.