The n-linear embedding theorem for dyadic rectangles

Abstract

Let i, i=1,…,n, denote reverse doubling weights on d, let (d) denote the set of all dyadic rectangles on d (Cartesian products of usual dyadic intervals) and let K:\,(d)[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 \[ ΣR∈(d) K(R)Πi=1n|∫Rfi\, di| C Πi=1n \|fi\|Lpi(i) \] can be characterized by simple testing condition \[ K(R)Πi=1ni(R) C Πi=1ni(R)1pi R∈(d), \] in the range 1<pi<\8 and Σi=1n1pi>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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…