linear isometric embedding from $(mathbb{R}^2, | |_2)$ to $(l^1, | |_1)$












7












$begingroup$


I would like to prove the following :




There isn't a linear isometric embedding from $(mathbb{R}^2, | cdot |_2)$ to $(l^1, | cdot |_1)$




I don't know how to prove this. So far I am able to prove this result only in the case where the vector $(1,0)$ and $(0,1)$ are sent to sequences that have all positive, or all negative value.



In this case I use the fact that the $2$ norm is not linear whereas the $1$ norm is (ie $| xa + yb | = xa + yb$, $x, y, a, b > 0$).



The problem is that when the sequences have different signs i's hard for me to conclude.



Thank you.










share|cite|improve this question









$endgroup$

















    7












    $begingroup$


    I would like to prove the following :




    There isn't a linear isometric embedding from $(mathbb{R}^2, | cdot |_2)$ to $(l^1, | cdot |_1)$




    I don't know how to prove this. So far I am able to prove this result only in the case where the vector $(1,0)$ and $(0,1)$ are sent to sequences that have all positive, or all negative value.



    In this case I use the fact that the $2$ norm is not linear whereas the $1$ norm is (ie $| xa + yb | = xa + yb$, $x, y, a, b > 0$).



    The problem is that when the sequences have different signs i's hard for me to conclude.



    Thank you.










    share|cite|improve this question









    $endgroup$















      7












      7








      7


      2



      $begingroup$


      I would like to prove the following :




      There isn't a linear isometric embedding from $(mathbb{R}^2, | cdot |_2)$ to $(l^1, | cdot |_1)$




      I don't know how to prove this. So far I am able to prove this result only in the case where the vector $(1,0)$ and $(0,1)$ are sent to sequences that have all positive, or all negative value.



      In this case I use the fact that the $2$ norm is not linear whereas the $1$ norm is (ie $| xa + yb | = xa + yb$, $x, y, a, b > 0$).



      The problem is that when the sequences have different signs i's hard for me to conclude.



      Thank you.










      share|cite|improve this question









      $endgroup$




      I would like to prove the following :




      There isn't a linear isometric embedding from $(mathbb{R}^2, | cdot |_2)$ to $(l^1, | cdot |_1)$




      I don't know how to prove this. So far I am able to prove this result only in the case where the vector $(1,0)$ and $(0,1)$ are sent to sequences that have all positive, or all negative value.



      In this case I use the fact that the $2$ norm is not linear whereas the $1$ norm is (ie $| xa + yb | = xa + yb$, $x, y, a, b > 0$).



      The problem is that when the sequences have different signs i's hard for me to conclude.



      Thank you.







      real-analysis linear-algebra general-topology functional-analysis normed-spaces






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 29 '18 at 9:18









      DP_qDP_q

      856




      856






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          Let the image of $(1,0)$ be the sequence $x=(x_i)_i$ and
          let the image of $(0,1)$ be the sequence $y=(y_i)_i$.
          Now we define the function
          For $alphainmathbb R$ we define
          $$
          f(alpha) = | x + alpha y| = sum_{i=1}^infty | x_i+alpha y_i |.
          $$

          Note that because of the isometry we should have
          $$
          f(alpha) = sqrt{1+alpha^2}.
          $$

          We cannot say that $f$ is linear, because as $alpha$ changes, there might be sign changes in some of the terms $|x_i+alpha y_i|$.



          We pick a fixed $j$ such that $y_jneq0$.
          Then we choose $Ninmathbb N$ such that
          $sum_{i=N+1}^infty |y_i| < |y_j|/2$.
          Clearly, $Ngeq j$ has to be true.
          We define
          $$
          g(alpha):=sum_{i=1}^N | x_i+alpha y_i |
          qquad
          h(alpha):=sum_{i=N+1}^infty | x_i+alpha y_i |.
          $$

          Clearly, $f=g+h$.
          It can be shown that $h(alpha)$ is Lipschitz continuous with the global Lipschitz constant $|y_j|/2$.



          Now we will analyse $g$.
          Since there are only finitely many terms, there are only finitely many points where $g$ is not smooth.
          In between those points $g$ is affine linear.
          If we consider the point $alpha_j:=-x_j/y_j$, then we can find $varepsilon_0>0$ such that
          $g$ is affine linear on the intervals
          $[alpha_j-varepsilon_0,alpha_j]$ and $[alpha_j,alpha_j+varepsilon_0]$.
          Then we have
          $$
          g(alpha_j+varepsilon)-g(alpha_j) geq varepsilon |y_j|
          quadtext{and}quad
          g(alpha_j-varepsilon)-g(alpha_j) geq varepsilon |y_j|
          $$

          for all $varepsilonin (0,varepsilon_0)$.



          Combining this with the Lipschitz constant for $h$, we can conclude
          $$
          f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j) geq varepsilon | y_j|.
          $$

          for all $varepsilonin (0,varepsilon_0)$.
          This means that
          $$
          liminf_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          geq |y_j| > 0.
          $$

          holds.
          However, this is a contradiction to $ f(alpha) = sqrt{1+alpha^2}$, because here the right-hand term is twice continuously differentiable, which (by using Taylor expansion) implies
          $$
          lim_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          =0
          $$






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            That is a good point. I think i found a fix and will update soon
            $endgroup$
            – supinf
            Nov 29 '18 at 11:15










          • $begingroup$
            @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 14:05



















          0












          $begingroup$

          The following construction gives an approximate such imbedding. Choose an $Ngg1$, and put
          $$f(1,0)=(x_k)_{0leq kleq N-1},qquad f(0,1)=(y_k)_{0leq kleq N-1}$$
          with
          $$x_k:={piover 2N}cos{2pi kover N},quad y_k:={piover 2N}sin{2pi kover N}qquad(0leq kleq N-1) .$$
          Then, by linearity,
          $$eqalign{|f(cosphi,sinphi)|&={piover 2N}sum_{k=0}^{N-1}left|cosphicos{2kpiover N}+sinphisin{2kpiover N}right| cr &=
          {1over 4}sum_{k=0}^{N-1}{2piover N}left|cosleft(phi-{2pi kover N}right)right|cr &approx{1over4}int_{-pi}^pi|cos t|>dt=1 ,cr}$$

          independently of $phi$.



          I'm not so sure that an exact isometric imbedding is impossible.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 15:06











          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%2f3018394%2flinear-isometric-embedding-from-mathbbr2-2-to-l1-1%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









          2












          $begingroup$

          Let the image of $(1,0)$ be the sequence $x=(x_i)_i$ and
          let the image of $(0,1)$ be the sequence $y=(y_i)_i$.
          Now we define the function
          For $alphainmathbb R$ we define
          $$
          f(alpha) = | x + alpha y| = sum_{i=1}^infty | x_i+alpha y_i |.
          $$

          Note that because of the isometry we should have
          $$
          f(alpha) = sqrt{1+alpha^2}.
          $$

          We cannot say that $f$ is linear, because as $alpha$ changes, there might be sign changes in some of the terms $|x_i+alpha y_i|$.



          We pick a fixed $j$ such that $y_jneq0$.
          Then we choose $Ninmathbb N$ such that
          $sum_{i=N+1}^infty |y_i| < |y_j|/2$.
          Clearly, $Ngeq j$ has to be true.
          We define
          $$
          g(alpha):=sum_{i=1}^N | x_i+alpha y_i |
          qquad
          h(alpha):=sum_{i=N+1}^infty | x_i+alpha y_i |.
          $$

          Clearly, $f=g+h$.
          It can be shown that $h(alpha)$ is Lipschitz continuous with the global Lipschitz constant $|y_j|/2$.



          Now we will analyse $g$.
          Since there are only finitely many terms, there are only finitely many points where $g$ is not smooth.
          In between those points $g$ is affine linear.
          If we consider the point $alpha_j:=-x_j/y_j$, then we can find $varepsilon_0>0$ such that
          $g$ is affine linear on the intervals
          $[alpha_j-varepsilon_0,alpha_j]$ and $[alpha_j,alpha_j+varepsilon_0]$.
          Then we have
          $$
          g(alpha_j+varepsilon)-g(alpha_j) geq varepsilon |y_j|
          quadtext{and}quad
          g(alpha_j-varepsilon)-g(alpha_j) geq varepsilon |y_j|
          $$

          for all $varepsilonin (0,varepsilon_0)$.



          Combining this with the Lipschitz constant for $h$, we can conclude
          $$
          f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j) geq varepsilon | y_j|.
          $$

          for all $varepsilonin (0,varepsilon_0)$.
          This means that
          $$
          liminf_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          geq |y_j| > 0.
          $$

          holds.
          However, this is a contradiction to $ f(alpha) = sqrt{1+alpha^2}$, because here the right-hand term is twice continuously differentiable, which (by using Taylor expansion) implies
          $$
          lim_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          =0
          $$






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            That is a good point. I think i found a fix and will update soon
            $endgroup$
            – supinf
            Nov 29 '18 at 11:15










          • $begingroup$
            @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 14:05
















          2












          $begingroup$

          Let the image of $(1,0)$ be the sequence $x=(x_i)_i$ and
          let the image of $(0,1)$ be the sequence $y=(y_i)_i$.
          Now we define the function
          For $alphainmathbb R$ we define
          $$
          f(alpha) = | x + alpha y| = sum_{i=1}^infty | x_i+alpha y_i |.
          $$

          Note that because of the isometry we should have
          $$
          f(alpha) = sqrt{1+alpha^2}.
          $$

          We cannot say that $f$ is linear, because as $alpha$ changes, there might be sign changes in some of the terms $|x_i+alpha y_i|$.



          We pick a fixed $j$ such that $y_jneq0$.
          Then we choose $Ninmathbb N$ such that
          $sum_{i=N+1}^infty |y_i| < |y_j|/2$.
          Clearly, $Ngeq j$ has to be true.
          We define
          $$
          g(alpha):=sum_{i=1}^N | x_i+alpha y_i |
          qquad
          h(alpha):=sum_{i=N+1}^infty | x_i+alpha y_i |.
          $$

          Clearly, $f=g+h$.
          It can be shown that $h(alpha)$ is Lipschitz continuous with the global Lipschitz constant $|y_j|/2$.



          Now we will analyse $g$.
          Since there are only finitely many terms, there are only finitely many points where $g$ is not smooth.
          In between those points $g$ is affine linear.
          If we consider the point $alpha_j:=-x_j/y_j$, then we can find $varepsilon_0>0$ such that
          $g$ is affine linear on the intervals
          $[alpha_j-varepsilon_0,alpha_j]$ and $[alpha_j,alpha_j+varepsilon_0]$.
          Then we have
          $$
          g(alpha_j+varepsilon)-g(alpha_j) geq varepsilon |y_j|
          quadtext{and}quad
          g(alpha_j-varepsilon)-g(alpha_j) geq varepsilon |y_j|
          $$

          for all $varepsilonin (0,varepsilon_0)$.



          Combining this with the Lipschitz constant for $h$, we can conclude
          $$
          f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j) geq varepsilon | y_j|.
          $$

          for all $varepsilonin (0,varepsilon_0)$.
          This means that
          $$
          liminf_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          geq |y_j| > 0.
          $$

          holds.
          However, this is a contradiction to $ f(alpha) = sqrt{1+alpha^2}$, because here the right-hand term is twice continuously differentiable, which (by using Taylor expansion) implies
          $$
          lim_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          =0
          $$






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            That is a good point. I think i found a fix and will update soon
            $endgroup$
            – supinf
            Nov 29 '18 at 11:15










          • $begingroup$
            @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 14:05














          2












          2








          2





          $begingroup$

          Let the image of $(1,0)$ be the sequence $x=(x_i)_i$ and
          let the image of $(0,1)$ be the sequence $y=(y_i)_i$.
          Now we define the function
          For $alphainmathbb R$ we define
          $$
          f(alpha) = | x + alpha y| = sum_{i=1}^infty | x_i+alpha y_i |.
          $$

          Note that because of the isometry we should have
          $$
          f(alpha) = sqrt{1+alpha^2}.
          $$

          We cannot say that $f$ is linear, because as $alpha$ changes, there might be sign changes in some of the terms $|x_i+alpha y_i|$.



          We pick a fixed $j$ such that $y_jneq0$.
          Then we choose $Ninmathbb N$ such that
          $sum_{i=N+1}^infty |y_i| < |y_j|/2$.
          Clearly, $Ngeq j$ has to be true.
          We define
          $$
          g(alpha):=sum_{i=1}^N | x_i+alpha y_i |
          qquad
          h(alpha):=sum_{i=N+1}^infty | x_i+alpha y_i |.
          $$

          Clearly, $f=g+h$.
          It can be shown that $h(alpha)$ is Lipschitz continuous with the global Lipschitz constant $|y_j|/2$.



          Now we will analyse $g$.
          Since there are only finitely many terms, there are only finitely many points where $g$ is not smooth.
          In between those points $g$ is affine linear.
          If we consider the point $alpha_j:=-x_j/y_j$, then we can find $varepsilon_0>0$ such that
          $g$ is affine linear on the intervals
          $[alpha_j-varepsilon_0,alpha_j]$ and $[alpha_j,alpha_j+varepsilon_0]$.
          Then we have
          $$
          g(alpha_j+varepsilon)-g(alpha_j) geq varepsilon |y_j|
          quadtext{and}quad
          g(alpha_j-varepsilon)-g(alpha_j) geq varepsilon |y_j|
          $$

          for all $varepsilonin (0,varepsilon_0)$.



          Combining this with the Lipschitz constant for $h$, we can conclude
          $$
          f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j) geq varepsilon | y_j|.
          $$

          for all $varepsilonin (0,varepsilon_0)$.
          This means that
          $$
          liminf_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          geq |y_j| > 0.
          $$

          holds.
          However, this is a contradiction to $ f(alpha) = sqrt{1+alpha^2}$, because here the right-hand term is twice continuously differentiable, which (by using Taylor expansion) implies
          $$
          lim_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          =0
          $$






          share|cite|improve this answer











          $endgroup$



          Let the image of $(1,0)$ be the sequence $x=(x_i)_i$ and
          let the image of $(0,1)$ be the sequence $y=(y_i)_i$.
          Now we define the function
          For $alphainmathbb R$ we define
          $$
          f(alpha) = | x + alpha y| = sum_{i=1}^infty | x_i+alpha y_i |.
          $$

          Note that because of the isometry we should have
          $$
          f(alpha) = sqrt{1+alpha^2}.
          $$

          We cannot say that $f$ is linear, because as $alpha$ changes, there might be sign changes in some of the terms $|x_i+alpha y_i|$.



          We pick a fixed $j$ such that $y_jneq0$.
          Then we choose $Ninmathbb N$ such that
          $sum_{i=N+1}^infty |y_i| < |y_j|/2$.
          Clearly, $Ngeq j$ has to be true.
          We define
          $$
          g(alpha):=sum_{i=1}^N | x_i+alpha y_i |
          qquad
          h(alpha):=sum_{i=N+1}^infty | x_i+alpha y_i |.
          $$

          Clearly, $f=g+h$.
          It can be shown that $h(alpha)$ is Lipschitz continuous with the global Lipschitz constant $|y_j|/2$.



          Now we will analyse $g$.
          Since there are only finitely many terms, there are only finitely many points where $g$ is not smooth.
          In between those points $g$ is affine linear.
          If we consider the point $alpha_j:=-x_j/y_j$, then we can find $varepsilon_0>0$ such that
          $g$ is affine linear on the intervals
          $[alpha_j-varepsilon_0,alpha_j]$ and $[alpha_j,alpha_j+varepsilon_0]$.
          Then we have
          $$
          g(alpha_j+varepsilon)-g(alpha_j) geq varepsilon |y_j|
          quadtext{and}quad
          g(alpha_j-varepsilon)-g(alpha_j) geq varepsilon |y_j|
          $$

          for all $varepsilonin (0,varepsilon_0)$.



          Combining this with the Lipschitz constant for $h$, we can conclude
          $$
          f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j) geq varepsilon | y_j|.
          $$

          for all $varepsilonin (0,varepsilon_0)$.
          This means that
          $$
          liminf_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          geq |y_j| > 0.
          $$

          holds.
          However, this is a contradiction to $ f(alpha) = sqrt{1+alpha^2}$, because here the right-hand term is twice continuously differentiable, which (by using Taylor expansion) implies
          $$
          lim_{varepsilondownarrow 0}
          frac1varepsilon (f(alpha_j+varepsilon)+f(alpha_j-varepsilon)-2f(alpha_j))
          =0
          $$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 29 '18 at 11:41

























          answered Nov 29 '18 at 10:05









          supinfsupinf

          6,1391028




          6,1391028












          • $begingroup$
            That is a good point. I think i found a fix and will update soon
            $endgroup$
            – supinf
            Nov 29 '18 at 11:15










          • $begingroup$
            @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 14:05


















          • $begingroup$
            That is a good point. I think i found a fix and will update soon
            $endgroup$
            – supinf
            Nov 29 '18 at 11:15










          • $begingroup$
            @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 14:05
















          $begingroup$
          That is a good point. I think i found a fix and will update soon
          $endgroup$
          – supinf
          Nov 29 '18 at 11:15




          $begingroup$
          That is a good point. I think i found a fix and will update soon
          $endgroup$
          – supinf
          Nov 29 '18 at 11:15












          $begingroup$
          @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
          $endgroup$
          – Thinking
          Nov 29 '18 at 14:05




          $begingroup$
          @supinf To get a contradiction you can simply use the fact that : $sum_{i = 1}^{infty} mid x_i + x cdot y_i mid$ is convex whereas $sqrt{x^2+1}-mid x_0 + x cdot y_0 mid$ is not convex ?
          $endgroup$
          – Thinking
          Nov 29 '18 at 14:05











          0












          $begingroup$

          The following construction gives an approximate such imbedding. Choose an $Ngg1$, and put
          $$f(1,0)=(x_k)_{0leq kleq N-1},qquad f(0,1)=(y_k)_{0leq kleq N-1}$$
          with
          $$x_k:={piover 2N}cos{2pi kover N},quad y_k:={piover 2N}sin{2pi kover N}qquad(0leq kleq N-1) .$$
          Then, by linearity,
          $$eqalign{|f(cosphi,sinphi)|&={piover 2N}sum_{k=0}^{N-1}left|cosphicos{2kpiover N}+sinphisin{2kpiover N}right| cr &=
          {1over 4}sum_{k=0}^{N-1}{2piover N}left|cosleft(phi-{2pi kover N}right)right|cr &approx{1over4}int_{-pi}^pi|cos t|>dt=1 ,cr}$$

          independently of $phi$.



          I'm not so sure that an exact isometric imbedding is impossible.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 15:06
















          0












          $begingroup$

          The following construction gives an approximate such imbedding. Choose an $Ngg1$, and put
          $$f(1,0)=(x_k)_{0leq kleq N-1},qquad f(0,1)=(y_k)_{0leq kleq N-1}$$
          with
          $$x_k:={piover 2N}cos{2pi kover N},quad y_k:={piover 2N}sin{2pi kover N}qquad(0leq kleq N-1) .$$
          Then, by linearity,
          $$eqalign{|f(cosphi,sinphi)|&={piover 2N}sum_{k=0}^{N-1}left|cosphicos{2kpiover N}+sinphisin{2kpiover N}right| cr &=
          {1over 4}sum_{k=0}^{N-1}{2piover N}left|cosleft(phi-{2pi kover N}right)right|cr &approx{1over4}int_{-pi}^pi|cos t|>dt=1 ,cr}$$

          independently of $phi$.



          I'm not so sure that an exact isometric imbedding is impossible.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 15:06














          0












          0








          0





          $begingroup$

          The following construction gives an approximate such imbedding. Choose an $Ngg1$, and put
          $$f(1,0)=(x_k)_{0leq kleq N-1},qquad f(0,1)=(y_k)_{0leq kleq N-1}$$
          with
          $$x_k:={piover 2N}cos{2pi kover N},quad y_k:={piover 2N}sin{2pi kover N}qquad(0leq kleq N-1) .$$
          Then, by linearity,
          $$eqalign{|f(cosphi,sinphi)|&={piover 2N}sum_{k=0}^{N-1}left|cosphicos{2kpiover N}+sinphisin{2kpiover N}right| cr &=
          {1over 4}sum_{k=0}^{N-1}{2piover N}left|cosleft(phi-{2pi kover N}right)right|cr &approx{1over4}int_{-pi}^pi|cos t|>dt=1 ,cr}$$

          independently of $phi$.



          I'm not so sure that an exact isometric imbedding is impossible.






          share|cite|improve this answer









          $endgroup$



          The following construction gives an approximate such imbedding. Choose an $Ngg1$, and put
          $$f(1,0)=(x_k)_{0leq kleq N-1},qquad f(0,1)=(y_k)_{0leq kleq N-1}$$
          with
          $$x_k:={piover 2N}cos{2pi kover N},quad y_k:={piover 2N}sin{2pi kover N}qquad(0leq kleq N-1) .$$
          Then, by linearity,
          $$eqalign{|f(cosphi,sinphi)|&={piover 2N}sum_{k=0}^{N-1}left|cosphicos{2kpiover N}+sinphisin{2kpiover N}right| cr &=
          {1over 4}sum_{k=0}^{N-1}{2piover N}left|cosleft(phi-{2pi kover N}right)right|cr &approx{1over4}int_{-pi}^pi|cos t|>dt=1 ,cr}$$

          independently of $phi$.



          I'm not so sure that an exact isometric imbedding is impossible.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 29 '18 at 10:39









          Christian BlatterChristian Blatter

          172k7113326




          172k7113326












          • $begingroup$
            It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 15:06


















          • $begingroup$
            It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
            $endgroup$
            – Thinking
            Nov 29 '18 at 15:06
















          $begingroup$
          It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
          $endgroup$
          – Thinking
          Nov 29 '18 at 15:06




          $begingroup$
          It is impossible by a convexity argument (see my comment under @supinf answer). Nevertheless this a nice approximation how did you get that idea ?
          $endgroup$
          – Thinking
          Nov 29 '18 at 15:06


















          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%2f3018394%2flinear-isometric-embedding-from-mathbbr2-2-to-l1-1%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

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

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