Closed operator, closed graph












0














From a course based on Kreyszig's Introduction to Functional analysis.



Let $X neq {0}$ denote a complex normed vector space, and
assume that the operator $T : D(T) ⊂ X → X$ is closed. Let $λ ∈ C$. Show
that the operator $T − λI$ is closed. I have tried applying theorem $4.13-3$, but am unsure of how to choose a sequence and showing convergence.










share|cite|improve this question





























    0














    From a course based on Kreyszig's Introduction to Functional analysis.



    Let $X neq {0}$ denote a complex normed vector space, and
    assume that the operator $T : D(T) ⊂ X → X$ is closed. Let $λ ∈ C$. Show
    that the operator $T − λI$ is closed. I have tried applying theorem $4.13-3$, but am unsure of how to choose a sequence and showing convergence.










    share|cite|improve this question



























      0












      0








      0







      From a course based on Kreyszig's Introduction to Functional analysis.



      Let $X neq {0}$ denote a complex normed vector space, and
      assume that the operator $T : D(T) ⊂ X → X$ is closed. Let $λ ∈ C$. Show
      that the operator $T − λI$ is closed. I have tried applying theorem $4.13-3$, but am unsure of how to choose a sequence and showing convergence.










      share|cite|improve this question















      From a course based on Kreyszig's Introduction to Functional analysis.



      Let $X neq {0}$ denote a complex normed vector space, and
      assume that the operator $T : D(T) ⊂ X → X$ is closed. Let $λ ∈ C$. Show
      that the operator $T − λI$ is closed. I have tried applying theorem $4.13-3$, but am unsure of how to choose a sequence and showing convergence.







      real-analysis functional-analysis operator-theory closed-graph






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 4 '18 at 11:35







      thaumoctopus

















      asked Dec 4 '18 at 10:57









      thaumoctopusthaumoctopus

      1




      1






















          1 Answer
          1






          active

          oldest

          votes


















          1














          Note that for any $lambdainmathbb{C}$, $D(T)=D(T-lambda I)$ and both of $T$ and $I$ are closed. Also, for any two closed operators $T, F$ their linear sum is also closed.



          For proof, you simply consider $T:D(T)to X$ and $F:D(F)to X$ be two closed operators then their corresponding graphs are closed i.e $G_T, G_F$ are closed. We now show $G_{T+F}$ is closed which will imply $T+F:D(T)cap D(F)to X$ defined by $(T+F)x=T(x)+F(x)$is closed.



          For this let $(x,y)in overline{G_{F+T}}$ then $exists$ a sequence ${(x_n,y_n)}_{ninmathbb{N}}$ in $G_{F+T}$ converging to $(x,y)$ with $y_n=(T+F)(x_n),forall ninmathbb{N}implies y_n=T(x_n)+F(x_n),forall ninmathbb{N}$.



          Since $G_T, G_F$ are both closed so $T(x_n)to T(x)$, $F(x_n)to F(x)$ as $x_nto x$ as $nto infty$. Hence, $y_n=T(x_n)+F(x_n)to T(x)+F(x)=(T+F)(x)$ as $nto infty$, also $y_nto y$ is clear by definition so $y=(T+F)x$ gives $overline{G_{T+F}}subset G_{T+F}$. Hence our claim is proved.






          share|cite|improve this answer





















          • Thank you for a very detailed answer
            – thaumoctopus
            Dec 4 '18 at 11:30










          • welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
            – Sujit Bhattacharyya
            Dec 4 '18 at 11:32










          • Yeah it was meant to say $neq$, edited it now :)
            – thaumoctopus
            Dec 4 '18 at 11:35











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025425%2fclosed-operator-closed-graph%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          1














          Note that for any $lambdainmathbb{C}$, $D(T)=D(T-lambda I)$ and both of $T$ and $I$ are closed. Also, for any two closed operators $T, F$ their linear sum is also closed.



          For proof, you simply consider $T:D(T)to X$ and $F:D(F)to X$ be two closed operators then their corresponding graphs are closed i.e $G_T, G_F$ are closed. We now show $G_{T+F}$ is closed which will imply $T+F:D(T)cap D(F)to X$ defined by $(T+F)x=T(x)+F(x)$is closed.



          For this let $(x,y)in overline{G_{F+T}}$ then $exists$ a sequence ${(x_n,y_n)}_{ninmathbb{N}}$ in $G_{F+T}$ converging to $(x,y)$ with $y_n=(T+F)(x_n),forall ninmathbb{N}implies y_n=T(x_n)+F(x_n),forall ninmathbb{N}$.



          Since $G_T, G_F$ are both closed so $T(x_n)to T(x)$, $F(x_n)to F(x)$ as $x_nto x$ as $nto infty$. Hence, $y_n=T(x_n)+F(x_n)to T(x)+F(x)=(T+F)(x)$ as $nto infty$, also $y_nto y$ is clear by definition so $y=(T+F)x$ gives $overline{G_{T+F}}subset G_{T+F}$. Hence our claim is proved.






          share|cite|improve this answer





















          • Thank you for a very detailed answer
            – thaumoctopus
            Dec 4 '18 at 11:30










          • welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
            – Sujit Bhattacharyya
            Dec 4 '18 at 11:32










          • Yeah it was meant to say $neq$, edited it now :)
            – thaumoctopus
            Dec 4 '18 at 11:35
















          1














          Note that for any $lambdainmathbb{C}$, $D(T)=D(T-lambda I)$ and both of $T$ and $I$ are closed. Also, for any two closed operators $T, F$ their linear sum is also closed.



          For proof, you simply consider $T:D(T)to X$ and $F:D(F)to X$ be two closed operators then their corresponding graphs are closed i.e $G_T, G_F$ are closed. We now show $G_{T+F}$ is closed which will imply $T+F:D(T)cap D(F)to X$ defined by $(T+F)x=T(x)+F(x)$is closed.



          For this let $(x,y)in overline{G_{F+T}}$ then $exists$ a sequence ${(x_n,y_n)}_{ninmathbb{N}}$ in $G_{F+T}$ converging to $(x,y)$ with $y_n=(T+F)(x_n),forall ninmathbb{N}implies y_n=T(x_n)+F(x_n),forall ninmathbb{N}$.



          Since $G_T, G_F$ are both closed so $T(x_n)to T(x)$, $F(x_n)to F(x)$ as $x_nto x$ as $nto infty$. Hence, $y_n=T(x_n)+F(x_n)to T(x)+F(x)=(T+F)(x)$ as $nto infty$, also $y_nto y$ is clear by definition so $y=(T+F)x$ gives $overline{G_{T+F}}subset G_{T+F}$. Hence our claim is proved.






          share|cite|improve this answer





















          • Thank you for a very detailed answer
            – thaumoctopus
            Dec 4 '18 at 11:30










          • welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
            – Sujit Bhattacharyya
            Dec 4 '18 at 11:32










          • Yeah it was meant to say $neq$, edited it now :)
            – thaumoctopus
            Dec 4 '18 at 11:35














          1












          1








          1






          Note that for any $lambdainmathbb{C}$, $D(T)=D(T-lambda I)$ and both of $T$ and $I$ are closed. Also, for any two closed operators $T, F$ their linear sum is also closed.



          For proof, you simply consider $T:D(T)to X$ and $F:D(F)to X$ be two closed operators then their corresponding graphs are closed i.e $G_T, G_F$ are closed. We now show $G_{T+F}$ is closed which will imply $T+F:D(T)cap D(F)to X$ defined by $(T+F)x=T(x)+F(x)$is closed.



          For this let $(x,y)in overline{G_{F+T}}$ then $exists$ a sequence ${(x_n,y_n)}_{ninmathbb{N}}$ in $G_{F+T}$ converging to $(x,y)$ with $y_n=(T+F)(x_n),forall ninmathbb{N}implies y_n=T(x_n)+F(x_n),forall ninmathbb{N}$.



          Since $G_T, G_F$ are both closed so $T(x_n)to T(x)$, $F(x_n)to F(x)$ as $x_nto x$ as $nto infty$. Hence, $y_n=T(x_n)+F(x_n)to T(x)+F(x)=(T+F)(x)$ as $nto infty$, also $y_nto y$ is clear by definition so $y=(T+F)x$ gives $overline{G_{T+F}}subset G_{T+F}$. Hence our claim is proved.






          share|cite|improve this answer












          Note that for any $lambdainmathbb{C}$, $D(T)=D(T-lambda I)$ and both of $T$ and $I$ are closed. Also, for any two closed operators $T, F$ their linear sum is also closed.



          For proof, you simply consider $T:D(T)to X$ and $F:D(F)to X$ be two closed operators then their corresponding graphs are closed i.e $G_T, G_F$ are closed. We now show $G_{T+F}$ is closed which will imply $T+F:D(T)cap D(F)to X$ defined by $(T+F)x=T(x)+F(x)$is closed.



          For this let $(x,y)in overline{G_{F+T}}$ then $exists$ a sequence ${(x_n,y_n)}_{ninmathbb{N}}$ in $G_{F+T}$ converging to $(x,y)$ with $y_n=(T+F)(x_n),forall ninmathbb{N}implies y_n=T(x_n)+F(x_n),forall ninmathbb{N}$.



          Since $G_T, G_F$ are both closed so $T(x_n)to T(x)$, $F(x_n)to F(x)$ as $x_nto x$ as $nto infty$. Hence, $y_n=T(x_n)+F(x_n)to T(x)+F(x)=(T+F)(x)$ as $nto infty$, also $y_nto y$ is clear by definition so $y=(T+F)x$ gives $overline{G_{T+F}}subset G_{T+F}$. Hence our claim is proved.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 4 '18 at 11:28









          Sujit BhattacharyyaSujit Bhattacharyya

          945318




          945318












          • Thank you for a very detailed answer
            – thaumoctopus
            Dec 4 '18 at 11:30










          • welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
            – Sujit Bhattacharyya
            Dec 4 '18 at 11:32










          • Yeah it was meant to say $neq$, edited it now :)
            – thaumoctopus
            Dec 4 '18 at 11:35


















          • Thank you for a very detailed answer
            – thaumoctopus
            Dec 4 '18 at 11:30










          • welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
            – Sujit Bhattacharyya
            Dec 4 '18 at 11:32










          • Yeah it was meant to say $neq$, edited it now :)
            – thaumoctopus
            Dec 4 '18 at 11:35
















          Thank you for a very detailed answer
          – thaumoctopus
          Dec 4 '18 at 11:30




          Thank you for a very detailed answer
          – thaumoctopus
          Dec 4 '18 at 11:30












          welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
          – Sujit Bhattacharyya
          Dec 4 '18 at 11:32




          welcome. For your case, we have the domain set zero $D(T)subset X={0}$ so $D(T)={0}$ so the result holds trivially.
          – Sujit Bhattacharyya
          Dec 4 '18 at 11:32












          Yeah it was meant to say $neq$, edited it now :)
          – thaumoctopus
          Dec 4 '18 at 11:35




          Yeah it was meant to say $neq$, edited it now :)
          – thaumoctopus
          Dec 4 '18 at 11:35


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025425%2fclosed-operator-closed-graph%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Wiesbaden

          Marschland

          Dieringhausen