Proof: If $lambda$ is an eigenvalue of $A$ and $x$ is a corresponding eigenvector, then $sAx=slambda x$ for...











up vote
0
down vote

favorite












It's fairly straight forward to multiple $s$ on both sides of $Ax=lambda x$, for $x$ is not the $0$ vector. How do you go about showing that $sAx=slambda x$ holds true for every $s$ scalar?



I'm thinking of 3 scenarios, when $s=0, s<0, and s>0$.




  • When $s=0, 0Ax = 0lambda x$, this is valid since $x$ is not the $0$ vector to hold true.


  • When $s>0, sAx = slambda x$, which is scalar multiplication and is valid.


  • When $s<0, -sAx = -slambda x$ is equivalent to $sAx = slambda x$.



Is this enough to show the above statement is true for every scalar $s$?



Thank you










share|cite|improve this question
























  • You don't have to consider $0$, positive and negative values separately. For any scalar $s$, $sAx=s(Ax)$.
    – John Douma
    yesterday










  • If you have two equals things, just apply the same operation to both sides
    – Blumer
    yesterday










  • Doesn't this just follow from the fact that $Ax = lambda x$ by the definition of eigenvalues/eigenvectors, and then you could just multiply on the left by the scalar without a problem since they're equivalent?
    – Eevee Trainer
    yesterday






  • 1




    This is trivial the way you wrote the title, as you suggested (gollows from propertues of matrix multiplication). The question likely is to show that if $x $ is an eigenvector corresponding to eigenvalue $lambda $ then $sx $ is also an eigenvector of $A$ correspond to the same eigenvalue (for non-zero $s $).
    – AnyAD
    yesterday















up vote
0
down vote

favorite












It's fairly straight forward to multiple $s$ on both sides of $Ax=lambda x$, for $x$ is not the $0$ vector. How do you go about showing that $sAx=slambda x$ holds true for every $s$ scalar?



I'm thinking of 3 scenarios, when $s=0, s<0, and s>0$.




  • When $s=0, 0Ax = 0lambda x$, this is valid since $x$ is not the $0$ vector to hold true.


  • When $s>0, sAx = slambda x$, which is scalar multiplication and is valid.


  • When $s<0, -sAx = -slambda x$ is equivalent to $sAx = slambda x$.



Is this enough to show the above statement is true for every scalar $s$?



Thank you










share|cite|improve this question
























  • You don't have to consider $0$, positive and negative values separately. For any scalar $s$, $sAx=s(Ax)$.
    – John Douma
    yesterday










  • If you have two equals things, just apply the same operation to both sides
    – Blumer
    yesterday










  • Doesn't this just follow from the fact that $Ax = lambda x$ by the definition of eigenvalues/eigenvectors, and then you could just multiply on the left by the scalar without a problem since they're equivalent?
    – Eevee Trainer
    yesterday






  • 1




    This is trivial the way you wrote the title, as you suggested (gollows from propertues of matrix multiplication). The question likely is to show that if $x $ is an eigenvector corresponding to eigenvalue $lambda $ then $sx $ is also an eigenvector of $A$ correspond to the same eigenvalue (for non-zero $s $).
    – AnyAD
    yesterday













up vote
0
down vote

favorite









up vote
0
down vote

favorite











It's fairly straight forward to multiple $s$ on both sides of $Ax=lambda x$, for $x$ is not the $0$ vector. How do you go about showing that $sAx=slambda x$ holds true for every $s$ scalar?



I'm thinking of 3 scenarios, when $s=0, s<0, and s>0$.




  • When $s=0, 0Ax = 0lambda x$, this is valid since $x$ is not the $0$ vector to hold true.


  • When $s>0, sAx = slambda x$, which is scalar multiplication and is valid.


  • When $s<0, -sAx = -slambda x$ is equivalent to $sAx = slambda x$.



Is this enough to show the above statement is true for every scalar $s$?



Thank you










share|cite|improve this question















It's fairly straight forward to multiple $s$ on both sides of $Ax=lambda x$, for $x$ is not the $0$ vector. How do you go about showing that $sAx=slambda x$ holds true for every $s$ scalar?



I'm thinking of 3 scenarios, when $s=0, s<0, and s>0$.




  • When $s=0, 0Ax = 0lambda x$, this is valid since $x$ is not the $0$ vector to hold true.


  • When $s>0, sAx = slambda x$, which is scalar multiplication and is valid.


  • When $s<0, -sAx = -slambda x$ is equivalent to $sAx = slambda x$.



Is this enough to show the above statement is true for every scalar $s$?



Thank you







linear-algebra proof-writing eigenvalues-eigenvectors






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday









Eevee Trainer

97111




97111










asked yesterday









noobcoder

134




134












  • You don't have to consider $0$, positive and negative values separately. For any scalar $s$, $sAx=s(Ax)$.
    – John Douma
    yesterday










  • If you have two equals things, just apply the same operation to both sides
    – Blumer
    yesterday










  • Doesn't this just follow from the fact that $Ax = lambda x$ by the definition of eigenvalues/eigenvectors, and then you could just multiply on the left by the scalar without a problem since they're equivalent?
    – Eevee Trainer
    yesterday






  • 1




    This is trivial the way you wrote the title, as you suggested (gollows from propertues of matrix multiplication). The question likely is to show that if $x $ is an eigenvector corresponding to eigenvalue $lambda $ then $sx $ is also an eigenvector of $A$ correspond to the same eigenvalue (for non-zero $s $).
    – AnyAD
    yesterday


















  • You don't have to consider $0$, positive and negative values separately. For any scalar $s$, $sAx=s(Ax)$.
    – John Douma
    yesterday










  • If you have two equals things, just apply the same operation to both sides
    – Blumer
    yesterday










  • Doesn't this just follow from the fact that $Ax = lambda x$ by the definition of eigenvalues/eigenvectors, and then you could just multiply on the left by the scalar without a problem since they're equivalent?
    – Eevee Trainer
    yesterday






  • 1




    This is trivial the way you wrote the title, as you suggested (gollows from propertues of matrix multiplication). The question likely is to show that if $x $ is an eigenvector corresponding to eigenvalue $lambda $ then $sx $ is also an eigenvector of $A$ correspond to the same eigenvalue (for non-zero $s $).
    – AnyAD
    yesterday
















You don't have to consider $0$, positive and negative values separately. For any scalar $s$, $sAx=s(Ax)$.
– John Douma
yesterday




You don't have to consider $0$, positive and negative values separately. For any scalar $s$, $sAx=s(Ax)$.
– John Douma
yesterday












If you have two equals things, just apply the same operation to both sides
– Blumer
yesterday




If you have two equals things, just apply the same operation to both sides
– Blumer
yesterday












Doesn't this just follow from the fact that $Ax = lambda x$ by the definition of eigenvalues/eigenvectors, and then you could just multiply on the left by the scalar without a problem since they're equivalent?
– Eevee Trainer
yesterday




Doesn't this just follow from the fact that $Ax = lambda x$ by the definition of eigenvalues/eigenvectors, and then you could just multiply on the left by the scalar without a problem since they're equivalent?
– Eevee Trainer
yesterday




1




1




This is trivial the way you wrote the title, as you suggested (gollows from propertues of matrix multiplication). The question likely is to show that if $x $ is an eigenvector corresponding to eigenvalue $lambda $ then $sx $ is also an eigenvector of $A$ correspond to the same eigenvalue (for non-zero $s $).
– AnyAD
yesterday




This is trivial the way you wrote the title, as you suggested (gollows from propertues of matrix multiplication). The question likely is to show that if $x $ is an eigenvector corresponding to eigenvalue $lambda $ then $sx $ is also an eigenvector of $A$ correspond to the same eigenvalue (for non-zero $s $).
– AnyAD
yesterday










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Since $lambda$ is an eigenvalue with corresponding eigenvector $x$ we have $$Ax = lambda x$$



Note that $Ax$ and $lambda x$ are identical vectors and scalar multiplication is a well defined operator therefore for every scalar $s$ you get $sAx=slambda x$



More interesting is the fact that $$A(sx)=lambda (sx) $$ which is part of the proof for eigen space generated by $x$






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: 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%2f3006972%2fproof-if-lambda-is-an-eigenvalue-of-a-and-x-is-a-corresponding-eigenvect%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








    up vote
    0
    down vote













    Since $lambda$ is an eigenvalue with corresponding eigenvector $x$ we have $$Ax = lambda x$$



    Note that $Ax$ and $lambda x$ are identical vectors and scalar multiplication is a well defined operator therefore for every scalar $s$ you get $sAx=slambda x$



    More interesting is the fact that $$A(sx)=lambda (sx) $$ which is part of the proof for eigen space generated by $x$






    share|cite|improve this answer

























      up vote
      0
      down vote













      Since $lambda$ is an eigenvalue with corresponding eigenvector $x$ we have $$Ax = lambda x$$



      Note that $Ax$ and $lambda x$ are identical vectors and scalar multiplication is a well defined operator therefore for every scalar $s$ you get $sAx=slambda x$



      More interesting is the fact that $$A(sx)=lambda (sx) $$ which is part of the proof for eigen space generated by $x$






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        Since $lambda$ is an eigenvalue with corresponding eigenvector $x$ we have $$Ax = lambda x$$



        Note that $Ax$ and $lambda x$ are identical vectors and scalar multiplication is a well defined operator therefore for every scalar $s$ you get $sAx=slambda x$



        More interesting is the fact that $$A(sx)=lambda (sx) $$ which is part of the proof for eigen space generated by $x$






        share|cite|improve this answer












        Since $lambda$ is an eigenvalue with corresponding eigenvector $x$ we have $$Ax = lambda x$$



        Note that $Ax$ and $lambda x$ are identical vectors and scalar multiplication is a well defined operator therefore for every scalar $s$ you get $sAx=slambda x$



        More interesting is the fact that $$A(sx)=lambda (sx) $$ which is part of the proof for eigen space generated by $x$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered yesterday









        Mohammad Riazi-Kermani

        40.2k41958




        40.2k41958






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3006972%2fproof-if-lambda-is-an-eigenvalue-of-a-and-x-is-a-corresponding-eigenvect%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

            Berounka

            Sphinx de Gizeh

            Different font size/position of beamer's navigation symbols template's content depending on regular/plain...