Abstract
We establish a class of sharp logarithmic estimates for the Beurling-Ahlfors transform B on the complex plane. For any K > 0 we determine the optimal constant $${L = L(K) \in (0, \infty]}$$ such that the following holds. If $${F : \mathbb{C} \rightarrow \mathbb{C}}$$ is a radial function, then for any R > 0, $$\frac{1}{|\mathcal{B}(0, R)|} \int_{\mathcal{B}(0, R)} |BF(z)| dz \leq \frac{K}{|\mathcal{B}(0, R)|} \int_{\mathcal{B}(0, R)} \Psi(|F(z)|) dz + L(K),$$ where Ψ(t) = (t + 1) log(t + 1) – t and $${\mathcal{B}(0, R) \subset \mathbb{C}}$$ denotes the ball of center 0 and radius R. A related result in higher dimensions is also established. The proof rests on probabilistic methods and exploits a certain sharp inequality for martingales.
Highlights
The Beurling-Ahlfors transform is an operator acting on Lp(C), defined by the singular integral
The purpose of this paper is to study a different, LlogL inequality, which can be regarded as a version of the Lp estimate for p = 1
We will deduce (1.2) from an appropriate sharp inequality for martingales, which is of independent interest
Summary
The Beurling-Ahlfors transform is an operator acting on Lp(C), defined by the singular integral. Where p.v. means the principal value and the integration is with respect to the Lebesgue measure on the plane. It can be defined as a Fourier multiplier with the symbol m(ξ) = ξ/ξ, i.e., we have the identity BF (ξ) =. This operator is of fundamental importance in Partially supported by Polish Ministry of Science and Higher Education (MNiSW) grant IP2011 039571 ‘Iuventus Plus’
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.