How to prove positive semi-definiteness or integral inequality

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
4
down vote

favorite












I am trying to show that the following matrix is positive semi-definite (PSD):



$$H=left[beginarraycc
int v(x),dx & int xv(x),dx\
int xv(x),dx & int x^2v(x),dx
endarrayright]$$



where $v(x)$ is a differentiable function of unknown sign.



The definition of PSD requires that for all $w,z in mathbbR$, $$w^2 int v(x)dx + 2wzleft(int xv(x),dxright)^2+z^2int x^2v(x),dx geq 0$$



Even if I assume $v(x) geq 0$ (I have $xgeq0$), it doesn't look like Holder's inequality is useful to get to the desired result.



Alternatively, assuming that $int v(x) dx geq 0$, I tried proving that the determinant of $H$ is positive, but that did not lead anywhere either.



Are there any other avenues?







share|cite|improve this question






















  • math.stackexchange.com/questions/2843125/a-is-invertible-matrix/…
    – Mike Earnest
    Aug 8 at 16:39














up vote
4
down vote

favorite












I am trying to show that the following matrix is positive semi-definite (PSD):



$$H=left[beginarraycc
int v(x),dx & int xv(x),dx\
int xv(x),dx & int x^2v(x),dx
endarrayright]$$



where $v(x)$ is a differentiable function of unknown sign.



The definition of PSD requires that for all $w,z in mathbbR$, $$w^2 int v(x)dx + 2wzleft(int xv(x),dxright)^2+z^2int x^2v(x),dx geq 0$$



Even if I assume $v(x) geq 0$ (I have $xgeq0$), it doesn't look like Holder's inequality is useful to get to the desired result.



Alternatively, assuming that $int v(x) dx geq 0$, I tried proving that the determinant of $H$ is positive, but that did not lead anywhere either.



Are there any other avenues?







share|cite|improve this question






















  • math.stackexchange.com/questions/2843125/a-is-invertible-matrix/…
    – Mike Earnest
    Aug 8 at 16:39












up vote
4
down vote

favorite









up vote
4
down vote

favorite











I am trying to show that the following matrix is positive semi-definite (PSD):



$$H=left[beginarraycc
int v(x),dx & int xv(x),dx\
int xv(x),dx & int x^2v(x),dx
endarrayright]$$



where $v(x)$ is a differentiable function of unknown sign.



The definition of PSD requires that for all $w,z in mathbbR$, $$w^2 int v(x)dx + 2wzleft(int xv(x),dxright)^2+z^2int x^2v(x),dx geq 0$$



Even if I assume $v(x) geq 0$ (I have $xgeq0$), it doesn't look like Holder's inequality is useful to get to the desired result.



Alternatively, assuming that $int v(x) dx geq 0$, I tried proving that the determinant of $H$ is positive, but that did not lead anywhere either.



Are there any other avenues?







share|cite|improve this question














I am trying to show that the following matrix is positive semi-definite (PSD):



$$H=left[beginarraycc
int v(x),dx & int xv(x),dx\
int xv(x),dx & int x^2v(x),dx
endarrayright]$$



where $v(x)$ is a differentiable function of unknown sign.



The definition of PSD requires that for all $w,z in mathbbR$, $$w^2 int v(x)dx + 2wzleft(int xv(x),dxright)^2+z^2int x^2v(x),dx geq 0$$



Even if I assume $v(x) geq 0$ (I have $xgeq0$), it doesn't look like Holder's inequality is useful to get to the desired result.



Alternatively, assuming that $int v(x) dx geq 0$, I tried proving that the determinant of $H$ is positive, but that did not lead anywhere either.



Are there any other avenues?









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 8 at 16:33









Robert Howard

1,331620




1,331620










asked Aug 8 at 16:16









George Georgiadis

368




368











  • math.stackexchange.com/questions/2843125/a-is-invertible-matrix/…
    – Mike Earnest
    Aug 8 at 16:39
















  • math.stackexchange.com/questions/2843125/a-is-invertible-matrix/…
    – Mike Earnest
    Aug 8 at 16:39















math.stackexchange.com/questions/2843125/a-is-invertible-matrix/…
– Mike Earnest
Aug 8 at 16:39




math.stackexchange.com/questions/2843125/a-is-invertible-matrix/…
– Mike Earnest
Aug 8 at 16:39










1 Answer
1






active

oldest

votes

















up vote
4
down vote













A way to verify that a matrix is PSD is the to test that the determinants of all upper-left sub-matrices are non negative.



This is true for the first sub-matrix if you assume $int v(x) dxge0$.



For the second one you need to have $$left(int v(x) dxright)left(int x^2v(x) dxright)ge left(int xv(x) dxright)^2$$ which is Cauchy-Schwarz inequality for the inner product $langle f,g rangle = int fg$ with $f(x) = sqrtv(x)$ and $g(x)=xsqrtv(x)$ providing those functions are well defined. Which is the case if $v$ is supposed non negative.






share|cite|improve this answer




















    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',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2876280%2fhow-to-prove-positive-semi-definiteness-or-integral-inequality%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    4
    down vote













    A way to verify that a matrix is PSD is the to test that the determinants of all upper-left sub-matrices are non negative.



    This is true for the first sub-matrix if you assume $int v(x) dxge0$.



    For the second one you need to have $$left(int v(x) dxright)left(int x^2v(x) dxright)ge left(int xv(x) dxright)^2$$ which is Cauchy-Schwarz inequality for the inner product $langle f,g rangle = int fg$ with $f(x) = sqrtv(x)$ and $g(x)=xsqrtv(x)$ providing those functions are well defined. Which is the case if $v$ is supposed non negative.






    share|cite|improve this answer
























      up vote
      4
      down vote













      A way to verify that a matrix is PSD is the to test that the determinants of all upper-left sub-matrices are non negative.



      This is true for the first sub-matrix if you assume $int v(x) dxge0$.



      For the second one you need to have $$left(int v(x) dxright)left(int x^2v(x) dxright)ge left(int xv(x) dxright)^2$$ which is Cauchy-Schwarz inequality for the inner product $langle f,g rangle = int fg$ with $f(x) = sqrtv(x)$ and $g(x)=xsqrtv(x)$ providing those functions are well defined. Which is the case if $v$ is supposed non negative.






      share|cite|improve this answer






















        up vote
        4
        down vote










        up vote
        4
        down vote









        A way to verify that a matrix is PSD is the to test that the determinants of all upper-left sub-matrices are non negative.



        This is true for the first sub-matrix if you assume $int v(x) dxge0$.



        For the second one you need to have $$left(int v(x) dxright)left(int x^2v(x) dxright)ge left(int xv(x) dxright)^2$$ which is Cauchy-Schwarz inequality for the inner product $langle f,g rangle = int fg$ with $f(x) = sqrtv(x)$ and $g(x)=xsqrtv(x)$ providing those functions are well defined. Which is the case if $v$ is supposed non negative.






        share|cite|improve this answer












        A way to verify that a matrix is PSD is the to test that the determinants of all upper-left sub-matrices are non negative.



        This is true for the first sub-matrix if you assume $int v(x) dxge0$.



        For the second one you need to have $$left(int v(x) dxright)left(int x^2v(x) dxright)ge left(int xv(x) dxright)^2$$ which is Cauchy-Schwarz inequality for the inner product $langle f,g rangle = int fg$ with $f(x) = sqrtv(x)$ and $g(x)=xsqrtv(x)$ providing those functions are well defined. Which is the case if $v$ is supposed non negative.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 8 at 16:36









        mathcounterexamples.net

        24.7k21653




        24.7k21653






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2876280%2fhow-to-prove-positive-semi-definiteness-or-integral-inequality%23new-answer', 'question_page');

            );

            Post as a guest