Definition

Let T:D(T)XYT:\mathcal D(T)\subseteq X\to Y be a between . Its closure T\overline T is the operator whose is the closure of the graph of TT in X×YX\times Y:

G(T)=G(T).\mathcal G(\overline T)=\overline{\mathcal G(T)}.

Equivalently, xD(T)x\in\mathcal D(\overline T) precisely when some sequence xnD(T)x_n\in\mathcal D(T) satisfies xnxx_n\to x and TxnyTx_n\to y for some yYy\in Y; then Tx=y\overline Tx=y. Closability is exactly what makes this limit yy unique. The operator T\overline T is , extends TT, and is contained in every closed extension of TT.

Graph characterization

The closure operation adds exactly the limit pairs forced by the original graph. In particular,

D(T)={x:xnD(T), xnx, (Txn) converges}.\mathcal D(\overline T) =\left\{x:\exists x_n\in\mathcal D(T),\ x_n\to x,\ (Tx_n)\text{ converges}\right\}.

The value of T\overline T is determined by the limit of TxnTx_n, and does not depend on the chosen approximating sequence. If the closed graph contains a nonzero pair (0,y)(0,y), no operator can have that graph and TT is not closable.

Relation to adjoints

For a between , TT is closable exactly when the domain of its TT^* is dense. In that case,

T=T.\overline T=T^{**}.

This identity includes the domains: it is not merely equality of the formal actions. The adjoint TT^* itself is always closed.

Example and warning

On L2(R)L^2(\mathbb R), restrict multiplication by the coordinate xx to . Its closure is the maximal multiplication operator

(Tf)(x)=xf(x),D(T)={fL2(R):xfL2(R)}.(\overline Tf)(x)=xf(x),\qquad \mathcal D(\overline T)=\{f\in L^2(\mathbb R):xf\in L^2(\mathbb R)\}.

Other closed extensions can exist, especially for differential operators with boundary conditions. The closure is the smallest closed extension, not an arbitrarily chosen .

References