Show that lower semi-continuous function attains it's minimum. (Proof verification) (By contradiction)












1












$begingroup$


Let $f: [0,1]to mathbb{R}$ be a lower semi-continuous function, then



$$ liminf_{xto a} f(x) geq f(a), forall a in [0,1]$$



I have to prove that $f$ attains its minimum on $[0,1]$, that is:



$exists x_0 in [0,1]$ such that $f(x_0) le f(x)$, $forall x in [0,1]$.



My proof:



Assume that $f$ is lower semi-continuous, but $f$ doesn't attain it's minimum on $[0,1]$,



Since $f$ is lower semicontinuous at $x_0$,



$$forall epsilon > 0, exists delta > 0 mbox{ such that } |x - x_0| < delta, Rightarrow f(x) > f(x_0) - epsilon, forall x in (x_0 - delta,x_0 + delta)$$



Now since $f$ doesn't attain it's minimum on $[0,1]$, then



$$forall x_0 in [0,1], exists x in [0,1] mbox{ s.t } f(x_0) > f(x)$$



Let $epsilon = f(x_0) - f(x) > 0, exists delta > 0$, such that $|x-x_0| < delta$ and $f(x) > f(x_0) - epsilon Rightarrow f(x_0) - f(x) > epsilon = f(x_0) - f(x)$ which is a contradiction.



I am right? Thanks.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    It's wrong. You should have said "$forallepsilon>0forall x_0in [0,1] $... such that $|x-x_0|<delta implies f(x)>f(x_0)color{red}- epsilon$".
    $endgroup$
    – Song
    Jan 21 at 17:04








  • 1




    $begingroup$
    It is $-epsilon$ in the definition, and the $forall x$ has to be after the “such that”.
    $endgroup$
    – Mindlack
    Jan 21 at 17:04










  • $begingroup$
    Yes, I fixed the problem about the epsilon, it was a typo using the upper semi-continuity. I will see the quantifier problem now.
    $endgroup$
    – Richard Clare
    Jan 21 at 17:06






  • 1




    $begingroup$
    No. The $delta$ is allowed to depend on $epsilon$ and $x_0$, not $x$.
    $endgroup$
    – Mindlack
    Jan 21 at 17:16






  • 1




    $begingroup$
    An idea to fix this proof: if $f$ does not attain a minimum, there is a sequence $x_n$ in $[0, 1]$ such that $f(x_n) > f(x_{n+1})$ for every $n$. Now, this sequence must have a convergent subsequence since $[0, 1]$ is compact. Try to reach your contradiction from here.
    $endgroup$
    – Daniel
    Jan 21 at 17:34
















1












$begingroup$


Let $f: [0,1]to mathbb{R}$ be a lower semi-continuous function, then



$$ liminf_{xto a} f(x) geq f(a), forall a in [0,1]$$



I have to prove that $f$ attains its minimum on $[0,1]$, that is:



$exists x_0 in [0,1]$ such that $f(x_0) le f(x)$, $forall x in [0,1]$.



My proof:



Assume that $f$ is lower semi-continuous, but $f$ doesn't attain it's minimum on $[0,1]$,



Since $f$ is lower semicontinuous at $x_0$,



$$forall epsilon > 0, exists delta > 0 mbox{ such that } |x - x_0| < delta, Rightarrow f(x) > f(x_0) - epsilon, forall x in (x_0 - delta,x_0 + delta)$$



Now since $f$ doesn't attain it's minimum on $[0,1]$, then



$$forall x_0 in [0,1], exists x in [0,1] mbox{ s.t } f(x_0) > f(x)$$



Let $epsilon = f(x_0) - f(x) > 0, exists delta > 0$, such that $|x-x_0| < delta$ and $f(x) > f(x_0) - epsilon Rightarrow f(x_0) - f(x) > epsilon = f(x_0) - f(x)$ which is a contradiction.



I am right? Thanks.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    It's wrong. You should have said "$forallepsilon>0forall x_0in [0,1] $... such that $|x-x_0|<delta implies f(x)>f(x_0)color{red}- epsilon$".
    $endgroup$
    – Song
    Jan 21 at 17:04








  • 1




    $begingroup$
    It is $-epsilon$ in the definition, and the $forall x$ has to be after the “such that”.
    $endgroup$
    – Mindlack
    Jan 21 at 17:04










  • $begingroup$
    Yes, I fixed the problem about the epsilon, it was a typo using the upper semi-continuity. I will see the quantifier problem now.
    $endgroup$
    – Richard Clare
    Jan 21 at 17:06






  • 1




    $begingroup$
    No. The $delta$ is allowed to depend on $epsilon$ and $x_0$, not $x$.
    $endgroup$
    – Mindlack
    Jan 21 at 17:16






  • 1




    $begingroup$
    An idea to fix this proof: if $f$ does not attain a minimum, there is a sequence $x_n$ in $[0, 1]$ such that $f(x_n) > f(x_{n+1})$ for every $n$. Now, this sequence must have a convergent subsequence since $[0, 1]$ is compact. Try to reach your contradiction from here.
    $endgroup$
    – Daniel
    Jan 21 at 17:34














1












1








1





$begingroup$


Let $f: [0,1]to mathbb{R}$ be a lower semi-continuous function, then



$$ liminf_{xto a} f(x) geq f(a), forall a in [0,1]$$



I have to prove that $f$ attains its minimum on $[0,1]$, that is:



$exists x_0 in [0,1]$ such that $f(x_0) le f(x)$, $forall x in [0,1]$.



My proof:



Assume that $f$ is lower semi-continuous, but $f$ doesn't attain it's minimum on $[0,1]$,



Since $f$ is lower semicontinuous at $x_0$,



$$forall epsilon > 0, exists delta > 0 mbox{ such that } |x - x_0| < delta, Rightarrow f(x) > f(x_0) - epsilon, forall x in (x_0 - delta,x_0 + delta)$$



Now since $f$ doesn't attain it's minimum on $[0,1]$, then



$$forall x_0 in [0,1], exists x in [0,1] mbox{ s.t } f(x_0) > f(x)$$



Let $epsilon = f(x_0) - f(x) > 0, exists delta > 0$, such that $|x-x_0| < delta$ and $f(x) > f(x_0) - epsilon Rightarrow f(x_0) - f(x) > epsilon = f(x_0) - f(x)$ which is a contradiction.



I am right? Thanks.










share|cite|improve this question











$endgroup$




Let $f: [0,1]to mathbb{R}$ be a lower semi-continuous function, then



$$ liminf_{xto a} f(x) geq f(a), forall a in [0,1]$$



I have to prove that $f$ attains its minimum on $[0,1]$, that is:



$exists x_0 in [0,1]$ such that $f(x_0) le f(x)$, $forall x in [0,1]$.



My proof:



Assume that $f$ is lower semi-continuous, but $f$ doesn't attain it's minimum on $[0,1]$,



Since $f$ is lower semicontinuous at $x_0$,



$$forall epsilon > 0, exists delta > 0 mbox{ such that } |x - x_0| < delta, Rightarrow f(x) > f(x_0) - epsilon, forall x in (x_0 - delta,x_0 + delta)$$



Now since $f$ doesn't attain it's minimum on $[0,1]$, then



$$forall x_0 in [0,1], exists x in [0,1] mbox{ s.t } f(x_0) > f(x)$$



Let $epsilon = f(x_0) - f(x) > 0, exists delta > 0$, such that $|x-x_0| < delta$ and $f(x) > f(x_0) - epsilon Rightarrow f(x_0) - f(x) > epsilon = f(x_0) - f(x)$ which is a contradiction.



I am right? Thanks.







real-analysis proof-verification upper-lower-bounds semicontinuous-functions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 21 at 17:11







Richard Clare

















asked Jan 21 at 16:58









Richard ClareRichard Clare

1,076314




1,076314








  • 1




    $begingroup$
    It's wrong. You should have said "$forallepsilon>0forall x_0in [0,1] $... such that $|x-x_0|<delta implies f(x)>f(x_0)color{red}- epsilon$".
    $endgroup$
    – Song
    Jan 21 at 17:04








  • 1




    $begingroup$
    It is $-epsilon$ in the definition, and the $forall x$ has to be after the “such that”.
    $endgroup$
    – Mindlack
    Jan 21 at 17:04










  • $begingroup$
    Yes, I fixed the problem about the epsilon, it was a typo using the upper semi-continuity. I will see the quantifier problem now.
    $endgroup$
    – Richard Clare
    Jan 21 at 17:06






  • 1




    $begingroup$
    No. The $delta$ is allowed to depend on $epsilon$ and $x_0$, not $x$.
    $endgroup$
    – Mindlack
    Jan 21 at 17:16






  • 1




    $begingroup$
    An idea to fix this proof: if $f$ does not attain a minimum, there is a sequence $x_n$ in $[0, 1]$ such that $f(x_n) > f(x_{n+1})$ for every $n$. Now, this sequence must have a convergent subsequence since $[0, 1]$ is compact. Try to reach your contradiction from here.
    $endgroup$
    – Daniel
    Jan 21 at 17:34














  • 1




    $begingroup$
    It's wrong. You should have said "$forallepsilon>0forall x_0in [0,1] $... such that $|x-x_0|<delta implies f(x)>f(x_0)color{red}- epsilon$".
    $endgroup$
    – Song
    Jan 21 at 17:04








  • 1




    $begingroup$
    It is $-epsilon$ in the definition, and the $forall x$ has to be after the “such that”.
    $endgroup$
    – Mindlack
    Jan 21 at 17:04










  • $begingroup$
    Yes, I fixed the problem about the epsilon, it was a typo using the upper semi-continuity. I will see the quantifier problem now.
    $endgroup$
    – Richard Clare
    Jan 21 at 17:06






  • 1




    $begingroup$
    No. The $delta$ is allowed to depend on $epsilon$ and $x_0$, not $x$.
    $endgroup$
    – Mindlack
    Jan 21 at 17:16






  • 1




    $begingroup$
    An idea to fix this proof: if $f$ does not attain a minimum, there is a sequence $x_n$ in $[0, 1]$ such that $f(x_n) > f(x_{n+1})$ for every $n$. Now, this sequence must have a convergent subsequence since $[0, 1]$ is compact. Try to reach your contradiction from here.
    $endgroup$
    – Daniel
    Jan 21 at 17:34








1




1




$begingroup$
It's wrong. You should have said "$forallepsilon>0forall x_0in [0,1] $... such that $|x-x_0|<delta implies f(x)>f(x_0)color{red}- epsilon$".
$endgroup$
– Song
Jan 21 at 17:04






$begingroup$
It's wrong. You should have said "$forallepsilon>0forall x_0in [0,1] $... such that $|x-x_0|<delta implies f(x)>f(x_0)color{red}- epsilon$".
$endgroup$
– Song
Jan 21 at 17:04






1




1




$begingroup$
It is $-epsilon$ in the definition, and the $forall x$ has to be after the “such that”.
$endgroup$
– Mindlack
Jan 21 at 17:04




$begingroup$
It is $-epsilon$ in the definition, and the $forall x$ has to be after the “such that”.
$endgroup$
– Mindlack
Jan 21 at 17:04












$begingroup$
Yes, I fixed the problem about the epsilon, it was a typo using the upper semi-continuity. I will see the quantifier problem now.
$endgroup$
– Richard Clare
Jan 21 at 17:06




$begingroup$
Yes, I fixed the problem about the epsilon, it was a typo using the upper semi-continuity. I will see the quantifier problem now.
$endgroup$
– Richard Clare
Jan 21 at 17:06




1




1




$begingroup$
No. The $delta$ is allowed to depend on $epsilon$ and $x_0$, not $x$.
$endgroup$
– Mindlack
Jan 21 at 17:16




$begingroup$
No. The $delta$ is allowed to depend on $epsilon$ and $x_0$, not $x$.
$endgroup$
– Mindlack
Jan 21 at 17:16




1




1




$begingroup$
An idea to fix this proof: if $f$ does not attain a minimum, there is a sequence $x_n$ in $[0, 1]$ such that $f(x_n) > f(x_{n+1})$ for every $n$. Now, this sequence must have a convergent subsequence since $[0, 1]$ is compact. Try to reach your contradiction from here.
$endgroup$
– Daniel
Jan 21 at 17:34




$begingroup$
An idea to fix this proof: if $f$ does not attain a minimum, there is a sequence $x_n$ in $[0, 1]$ such that $f(x_n) > f(x_{n+1})$ for every $n$. Now, this sequence must have a convergent subsequence since $[0, 1]$ is compact. Try to reach your contradiction from here.
$endgroup$
– Daniel
Jan 21 at 17:34










2 Answers
2






active

oldest

votes


















1












$begingroup$

Since $f$ is lower-semicontinuous, for each $xin [0,1],$ there is an open interval $I_xsubseteq [0,1]$ such that $inf{f(y):yin I_x}ge f(x)-1.$ The $I_x$ form an open cover of $[0,1]$ so passing to a finite subcover, we conclude that $f$ is bounded below.



So, letting $y=inf{f(x):xin [0,1]}$, we can find a sequence $(x_n)subseteq [0,1]$ such that $f(x_n)to y.$ And of course, there is a subsequence $(x_{n_k})subseteq (x_n)$ such that $x_{n_k}to x_0in [0,1]$.



Then, $f(x_0)le liminf_{xto x_0} f(x)le liminf_{kto infty}f(x_{n_k})=lim_{kto infty}f(x_{n_k})=y,$ which implies that $f(x_0)=y.$






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    Another characterization of lower semi-continuous function that might be helpful:




    A function $f:[0,1] to Bbb R$ is lower semi-continuous if and only if its upper level set ${xin [0,1]:f(x)>c}$ is open in $[0,1]$ for all $cinBbb R$.




    (Indeed above characterization can be applied to every topological space $X$ and $f:XtoBbb R$. And the proof below can be generalized to any compact topological space.)



    Proof. Assume $x_0in X$ is such that $f(x_0)>c$. If we choose $0<epsilon< f(x_0)-c$, we can find $delta>0$ such that $$xin [0,1], xin (x_0-delta,x_0+delta)implies f(x)>f(x_0)-epsilon.$$ Since $f(x_0)-epsilon>c$, it follows
    $$
    [0,1]cap (x_0-delta,x_0+delta)subset {x : f(x)>c}.
    $$
    This proves ${x:f(x)>c}$ is open in $[0,1]$. $blacksquare$



    By the above proposition, $F_c={x:f(x)le c}$ is closed in $[0,1]$ for every $cinBbb R$, hence is compact. If there is no minimum, then $F_c$ is not empty for every $c$. Consider the decreasing sequence of closed sets$$F_{-1}supset F_{-2}supset cdotssupset F_{-n}supsetcdots.$$ Since
    $$
    bigcap_{ninBbb N}F_{-n} = varnothing,
    $$
    by the finite intersection property of the compact set $[0,1]$, there exists $n_0inBbb N$ such that $F_{-n_0}=varnothing$. This implies $f(x)ge -n_0$ for all $xin [0,1]$, hence $f$ is lower bounded.



    Let us define $S={cinBbb R: F_cne varnothing}$. Since $-n_0notin S$ and $-n_0le S$, we know $S$ is lower bounded. Let $m=inf S$. Then by finite intersection property,
    $$
    F_m=bigcap_{kinBbb N}F_{m+1/k}ne varnothing.
    $$
    Thus there exists $x_0$ such that $f(x_0)=m$. Finally, for all $c<m$, it holds $cnotin S$, i.e. $F_c=varnothing.$ This establishes $m$ is the minimum of $f$.






    share|cite|improve this answer









    $endgroup$













      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%2f3082099%2fshow-that-lower-semi-continuous-function-attains-its-minimum-proof-verificati%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      1












      $begingroup$

      Since $f$ is lower-semicontinuous, for each $xin [0,1],$ there is an open interval $I_xsubseteq [0,1]$ such that $inf{f(y):yin I_x}ge f(x)-1.$ The $I_x$ form an open cover of $[0,1]$ so passing to a finite subcover, we conclude that $f$ is bounded below.



      So, letting $y=inf{f(x):xin [0,1]}$, we can find a sequence $(x_n)subseteq [0,1]$ such that $f(x_n)to y.$ And of course, there is a subsequence $(x_{n_k})subseteq (x_n)$ such that $x_{n_k}to x_0in [0,1]$.



      Then, $f(x_0)le liminf_{xto x_0} f(x)le liminf_{kto infty}f(x_{n_k})=lim_{kto infty}f(x_{n_k})=y,$ which implies that $f(x_0)=y.$






      share|cite|improve this answer









      $endgroup$


















        1












        $begingroup$

        Since $f$ is lower-semicontinuous, for each $xin [0,1],$ there is an open interval $I_xsubseteq [0,1]$ such that $inf{f(y):yin I_x}ge f(x)-1.$ The $I_x$ form an open cover of $[0,1]$ so passing to a finite subcover, we conclude that $f$ is bounded below.



        So, letting $y=inf{f(x):xin [0,1]}$, we can find a sequence $(x_n)subseteq [0,1]$ such that $f(x_n)to y.$ And of course, there is a subsequence $(x_{n_k})subseteq (x_n)$ such that $x_{n_k}to x_0in [0,1]$.



        Then, $f(x_0)le liminf_{xto x_0} f(x)le liminf_{kto infty}f(x_{n_k})=lim_{kto infty}f(x_{n_k})=y,$ which implies that $f(x_0)=y.$






        share|cite|improve this answer









        $endgroup$
















          1












          1








          1





          $begingroup$

          Since $f$ is lower-semicontinuous, for each $xin [0,1],$ there is an open interval $I_xsubseteq [0,1]$ such that $inf{f(y):yin I_x}ge f(x)-1.$ The $I_x$ form an open cover of $[0,1]$ so passing to a finite subcover, we conclude that $f$ is bounded below.



          So, letting $y=inf{f(x):xin [0,1]}$, we can find a sequence $(x_n)subseteq [0,1]$ such that $f(x_n)to y.$ And of course, there is a subsequence $(x_{n_k})subseteq (x_n)$ such that $x_{n_k}to x_0in [0,1]$.



          Then, $f(x_0)le liminf_{xto x_0} f(x)le liminf_{kto infty}f(x_{n_k})=lim_{kto infty}f(x_{n_k})=y,$ which implies that $f(x_0)=y.$






          share|cite|improve this answer









          $endgroup$



          Since $f$ is lower-semicontinuous, for each $xin [0,1],$ there is an open interval $I_xsubseteq [0,1]$ such that $inf{f(y):yin I_x}ge f(x)-1.$ The $I_x$ form an open cover of $[0,1]$ so passing to a finite subcover, we conclude that $f$ is bounded below.



          So, letting $y=inf{f(x):xin [0,1]}$, we can find a sequence $(x_n)subseteq [0,1]$ such that $f(x_n)to y.$ And of course, there is a subsequence $(x_{n_k})subseteq (x_n)$ such that $x_{n_k}to x_0in [0,1]$.



          Then, $f(x_0)le liminf_{xto x_0} f(x)le liminf_{kto infty}f(x_{n_k})=lim_{kto infty}f(x_{n_k})=y,$ which implies that $f(x_0)=y.$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 21 at 22:47









          MatematletaMatematleta

          11.5k2920




          11.5k2920























              1












              $begingroup$

              Another characterization of lower semi-continuous function that might be helpful:




              A function $f:[0,1] to Bbb R$ is lower semi-continuous if and only if its upper level set ${xin [0,1]:f(x)>c}$ is open in $[0,1]$ for all $cinBbb R$.




              (Indeed above characterization can be applied to every topological space $X$ and $f:XtoBbb R$. And the proof below can be generalized to any compact topological space.)



              Proof. Assume $x_0in X$ is such that $f(x_0)>c$. If we choose $0<epsilon< f(x_0)-c$, we can find $delta>0$ such that $$xin [0,1], xin (x_0-delta,x_0+delta)implies f(x)>f(x_0)-epsilon.$$ Since $f(x_0)-epsilon>c$, it follows
              $$
              [0,1]cap (x_0-delta,x_0+delta)subset {x : f(x)>c}.
              $$
              This proves ${x:f(x)>c}$ is open in $[0,1]$. $blacksquare$



              By the above proposition, $F_c={x:f(x)le c}$ is closed in $[0,1]$ for every $cinBbb R$, hence is compact. If there is no minimum, then $F_c$ is not empty for every $c$. Consider the decreasing sequence of closed sets$$F_{-1}supset F_{-2}supset cdotssupset F_{-n}supsetcdots.$$ Since
              $$
              bigcap_{ninBbb N}F_{-n} = varnothing,
              $$
              by the finite intersection property of the compact set $[0,1]$, there exists $n_0inBbb N$ such that $F_{-n_0}=varnothing$. This implies $f(x)ge -n_0$ for all $xin [0,1]$, hence $f$ is lower bounded.



              Let us define $S={cinBbb R: F_cne varnothing}$. Since $-n_0notin S$ and $-n_0le S$, we know $S$ is lower bounded. Let $m=inf S$. Then by finite intersection property,
              $$
              F_m=bigcap_{kinBbb N}F_{m+1/k}ne varnothing.
              $$
              Thus there exists $x_0$ such that $f(x_0)=m$. Finally, for all $c<m$, it holds $cnotin S$, i.e. $F_c=varnothing.$ This establishes $m$ is the minimum of $f$.






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                Another characterization of lower semi-continuous function that might be helpful:




                A function $f:[0,1] to Bbb R$ is lower semi-continuous if and only if its upper level set ${xin [0,1]:f(x)>c}$ is open in $[0,1]$ for all $cinBbb R$.




                (Indeed above characterization can be applied to every topological space $X$ and $f:XtoBbb R$. And the proof below can be generalized to any compact topological space.)



                Proof. Assume $x_0in X$ is such that $f(x_0)>c$. If we choose $0<epsilon< f(x_0)-c$, we can find $delta>0$ such that $$xin [0,1], xin (x_0-delta,x_0+delta)implies f(x)>f(x_0)-epsilon.$$ Since $f(x_0)-epsilon>c$, it follows
                $$
                [0,1]cap (x_0-delta,x_0+delta)subset {x : f(x)>c}.
                $$
                This proves ${x:f(x)>c}$ is open in $[0,1]$. $blacksquare$



                By the above proposition, $F_c={x:f(x)le c}$ is closed in $[0,1]$ for every $cinBbb R$, hence is compact. If there is no minimum, then $F_c$ is not empty for every $c$. Consider the decreasing sequence of closed sets$$F_{-1}supset F_{-2}supset cdotssupset F_{-n}supsetcdots.$$ Since
                $$
                bigcap_{ninBbb N}F_{-n} = varnothing,
                $$
                by the finite intersection property of the compact set $[0,1]$, there exists $n_0inBbb N$ such that $F_{-n_0}=varnothing$. This implies $f(x)ge -n_0$ for all $xin [0,1]$, hence $f$ is lower bounded.



                Let us define $S={cinBbb R: F_cne varnothing}$. Since $-n_0notin S$ and $-n_0le S$, we know $S$ is lower bounded. Let $m=inf S$. Then by finite intersection property,
                $$
                F_m=bigcap_{kinBbb N}F_{m+1/k}ne varnothing.
                $$
                Thus there exists $x_0$ such that $f(x_0)=m$. Finally, for all $c<m$, it holds $cnotin S$, i.e. $F_c=varnothing.$ This establishes $m$ is the minimum of $f$.






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  Another characterization of lower semi-continuous function that might be helpful:




                  A function $f:[0,1] to Bbb R$ is lower semi-continuous if and only if its upper level set ${xin [0,1]:f(x)>c}$ is open in $[0,1]$ for all $cinBbb R$.




                  (Indeed above characterization can be applied to every topological space $X$ and $f:XtoBbb R$. And the proof below can be generalized to any compact topological space.)



                  Proof. Assume $x_0in X$ is such that $f(x_0)>c$. If we choose $0<epsilon< f(x_0)-c$, we can find $delta>0$ such that $$xin [0,1], xin (x_0-delta,x_0+delta)implies f(x)>f(x_0)-epsilon.$$ Since $f(x_0)-epsilon>c$, it follows
                  $$
                  [0,1]cap (x_0-delta,x_0+delta)subset {x : f(x)>c}.
                  $$
                  This proves ${x:f(x)>c}$ is open in $[0,1]$. $blacksquare$



                  By the above proposition, $F_c={x:f(x)le c}$ is closed in $[0,1]$ for every $cinBbb R$, hence is compact. If there is no minimum, then $F_c$ is not empty for every $c$. Consider the decreasing sequence of closed sets$$F_{-1}supset F_{-2}supset cdotssupset F_{-n}supsetcdots.$$ Since
                  $$
                  bigcap_{ninBbb N}F_{-n} = varnothing,
                  $$
                  by the finite intersection property of the compact set $[0,1]$, there exists $n_0inBbb N$ such that $F_{-n_0}=varnothing$. This implies $f(x)ge -n_0$ for all $xin [0,1]$, hence $f$ is lower bounded.



                  Let us define $S={cinBbb R: F_cne varnothing}$. Since $-n_0notin S$ and $-n_0le S$, we know $S$ is lower bounded. Let $m=inf S$. Then by finite intersection property,
                  $$
                  F_m=bigcap_{kinBbb N}F_{m+1/k}ne varnothing.
                  $$
                  Thus there exists $x_0$ such that $f(x_0)=m$. Finally, for all $c<m$, it holds $cnotin S$, i.e. $F_c=varnothing.$ This establishes $m$ is the minimum of $f$.






                  share|cite|improve this answer









                  $endgroup$



                  Another characterization of lower semi-continuous function that might be helpful:




                  A function $f:[0,1] to Bbb R$ is lower semi-continuous if and only if its upper level set ${xin [0,1]:f(x)>c}$ is open in $[0,1]$ for all $cinBbb R$.




                  (Indeed above characterization can be applied to every topological space $X$ and $f:XtoBbb R$. And the proof below can be generalized to any compact topological space.)



                  Proof. Assume $x_0in X$ is such that $f(x_0)>c$. If we choose $0<epsilon< f(x_0)-c$, we can find $delta>0$ such that $$xin [0,1], xin (x_0-delta,x_0+delta)implies f(x)>f(x_0)-epsilon.$$ Since $f(x_0)-epsilon>c$, it follows
                  $$
                  [0,1]cap (x_0-delta,x_0+delta)subset {x : f(x)>c}.
                  $$
                  This proves ${x:f(x)>c}$ is open in $[0,1]$. $blacksquare$



                  By the above proposition, $F_c={x:f(x)le c}$ is closed in $[0,1]$ for every $cinBbb R$, hence is compact. If there is no minimum, then $F_c$ is not empty for every $c$. Consider the decreasing sequence of closed sets$$F_{-1}supset F_{-2}supset cdotssupset F_{-n}supsetcdots.$$ Since
                  $$
                  bigcap_{ninBbb N}F_{-n} = varnothing,
                  $$
                  by the finite intersection property of the compact set $[0,1]$, there exists $n_0inBbb N$ such that $F_{-n_0}=varnothing$. This implies $f(x)ge -n_0$ for all $xin [0,1]$, hence $f$ is lower bounded.



                  Let us define $S={cinBbb R: F_cne varnothing}$. Since $-n_0notin S$ and $-n_0le S$, we know $S$ is lower bounded. Let $m=inf S$. Then by finite intersection property,
                  $$
                  F_m=bigcap_{kinBbb N}F_{m+1/k}ne varnothing.
                  $$
                  Thus there exists $x_0$ such that $f(x_0)=m$. Finally, for all $c<m$, it holds $cnotin S$, i.e. $F_c=varnothing.$ This establishes $m$ is the minimum of $f$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 21 at 18:01









                  SongSong

                  16.7k11044




                  16.7k11044






























                      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%2f3082099%2fshow-that-lower-semi-continuous-function-attains-its-minimum-proof-verificati%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

                      MongoDB - Not Authorized To Execute Command

                      How to fix TextFormField cause rebuild widget in Flutter

                      in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith