A range matrix-type criterion for the self-adjointness of symmetric linear relations
Let $\mathfrak{H}$ be a real or complex Hilbert space; $T$ a linear relation in $\mathfrak{H}$, i.e., a linear subspace of $\mathfrak{H} \times \mathfrak{H}$. The adjoint $T^\star$ of $T$ is defined as $$T^\star = \Big\{\{f,f^\prime\} \in \mathfrak{H} \times \mathfrak{H}\colon \,\, \langle f^\prime,h\rangle = \langle f,h^\prime\rangle \text{ for all } \{h,h^\prime\} \in T \Big\}.$$ A linear relation $T$ is called symmetric if $T \subset T^\star.$ \par The main result of the paper is a matrix-type criterion for a symmetric linear relation to be self-adjoint. For the case of linear operators, the corresponding result was presented by \textit{Z. Sebestyén} and \textit{Z. Tarcsay} [Stud. Sci. Math. Hung. 50, No. 4, 423--435 (2013; Zbl 1313.47045)].
- Adjoint to each other linear relations. Nieminen type criteria
- On the adjoint of linear relations in Hilbert spaces
- Operator factorization of range space relations∗
- Some results concerning the linear relations which are adjoint to each other
- Operational calculus for rows, columns, and blocks of linear relations
This page was built for publication: A range matrix-type criterion for the self-adjointness of symmetric linear relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317439)
