English

The $n$-linear embedding theorem for dyadic rectangles

Functional Analysis 2017-10-24 v1

Abstract

Let \sgi\sg_i, i=1,,ni=1,\ldots,n, denote reverse doubling weights on Rd\R^d, let \cdr(Rd)\cdr(\R^d) denote the set of all dyadic rectangles on Rd\R^d (Cartesian products of usual dyadic intervals) and let K:\cdr(Rd)[0,\8)K:\,\cdr(\R^d)\to[0,\8) be a~map. In this paper we give the nn-linear embedding theorem for dyadic rectangles. That is, we prove the nn-linear embedding inequality for dyadic rectangles R\cdr(Rd)K(R)i=1n<Rfid\sgi\rtCi=1nfiLpi(\sgi) \sum_{R\in\cdr(\R^d)} K(R)\prod_{i=1}^n\lt|\int_{R}f_i\,{\rm d}\sg_i\rt| \le C \prod_{i=1}^n \|f_i\|_{L^{p_i}(\sg_i)} can be characterized by simple testing condition K(R)i=1n\sgi(R)Ci=1n\sgi(R)1piR\cdr(Rd), K(R)\prod_{i=1}^n\sg_i(R) \le C \prod_{i=1}^n\sg_i(R)^{\frac{1}{p_i}} \quad R\in\cdr(\R^d), in the range 1<pi<\81<p_i<\8 and i=1n1pi>1\sum_{i=1}^n\frac{1}{p_i}>1. As a~corollary to this theorem, for reverse doubling weights, we verify a~necessary and sufficient condition for which the weighted norm inequality for the multilinear strong positive dyadic operator and for strong fractional integral operator to hold.

Keywords

Cite

@article{arxiv.1710.08059,
  title  = {The $n$-linear embedding theorem for dyadic rectangles},
  author = {Hitoshi Tanaka and Kozo Yabuta},
  journal= {arXiv preprint arXiv:1710.08059},
  year   = {2017}
}