Applications of Reproducing Kernels in composition operators
Preeti Kumari, P. Muthukumar, Antti Rasila
TL;DR
This work develops a unified RKHS perspective on composition and weighted composition operators, showing how reproducing kernels streamline the analysis across classical one-variable Hardy spaces and their weighted variants, as well as multivariable domains. Key results include an explicit norm formula and non-attainment for inner-symbol composition operators, a complete kernel-based characterization of when adjoints are themselves composition operators, and a general RKHS framework for weighted composition operators with precise boundedness criteria. The methodology yields simpler proofs of known results and extends to several complex variables, enhancing structural understanding of operator behavior via kernel techniques. The findings have potential implications for spectral properties and norm estimates in RKHS settings beyond the classical Hardy spaces.
Abstract
In this paper, we illustrate the effectiveness of reproducing kernel Hilbert space techniques in the study of composition operators. For weighted Hardy spaces on the unit disk, we characterize the composition operators whose adjoint is again a composition operator. Using reproducing kernel methods, we obtain a classification of bounded weighted composition operators acting between reproducing kernel Hilbert spaces. We also show that the reproducing kernel techniques yield simpler proofs of several known results, highlighting the role of reproducing kernels as a unifying structural tool in the analysis of composition operators.
