Weighted Join Operators on Directed Trees
Abstract
A rooted directed tree with can be extended to a directed graph by adding a vertex to and declaring each vertex in as a parent of One may associate with the extended directed tree a family of semigroup structures with extreme ends being induced by the join operation and the meet operation . Each semigroup structure among these leads to a family of densely defined linear operators acting on which we refer to as weighted join operators at a given base point with prescribed vertex . The extreme ends of this family are weighted join operators and weighted meet operators . In this paper, we systematically study these operators. We also present a more involved counter-part of weighted join operators on rootless directed trees. In both cases, the class of weighted join operators overlaps with the well-studied classes of complex Jordan operators and -symmetric operators. An important half of this paper is devoted to the study of rank one extensions of weighted join operators, where and is unspecified. Unlike weighted join operators, these operators are not necessarily closed. We provide a couple of compatibility conditions involving the weight system and to ensure closedness of . We discuss the role of the Gelfand-triplet in the realization of the Hilbert space adjoint of . Further, we describe various spectral parts of in terms of the weight system and the tree data. We also provide sufficient conditions for to be a sectorial operator. In case is leafless, we characterize rank one extensions , which admit compact resolvent.
Cite
@article{arxiv.1806.08495,
title = {Weighted Join Operators on Directed Trees},
author = {Sameer Chavan and Rajeev Gupta and Kalyan B. Sinha},
journal= {arXiv preprint arXiv:1806.08495},
year = {2021}
}
Comments
This is a slight revision of the previous version