Search arXiv⌕ Search

arXiv · 0704.2950

Pseudo-localization of singular integrals and noncommutative Calderon-Zygmund theory

Abstract

In this paper we obtain the weak type (1,1) boundedness of Calderon-Zygmund operators acting over operator-valued functions. Our main tools for its solution are a noncommutative form of Calderon-Zygmund decomposition in conjunction with a pseudo-localization principle for singular integrals, which is new even in the classical setting and of independent interest. Perhaps because of the hidden role of pseudo-localization and almost orthogonality, this problem has remained open for quite some time. We also consider Calderon-Zygmund operators associated to certain operator-valued kernels.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Javier Parcet. 2007-04-23. Pseudo-localization of singular integrals and noncommutative Calderon-Zygmund theory. https://arxiv.org/abs/0704.2950

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Discriminants of derivatives: square graphs and sums of squares

The discriminants of the derivatives of a real-rooted polynomial are nonnegative polynomials in its roots, and we ask whether this nonnegativity can be certified algebraically in the root differences. We compare three such certificates: sums of squares, positive combinations of symmetrized monomials in squared root differences (the square-graph cone of Alexandersson and Shapiro), and sum-of-squares factorizations of the Hermite matrix of the derivative. We work in the terminal range, where the degree $r=n-k$ of the $k$-th derivative is fixed and the degree $n$ of the polynomial grows. For $r=3$ the discriminant lies in the square-graph cone for every $n$, and we prove the three-graph formula conjectured by Alexandersson and Shapiro. For $r=4$ the two cones separate: the discriminant belongs to the square-graph cone exactly for $4\le n\le22$, but it is a sum of squares for every $n\ge4$. The negative part is certified by an explicit linear functional, the positive part by a rational Gram certificate built from nine orbits of squares under the symmetric group. Thus the square-graph conjecture fails, already at $(n,k)=(23,19)$, while the sum-of-squares question has a positive answer for all $k\ge n-4$. Finally, we give explicit sum-of-squares factorizations of the Hermite matrices of the terminal cubic and quartic. The quartic factorization yields a uniform proof of the sum-of-squares property for all $n\ge4$, and we conjecture that such a factorization exists for every derivative; this is verified in the centered outlier limit through terminal degree six.

math.CA↗

Integrability of a composition of functions

The paper deals with the Riemann and Lebesgue integrability of functions. Sufficient conditions and criteria are stated for the integrability of a composition of functions. Relevant counterexamples are constructed based on Cantor's perfect sets and the Cantor staircase function. The main tool of research is Lebesgue's criterion for Riemann integrability.

math.CA↗

Stability for the adjoint Finner inequality and improved lower bounds on the $k$-plane transform

We establish stability properties of near-extremisers for the Loomis--Whitney inequality and its adjoint, presenting our results in the general framework of Finner. In particular, we show that a function nearly achieves equality in the adjoint Finner inequality if and only if it is near to being an indicator function of a cartesian product. As an application, we obtain new lower bounds for the classical $k$-plane transform on $L^p(\mathbb{R}^d)$, modestly improving those obtained recently by Tao and the first author. We also present an alternative approach to such improvements based on stability in the setting of the Brascamp--Lieb inequality and the theory of fusion frames. We conclude with an interpretation of our $k$-plane transform estimates as adjoint forms of the continuous Brascamp--Lieb inequalities.

math.CA↗