Have I proven that every matrix is symmetric?












2












$begingroup$


I've been given this as an assignment:



"From definitions of different classes of matrices, prove the following claims:



A) Positive => Symmetric…"



There is also a hint: If $<Au,u> = <Bu,u>$ for all $u$, then $A=B$.



The definitions have been given: A matrix is symmetric if $A^*=A$ and positive if $<Au,u>$ is positive for all $u$. The adjugate $A^*$ is defined as the matrix which satisfies $<Ax,y>=<x,A^*y>$.



I tried this:



$$<Au,u>=<u,A^*u>$$



The inner product is commutative, so:



$$<Au,u>=<A^*u,u>$$



So using the hint:



$$A^*=A$$



But for this proof, I didn't need the matrix $A$ to be positive. I seem to have proven that every matrix is symmetric. This probably isn't true, so what was my mistake?










share|cite|improve this question











$endgroup$








  • 6




    $begingroup$
    Two matrices $A$ and $B$ satisfying $langle Au, urangle = langle Bu, urangle$ for all vectors $u$ do not need to be equal. Compare rotation by 90 degrees and the zero matrix.
    $endgroup$
    – T. Bongers
    Dec 2 '18 at 22:24
















2












$begingroup$


I've been given this as an assignment:



"From definitions of different classes of matrices, prove the following claims:



A) Positive => Symmetric…"



There is also a hint: If $<Au,u> = <Bu,u>$ for all $u$, then $A=B$.



The definitions have been given: A matrix is symmetric if $A^*=A$ and positive if $<Au,u>$ is positive for all $u$. The adjugate $A^*$ is defined as the matrix which satisfies $<Ax,y>=<x,A^*y>$.



I tried this:



$$<Au,u>=<u,A^*u>$$



The inner product is commutative, so:



$$<Au,u>=<A^*u,u>$$



So using the hint:



$$A^*=A$$



But for this proof, I didn't need the matrix $A$ to be positive. I seem to have proven that every matrix is symmetric. This probably isn't true, so what was my mistake?










share|cite|improve this question











$endgroup$








  • 6




    $begingroup$
    Two matrices $A$ and $B$ satisfying $langle Au, urangle = langle Bu, urangle$ for all vectors $u$ do not need to be equal. Compare rotation by 90 degrees and the zero matrix.
    $endgroup$
    – T. Bongers
    Dec 2 '18 at 22:24














2












2








2





$begingroup$


I've been given this as an assignment:



"From definitions of different classes of matrices, prove the following claims:



A) Positive => Symmetric…"



There is also a hint: If $<Au,u> = <Bu,u>$ for all $u$, then $A=B$.



The definitions have been given: A matrix is symmetric if $A^*=A$ and positive if $<Au,u>$ is positive for all $u$. The adjugate $A^*$ is defined as the matrix which satisfies $<Ax,y>=<x,A^*y>$.



I tried this:



$$<Au,u>=<u,A^*u>$$



The inner product is commutative, so:



$$<Au,u>=<A^*u,u>$$



So using the hint:



$$A^*=A$$



But for this proof, I didn't need the matrix $A$ to be positive. I seem to have proven that every matrix is symmetric. This probably isn't true, so what was my mistake?










share|cite|improve this question











$endgroup$




I've been given this as an assignment:



"From definitions of different classes of matrices, prove the following claims:



A) Positive => Symmetric…"



There is also a hint: If $<Au,u> = <Bu,u>$ for all $u$, then $A=B$.



The definitions have been given: A matrix is symmetric if $A^*=A$ and positive if $<Au,u>$ is positive for all $u$. The adjugate $A^*$ is defined as the matrix which satisfies $<Ax,y>=<x,A^*y>$.



I tried this:



$$<Au,u>=<u,A^*u>$$



The inner product is commutative, so:



$$<Au,u>=<A^*u,u>$$



So using the hint:



$$A^*=A$$



But for this proof, I didn't need the matrix $A$ to be positive. I seem to have proven that every matrix is symmetric. This probably isn't true, so what was my mistake?







linear-algebra symmetric-matrices






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 2 '18 at 22:30







S. Rotos

















asked Dec 2 '18 at 22:22









S. RotosS. Rotos

1624




1624








  • 6




    $begingroup$
    Two matrices $A$ and $B$ satisfying $langle Au, urangle = langle Bu, urangle$ for all vectors $u$ do not need to be equal. Compare rotation by 90 degrees and the zero matrix.
    $endgroup$
    – T. Bongers
    Dec 2 '18 at 22:24














  • 6




    $begingroup$
    Two matrices $A$ and $B$ satisfying $langle Au, urangle = langle Bu, urangle$ for all vectors $u$ do not need to be equal. Compare rotation by 90 degrees and the zero matrix.
    $endgroup$
    – T. Bongers
    Dec 2 '18 at 22:24








6




6




$begingroup$
Two matrices $A$ and $B$ satisfying $langle Au, urangle = langle Bu, urangle$ for all vectors $u$ do not need to be equal. Compare rotation by 90 degrees and the zero matrix.
$endgroup$
– T. Bongers
Dec 2 '18 at 22:24




$begingroup$
Two matrices $A$ and $B$ satisfying $langle Au, urangle = langle Bu, urangle$ for all vectors $u$ do not need to be equal. Compare rotation by 90 degrees and the zero matrix.
$endgroup$
– T. Bongers
Dec 2 '18 at 22:24










1 Answer
1






active

oldest

votes


















2












$begingroup$

There's a straightforward way to figure out what went wrong in a situation like this, when you prove a statement you know is false. You find a counterexample to the statement you know is false, and substitute the counterexample into your proof to figure out when you first wrote down a false statement about your counterexample.



So: it's clearly false that every matrix is symmetric. For example, the matrix $A = left[ begin{array}{cc} 0 & 1 \ 0 & 0 end{array} right]$ isn't symmetric. So what happens when you put it into your proof? It's true that



$$langle Au, u rangle = A^{ast} u, u rangle$$



for all $u in mathbb{R}^2$; explicitly, if $u = (x, y)$, then both sides are equal to $xy$. However, it's not true that $A = A^{ast}$, since $A^{ast} = left[ begin{array}{cc} 0 & 0 \ 1 & 0 end{array} right]$. So the hint is false. That's all.





That was straightforward. Here are some facts which are also true but which are less straightforward. If $langle Au, u rangle = langle Bu, u rangle$ all you can conclude is that $A - B$ is skew-symmetric, which is the case above. It's also false that positive matrices are symmetric, with the given definitions. (The correct definition, to my mind, is that positive should only be applied to symmetric matrices.)






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%2f3023302%2fhave-i-proven-that-every-matrix-is-symmetric%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









    2












    $begingroup$

    There's a straightforward way to figure out what went wrong in a situation like this, when you prove a statement you know is false. You find a counterexample to the statement you know is false, and substitute the counterexample into your proof to figure out when you first wrote down a false statement about your counterexample.



    So: it's clearly false that every matrix is symmetric. For example, the matrix $A = left[ begin{array}{cc} 0 & 1 \ 0 & 0 end{array} right]$ isn't symmetric. So what happens when you put it into your proof? It's true that



    $$langle Au, u rangle = A^{ast} u, u rangle$$



    for all $u in mathbb{R}^2$; explicitly, if $u = (x, y)$, then both sides are equal to $xy$. However, it's not true that $A = A^{ast}$, since $A^{ast} = left[ begin{array}{cc} 0 & 0 \ 1 & 0 end{array} right]$. So the hint is false. That's all.





    That was straightforward. Here are some facts which are also true but which are less straightforward. If $langle Au, u rangle = langle Bu, u rangle$ all you can conclude is that $A - B$ is skew-symmetric, which is the case above. It's also false that positive matrices are symmetric, with the given definitions. (The correct definition, to my mind, is that positive should only be applied to symmetric matrices.)






    share|cite|improve this answer











    $endgroup$


















      2












      $begingroup$

      There's a straightforward way to figure out what went wrong in a situation like this, when you prove a statement you know is false. You find a counterexample to the statement you know is false, and substitute the counterexample into your proof to figure out when you first wrote down a false statement about your counterexample.



      So: it's clearly false that every matrix is symmetric. For example, the matrix $A = left[ begin{array}{cc} 0 & 1 \ 0 & 0 end{array} right]$ isn't symmetric. So what happens when you put it into your proof? It's true that



      $$langle Au, u rangle = A^{ast} u, u rangle$$



      for all $u in mathbb{R}^2$; explicitly, if $u = (x, y)$, then both sides are equal to $xy$. However, it's not true that $A = A^{ast}$, since $A^{ast} = left[ begin{array}{cc} 0 & 0 \ 1 & 0 end{array} right]$. So the hint is false. That's all.





      That was straightforward. Here are some facts which are also true but which are less straightforward. If $langle Au, u rangle = langle Bu, u rangle$ all you can conclude is that $A - B$ is skew-symmetric, which is the case above. It's also false that positive matrices are symmetric, with the given definitions. (The correct definition, to my mind, is that positive should only be applied to symmetric matrices.)






      share|cite|improve this answer











      $endgroup$
















        2












        2








        2





        $begingroup$

        There's a straightforward way to figure out what went wrong in a situation like this, when you prove a statement you know is false. You find a counterexample to the statement you know is false, and substitute the counterexample into your proof to figure out when you first wrote down a false statement about your counterexample.



        So: it's clearly false that every matrix is symmetric. For example, the matrix $A = left[ begin{array}{cc} 0 & 1 \ 0 & 0 end{array} right]$ isn't symmetric. So what happens when you put it into your proof? It's true that



        $$langle Au, u rangle = A^{ast} u, u rangle$$



        for all $u in mathbb{R}^2$; explicitly, if $u = (x, y)$, then both sides are equal to $xy$. However, it's not true that $A = A^{ast}$, since $A^{ast} = left[ begin{array}{cc} 0 & 0 \ 1 & 0 end{array} right]$. So the hint is false. That's all.





        That was straightforward. Here are some facts which are also true but which are less straightforward. If $langle Au, u rangle = langle Bu, u rangle$ all you can conclude is that $A - B$ is skew-symmetric, which is the case above. It's also false that positive matrices are symmetric, with the given definitions. (The correct definition, to my mind, is that positive should only be applied to symmetric matrices.)






        share|cite|improve this answer











        $endgroup$



        There's a straightforward way to figure out what went wrong in a situation like this, when you prove a statement you know is false. You find a counterexample to the statement you know is false, and substitute the counterexample into your proof to figure out when you first wrote down a false statement about your counterexample.



        So: it's clearly false that every matrix is symmetric. For example, the matrix $A = left[ begin{array}{cc} 0 & 1 \ 0 & 0 end{array} right]$ isn't symmetric. So what happens when you put it into your proof? It's true that



        $$langle Au, u rangle = A^{ast} u, u rangle$$



        for all $u in mathbb{R}^2$; explicitly, if $u = (x, y)$, then both sides are equal to $xy$. However, it's not true that $A = A^{ast}$, since $A^{ast} = left[ begin{array}{cc} 0 & 0 \ 1 & 0 end{array} right]$. So the hint is false. That's all.





        That was straightforward. Here are some facts which are also true but which are less straightforward. If $langle Au, u rangle = langle Bu, u rangle$ all you can conclude is that $A - B$ is skew-symmetric, which is the case above. It's also false that positive matrices are symmetric, with the given definitions. (The correct definition, to my mind, is that positive should only be applied to symmetric matrices.)







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Dec 3 '18 at 0:47

























        answered Dec 3 '18 at 0:39









        Qiaochu YuanQiaochu Yuan

        278k32585921




        278k32585921






























            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%2f3023302%2fhave-i-proven-that-every-matrix-is-symmetric%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

            Puebla de Zaragoza

            Musa