 Weighted Join Operators on Directed TreesSameer Chavan (),
Rajeev Gupta () and
Kalyan B. Sinha ()
A chapter in Multivariable Operator Theory, 2023, pp 243-344 from Springer Abstract: Abstract A rooted directed tree $${\mathscr {T}}=(V, E)$$ T = ( V , E ) with root $${\textsf{root}}$$ root can be extended to a directed graph $$\mathscr {T}_\infty =(V_\infty , E_\infty )$$ T ∞ = ( V ∞ , E ∞ ) by adding a vertex $$\infty $$ ∞ to V and declaring each vertex in V as a parent of $$\infty $$ ∞ . One may associate with the extended directed tree $${\mathscr {T}}_{\infty }$$ T ∞ a family of semigroup structures $$\sqcup _{\mathfrak b}$$ ⊔ b with extreme ends being induced by the join operation $$\sqcup $$ ⊔ and the meet operation $$\sqcap $$ ⊓ from lattice theory (corresponding to $$\mathfrak b={\textsf{root}}$$ b = root and $$\mathfrak b= \infty $$ b = ∞ respectively). Each semigroup structure among these leads to a family of densely defined linear operators $$W^{(\mathfrak b)}_{\varvec{\lambda }_{u}}$$ W λ u ( b ) acting on $$\ell ^2(V),$$ ℓ 2 ( V ) , which we refer to as weighted join operators at a given base point $$\mathfrak b \in V_{\infty }$$ b ∈ V ∞ with prescribed vertex $$u \in V$$ u ∈ V . The extreme ends of this family are weighted join operators $$W^{(\mathfrak {{\textsf{root}}})}_{\varvec{\lambda }_{u}}$$ W λ u ( root ) and weighted meet operators $$W^{(\mathfrak \infty )}_{\varvec{\lambda }_{u}}$$ W λ u ( ∞ ) . In this paper, we systematically study the weighted join operators on rooted directed trees. We also present a more involved counterpart of weighted join operators $$W^{(\mathfrak b)}_{\varvec{\lambda }_{u}}$$ W λ u ( b ) on rootless directed trees $${\mathscr {T}}$$ T . In the rooted case, these operators are either finite rank operators, diagonal operators or rank one perturbations of diagonal operators. In the rootless case, these operators are either possibly infinite rank operators, diagonal operators or (possibly unbounded) rank one perturbations of diagonal operators. 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 $$W_{f, g}$$ W f , g of weighted join operators $$W^{(\mathfrak b)}_{\varvec{\lambda }_{u}}$$ W λ u ( b ) on rooted directed trees, where $$f \in \ell ^2(V)$$ f ∈ ℓ 2 ( V ) and $$g: V \rightarrow {\mathbb {C}}$$ 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 $$\varvec{\lambda }_u$$ λ u and g to ensure closedness of $$W_{f, g}$$ W f , g . These compatibility conditions are intimately related to whether or not an associated discrete Hilbert transform is well-defined. We discuss the role of the Gelfand-triplet in the realization of the Hilbert space adjoint of $$W_{f, g}$$ W f , g . Further, we describe various spectral parts of $$W_{f, g}$$ W f , g in terms of the weight system and the tree data. We also provide sufficient conditions for $$W_{f, g}$$ W f , g to be a sectorial operator (resp. an infinitesimal generator of a quasi-bounded strongly continuous semigroup). In case $${\mathscr {T}}$$ T is leafless, we characterize rank one extensions $$W_{f, g}$$ W f , g , which admit compact resolvent. Motivated by the above graph-model, we also take a brief look into the general theory of rank one non-selfadjoint perturbations. Keywords: Directed tree; Join; Meet; Rank one perturbation; Discrete Hilbert transform; Commutant; Gelfand-triplet; Sectorial; Complex Jordan; n-symmetric; Form-sum; Primary 47B37; 47B15; 47H06; Secondary 05C20; 47B20 (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-50535-5_11 Ordering information: This item can be ordered from DOI: 10.1007/978-3-031-50535-5_11 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.