Math 2.0

Operator theory Definition

Closed operator

Builds on Unbounded operatorGraph of an operatorClosed setClosed graph theorem

Definition

Let XX and YY be normed spaces, and let TT be an unbounded operator from XX to YY with domain D(T)D(T). The operator TT is closed if its graph Γ(T)\Gamma(T) is a closed subset of X×YX \times Y.

Remarks

Equivalently, TT is closed when, for every sequence (xn)(x_n) in D(T)D(T) with xn→xx_n \to x in XX and Txn→yT x_n \to y in YY, one has x∈D(T)x \in D(T) and Tx=yTx = y.

Example: on X=Y=C[0,1]X = Y = C[0, 1] with the supremum norm, let D(T)=C1[0,1]D(T) = C^1[0, 1] and Tf=f′Tf = f'. If fn→ff_n \to f and fn′→gf_n' \to g uniformly, then fn(x)=fn(0)+∫0xfn′f_n(x) = f_n(0) + \int_0^x f_n' gives f(x)=f(0)+∫0xgf(x) = f(0) + \int_0^x g, so f∈C1[0,1]f \in C^1[0, 1] and f′=gf' = g. Hence TT is closed, although it is not bounded.

Non-example: the same formula with D(S)D(S) the space of polynomials is not closed. The Taylor polynomials pnp_n of exe^x converge uniformly to exe^x and pn′=pn−1p_n' = p_{n-1} converges to exe^x, but exe^x is not a polynomial, so it is not in D(S)D(S).

Every bounded operator defined on all of XX is closed. If XX and YY are Banach spaces and TT is closed with D(T)=XD(T) = X, then TT is bounded, by the closed graph theorem.

Reading path

To understand this page from the ground up, read these 9 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Banach space concept
  2. Closed set concept
  3. Continuous linear map concept
  4. Graph of a function concept
  5. Graph of an operator concept
  6. Linear map concept
  7. Unbounded operator concept
  8. Closed graph theorem statement
  9. Closed operator definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Closed_linear_operator
About this page
TagNY6FVCX61P
URIm2://NY6FVCX61P
Kinddefinition
WritingW0 stub
MSC47A05, 47B25
DefinesClosed operator
UsesUnbounded operator, Graph of an operator, Closed set, Closed graph theorem
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.