Matrix valued paraproducts (Q1384991): Difference between revisions

The paper contains a real-variable proof of the upper bound of order \(O(\log N)\) in the dyadic Carleson-type embedding theorem with an \((N\times n)\)-matrix weight. See the paper by \textit{F. Nazarov}, \textit{S. Treil} and \textit{A. Volberg} [C. R. Acad. Sci., Paris, Sér. I, Math. 325, No. 4, 383-388 (1997; Zbl 0892.42013)] for a different proof, and for the fact that this bound cannot be smaller than \(c(\log N)^{1/2}\).