Maximal eigenvalue is a convex function. Why?

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











up vote
3
down vote

favorite












Let $A$ be a symmetric real matrix. Let $f(A)=lambda_max(A)$ be its largest eigenvalue. Why is $f$ convex?







share|cite|improve this question






















  • What is your definition of convex function?
    – Matthew Leingang
    Jun 17 '15 at 17:41






  • 2




    This follows from the min-max theorem
    – Omnomnomnom
    Jun 17 '15 at 17:44










  • More generally one has the Weyl inequalities, see en.wikipedia.org/wiki/…. And then, there is the Horn problem ...
    – orangeskid
    Jun 18 '15 at 7:07














up vote
3
down vote

favorite












Let $A$ be a symmetric real matrix. Let $f(A)=lambda_max(A)$ be its largest eigenvalue. Why is $f$ convex?







share|cite|improve this question






















  • What is your definition of convex function?
    – Matthew Leingang
    Jun 17 '15 at 17:41






  • 2




    This follows from the min-max theorem
    – Omnomnomnom
    Jun 17 '15 at 17:44










  • More generally one has the Weyl inequalities, see en.wikipedia.org/wiki/…. And then, there is the Horn problem ...
    – orangeskid
    Jun 18 '15 at 7:07












up vote
3
down vote

favorite









up vote
3
down vote

favorite











Let $A$ be a symmetric real matrix. Let $f(A)=lambda_max(A)$ be its largest eigenvalue. Why is $f$ convex?







share|cite|improve this question














Let $A$ be a symmetric real matrix. Let $f(A)=lambda_max(A)$ be its largest eigenvalue. Why is $f$ convex?









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 22 at 5:37









Rodrigo de Azevedo

12.6k41751




12.6k41751










asked Jun 17 '15 at 17:39









Polaris

386




386











  • What is your definition of convex function?
    – Matthew Leingang
    Jun 17 '15 at 17:41






  • 2




    This follows from the min-max theorem
    – Omnomnomnom
    Jun 17 '15 at 17:44










  • More generally one has the Weyl inequalities, see en.wikipedia.org/wiki/…. And then, there is the Horn problem ...
    – orangeskid
    Jun 18 '15 at 7:07
















  • What is your definition of convex function?
    – Matthew Leingang
    Jun 17 '15 at 17:41






  • 2




    This follows from the min-max theorem
    – Omnomnomnom
    Jun 17 '15 at 17:44










  • More generally one has the Weyl inequalities, see en.wikipedia.org/wiki/…. And then, there is the Horn problem ...
    – orangeskid
    Jun 18 '15 at 7:07















What is your definition of convex function?
– Matthew Leingang
Jun 17 '15 at 17:41




What is your definition of convex function?
– Matthew Leingang
Jun 17 '15 at 17:41




2




2




This follows from the min-max theorem
– Omnomnomnom
Jun 17 '15 at 17:44




This follows from the min-max theorem
– Omnomnomnom
Jun 17 '15 at 17:44












More generally one has the Weyl inequalities, see en.wikipedia.org/wiki/…. And then, there is the Horn problem ...
– orangeskid
Jun 18 '15 at 7:07




More generally one has the Weyl inequalities, see en.wikipedia.org/wiki/…. And then, there is the Horn problem ...
– orangeskid
Jun 18 '15 at 7:07










3 Answers
3






active

oldest

votes

















up vote
2
down vote













HINT:



$f(A) I - Asucceq 0$, $f(B) I - B succeq 0$ implies $(lambda f(A) + (1- lambda) f(B))I - ( lambda A + (1-lambda) B) succeq 0$






share|cite|improve this answer




















  • Just Courant-Fischer in disguise
    – orangeskid
    Jun 18 '15 at 7:10

















up vote
1
down vote













we have that $lambda_max(A)=textmint: tgeq h, hin S(A)$ where $S(A)=h:hgeq langle A, xx^Trangle text , forall x in R^n text and x^Tx=1$.
The set $S(A)$ is convex. This is a convex function since min is a convex function on a convex set. So the function is convex.






share|cite|improve this answer






















  • Thank you. I edited the answer.
    – user85361
    Jun 17 '15 at 19:47

















up vote
1
down vote













$f(A) = sup_x x^T Ax$, and a supremum of convex functions is convex.



(For a given $x$, the function $A mapsto x^TAx$ is linear, hence convex.)






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%2f1329189%2fmaximal-eigenvalue-is-a-convex-function-why%23new-answer', 'question_page');

    );

    Post as a guest






























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    2
    down vote













    HINT:



    $f(A) I - Asucceq 0$, $f(B) I - B succeq 0$ implies $(lambda f(A) + (1- lambda) f(B))I - ( lambda A + (1-lambda) B) succeq 0$






    share|cite|improve this answer




















    • Just Courant-Fischer in disguise
      – orangeskid
      Jun 18 '15 at 7:10














    up vote
    2
    down vote













    HINT:



    $f(A) I - Asucceq 0$, $f(B) I - B succeq 0$ implies $(lambda f(A) + (1- lambda) f(B))I - ( lambda A + (1-lambda) B) succeq 0$






    share|cite|improve this answer




















    • Just Courant-Fischer in disguise
      – orangeskid
      Jun 18 '15 at 7:10












    up vote
    2
    down vote










    up vote
    2
    down vote









    HINT:



    $f(A) I - Asucceq 0$, $f(B) I - B succeq 0$ implies $(lambda f(A) + (1- lambda) f(B))I - ( lambda A + (1-lambda) B) succeq 0$






    share|cite|improve this answer












    HINT:



    $f(A) I - Asucceq 0$, $f(B) I - B succeq 0$ implies $(lambda f(A) + (1- lambda) f(B))I - ( lambda A + (1-lambda) B) succeq 0$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Jun 18 '15 at 7:05









    orangeskid

    28.1k31746




    28.1k31746











    • Just Courant-Fischer in disguise
      – orangeskid
      Jun 18 '15 at 7:10
















    • Just Courant-Fischer in disguise
      – orangeskid
      Jun 18 '15 at 7:10















    Just Courant-Fischer in disguise
    – orangeskid
    Jun 18 '15 at 7:10




    Just Courant-Fischer in disguise
    – orangeskid
    Jun 18 '15 at 7:10










    up vote
    1
    down vote













    we have that $lambda_max(A)=textmint: tgeq h, hin S(A)$ where $S(A)=h:hgeq langle A, xx^Trangle text , forall x in R^n text and x^Tx=1$.
    The set $S(A)$ is convex. This is a convex function since min is a convex function on a convex set. So the function is convex.






    share|cite|improve this answer






















    • Thank you. I edited the answer.
      – user85361
      Jun 17 '15 at 19:47














    up vote
    1
    down vote













    we have that $lambda_max(A)=textmint: tgeq h, hin S(A)$ where $S(A)=h:hgeq langle A, xx^Trangle text , forall x in R^n text and x^Tx=1$.
    The set $S(A)$ is convex. This is a convex function since min is a convex function on a convex set. So the function is convex.






    share|cite|improve this answer






















    • Thank you. I edited the answer.
      – user85361
      Jun 17 '15 at 19:47












    up vote
    1
    down vote










    up vote
    1
    down vote









    we have that $lambda_max(A)=textmint: tgeq h, hin S(A)$ where $S(A)=h:hgeq langle A, xx^Trangle text , forall x in R^n text and x^Tx=1$.
    The set $S(A)$ is convex. This is a convex function since min is a convex function on a convex set. So the function is convex.






    share|cite|improve this answer














    we have that $lambda_max(A)=textmint: tgeq h, hin S(A)$ where $S(A)=h:hgeq langle A, xx^Trangle text , forall x in R^n text and x^Tx=1$.
    The set $S(A)$ is convex. This is a convex function since min is a convex function on a convex set. So the function is convex.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Aug 22 at 5:25









    Laurent Lessard

    1,4231212




    1,4231212










    answered Jun 17 '15 at 17:55









    user85361

    341215




    341215











    • Thank you. I edited the answer.
      – user85361
      Jun 17 '15 at 19:47
















    • Thank you. I edited the answer.
      – user85361
      Jun 17 '15 at 19:47















    Thank you. I edited the answer.
    – user85361
    Jun 17 '15 at 19:47




    Thank you. I edited the answer.
    – user85361
    Jun 17 '15 at 19:47










    up vote
    1
    down vote













    $f(A) = sup_x x^T Ax$, and a supremum of convex functions is convex.



    (For a given $x$, the function $A mapsto x^TAx$ is linear, hence convex.)






    share|cite|improve this answer


























      up vote
      1
      down vote













      $f(A) = sup_x x^T Ax$, and a supremum of convex functions is convex.



      (For a given $x$, the function $A mapsto x^TAx$ is linear, hence convex.)






      share|cite|improve this answer
























        up vote
        1
        down vote










        up vote
        1
        down vote









        $f(A) = sup_x x^T Ax$, and a supremum of convex functions is convex.



        (For a given $x$, the function $A mapsto x^TAx$ is linear, hence convex.)






        share|cite|improve this answer














        $f(A) = sup_x x^T Ax$, and a supremum of convex functions is convex.



        (For a given $x$, the function $A mapsto x^TAx$ is linear, hence convex.)







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Aug 26 at 17:04

























        answered Aug 22 at 5:55









        littleO

        26.3k540102




        26.3k540102






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1329189%2fmaximal-eigenvalue-is-a-convex-function-why%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            tkz-euclide: tkzDrawCircle[R] not working

            How to combine Bézier curves to a surface?

            1st Magritte Awards