$L^1$ inequality between ordered real numbers implies $L^2$ norm inequality












2















Let $x_1,ldots,x_n$ be real numbers such that $|x_1|geq ldotsgeq |x_n|$ and $displaystyle sum_{i=k+1}^n |x_i| leq alpha sum_{i=1}^k |x_i|$ where $1leq k leq n-1$ and $alpha >0$.



Prove that $$sum_{i=k+1}^n x_i^2 leq alpha sum_{i=1}^k x_i^2$$




I have managed to prove a looser inequality: $$begin{align}
alpha sum_{i=1}^k x_i^2
&geq frac{alpha}{k}left(sum_{i=1}^k |x_i| right)^2 quad quad text{Cauchy-Schwarz}\
&geq frac 1k sum_{i=k+1}^n |x_i| sum_{i=1}^k |x_i|\
&geq frac 1k left(sum_{i=k+1}^n |x_i| right)^2\
&geq frac 1k sum_{i=k+1}^n x_i^2 quad quad text{since } |z|_1 geq |z|_2
end{align}$$



Since $frac 1k$ is not $geq 1$, I'm stuck...






real-analysis inequality cauchy-schwarz-inequality







share|cite|improve this question





























    2















    Let $x_1,ldots,x_n$ be real numbers such that $|x_1|geq ldotsgeq |x_n|$ and $displaystyle sum_{i=k+1}^n |x_i| leq alpha sum_{i=1}^k |x_i|$ where $1leq k leq n-1$ and $alpha >0$.



    Prove that $$sum_{i=k+1}^n x_i^2 leq alpha sum_{i=1}^k x_i^2$$




    I have managed to prove a looser inequality: $$begin{align}
    alpha sum_{i=1}^k x_i^2
    &geq frac{alpha}{k}left(sum_{i=1}^k |x_i| right)^2 quad quad text{Cauchy-Schwarz}\
    &geq frac 1k sum_{i=k+1}^n |x_i| sum_{i=1}^k |x_i|\
    &geq frac 1k left(sum_{i=k+1}^n |x_i| right)^2\
    &geq frac 1k sum_{i=k+1}^n x_i^2 quad quad text{since } |z|_1 geq |z|_2
    end{align}$$



    Since $frac 1k$ is not $geq 1$, I'm stuck...






    real-analysis inequality cauchy-schwarz-inequality







    share|cite|improve this question



























      2












      2








      2


      1






      Let $x_1,ldots,x_n$ be real numbers such that $|x_1|geq ldotsgeq |x_n|$ and $displaystyle sum_{i=k+1}^n |x_i| leq alpha sum_{i=1}^k |x_i|$ where $1leq k leq n-1$ and $alpha >0$.



      Prove that $$sum_{i=k+1}^n x_i^2 leq alpha sum_{i=1}^k x_i^2$$




      I have managed to prove a looser inequality: $$begin{align}
      alpha sum_{i=1}^k x_i^2
      &geq frac{alpha}{k}left(sum_{i=1}^k |x_i| right)^2 quad quad text{Cauchy-Schwarz}\
      &geq frac 1k sum_{i=k+1}^n |x_i| sum_{i=1}^k |x_i|\
      &geq frac 1k left(sum_{i=k+1}^n |x_i| right)^2\
      &geq frac 1k sum_{i=k+1}^n x_i^2 quad quad text{since } |z|_1 geq |z|_2
      end{align}$$



      Since $frac 1k$ is not $geq 1$, I'm stuck...






      real-analysis inequality cauchy-schwarz-inequality







      share|cite|improve this question
















      Let $x_1,ldots,x_n$ be real numbers such that $|x_1|geq ldotsgeq |x_n|$ and $displaystyle sum_{i=k+1}^n |x_i| leq alpha sum_{i=1}^k |x_i|$ where $1leq k leq n-1$ and $alpha >0$.



      Prove that $$sum_{i=k+1}^n x_i^2 leq alpha sum_{i=1}^k x_i^2$$




      I have managed to prove a looser inequality: $$begin{align}
      alpha sum_{i=1}^k x_i^2
      &geq frac{alpha}{k}left(sum_{i=1}^k |x_i| right)^2 quad quad text{Cauchy-Schwarz}\
      &geq frac 1k sum_{i=k+1}^n |x_i| sum_{i=1}^k |x_i|\
      &geq frac 1k left(sum_{i=k+1}^n |x_i| right)^2\
      &geq frac 1k sum_{i=k+1}^n x_i^2 quad quad text{since } |z|_1 geq |z|_2
      end{align}$$



      Since $frac 1k$ is not $geq 1$, I'm stuck...






      real-analysis inequality cauchy-schwarz-inequality




      real-analysis inequality cauchy-schwarz-inequality






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 21 '18 at 11:28









      Tianlalu

      3,09621038




      3,09621038










      asked Nov 21 '18 at 10:15









      Issou Chankla

      254




      254






















          1 Answer
          1






          active

          oldest

          votes


















          1














          It is quite simple: Note that $|x_i| le |x_k|$ for any $i in {k+1,ldots,n}$. Thus
          $$tag{1}sum_{i=k+1}^n x_i^2 le |x_k| sum_{i=k+1}^n |x_i| le alpha |x_k| sum_{i=1}^k |x_i|,$$
          where the given condition is used in the last step. Now $|x_k x_i| le x_i^2$ for an $i=1,ldots,k$, because $|x_k| le |x_i|$ for all $i=1,ldots,k$. So proceeding in (1) gives the claimed estimate
          $$sum_{i=k+1}^n x_i^2lealpha sum_{i=1}^k x_i^2.$$






          share|cite|improve this answer





















          • Nice, thank you. This line of thought did not occur to me.
            – Issou Chankla
            Nov 21 '18 at 11:17










          • In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
            – p4sch
            Nov 21 '18 at 12:04











          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%2f3007523%2fl1-inequality-between-ordered-real-numbers-implies-l2-norm-inequality%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














          It is quite simple: Note that $|x_i| le |x_k|$ for any $i in {k+1,ldots,n}$. Thus
          $$tag{1}sum_{i=k+1}^n x_i^2 le |x_k| sum_{i=k+1}^n |x_i| le alpha |x_k| sum_{i=1}^k |x_i|,$$
          where the given condition is used in the last step. Now $|x_k x_i| le x_i^2$ for an $i=1,ldots,k$, because $|x_k| le |x_i|$ for all $i=1,ldots,k$. So proceeding in (1) gives the claimed estimate
          $$sum_{i=k+1}^n x_i^2lealpha sum_{i=1}^k x_i^2.$$






          share|cite|improve this answer





















          • Nice, thank you. This line of thought did not occur to me.
            – Issou Chankla
            Nov 21 '18 at 11:17










          • In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
            – p4sch
            Nov 21 '18 at 12:04
















          1














          It is quite simple: Note that $|x_i| le |x_k|$ for any $i in {k+1,ldots,n}$. Thus
          $$tag{1}sum_{i=k+1}^n x_i^2 le |x_k| sum_{i=k+1}^n |x_i| le alpha |x_k| sum_{i=1}^k |x_i|,$$
          where the given condition is used in the last step. Now $|x_k x_i| le x_i^2$ for an $i=1,ldots,k$, because $|x_k| le |x_i|$ for all $i=1,ldots,k$. So proceeding in (1) gives the claimed estimate
          $$sum_{i=k+1}^n x_i^2lealpha sum_{i=1}^k x_i^2.$$






          share|cite|improve this answer





















          • Nice, thank you. This line of thought did not occur to me.
            – Issou Chankla
            Nov 21 '18 at 11:17










          • In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
            – p4sch
            Nov 21 '18 at 12:04














          1












          1








          1






          It is quite simple: Note that $|x_i| le |x_k|$ for any $i in {k+1,ldots,n}$. Thus
          $$tag{1}sum_{i=k+1}^n x_i^2 le |x_k| sum_{i=k+1}^n |x_i| le alpha |x_k| sum_{i=1}^k |x_i|,$$
          where the given condition is used in the last step. Now $|x_k x_i| le x_i^2$ for an $i=1,ldots,k$, because $|x_k| le |x_i|$ for all $i=1,ldots,k$. So proceeding in (1) gives the claimed estimate
          $$sum_{i=k+1}^n x_i^2lealpha sum_{i=1}^k x_i^2.$$






          share|cite|improve this answer












          It is quite simple: Note that $|x_i| le |x_k|$ for any $i in {k+1,ldots,n}$. Thus
          $$tag{1}sum_{i=k+1}^n x_i^2 le |x_k| sum_{i=k+1}^n |x_i| le alpha |x_k| sum_{i=1}^k |x_i|,$$
          where the given condition is used in the last step. Now $|x_k x_i| le x_i^2$ for an $i=1,ldots,k$, because $|x_k| le |x_i|$ for all $i=1,ldots,k$. So proceeding in (1) gives the claimed estimate
          $$sum_{i=k+1}^n x_i^2lealpha sum_{i=1}^k x_i^2.$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 21 '18 at 11:06









          p4sch

          4,760217




          4,760217












          • Nice, thank you. This line of thought did not occur to me.
            – Issou Chankla
            Nov 21 '18 at 11:17










          • In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
            – p4sch
            Nov 21 '18 at 12:04


















          • Nice, thank you. This line of thought did not occur to me.
            – Issou Chankla
            Nov 21 '18 at 11:17










          • In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
            – p4sch
            Nov 21 '18 at 12:04
















          Nice, thank you. This line of thought did not occur to me.
          – Issou Chankla
          Nov 21 '18 at 11:17




          Nice, thank you. This line of thought did not occur to me.
          – Issou Chankla
          Nov 21 '18 at 11:17












          In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
          – p4sch
          Nov 21 '18 at 12:04




          In general you lose information, if you apply Cauchy-Schwarz. The constants between $|cdot|_1$ and $|cdot|_2$ are also strict. In fact, the key point here is the condition $|x_1| ge ldots ge |x_n|$. (The statement is wrong without this condition!)
          – p4sch
          Nov 21 '18 at 12:04


















          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f3007523%2fl1-inequality-between-ordered-real-numbers-implies-l2-norm-inequality%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

          How to change which sound is reproduced for terminal bell?

          Image
          3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
          Read more

          Can I use Tabulator js library in my java Spring + Thymeleaf project?

          Image
          0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
          Read more

          Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

          Image
          up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx...
          Read more