Boundedness of Fredholm integral operator












0












$begingroup$


Let $kin C([0,1]^2)$, Define $T_k:C[0,1]to C[0,1]$ such that for $xin C[0,1]$, defined by $(T_kx)(t)=int_{0}^1k(t,s)x(s)ds$. I want to show that $T_k$ is bounded and calculate its operator norm. Is my following proof correct



By definition, $
|T_k|:=sup{||T_kx||_{infty},big|,||x||_{infty}leq 1}.
$
Let $xin C[0,1]$ with $||x||_inftyleq 1$, so $suplimits_{sin[0,1]}|x(s)|leq 1$. Then $$||T_k x||_{infty}=suplimits_{tin[0,1]}bigg|int_{0}^1 k(t,s)x(s)dsbigg|leqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,|x(s)|,dsleq||x||_inftysuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,dsleqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds.$$
It follows that $$|T_k|leqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
Let $epsilon>0$ and define for all $tin[0,1]$ $x_epsilon:[0,1]tomathbb{K}$ by $$x_epsilon(s)=frac{overline{k(t,s)}}{|k(t,s)|+epsilon}.$$ Then we remark that $x_epsilon$ is continuous and $||x_epsilon||_{infty}leq 1$. We see that
begin{align*}
||T_k x_e||_{infty}&=suplimits_{tin[0,1]}bigg|int_{0}^{1}frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsbigg|=suplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsgeqsuplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2-epsilon^2}{|k(t,s)|+epsilon}
,ds=\&suplimits_{tin[0,1]}int_{0}^1(|k(t,s)|-epsilon),ds=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds-epsilon.
end{align*}

We see that $$|T_k|geqsuplimits_{epsilon>0}||T_kx_epsilon||_inftygeqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
Combining this with our previous estimate of $|T_k|$, we conclude that $|T_k|=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds,$ which concludes our proof.










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Let $kin C([0,1]^2)$, Define $T_k:C[0,1]to C[0,1]$ such that for $xin C[0,1]$, defined by $(T_kx)(t)=int_{0}^1k(t,s)x(s)ds$. I want to show that $T_k$ is bounded and calculate its operator norm. Is my following proof correct



    By definition, $
    |T_k|:=sup{||T_kx||_{infty},big|,||x||_{infty}leq 1}.
    $
    Let $xin C[0,1]$ with $||x||_inftyleq 1$, so $suplimits_{sin[0,1]}|x(s)|leq 1$. Then $$||T_k x||_{infty}=suplimits_{tin[0,1]}bigg|int_{0}^1 k(t,s)x(s)dsbigg|leqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,|x(s)|,dsleq||x||_inftysuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,dsleqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds.$$
    It follows that $$|T_k|leqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
    Let $epsilon>0$ and define for all $tin[0,1]$ $x_epsilon:[0,1]tomathbb{K}$ by $$x_epsilon(s)=frac{overline{k(t,s)}}{|k(t,s)|+epsilon}.$$ Then we remark that $x_epsilon$ is continuous and $||x_epsilon||_{infty}leq 1$. We see that
    begin{align*}
    ||T_k x_e||_{infty}&=suplimits_{tin[0,1]}bigg|int_{0}^{1}frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsbigg|=suplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsgeqsuplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2-epsilon^2}{|k(t,s)|+epsilon}
    ,ds=\&suplimits_{tin[0,1]}int_{0}^1(|k(t,s)|-epsilon),ds=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds-epsilon.
    end{align*}

    We see that $$|T_k|geqsuplimits_{epsilon>0}||T_kx_epsilon||_inftygeqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
    Combining this with our previous estimate of $|T_k|$, we conclude that $|T_k|=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds,$ which concludes our proof.










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      Let $kin C([0,1]^2)$, Define $T_k:C[0,1]to C[0,1]$ such that for $xin C[0,1]$, defined by $(T_kx)(t)=int_{0}^1k(t,s)x(s)ds$. I want to show that $T_k$ is bounded and calculate its operator norm. Is my following proof correct



      By definition, $
      |T_k|:=sup{||T_kx||_{infty},big|,||x||_{infty}leq 1}.
      $
      Let $xin C[0,1]$ with $||x||_inftyleq 1$, so $suplimits_{sin[0,1]}|x(s)|leq 1$. Then $$||T_k x||_{infty}=suplimits_{tin[0,1]}bigg|int_{0}^1 k(t,s)x(s)dsbigg|leqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,|x(s)|,dsleq||x||_inftysuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,dsleqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds.$$
      It follows that $$|T_k|leqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
      Let $epsilon>0$ and define for all $tin[0,1]$ $x_epsilon:[0,1]tomathbb{K}$ by $$x_epsilon(s)=frac{overline{k(t,s)}}{|k(t,s)|+epsilon}.$$ Then we remark that $x_epsilon$ is continuous and $||x_epsilon||_{infty}leq 1$. We see that
      begin{align*}
      ||T_k x_e||_{infty}&=suplimits_{tin[0,1]}bigg|int_{0}^{1}frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsbigg|=suplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsgeqsuplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2-epsilon^2}{|k(t,s)|+epsilon}
      ,ds=\&suplimits_{tin[0,1]}int_{0}^1(|k(t,s)|-epsilon),ds=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds-epsilon.
      end{align*}

      We see that $$|T_k|geqsuplimits_{epsilon>0}||T_kx_epsilon||_inftygeqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
      Combining this with our previous estimate of $|T_k|$, we conclude that $|T_k|=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds,$ which concludes our proof.










      share|cite|improve this question











      $endgroup$




      Let $kin C([0,1]^2)$, Define $T_k:C[0,1]to C[0,1]$ such that for $xin C[0,1]$, defined by $(T_kx)(t)=int_{0}^1k(t,s)x(s)ds$. I want to show that $T_k$ is bounded and calculate its operator norm. Is my following proof correct



      By definition, $
      |T_k|:=sup{||T_kx||_{infty},big|,||x||_{infty}leq 1}.
      $
      Let $xin C[0,1]$ with $||x||_inftyleq 1$, so $suplimits_{sin[0,1]}|x(s)|leq 1$. Then $$||T_k x||_{infty}=suplimits_{tin[0,1]}bigg|int_{0}^1 k(t,s)x(s)dsbigg|leqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,|x(s)|,dsleq||x||_inftysuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,dsleqsuplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds.$$
      It follows that $$|T_k|leqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
      Let $epsilon>0$ and define for all $tin[0,1]$ $x_epsilon:[0,1]tomathbb{K}$ by $$x_epsilon(s)=frac{overline{k(t,s)}}{|k(t,s)|+epsilon}.$$ Then we remark that $x_epsilon$ is continuous and $||x_epsilon||_{infty}leq 1$. We see that
      begin{align*}
      ||T_k x_e||_{infty}&=suplimits_{tin[0,1]}bigg|int_{0}^{1}frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsbigg|=suplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2}{|k(t,s)|+epsilon},dsgeqsuplimits_{tin[0,1]}int_{0}^1frac{|k(t,s)|^2-epsilon^2}{|k(t,s)|+epsilon}
      ,ds=\&suplimits_{tin[0,1]}int_{0}^1(|k(t,s)|-epsilon),ds=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds-epsilon.
      end{align*}

      We see that $$|T_k|geqsuplimits_{epsilon>0}||T_kx_epsilon||_inftygeqsuplimits_{tin[0,1]}int_{0}^1|k(t,s)|,ds.$$
      Combining this with our previous estimate of $|T_k|$, we conclude that $|T_k|=suplimits_{tin[0,1]}int_{0}^{1}|k(t,s)|,ds,$ which concludes our proof.







      integration functional-analysis operator-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 17 '18 at 16:58







      James

















      asked Dec 15 '18 at 13:44









      JamesJames

      863318




      863318






















          1 Answer
          1






          active

          oldest

          votes


















          1





          +50







          $begingroup$

          When you choose
          $$
          x_epsilon(s) = frac{overline{k(t,s)}}{|k(t,s)|+epsilon},
          $$
          the $t$ appearing in the expression should be predetermined and remain fixed in the following calculation. This is what you should fix in your argument. To make this point clear, let us write
          $$
          x_epsilon(s) = frac{overline{k(t_0,s)}}{|k(t_0,s)|+epsilon},
          $$
          for some $t_0in [0,1].$ Then, we have
          $$
          lVert T_k[x_epsilon]rVert_infty geq |T_k[x_epsilon](t_0)| = ∫_0^1 frac{|k(t_0,s)|^2}{|k(t_0,s)|+epsilon}dsgeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Accordingly, we can bound $lVert T_krVert$ from below: since $lVert x_epsilon rVert_infty leq 1$, we have
          $$
          lVert T_krVertgeq lVert T_k[x_epsilon]rVert_inftygeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Since our choice of $t_0$ was $textbf{arbitrary}$, by taking supremum over $t_0in[0,1]$, we get
          $$
          lVert T_krVert geq sup_{t_0in [0,1]}∫_0^1 |k(t_0,s)|ds-epsilon,
          $$
          for all $epsilon>0$. Finally by taking $epsilon to 0$, we have
          $$
          lVert T_krVert= sup_{tin [0,1]}∫_0^1 |k(t,s)|ds,
          $$
          as desired.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
            $endgroup$
            – James
            Dec 18 '18 at 22:29












          • $begingroup$
            Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
            $endgroup$
            – Song
            Dec 18 '18 at 22:42










          • $begingroup$
            Yes, Thank you :)
            $endgroup$
            – James
            Dec 18 '18 at 22:43










          • $begingroup$
            No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
            $endgroup$
            – James
            Dec 18 '18 at 23:09












          • $begingroup$
            Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
            $endgroup$
            – Song
            Dec 19 '18 at 0:10













          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%2f3041507%2fboundedness-of-fredholm-integral-operator%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





          +50







          $begingroup$

          When you choose
          $$
          x_epsilon(s) = frac{overline{k(t,s)}}{|k(t,s)|+epsilon},
          $$
          the $t$ appearing in the expression should be predetermined and remain fixed in the following calculation. This is what you should fix in your argument. To make this point clear, let us write
          $$
          x_epsilon(s) = frac{overline{k(t_0,s)}}{|k(t_0,s)|+epsilon},
          $$
          for some $t_0in [0,1].$ Then, we have
          $$
          lVert T_k[x_epsilon]rVert_infty geq |T_k[x_epsilon](t_0)| = ∫_0^1 frac{|k(t_0,s)|^2}{|k(t_0,s)|+epsilon}dsgeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Accordingly, we can bound $lVert T_krVert$ from below: since $lVert x_epsilon rVert_infty leq 1$, we have
          $$
          lVert T_krVertgeq lVert T_k[x_epsilon]rVert_inftygeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Since our choice of $t_0$ was $textbf{arbitrary}$, by taking supremum over $t_0in[0,1]$, we get
          $$
          lVert T_krVert geq sup_{t_0in [0,1]}∫_0^1 |k(t_0,s)|ds-epsilon,
          $$
          for all $epsilon>0$. Finally by taking $epsilon to 0$, we have
          $$
          lVert T_krVert= sup_{tin [0,1]}∫_0^1 |k(t,s)|ds,
          $$
          as desired.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
            $endgroup$
            – James
            Dec 18 '18 at 22:29












          • $begingroup$
            Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
            $endgroup$
            – Song
            Dec 18 '18 at 22:42










          • $begingroup$
            Yes, Thank you :)
            $endgroup$
            – James
            Dec 18 '18 at 22:43










          • $begingroup$
            No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
            $endgroup$
            – James
            Dec 18 '18 at 23:09












          • $begingroup$
            Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
            $endgroup$
            – Song
            Dec 19 '18 at 0:10


















          1





          +50







          $begingroup$

          When you choose
          $$
          x_epsilon(s) = frac{overline{k(t,s)}}{|k(t,s)|+epsilon},
          $$
          the $t$ appearing in the expression should be predetermined and remain fixed in the following calculation. This is what you should fix in your argument. To make this point clear, let us write
          $$
          x_epsilon(s) = frac{overline{k(t_0,s)}}{|k(t_0,s)|+epsilon},
          $$
          for some $t_0in [0,1].$ Then, we have
          $$
          lVert T_k[x_epsilon]rVert_infty geq |T_k[x_epsilon](t_0)| = ∫_0^1 frac{|k(t_0,s)|^2}{|k(t_0,s)|+epsilon}dsgeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Accordingly, we can bound $lVert T_krVert$ from below: since $lVert x_epsilon rVert_infty leq 1$, we have
          $$
          lVert T_krVertgeq lVert T_k[x_epsilon]rVert_inftygeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Since our choice of $t_0$ was $textbf{arbitrary}$, by taking supremum over $t_0in[0,1]$, we get
          $$
          lVert T_krVert geq sup_{t_0in [0,1]}∫_0^1 |k(t_0,s)|ds-epsilon,
          $$
          for all $epsilon>0$. Finally by taking $epsilon to 0$, we have
          $$
          lVert T_krVert= sup_{tin [0,1]}∫_0^1 |k(t,s)|ds,
          $$
          as desired.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
            $endgroup$
            – James
            Dec 18 '18 at 22:29












          • $begingroup$
            Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
            $endgroup$
            – Song
            Dec 18 '18 at 22:42










          • $begingroup$
            Yes, Thank you :)
            $endgroup$
            – James
            Dec 18 '18 at 22:43










          • $begingroup$
            No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
            $endgroup$
            – James
            Dec 18 '18 at 23:09












          • $begingroup$
            Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
            $endgroup$
            – Song
            Dec 19 '18 at 0:10
















          1





          +50







          1





          +50



          1




          +50



          $begingroup$

          When you choose
          $$
          x_epsilon(s) = frac{overline{k(t,s)}}{|k(t,s)|+epsilon},
          $$
          the $t$ appearing in the expression should be predetermined and remain fixed in the following calculation. This is what you should fix in your argument. To make this point clear, let us write
          $$
          x_epsilon(s) = frac{overline{k(t_0,s)}}{|k(t_0,s)|+epsilon},
          $$
          for some $t_0in [0,1].$ Then, we have
          $$
          lVert T_k[x_epsilon]rVert_infty geq |T_k[x_epsilon](t_0)| = ∫_0^1 frac{|k(t_0,s)|^2}{|k(t_0,s)|+epsilon}dsgeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Accordingly, we can bound $lVert T_krVert$ from below: since $lVert x_epsilon rVert_infty leq 1$, we have
          $$
          lVert T_krVertgeq lVert T_k[x_epsilon]rVert_inftygeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Since our choice of $t_0$ was $textbf{arbitrary}$, by taking supremum over $t_0in[0,1]$, we get
          $$
          lVert T_krVert geq sup_{t_0in [0,1]}∫_0^1 |k(t_0,s)|ds-epsilon,
          $$
          for all $epsilon>0$. Finally by taking $epsilon to 0$, we have
          $$
          lVert T_krVert= sup_{tin [0,1]}∫_0^1 |k(t,s)|ds,
          $$
          as desired.






          share|cite|improve this answer











          $endgroup$



          When you choose
          $$
          x_epsilon(s) = frac{overline{k(t,s)}}{|k(t,s)|+epsilon},
          $$
          the $t$ appearing in the expression should be predetermined and remain fixed in the following calculation. This is what you should fix in your argument. To make this point clear, let us write
          $$
          x_epsilon(s) = frac{overline{k(t_0,s)}}{|k(t_0,s)|+epsilon},
          $$
          for some $t_0in [0,1].$ Then, we have
          $$
          lVert T_k[x_epsilon]rVert_infty geq |T_k[x_epsilon](t_0)| = ∫_0^1 frac{|k(t_0,s)|^2}{|k(t_0,s)|+epsilon}dsgeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Accordingly, we can bound $lVert T_krVert$ from below: since $lVert x_epsilon rVert_infty leq 1$, we have
          $$
          lVert T_krVertgeq lVert T_k[x_epsilon]rVert_inftygeq ∫_0^1 |k(t_0,s)|ds-epsilon.
          $$
          Since our choice of $t_0$ was $textbf{arbitrary}$, by taking supremum over $t_0in[0,1]$, we get
          $$
          lVert T_krVert geq sup_{t_0in [0,1]}∫_0^1 |k(t_0,s)|ds-epsilon,
          $$
          for all $epsilon>0$. Finally by taking $epsilon to 0$, we have
          $$
          lVert T_krVert= sup_{tin [0,1]}∫_0^1 |k(t,s)|ds,
          $$
          as desired.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 19 '18 at 8:24

























          answered Dec 17 '18 at 18:22









          SongSong

          12.2k630




          12.2k630












          • $begingroup$
            A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
            $endgroup$
            – James
            Dec 18 '18 at 22:29












          • $begingroup$
            Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
            $endgroup$
            – Song
            Dec 18 '18 at 22:42










          • $begingroup$
            Yes, Thank you :)
            $endgroup$
            – James
            Dec 18 '18 at 22:43










          • $begingroup$
            No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
            $endgroup$
            – James
            Dec 18 '18 at 23:09












          • $begingroup$
            Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
            $endgroup$
            – Song
            Dec 19 '18 at 0:10




















          • $begingroup$
            A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
            $endgroup$
            – James
            Dec 18 '18 at 22:29












          • $begingroup$
            Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
            $endgroup$
            – Song
            Dec 18 '18 at 22:42










          • $begingroup$
            Yes, Thank you :)
            $endgroup$
            – James
            Dec 18 '18 at 22:43










          • $begingroup$
            No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
            $endgroup$
            – James
            Dec 18 '18 at 23:09












          • $begingroup$
            Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
            $endgroup$
            – Song
            Dec 19 '18 at 0:10


















          $begingroup$
          A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
          $endgroup$
          – James
          Dec 18 '18 at 22:29






          $begingroup$
          A question concerning your answer, you fixed the $t_0$ when you defined $x_epsilon$, but took afterwards the supremum over all $t_0$, but this estimate works for only 1 specific $t_0$ right?
          $endgroup$
          – James
          Dec 18 '18 at 22:29














          $begingroup$
          Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
          $endgroup$
          – Song
          Dec 18 '18 at 22:42




          $begingroup$
          Since our choice of $t_0$ was arbitrary, this bound can be strengthened to $sup_{t_0in [0,1]}∫_0^1 |k(t_o,s)|ds-epsilon$. Does this make it clear?
          $endgroup$
          – Song
          Dec 18 '18 at 22:42












          $begingroup$
          Yes, Thank you :)
          $endgroup$
          – James
          Dec 18 '18 at 22:43




          $begingroup$
          Yes, Thank you :)
          $endgroup$
          – James
          Dec 18 '18 at 22:43












          $begingroup$
          No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
          $endgroup$
          – James
          Dec 18 '18 at 23:09






          $begingroup$
          No wait, could you please elaborate it because I start to get lost in my head. We define a function $x_epsilon$ for SOME $t_0$, then we find an estimate for $||T_kx_e||$. Now if we take the supremo over $t_0$, don't we change or function $x_e$ if we change $t_0$?
          $endgroup$
          – James
          Dec 18 '18 at 23:09














          $begingroup$
          Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
          $endgroup$
          – Song
          Dec 19 '18 at 0:10






          $begingroup$
          Oops, that was my silly mistake! The final estimate should have been about $lVert T_krVert$ rather than $lVert T_k[x_epsilon] rVert_infty$. Sorry about the confusion.
          $endgroup$
          – Song
          Dec 19 '18 at 0:10




















          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%2f3041507%2fboundedness-of-fredholm-integral-operator%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

          Quarter-circle Tiles

          build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

          Mont Emei