Article · Wikipedia archive · Last revised May 27, 2026

Closed linear operator

In functional analysis, a branch of mathematics, a closed linear operator or often a closed operator is a partially defined linear operator whose graph is closed. It is a basic example of an unbounded operator.

Last revised
May 27, 2026
Read time
≈ 7 min
Length
1,616 w
Citations
3
Source

In functional analysis, a branch of mathematics, a closed linear operator or often a closed operator is a partially defined linear operator whose graph is closed (see closed graph property). It is a basic example of an unbounded operator.

The closed graph theorem says a linear operator f : X Y {\displaystyle f:X\to Y} between Banach spaces is a closed operator if and only if it is a bounded operator and the domain of the operator is X {\displaystyle X} . In practice, many operators are unbounded, but it is still desirable to make them have closed graph. Hence, they cannot be defined on all of X {\displaystyle X} . To stay useful, they are instead defined on a proper but dense subspace, which still allows approximating any vector and keeps key tools (closures, adjoints, spectral theory) available.

Definition

It is common in functional analysis to consider partial functions, which are functions defined on a subset of some space X . {\displaystyle X.} A partial function f {\displaystyle f} is declared with the notation f : D X Y , {\displaystyle f:D\subseteq X\to Y,} which indicates that f {\displaystyle f} has prototype f : D Y {\displaystyle f:D\to Y} (that is, its domain is D {\displaystyle D} and its codomain is Y {\displaystyle Y} )

Every partial function is, in particular, a function and so all terminology for functions can be applied to them. For instance, the graph of a partial function f {\displaystyle f} is the set graph ( f ) = { ( x , f ( x ) ) : x dom f } . {\displaystyle \operatorname {graph} {\!(f)}=\{(x,f(x)):x\in \operatorname {dom} f\}.} However, one exception to this is the definition of "closed graph". A partial function f : D X Y {\displaystyle f:D\subseteq X\to Y} is said to have a closed graph if graph f {\displaystyle \operatorname {graph} f} is a closed subset of X × Y {\displaystyle X\times Y} in the product topology; importantly, note that the product space is X × Y {\displaystyle X\times Y} and not D × Y = dom f × Y {\displaystyle D\times Y=\operatorname {dom} f\times Y} as it was defined above for ordinary functions. In contrast, when f : D Y {\displaystyle f:D\to Y} is considered as an ordinary function (rather than as the partial function f : D X Y {\displaystyle f:D\subseteq X\to Y} ), then "having a closed graph" would instead mean that graph f {\displaystyle \operatorname {graph} f} is a closed subset of D × Y . {\displaystyle D\times Y.} If graph f {\displaystyle \operatorname {graph} f} is a closed subset of X × Y {\displaystyle X\times Y} then it is also a closed subset of dom ( f ) × Y {\displaystyle \operatorname {dom} (f)\times Y} although the converse is not guaranteed in general.

Definition: If X and Y are topological vector spaces (TVSs) then we call a linear map f : D(f) ⊆ XY a closed linear operator if its graph is closed in X × Y.

The antonym of "closed" is "unclosed", that is, an unclosed linear operator is a linear operator whose graph is strictly smaller than its closure.

Closable maps and closures

A linear operator f : D X Y {\displaystyle f:D\subseteq X\to Y} is closable in X × Y {\displaystyle X\times Y} if there exists a vector subspace E X {\displaystyle E\subseteq X} containing D {\displaystyle D} and a function (resp. multifunction) F : E Y {\displaystyle F:E\to Y} whose graph is equal to the closure of the set graph f {\displaystyle \operatorname {graph} f} in X × Y . {\displaystyle X\times Y.} Such an F {\displaystyle F} is called a closure of f {\displaystyle f} in X × Y {\displaystyle X\times Y} , is denoted by f ¯ , {\displaystyle {\overline {f}},} and necessarily extends f . {\displaystyle f.}

If f : D X Y {\displaystyle f:D\subseteq X\to Y} is a closable linear operator then a core or an essential domain of f {\displaystyle f} is a subset C D {\displaystyle C\subseteq D} such that the closure in X × Y {\displaystyle X\times Y} of the graph of the restriction f | C : C Y {\displaystyle f{\big \vert }_{C}:C\to Y} of f {\displaystyle f} to C {\displaystyle C} is equal to the closure of the graph of f {\displaystyle f} in X × Y {\displaystyle X\times Y} (i.e. the closure of graph f {\displaystyle \operatorname {graph} f} in X × Y {\displaystyle X\times Y} is equal to the closure of graph f | C {\displaystyle \operatorname {graph} f{\big \vert }_{C}} in X × Y {\displaystyle X\times Y} ).

Examples

A closed operator between Banach spaces, is bounded, by the closed graph theorem. More interesting examples of closed operators are unbounded.

If ( X , τ ) {\displaystyle (X,\tau )} is a Hausdorff TVS and ν {\displaystyle \nu } is a vector topology on X {\displaystyle X} that is strictly finer than τ , {\displaystyle \tau ,} then the identity map Id : ( X , τ ) ( X , ν ) {\displaystyle \operatorname {Id} :(X,\tau )\to (X,\nu )} a closed discontinuous linear operator.1

Consider the derivative operator f = d d x {\displaystyle f={\frac {d}{dx}}} where X = Y = C ( [ a , b ] ) {\displaystyle X=Y=C([a,b])} is the Banach space (with supremum norm) of all continuous functions on an interval [ a , b ] . {\displaystyle [a,b].} If one takes its domain D ( f ) {\displaystyle D(f)} to be C 1 ( [ a , b ] ) , {\displaystyle C^{1}([a,b]),} then f {\displaystyle f} is a closed operator, which is not bounded.2 On the other hand, if D ( f ) {\displaystyle D(f)} is the space C ( [ a , b ] ) {\displaystyle C^{\infty }([a,b])} of smooth scalar valued functions then f {\displaystyle f} will no longer be closed, but it will be closable, with the closure being its extension defined on C 1 ( [ a , b ] ) . {\displaystyle C^{1}([a,b]).} To show that f {\displaystyle f} is not closed when restricted to C ( [ a , b ] ) C ( [ a , b ] ) {\displaystyle C^{\infty }([a,b])\to C^{\infty }([a,b])} , take a function u {\displaystyle u} that is C 1 {\displaystyle C^{1}} but not smooth, such as u ( x ) = x 3 / 2 {\displaystyle u(x)=x^{3/2}} . Then mollify it to a sequence of smooth functions ( u n ) n N {\displaystyle (u_{n})_{n\in \mathbb {N} }} such that u n u 0 {\displaystyle \|u_{n}-u\|_{\infty }\to 0} , then f ( u n ) u 0 {\displaystyle \|f(u_{n})-u'\|_{\infty }\to 0} , but ( u , u ) {\displaystyle (u,u')} is not in the graph of f | C ( [ a , b ] ) {\displaystyle f|_{C^{\infty }([a,b])}} .

Basic properties

The following properties are easily checked for a linear operator f : D ( f ) X Y {\displaystyle f:\operatorname {D} (f)\subseteq X\to Y} between Banach spaces:

  • If f {\displaystyle f} is defined on the entire domain X {\displaystyle X} , then f {\displaystyle f} is closed iff it is bounded.
  • If A {\displaystyle A} is closed then A λ I d D ( f ) {\displaystyle A-\lambda \mathrm {Id} _{\operatorname {D} (f)}} is closed where λ {\displaystyle \lambda } is a scalar and I d D ( f ) {\displaystyle \mathrm {Id} _{\operatorname {D} (f)}} is the identity function;
  • If f {\displaystyle f} is closed, then its kernel (or nullspace) is a closed vector subspace of X {\displaystyle X} ;
  • If f {\displaystyle f} is closed and injective then its inverse f 1 {\displaystyle f^{-1}} is also closed;
  • A linear operator f {\displaystyle f} admits a closure if and only if for every x X {\displaystyle x\in X} and every pair of sequences x = ( x i ) i = 1 {\displaystyle x_{\bullet }=(x_{i})_{i=1}^{\infty }} and y = ( y i ) i = 1 {\displaystyle y_{\bullet }=(y_{i})_{i=1}^{\infty }} in D ( f ) {\displaystyle \operatorname {D} (f)} both converging to x {\displaystyle x} in X {\displaystyle X} , such that both f ( x ) = ( f ( x i ) ) i = 1 {\displaystyle f(x_{\bullet })=(f(x_{i}))_{i=1}^{\infty }} and f ( y ) = ( f ( y i ) ) i = 1 {\displaystyle f(y_{\bullet })=(f(y_{i}))_{i=1}^{\infty }} converge in Y {\displaystyle Y} , one has lim i f ( x i ) = lim i f ( y i ) {\displaystyle \lim _{i\to \infty }f(x_{i})=\lim _{i\to \infty }f(y_{i})} .
References

References

  1. Narici & Beckenstein 2011, p. 480.
  2. Kreyszig, Erwin (1978). Introductory Functional Analysis With Applications. USA: John Wiley & Sons. Inc. p. 294. ISBN 0-471-50731-8.