The n-linear embedding theorem for dyadic rectangles

From MaRDI portal
Publication:4632041




Abstract: Let sgi, i=1,ldots,n, denote reverse doubling weights on Rd, let cdr(Rd) denote the set of all dyadic rectangles on Rd (Cartesian products of usual dyadic intervals) and let K:,cdr(Rd)o[0,8) be a~map. In this paper we give the n-linear embedding theorem for dyadic rectangles. That is, we prove the n-linear embedding inequality for dyadic rectangles [ sum_{Rincdr(R^d)} K(R)prod_{i=1}^nlt|int_{R}f_i,{ m d}sg_i t| le C prod_{i=1}^n |f_i|_{L^{p_i}(sg_i)} ] can be characterized by simple testing condition [ K(R)prod_{i=1}^nsg_i(R) le C prod_{i=1}^nsg_i(R)^{frac{1}{p_i}} quad Rincdr(R^d), ] in the range 1<pi<8 and sumi=1nfrac1pi>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.









This page was built for publication: The \(n\)-linear embedding theorem for dyadic rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632041)