Is one norm property: $p(v)=0 iff v=0$ or positive definiteness?












1












$begingroup$


I'm confused as to seeing different requirements for norms.



Triangle eq. and homogeneity seem to be in all, but the last property seems to be either:



$p(v)=0 iff v=0$ or positive definiteness



How are these related/equivalent?





It seems that positive definiteness may be able to capture the rule about norm having to be positive, while also capturing the zero element property, both at the same time?










share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    I'm confused as to seeing different requirements for norms.



    Triangle eq. and homogeneity seem to be in all, but the last property seems to be either:



    $p(v)=0 iff v=0$ or positive definiteness



    How are these related/equivalent?





    It seems that positive definiteness may be able to capture the rule about norm having to be positive, while also capturing the zero element property, both at the same time?










    share|cite|improve this question









    $endgroup$















      1












      1








      1





      $begingroup$


      I'm confused as to seeing different requirements for norms.



      Triangle eq. and homogeneity seem to be in all, but the last property seems to be either:



      $p(v)=0 iff v=0$ or positive definiteness



      How are these related/equivalent?





      It seems that positive definiteness may be able to capture the rule about norm having to be positive, while also capturing the zero element property, both at the same time?










      share|cite|improve this question









      $endgroup$




      I'm confused as to seeing different requirements for norms.



      Triangle eq. and homogeneity seem to be in all, but the last property seems to be either:



      $p(v)=0 iff v=0$ or positive definiteness



      How are these related/equivalent?





      It seems that positive definiteness may be able to capture the rule about norm having to be positive, while also capturing the zero element property, both at the same time?







      norm






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 19 at 12:45









      mavaviljmavavilj

      2,81411137




      2,81411137






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          Positive definiteness of $p$ states that $p(v) = 0 iff v = 0$ and $p(v) geq 0$ for all $v in V$. This is definitely required for every norm.



          If you're reading the Wikipedia article, $p(v) geq 0$ for all $v in V$ is implicitly encoded since $p$ is a function $p: V to [0, infty)$, hence you only need to include $p(v) = 0 iff v = 0$ as an additional requirement.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
            $endgroup$
            – I like Serena
            Jan 19 at 13:05





















          0












          $begingroup$

          Let $V$ be an $mathbb{R}$-vector space. A norm is a mapping $lVertcdotrVertcolon Vrightarrowmathbb{R}$, satisfying the following properties. For all $v,win V$, you have the triangle inequality $lVert v+wrVertlelVert vrVert+lVert wrVert$. For all $lambdainmathbb{R},vin V$ you have absolute homogenity, i.e. $lVert lambda vrVert=lvertlambdavertlVert vrVert$. Then we require either of the following properties:





          • $lVert vrVert=0Rightarrow v=0$ for $vin V$,


          • $lVert vrVertge0$ for all $vin V$ with equality iff $v=0$.


          I've seen either of these two properties be referred to as positive-definiteness, so I won't name them. The second property trivially implies the former property. For the other direction, notice that if $lVert vrVert<0$ for some $vin V$, you would - by absolute homogenity - have $lVert-vrVert=lvert-1rvertlVert vrVert=lVert vrVert<0$ and then - by the triangle inequality - $0=lVert0rVert=lVert v+(-v)rVertlelVert vrVert+lVert-vrVert<0$, a contradiction, so the norm is definitely non-negative. The equivalency $lVert vrVert=0Leftrightarrow v=0$ then follows from the first property as $lVert0rVert=lVertlambda0rVert=lvertlambdarvertlVert0rVert$ for all $lambdainmathbb{R}$ and hence $lVert0rVert=0$.






          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%2f3079325%2fis-one-norm-property-pv-0-iff-v-0-or-positive-definiteness%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$

            Positive definiteness of $p$ states that $p(v) = 0 iff v = 0$ and $p(v) geq 0$ for all $v in V$. This is definitely required for every norm.



            If you're reading the Wikipedia article, $p(v) geq 0$ for all $v in V$ is implicitly encoded since $p$ is a function $p: V to [0, infty)$, hence you only need to include $p(v) = 0 iff v = 0$ as an additional requirement.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
              $endgroup$
              – I like Serena
              Jan 19 at 13:05


















            1












            $begingroup$

            Positive definiteness of $p$ states that $p(v) = 0 iff v = 0$ and $p(v) geq 0$ for all $v in V$. This is definitely required for every norm.



            If you're reading the Wikipedia article, $p(v) geq 0$ for all $v in V$ is implicitly encoded since $p$ is a function $p: V to [0, infty)$, hence you only need to include $p(v) = 0 iff v = 0$ as an additional requirement.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
              $endgroup$
              – I like Serena
              Jan 19 at 13:05
















            1












            1








            1





            $begingroup$

            Positive definiteness of $p$ states that $p(v) = 0 iff v = 0$ and $p(v) geq 0$ for all $v in V$. This is definitely required for every norm.



            If you're reading the Wikipedia article, $p(v) geq 0$ for all $v in V$ is implicitly encoded since $p$ is a function $p: V to [0, infty)$, hence you only need to include $p(v) = 0 iff v = 0$ as an additional requirement.






            share|cite|improve this answer









            $endgroup$



            Positive definiteness of $p$ states that $p(v) = 0 iff v = 0$ and $p(v) geq 0$ for all $v in V$. This is definitely required for every norm.



            If you're reading the Wikipedia article, $p(v) geq 0$ for all $v in V$ is implicitly encoded since $p$ is a function $p: V to [0, infty)$, hence you only need to include $p(v) = 0 iff v = 0$ as an additional requirement.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 19 at 12:58









            bitesizebobitesizebo

            1,59618




            1,59618












            • $begingroup$
              Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
              $endgroup$
              – I like Serena
              Jan 19 at 13:05




















            • $begingroup$
              Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
              $endgroup$
              – I like Serena
              Jan 19 at 13:05


















            $begingroup$
            Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
            $endgroup$
            – I like Serena
            Jan 19 at 13:05






            $begingroup$
            Indeed. I don't like that hidden requirement in the wiki article. In most similar definitions there is already an implicit (semi-hidden) requirement that the the operation must be defined for all elements of the set. The norm definition on wiki has another implicit requirement that is somewhat unexpected.
            $endgroup$
            – I like Serena
            Jan 19 at 13:05













            0












            $begingroup$

            Let $V$ be an $mathbb{R}$-vector space. A norm is a mapping $lVertcdotrVertcolon Vrightarrowmathbb{R}$, satisfying the following properties. For all $v,win V$, you have the triangle inequality $lVert v+wrVertlelVert vrVert+lVert wrVert$. For all $lambdainmathbb{R},vin V$ you have absolute homogenity, i.e. $lVert lambda vrVert=lvertlambdavertlVert vrVert$. Then we require either of the following properties:





            • $lVert vrVert=0Rightarrow v=0$ for $vin V$,


            • $lVert vrVertge0$ for all $vin V$ with equality iff $v=0$.


            I've seen either of these two properties be referred to as positive-definiteness, so I won't name them. The second property trivially implies the former property. For the other direction, notice that if $lVert vrVert<0$ for some $vin V$, you would - by absolute homogenity - have $lVert-vrVert=lvert-1rvertlVert vrVert=lVert vrVert<0$ and then - by the triangle inequality - $0=lVert0rVert=lVert v+(-v)rVertlelVert vrVert+lVert-vrVert<0$, a contradiction, so the norm is definitely non-negative. The equivalency $lVert vrVert=0Leftrightarrow v=0$ then follows from the first property as $lVert0rVert=lVertlambda0rVert=lvertlambdarvertlVert0rVert$ for all $lambdainmathbb{R}$ and hence $lVert0rVert=0$.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              Let $V$ be an $mathbb{R}$-vector space. A norm is a mapping $lVertcdotrVertcolon Vrightarrowmathbb{R}$, satisfying the following properties. For all $v,win V$, you have the triangle inequality $lVert v+wrVertlelVert vrVert+lVert wrVert$. For all $lambdainmathbb{R},vin V$ you have absolute homogenity, i.e. $lVert lambda vrVert=lvertlambdavertlVert vrVert$. Then we require either of the following properties:





              • $lVert vrVert=0Rightarrow v=0$ for $vin V$,


              • $lVert vrVertge0$ for all $vin V$ with equality iff $v=0$.


              I've seen either of these two properties be referred to as positive-definiteness, so I won't name them. The second property trivially implies the former property. For the other direction, notice that if $lVert vrVert<0$ for some $vin V$, you would - by absolute homogenity - have $lVert-vrVert=lvert-1rvertlVert vrVert=lVert vrVert<0$ and then - by the triangle inequality - $0=lVert0rVert=lVert v+(-v)rVertlelVert vrVert+lVert-vrVert<0$, a contradiction, so the norm is definitely non-negative. The equivalency $lVert vrVert=0Leftrightarrow v=0$ then follows from the first property as $lVert0rVert=lVertlambda0rVert=lvertlambdarvertlVert0rVert$ for all $lambdainmathbb{R}$ and hence $lVert0rVert=0$.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                Let $V$ be an $mathbb{R}$-vector space. A norm is a mapping $lVertcdotrVertcolon Vrightarrowmathbb{R}$, satisfying the following properties. For all $v,win V$, you have the triangle inequality $lVert v+wrVertlelVert vrVert+lVert wrVert$. For all $lambdainmathbb{R},vin V$ you have absolute homogenity, i.e. $lVert lambda vrVert=lvertlambdavertlVert vrVert$. Then we require either of the following properties:





                • $lVert vrVert=0Rightarrow v=0$ for $vin V$,


                • $lVert vrVertge0$ for all $vin V$ with equality iff $v=0$.


                I've seen either of these two properties be referred to as positive-definiteness, so I won't name them. The second property trivially implies the former property. For the other direction, notice that if $lVert vrVert<0$ for some $vin V$, you would - by absolute homogenity - have $lVert-vrVert=lvert-1rvertlVert vrVert=lVert vrVert<0$ and then - by the triangle inequality - $0=lVert0rVert=lVert v+(-v)rVertlelVert vrVert+lVert-vrVert<0$, a contradiction, so the norm is definitely non-negative. The equivalency $lVert vrVert=0Leftrightarrow v=0$ then follows from the first property as $lVert0rVert=lVertlambda0rVert=lvertlambdarvertlVert0rVert$ for all $lambdainmathbb{R}$ and hence $lVert0rVert=0$.






                share|cite|improve this answer









                $endgroup$



                Let $V$ be an $mathbb{R}$-vector space. A norm is a mapping $lVertcdotrVertcolon Vrightarrowmathbb{R}$, satisfying the following properties. For all $v,win V$, you have the triangle inequality $lVert v+wrVertlelVert vrVert+lVert wrVert$. For all $lambdainmathbb{R},vin V$ you have absolute homogenity, i.e. $lVert lambda vrVert=lvertlambdavertlVert vrVert$. Then we require either of the following properties:





                • $lVert vrVert=0Rightarrow v=0$ for $vin V$,


                • $lVert vrVertge0$ for all $vin V$ with equality iff $v=0$.


                I've seen either of these two properties be referred to as positive-definiteness, so I won't name them. The second property trivially implies the former property. For the other direction, notice that if $lVert vrVert<0$ for some $vin V$, you would - by absolute homogenity - have $lVert-vrVert=lvert-1rvertlVert vrVert=lVert vrVert<0$ and then - by the triangle inequality - $0=lVert0rVert=lVert v+(-v)rVertlelVert vrVert+lVert-vrVert<0$, a contradiction, so the norm is definitely non-negative. The equivalency $lVert vrVert=0Leftrightarrow v=0$ then follows from the first property as $lVert0rVert=lVertlambda0rVert=lvertlambdarvertlVert0rVert$ for all $lambdainmathbb{R}$ and hence $lVert0rVert=0$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 19 at 13:05









                ThorgottThorgott

                600314




                600314






























                    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%2f3079325%2fis-one-norm-property-pv-0-iff-v-0-or-positive-definiteness%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

                    Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

                    Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

                    A Topological Invariant for $pi_3(U(n))$