Convergent sequences in metric space $(mathbb{R}^n,d)$












1












$begingroup$


Given a metric $d : mathbb{R}^n times mathbb{R}^n mapsto mathbb{R}$ defined as
$$ d(x,y) = begin{cases}
lVert x rVert + lVert y rVert & xneq y \
0 & x = y
end{cases}
$$



How can one describe the convergent sequences in metric space $(mathbb{R}^n,d)$?



My work:



This metric will return a longer distance between any two points $x, y in mathbb{R}^n$ So by the triangle inequality if a sequence converges in $(mathbb{R}^n,d)$ it must also converge in $mathbb{R}^n$ with the standard metric $lVert x - y rVert$ but the reverse is not necessarily true, the standard metric on $mathbb{R}^n$ is finer.



What about Cauchy sequences? It's not very clear to me whether $(mathbb{R}^n,d)$ is a complete metric space.






real-analysis metric-spaces







share|cite|improve this question









$endgroup$












  • $begingroup$
    Hints: What is in a small neighbourhood of $x$ when (a) $xneq 0$ and (b) $x=0$?
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:07










  • $begingroup$
    In case $x = 0$, it's the same epsilon neighbourhood around zero with the standard metric. If $x neq 0$ then it's an epsilon neighbourhood that completely contains the epsilon neighbourhood with the standard metric..
    $endgroup$
    – Sptmp
    Dec 16 '18 at 22:18










  • $begingroup$
    @Sptmp And note that if $xne 0$, there are lots of $epsilon>0$ for which you cant be within an $epsilon$ ball of the point, indeed $epsilon<||x||$.
    $endgroup$
    – qbert
    Dec 16 '18 at 22:23








  • 1




    $begingroup$
    (@Sptmp Indeed, everywhere apart of zero, the space is discrete.)
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:51
















1












$begingroup$


Given a metric $d : mathbb{R}^n times mathbb{R}^n mapsto mathbb{R}$ defined as
$$ d(x,y) = begin{cases}
lVert x rVert + lVert y rVert & xneq y \
0 & x = y
end{cases}
$$



How can one describe the convergent sequences in metric space $(mathbb{R}^n,d)$?



My work:



This metric will return a longer distance between any two points $x, y in mathbb{R}^n$ So by the triangle inequality if a sequence converges in $(mathbb{R}^n,d)$ it must also converge in $mathbb{R}^n$ with the standard metric $lVert x - y rVert$ but the reverse is not necessarily true, the standard metric on $mathbb{R}^n$ is finer.



What about Cauchy sequences? It's not very clear to me whether $(mathbb{R}^n,d)$ is a complete metric space.






real-analysis metric-spaces







share|cite|improve this question









$endgroup$












  • $begingroup$
    Hints: What is in a small neighbourhood of $x$ when (a) $xneq 0$ and (b) $x=0$?
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:07










  • $begingroup$
    In case $x = 0$, it's the same epsilon neighbourhood around zero with the standard metric. If $x neq 0$ then it's an epsilon neighbourhood that completely contains the epsilon neighbourhood with the standard metric..
    $endgroup$
    – Sptmp
    Dec 16 '18 at 22:18










  • $begingroup$
    @Sptmp And note that if $xne 0$, there are lots of $epsilon>0$ for which you cant be within an $epsilon$ ball of the point, indeed $epsilon<||x||$.
    $endgroup$
    – qbert
    Dec 16 '18 at 22:23








  • 1




    $begingroup$
    (@Sptmp Indeed, everywhere apart of zero, the space is discrete.)
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:51














1












1








1





$begingroup$


Given a metric $d : mathbb{R}^n times mathbb{R}^n mapsto mathbb{R}$ defined as
$$ d(x,y) = begin{cases}
lVert x rVert + lVert y rVert & xneq y \
0 & x = y
end{cases}
$$



How can one describe the convergent sequences in metric space $(mathbb{R}^n,d)$?



My work:



This metric will return a longer distance between any two points $x, y in mathbb{R}^n$ So by the triangle inequality if a sequence converges in $(mathbb{R}^n,d)$ it must also converge in $mathbb{R}^n$ with the standard metric $lVert x - y rVert$ but the reverse is not necessarily true, the standard metric on $mathbb{R}^n$ is finer.



What about Cauchy sequences? It's not very clear to me whether $(mathbb{R}^n,d)$ is a complete metric space.






real-analysis metric-spaces







share|cite|improve this question









$endgroup$




Given a metric $d : mathbb{R}^n times mathbb{R}^n mapsto mathbb{R}$ defined as
$$ d(x,y) = begin{cases}
lVert x rVert + lVert y rVert & xneq y \
0 & x = y
end{cases}
$$



How can one describe the convergent sequences in metric space $(mathbb{R}^n,d)$?



My work:



This metric will return a longer distance between any two points $x, y in mathbb{R}^n$ So by the triangle inequality if a sequence converges in $(mathbb{R}^n,d)$ it must also converge in $mathbb{R}^n$ with the standard metric $lVert x - y rVert$ but the reverse is not necessarily true, the standard metric on $mathbb{R}^n$ is finer.



What about Cauchy sequences? It's not very clear to me whether $(mathbb{R}^n,d)$ is a complete metric space.






real-analysis metric-spaces




real-analysis metric-spaces






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 16 '18 at 22:04









SptmpSptmp

7914




7914












  • $begingroup$
    Hints: What is in a small neighbourhood of $x$ when (a) $xneq 0$ and (b) $x=0$?
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:07










  • $begingroup$
    In case $x = 0$, it's the same epsilon neighbourhood around zero with the standard metric. If $x neq 0$ then it's an epsilon neighbourhood that completely contains the epsilon neighbourhood with the standard metric..
    $endgroup$
    – Sptmp
    Dec 16 '18 at 22:18










  • $begingroup$
    @Sptmp And note that if $xne 0$, there are lots of $epsilon>0$ for which you cant be within an $epsilon$ ball of the point, indeed $epsilon<||x||$.
    $endgroup$
    – qbert
    Dec 16 '18 at 22:23








  • 1




    $begingroup$
    (@Sptmp Indeed, everywhere apart of zero, the space is discrete.)
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:51


















  • $begingroup$
    Hints: What is in a small neighbourhood of $x$ when (a) $xneq 0$ and (b) $x=0$?
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:07










  • $begingroup$
    In case $x = 0$, it's the same epsilon neighbourhood around zero with the standard metric. If $x neq 0$ then it's an epsilon neighbourhood that completely contains the epsilon neighbourhood with the standard metric..
    $endgroup$
    – Sptmp
    Dec 16 '18 at 22:18










  • $begingroup$
    @Sptmp And note that if $xne 0$, there are lots of $epsilon>0$ for which you cant be within an $epsilon$ ball of the point, indeed $epsilon<||x||$.
    $endgroup$
    – qbert
    Dec 16 '18 at 22:23








  • 1




    $begingroup$
    (@Sptmp Indeed, everywhere apart of zero, the space is discrete.)
    $endgroup$
    – Peter Franek
    Dec 16 '18 at 22:51
















$begingroup$
Hints: What is in a small neighbourhood of $x$ when (a) $xneq 0$ and (b) $x=0$?
$endgroup$
– Peter Franek
Dec 16 '18 at 22:07




$begingroup$
Hints: What is in a small neighbourhood of $x$ when (a) $xneq 0$ and (b) $x=0$?
$endgroup$
– Peter Franek
Dec 16 '18 at 22:07












$begingroup$
In case $x = 0$, it's the same epsilon neighbourhood around zero with the standard metric. If $x neq 0$ then it's an epsilon neighbourhood that completely contains the epsilon neighbourhood with the standard metric..
$endgroup$
– Sptmp
Dec 16 '18 at 22:18




$begingroup$
In case $x = 0$, it's the same epsilon neighbourhood around zero with the standard metric. If $x neq 0$ then it's an epsilon neighbourhood that completely contains the epsilon neighbourhood with the standard metric..
$endgroup$
– Sptmp
Dec 16 '18 at 22:18












$begingroup$
@Sptmp And note that if $xne 0$, there are lots of $epsilon>0$ for which you cant be within an $epsilon$ ball of the point, indeed $epsilon<||x||$.
$endgroup$
– qbert
Dec 16 '18 at 22:23






$begingroup$
@Sptmp And note that if $xne 0$, there are lots of $epsilon>0$ for which you cant be within an $epsilon$ ball of the point, indeed $epsilon<||x||$.
$endgroup$
– qbert
Dec 16 '18 at 22:23






1




1




$begingroup$
(@Sptmp Indeed, everywhere apart of zero, the space is discrete.)
$endgroup$
– Peter Franek
Dec 16 '18 at 22:51




$begingroup$
(@Sptmp Indeed, everywhere apart of zero, the space is discrete.)
$endgroup$
– Peter Franek
Dec 16 '18 at 22:51










2 Answers
2






active

oldest

votes


















1












$begingroup$

So assume that $(x_n)$ converges to $x$. It follows that $d(x_n, x)$ is arbitrarly small. Now assume that $(x_n)$ is not eventually constant, i.e. $x_nneq x$ for infinitely many $n$. Then $d(x_n,x)=lVert x_nrVert+lVert xrVertgeq lVert xrVert$. If $xneq 0$ then $d(x_n,x)geq lVert xrVert>0$ and thus $x_n$ cannot be convergent to $x$.



It follows that if $xneq 0$ then $(x_n)to x$ if and only if $(x_n)$ is eventually constant.



On the other hand following similar reasoning we conclude that $(x_n)to 0$ in $d$ if and only if $(x_n)to 0$ in $lVertcdotrVert$.



Similarly if $(x_n)$ is Cauchy then $d(x_n, x_m)=lVert x_nrVert +lVert x_mrVert$ assuming $(x_n)$ is not eventually constant (which is the trivial case). So $d(x_n,x_m)$ is arbitrarly small if and only if $lVert x_nrVert$ is arbitrarly small. Meaning that $(x_n)$ is Cauchy if and only if it converges to $0$ (I omit the case when $(x_n)$ is eventually constant). In particular $(mathbb{R}^n,d)$ is complete.






share|cite|improve this answer









$endgroup$





















    2












    $begingroup$

    Note that if for any $kgeq 0$,
    $$
    d(x_{n},x_{n+k})to 0iff ||x_n||+||x_{n+k}||to 0implies ||x_n||to 0
    $$
    So, for any Cauchy sequence, we have
    $$
    d(x_n,0)=||x_{n}||to 0
    $$
    and $x_nto 0$ in this metric.



    Since convergent sequences are always Cauchy, this goes a long way towards describing the convergent sequences, even in terms of the usual Euclidean metric.






    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%2f3043235%2fconvergent-sequences-in-metric-space-mathbbrn-d%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$

      So assume that $(x_n)$ converges to $x$. It follows that $d(x_n, x)$ is arbitrarly small. Now assume that $(x_n)$ is not eventually constant, i.e. $x_nneq x$ for infinitely many $n$. Then $d(x_n,x)=lVert x_nrVert+lVert xrVertgeq lVert xrVert$. If $xneq 0$ then $d(x_n,x)geq lVert xrVert>0$ and thus $x_n$ cannot be convergent to $x$.



      It follows that if $xneq 0$ then $(x_n)to x$ if and only if $(x_n)$ is eventually constant.



      On the other hand following similar reasoning we conclude that $(x_n)to 0$ in $d$ if and only if $(x_n)to 0$ in $lVertcdotrVert$.



      Similarly if $(x_n)$ is Cauchy then $d(x_n, x_m)=lVert x_nrVert +lVert x_mrVert$ assuming $(x_n)$ is not eventually constant (which is the trivial case). So $d(x_n,x_m)$ is arbitrarly small if and only if $lVert x_nrVert$ is arbitrarly small. Meaning that $(x_n)$ is Cauchy if and only if it converges to $0$ (I omit the case when $(x_n)$ is eventually constant). In particular $(mathbb{R}^n,d)$ is complete.






      share|cite|improve this answer









      $endgroup$


















        1












        $begingroup$

        So assume that $(x_n)$ converges to $x$. It follows that $d(x_n, x)$ is arbitrarly small. Now assume that $(x_n)$ is not eventually constant, i.e. $x_nneq x$ for infinitely many $n$. Then $d(x_n,x)=lVert x_nrVert+lVert xrVertgeq lVert xrVert$. If $xneq 0$ then $d(x_n,x)geq lVert xrVert>0$ and thus $x_n$ cannot be convergent to $x$.



        It follows that if $xneq 0$ then $(x_n)to x$ if and only if $(x_n)$ is eventually constant.



        On the other hand following similar reasoning we conclude that $(x_n)to 0$ in $d$ if and only if $(x_n)to 0$ in $lVertcdotrVert$.



        Similarly if $(x_n)$ is Cauchy then $d(x_n, x_m)=lVert x_nrVert +lVert x_mrVert$ assuming $(x_n)$ is not eventually constant (which is the trivial case). So $d(x_n,x_m)$ is arbitrarly small if and only if $lVert x_nrVert$ is arbitrarly small. Meaning that $(x_n)$ is Cauchy if and only if it converges to $0$ (I omit the case when $(x_n)$ is eventually constant). In particular $(mathbb{R}^n,d)$ is complete.






        share|cite|improve this answer









        $endgroup$
















          1












          1








          1





          $begingroup$

          So assume that $(x_n)$ converges to $x$. It follows that $d(x_n, x)$ is arbitrarly small. Now assume that $(x_n)$ is not eventually constant, i.e. $x_nneq x$ for infinitely many $n$. Then $d(x_n,x)=lVert x_nrVert+lVert xrVertgeq lVert xrVert$. If $xneq 0$ then $d(x_n,x)geq lVert xrVert>0$ and thus $x_n$ cannot be convergent to $x$.



          It follows that if $xneq 0$ then $(x_n)to x$ if and only if $(x_n)$ is eventually constant.



          On the other hand following similar reasoning we conclude that $(x_n)to 0$ in $d$ if and only if $(x_n)to 0$ in $lVertcdotrVert$.



          Similarly if $(x_n)$ is Cauchy then $d(x_n, x_m)=lVert x_nrVert +lVert x_mrVert$ assuming $(x_n)$ is not eventually constant (which is the trivial case). So $d(x_n,x_m)$ is arbitrarly small if and only if $lVert x_nrVert$ is arbitrarly small. Meaning that $(x_n)$ is Cauchy if and only if it converges to $0$ (I omit the case when $(x_n)$ is eventually constant). In particular $(mathbb{R}^n,d)$ is complete.






          share|cite|improve this answer









          $endgroup$



          So assume that $(x_n)$ converges to $x$. It follows that $d(x_n, x)$ is arbitrarly small. Now assume that $(x_n)$ is not eventually constant, i.e. $x_nneq x$ for infinitely many $n$. Then $d(x_n,x)=lVert x_nrVert+lVert xrVertgeq lVert xrVert$. If $xneq 0$ then $d(x_n,x)geq lVert xrVert>0$ and thus $x_n$ cannot be convergent to $x$.



          It follows that if $xneq 0$ then $(x_n)to x$ if and only if $(x_n)$ is eventually constant.



          On the other hand following similar reasoning we conclude that $(x_n)to 0$ in $d$ if and only if $(x_n)to 0$ in $lVertcdotrVert$.



          Similarly if $(x_n)$ is Cauchy then $d(x_n, x_m)=lVert x_nrVert +lVert x_mrVert$ assuming $(x_n)$ is not eventually constant (which is the trivial case). So $d(x_n,x_m)$ is arbitrarly small if and only if $lVert x_nrVert$ is arbitrarly small. Meaning that $(x_n)$ is Cauchy if and only if it converges to $0$ (I omit the case when $(x_n)$ is eventually constant). In particular $(mathbb{R}^n,d)$ is complete.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 16 '18 at 22:23









          freakishfreakish

          12.8k1631




          12.8k1631























              2












              $begingroup$

              Note that if for any $kgeq 0$,
              $$
              d(x_{n},x_{n+k})to 0iff ||x_n||+||x_{n+k}||to 0implies ||x_n||to 0
              $$
              So, for any Cauchy sequence, we have
              $$
              d(x_n,0)=||x_{n}||to 0
              $$
              and $x_nto 0$ in this metric.



              Since convergent sequences are always Cauchy, this goes a long way towards describing the convergent sequences, even in terms of the usual Euclidean metric.






              share|cite|improve this answer









              $endgroup$


















                2












                $begingroup$

                Note that if for any $kgeq 0$,
                $$
                d(x_{n},x_{n+k})to 0iff ||x_n||+||x_{n+k}||to 0implies ||x_n||to 0
                $$
                So, for any Cauchy sequence, we have
                $$
                d(x_n,0)=||x_{n}||to 0
                $$
                and $x_nto 0$ in this metric.



                Since convergent sequences are always Cauchy, this goes a long way towards describing the convergent sequences, even in terms of the usual Euclidean metric.






                share|cite|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  Note that if for any $kgeq 0$,
                  $$
                  d(x_{n},x_{n+k})to 0iff ||x_n||+||x_{n+k}||to 0implies ||x_n||to 0
                  $$
                  So, for any Cauchy sequence, we have
                  $$
                  d(x_n,0)=||x_{n}||to 0
                  $$
                  and $x_nto 0$ in this metric.



                  Since convergent sequences are always Cauchy, this goes a long way towards describing the convergent sequences, even in terms of the usual Euclidean metric.






                  share|cite|improve this answer









                  $endgroup$



                  Note that if for any $kgeq 0$,
                  $$
                  d(x_{n},x_{n+k})to 0iff ||x_n||+||x_{n+k}||to 0implies ||x_n||to 0
                  $$
                  So, for any Cauchy sequence, we have
                  $$
                  d(x_n,0)=||x_{n}||to 0
                  $$
                  and $x_nto 0$ in this metric.



                  Since convergent sequences are always Cauchy, this goes a long way towards describing the convergent sequences, even in terms of the usual Euclidean metric.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 16 '18 at 22:17









                  qbertqbert

                  22.2k32561




                  22.2k32561






























                      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%2f3043235%2fconvergent-sequences-in-metric-space-mathbbrn-d%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

                      Plaza Victoria

                      Image
                      Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
                      Read more

                      In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

                      Image
                      .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 OneNote has two useful keyboard shortcuts for bulleted and numbered lists, namely Ctrl + . and Ctrl + - . Is there something similar for PowerPoint where the work with lists is also very common? Haven't found anything here: Use keyboard shortcuts in PowerPoint. keyboard-shortcuts microsoft-powerpoint share | improve this question edited Aug 14 '14 at 14:49 Linger 2,826 10 28 40
                      Read more

                      How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...

                      Image
                      1 0 I want to put 3 images in LateX such as 2 figures are side by side horizotally and 3rd figure below these 2 side by side figures but in middle. I have following code: begin{figure}[H] centering begin{minipage}{.5textwidth} centering includegraphics[width=.50linewidth]{Text/Images/Genelec_8010_AP.jpg} captionof{figure}{Genelec 8010 AP} label{fig:Genelec 8010} end{minipage}% begin{minipage}{.5textwidth} centering includegraphics[width=.69linewidth]{Text/Images/Genelec_8020_CPM.jpg} captionof{figure}{Genelec 8020 CPM} label{fig:Genelec 8020} end{minipage}% end{figure} %%Here is my 3rd picture code begin{figure} centering includegraphics[width=5cm]{Text/Images/Genelec_8030_BPM.jpg} caption{Genelec 8030 BPM} label{fig:Genelec 8030} end{figure} I want to ask ho
                      Read more