OurBigBook
About
$
Donate
Sign in
Sign up
Closed-graph proof for a factored operator
ID: closed-graph-proof-for-a-factored-operator
Top articles
Latest articles
New article in topic
Show body
Body
0
Closed-graph proof for a factored operator
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
If bounded
S
:
X
→
Y
is injective and
im
T
⊆
im
S
, then
R
=
S
−
1
T
has closed
graph
:
x
n
→
x
and
R
x
n
→
z
imply
S
z
=
T
x
=
S
(
R
x
)
and hence
z
=
R
x
.
Total
articles
:
1
New to
topics
?
Read the docs here!