# closed operator

Let $B$ be a Banach space. A linear operator $A\colon\mathscr{D}(A)\subset B\to B$ is said to be closed if for every sequence $\{x_{n}\}_{{n\in\mathbb{N}}}$ in $\mathscr{D}(A)$ converging to $x\in B$ such that $Ax_{n}\xrightarrow[n\to\infty]{}y\in B$, it holds $x\in\mathscr{D}(A)$ and $Ax=y$. Equivalently, $A$ is closed if its graph is closed in $B\oplus B$.

Given an operator $A$, not necessarily closed, if the closure of its graph in $B\oplus B$ happens to be the graph of some operator, we call that operator the closure of $A$, and we say that $A$ is closable. We denote the closure of $A$ by $\overline{A}$. It follows easily that $A$ is the restriction of $\overline{A}$ to $\mathscr{D}(A)$.

A core of a closable operator is a subset $\mathscr{C}$ of $\mathscr{D}(A)$ such that the closure of the restriction of $A$ to $\mathscr{C}$ is $\overline{A}$.

The following properties are easily checked:

1. 1.

Any bounded linear operator defined on the whole space $B$ is closed;

2. 2.

If $A$ is closed then $A-\lambda I$ is closed;

3. 3.

If $A$ is closed and it has an inverse, then $A^{{-1}}$ is also closed;

4. 4.

An operator $A$ admits a closure if and only if for every pair of sequences $\{x_{n}\}$ and $\{y_{n}\}$ in $\mathscr{D}(A)$, both converging to $z\in B$, and such that both $\{Ax_{n}\}$ and $\{Ay_{n}\}$ converge, it holds $\lim_{n}Ax_{n}=\lim_{n}Ay_{n}$.

Type of Math Object:
Definition
Major Section:
Reference

## Mathematics Subject Classification

47A05 General (adjoints, conjugates, products, inverses, domains, ranges, etc.)

## Recent Activity

May 17
new image: sinx_approx.png by jeremyboden
new image: approximation_to_sinx by jeremyboden
new image: approximation_to_sinx by jeremyboden
new question: Solving the word problem for isomorphic groups by mairiwalker
new image: LineDiagrams.jpg by m759
new image: ProjPoints.jpg by m759
new image: AbstrExample3.jpg by m759
new image: four-diamond_figure.jpg by m759
May 16
new problem: Curve fitting using the Exchange Algorithm. by jeremyboden
new question: Undirected graphs and their Chromatic Number by Serchinnho

## Info

Owner: Koro
Added: 2003-07-28 - 16:29
Author(s): Koro

## Corrections

unclear by matte ✘

## Versions

(v9) by Koro 2013-03-22
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 37, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9338991641998291, "perplexity_flag": "head"}