Weighted Join Operators on Directed Trees
Abstract
A rooted directed tree T=(V, E) with can be extended to a directed graph T∞=(V∞, E∞) by adding a vertex ∞ to V and declaring each vertex in V as a parent of ∞. One may associate with the extended directed tree a family of semigroup structures b 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 Wbλu acting on 2(V), which we refer to as weighted join operators at a given base point b ∈ V∞ with prescribed vertex u ∈ V. The extreme ends of this family are weighted join operators Wrootλu and weighted meet operators W∞λu. 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 n-symmetric operators. An important half of this paper is devoted to the study of rank one extensions Wf, g of weighted join operators, where f ∈ 2(V) and g : V C is unspecified. Unlike weighted join operators, these operators are not necessarily closed. We provide a couple of compatibility conditions involving the weight system λu and g to ensure closedness of Wf, g. We discuss the role of the Gelfand-triplet in the realization of the Hilbert space adjoint of Wf, g. Further, we describe various spectral parts of Wf, g in terms of the weight system and the tree data. We also provide sufficient conditions for Wf, g to be a sectorial operator. In case T is leafless, we characterize rank one extensions Wf, g, which admit compact resolvent.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.