Definition
Graph norm
The norm on an operator domain that controls both a vector and its image.
Definition
Let be a linear operator between normed vector spaces. The graph norm of is the norm on defined by
Equivalently, it is the norm transported from the graph of by the linear bijection , when is given the sum norm. The graph norm is stronger than the norm inherited from : convergence in graph norm means both in and in .
Completeness and closedness
If and are Banach spaces, then is closed exactly when is a Banach space. Indeed, the graph map identifies the operator domain isometrically with , and a linear subspace of a Banach space is complete precisely when it is closed.
Equivalent choices
When and are Hilbert spaces, one often uses
This norm is equivalent to the sum graph norm and comes from the graph inner product
The two formulas define the same topology on , though only the second is induced by an inner product.
Cores
For a closed operator , a subspace is a core when it is dense in for the graph norm. Equivalently, the restriction is closable and its closure is . Ordinary density of in is not enough, because it does not control convergence of the images .
References
- Tosio Kato, Perturbation Theory for Linear Operators, Springer, 1995 reprint of the 2nd ed. Springer DOI record. Relevant: Chapter III.
- Konrad Schmüdgen, Unbounded Self-adjoint Operators on Hilbert Space, Springer, 2012. Springer DOI record. Relevant: Chapter 1.