Unbounded & Closed Operators

Differential and multiplication operators are often necessarily unbounded, so their domain becomes part of the mathematical object. This chapter explains graphs, closedness, closability, graph norms, dense domains, and why the closed graph theorem does not make every closed operator bounded.

Differentiation amplifies high frequencies, so no uniform output bound can hold under a norm that measures only function amplitude. Treating such an operator as “a linear map with an inconvenient constant” loses the key structure. An unbounded operator is specified by both its rule and its domain.

The domain belongs to the operator #

An operator from XX to YY is a pair (T,D(T))(T,D(T)) with a linear subspace D(T)⊆XD(T)\subseteq X and a linear map T:D(T)→YT:D(T)\to Y. Two operators with the same formula but different domains are different: they may have different kernels, ranges, adjoints, closures, and spectra.

For example, differentiation on L2(0,1)L^2(0,1) may use periodic, Dirichlet, or other boundary conditions. Those conditions live in D(T)D(T) and change the spectral problem.

The graph is

G(T)={(x,Tx):x∈D(T)}⊆X×Y.G(T)=\{(x,Tx):x\in D(T)\}\subseteq X\times Y.

TT is closed when G(T)G(T) is closed: whenever xn∈D(T)x_n\in D(T), xn→xx_n\to x in XX, and Txn→yTx_n\to y in YY, then x∈D(T)x\in D(T) and Tx=yTx=y. Closedness says that simultaneous convergence of input and output cannot produce an inadmissible limiting pair.

Closed does not mean bounded #

Let X=Y=C[0,1]X=Y=C[0,1] with the sup norm and

D(T)=C1[0,1],Tf=f′.D(T)=C^1[0,1],\qquad Tf=f'.

The operator is unbounded: for fn(x)=sin⁡(nx)/nf_n(x)=\sin(nx)/n, ∥fn∥∞≤1/n\|f_n\|_\infty\le1/n while ∥Tfn∥∞=1\|Tf_n\|_\infty=1. It is nevertheless closed. If fn→ff_n\to f and fn′→gf_n'\to g uniformly, then

fn(x)−fn(0)=∫0xfn′(t)dtf_n(x)-f_n(0)=\int_0^x f_n'(t)dt

passes to the limit, giving f(x)−f(0)=∫0xg(t)dtf(x)-f(0)=\int_0^x g(t)dt; hence f∈C1f\in C^1 and f′=gf'=g.

There is no conflict with the closed graph theorem because TT is not defined on all of C[0,1]C[0,1]. An everywhere-defined closed linear map between Banach spaces is bounded.

Graph norm makes a closed operator complete #

Define

∥x∥T=∥x∥X+∥Tx∥Y,x∈D(T).\|x\|_T=\|x\|_X+\|Tx\|_Y, \qquad x\in D(T).

If XX and YY are Banach, then TT is closed iff D(T)D(T) is Banach under the graph norm. The graph norm records both convergence of the object and of the quantity produced by the operator. Sobolev norms are systematic versions of this idea for differential operators.

Closable operators and closure #

TT is closable when the closure of G(T)G(T) is itself the graph of an operator T‾\overline T. Equivalently,

xn→0,quadTxn→y⟹y=0.x_n\to0,quad Tx_n\to y\quad\Longrightarrow\quad y=0.

If a nonzero yy were possible, the closed graph would contain both (0,0)(0,0) and (0,y)(0,y) and could not define a function. The closure T‾\overline T is the smallest closed extension of TT.

A densely defined operator on a Hilbert space is closable iff the domain of its adjoint is dense. Density is what lets inner products against D(T)D(T) determine candidate adjoint vectors uniquely.

Resolvents require domain-aware bijectivity #

For a closed operator TT on a Banach space, λ\lambda lies in the resolvent set when

T−λI:D(T)→XT-\lambda I:D(T)\to X

is bijective and its inverse is bounded on all of XX. The inverse maps into D(T)D(T), usually with graph-norm control. Ignoring the domain can turn two different boundary-value problems into the same symbol and produce the wrong spectrum.

Diagnostic checklist #

  • Write D(T)D(T) beside the formula every time.
  • State the ambient norm and the graph norm.
  • Test closedness with simultaneous input/output convergence.
  • Test closability with the zero-input criterion.
  • Do not invoke closed graph unless the map is everywhere-defined between Banach spaces.
  • Treat boundary conditions as domain data, not annotations.

Sources

  1. bookIntroduction to Functional Analysis: Lecture Notes for 18.102pdfnotes

Searches titles, aliases, headings, summaries, and full text.↑↓ move ↵ open esc close