Prove that $v in U^perp $.












2












$begingroup$



Let $U$ be a subspace of $V$. Assume that there exists $vin V$ such that $langle v,urangle +langle u,vrangle le langle u,urangle forall uin U$



Prove that $v in U^perp $.




Let $uin U$ then we need to show that $langle u,vrangle =0$



Now $langle v,urangle +langle u,vrangle le langle u,urangleimplies 2Re langle u,vranglele langle u,urangle$



How to show from here that $langle u,vrangle =0$?



Please help










share|cite|improve this question











$endgroup$












  • $begingroup$
    So, $V$ are complex inner product vector?
    $endgroup$
    – Thomas Andrews
    Jan 31 at 15:45








  • 1




    $begingroup$
    Hint: look at the orthogonal projection of $v$ onto $U$ (i.e. using the fact that $V = U oplus U^{perp}$).
    $endgroup$
    – Chessanator
    Jan 31 at 15:59












  • $begingroup$
    @Chessanator;how is that a hint
    $endgroup$
    – user596656
    Jan 31 at 16:01
















2












$begingroup$



Let $U$ be a subspace of $V$. Assume that there exists $vin V$ such that $langle v,urangle +langle u,vrangle le langle u,urangle forall uin U$



Prove that $v in U^perp $.




Let $uin U$ then we need to show that $langle u,vrangle =0$



Now $langle v,urangle +langle u,vrangle le langle u,urangleimplies 2Re langle u,vranglele langle u,urangle$



How to show from here that $langle u,vrangle =0$?



Please help










share|cite|improve this question











$endgroup$












  • $begingroup$
    So, $V$ are complex inner product vector?
    $endgroup$
    – Thomas Andrews
    Jan 31 at 15:45








  • 1




    $begingroup$
    Hint: look at the orthogonal projection of $v$ onto $U$ (i.e. using the fact that $V = U oplus U^{perp}$).
    $endgroup$
    – Chessanator
    Jan 31 at 15:59












  • $begingroup$
    @Chessanator;how is that a hint
    $endgroup$
    – user596656
    Jan 31 at 16:01














2












2








2





$begingroup$



Let $U$ be a subspace of $V$. Assume that there exists $vin V$ such that $langle v,urangle +langle u,vrangle le langle u,urangle forall uin U$



Prove that $v in U^perp $.




Let $uin U$ then we need to show that $langle u,vrangle =0$



Now $langle v,urangle +langle u,vrangle le langle u,urangleimplies 2Re langle u,vranglele langle u,urangle$



How to show from here that $langle u,vrangle =0$?



Please help










share|cite|improve this question











$endgroup$





Let $U$ be a subspace of $V$. Assume that there exists $vin V$ such that $langle v,urangle +langle u,vrangle le langle u,urangle forall uin U$



Prove that $v in U^perp $.




Let $uin U$ then we need to show that $langle u,vrangle =0$



Now $langle v,urangle +langle u,vrangle le langle u,urangleimplies 2Re langle u,vranglele langle u,urangle$



How to show from here that $langle u,vrangle =0$?



Please help







linear-algebra functional-analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 31 at 16:25

























asked Jan 31 at 15:38







user596656



















  • $begingroup$
    So, $V$ are complex inner product vector?
    $endgroup$
    – Thomas Andrews
    Jan 31 at 15:45








  • 1




    $begingroup$
    Hint: look at the orthogonal projection of $v$ onto $U$ (i.e. using the fact that $V = U oplus U^{perp}$).
    $endgroup$
    – Chessanator
    Jan 31 at 15:59












  • $begingroup$
    @Chessanator;how is that a hint
    $endgroup$
    – user596656
    Jan 31 at 16:01


















  • $begingroup$
    So, $V$ are complex inner product vector?
    $endgroup$
    – Thomas Andrews
    Jan 31 at 15:45








  • 1




    $begingroup$
    Hint: look at the orthogonal projection of $v$ onto $U$ (i.e. using the fact that $V = U oplus U^{perp}$).
    $endgroup$
    – Chessanator
    Jan 31 at 15:59












  • $begingroup$
    @Chessanator;how is that a hint
    $endgroup$
    – user596656
    Jan 31 at 16:01
















$begingroup$
So, $V$ are complex inner product vector?
$endgroup$
– Thomas Andrews
Jan 31 at 15:45






$begingroup$
So, $V$ are complex inner product vector?
$endgroup$
– Thomas Andrews
Jan 31 at 15:45






1




1




$begingroup$
Hint: look at the orthogonal projection of $v$ onto $U$ (i.e. using the fact that $V = U oplus U^{perp}$).
$endgroup$
– Chessanator
Jan 31 at 15:59






$begingroup$
Hint: look at the orthogonal projection of $v$ onto $U$ (i.e. using the fact that $V = U oplus U^{perp}$).
$endgroup$
– Chessanator
Jan 31 at 15:59














$begingroup$
@Chessanator;how is that a hint
$endgroup$
– user596656
Jan 31 at 16:01




$begingroup$
@Chessanator;how is that a hint
$endgroup$
– user596656
Jan 31 at 16:01










2 Answers
2






active

oldest

votes


















1












$begingroup$

We take the Chessanator hint, and note that $Ucap U^{perp}={0},$ the zero vector. If $v=0,$ then we are done trivially because $0in U^{perp}.$ But now, suppose, by way of establishing a contradiction, that $vin V,$ and $vnot=0$. Then, by assumption, we can write $v=u+u^{perp},$ where $uin U$ and $u^{perp}in U^{perp}$. It must be that
$$langle v,urangle+langle u,vrangle=langle u+u^{perp},urangle+langle u,u+u^{perp}rangle=langle u,urangle+langle u,urangle =2langle u,urangle.$$
If $u=0,$ we are done and $vin U^{perp}.$ If $unot=0,$ then we have a case where $langle v,urangle+langle u,vrangle > langle u,urangle,$ which cannot be, by assumption. Therefore, $u=0,$ and the theorem is proved.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
    $endgroup$
    – user596656
    Jan 31 at 16:24










  • $begingroup$
    I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
    $endgroup$
    – Adrian Keister
    Jan 31 at 16:34










  • $begingroup$
    Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:37










  • $begingroup$
    I think with that change this proof is definitely more elegant than my own.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:38






  • 1




    $begingroup$
    @Adrian Keister, yes that looks correct.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:49



















0












$begingroup$

Suppose there is some $uin U$ such that $langle u,vrangleneq 0$. Pick $lambdainmathbb{C}$ and take $w=lambda u$, such that $langle w,vrangle>0$ and $|w|=1$.



Now let $r>0$ and consider
$$langle v,rwrangle+langle rw,vrangleleq |rw|^{2}=r^{2}Leftrightarrow r^{2}-2rlangle v,wranglegeq0$$
which only holds for $rleq0$ and $rgeq 2langle v,wrangle$. So for $r=langle v,wrangle$ we find
$$langle v,rwrangle+langle rw,vrangle=2langle v,wrangle^{2}geq langle v,wrangle^{2}=|rw|^{2}$$
which is a contradiction.






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%2f3095020%2fprove-that-v-in-u-perp%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$

    We take the Chessanator hint, and note that $Ucap U^{perp}={0},$ the zero vector. If $v=0,$ then we are done trivially because $0in U^{perp}.$ But now, suppose, by way of establishing a contradiction, that $vin V,$ and $vnot=0$. Then, by assumption, we can write $v=u+u^{perp},$ where $uin U$ and $u^{perp}in U^{perp}$. It must be that
    $$langle v,urangle+langle u,vrangle=langle u+u^{perp},urangle+langle u,u+u^{perp}rangle=langle u,urangle+langle u,urangle =2langle u,urangle.$$
    If $u=0,$ we are done and $vin U^{perp}.$ If $unot=0,$ then we have a case where $langle v,urangle+langle u,vrangle > langle u,urangle,$ which cannot be, by assumption. Therefore, $u=0,$ and the theorem is proved.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
      $endgroup$
      – user596656
      Jan 31 at 16:24










    • $begingroup$
      I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
      $endgroup$
      – Adrian Keister
      Jan 31 at 16:34










    • $begingroup$
      Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:37










    • $begingroup$
      I think with that change this proof is definitely more elegant than my own.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:38






    • 1




      $begingroup$
      @Adrian Keister, yes that looks correct.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:49
















    1












    $begingroup$

    We take the Chessanator hint, and note that $Ucap U^{perp}={0},$ the zero vector. If $v=0,$ then we are done trivially because $0in U^{perp}.$ But now, suppose, by way of establishing a contradiction, that $vin V,$ and $vnot=0$. Then, by assumption, we can write $v=u+u^{perp},$ where $uin U$ and $u^{perp}in U^{perp}$. It must be that
    $$langle v,urangle+langle u,vrangle=langle u+u^{perp},urangle+langle u,u+u^{perp}rangle=langle u,urangle+langle u,urangle =2langle u,urangle.$$
    If $u=0,$ we are done and $vin U^{perp}.$ If $unot=0,$ then we have a case where $langle v,urangle+langle u,vrangle > langle u,urangle,$ which cannot be, by assumption. Therefore, $u=0,$ and the theorem is proved.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
      $endgroup$
      – user596656
      Jan 31 at 16:24










    • $begingroup$
      I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
      $endgroup$
      – Adrian Keister
      Jan 31 at 16:34










    • $begingroup$
      Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:37










    • $begingroup$
      I think with that change this proof is definitely more elegant than my own.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:38






    • 1




      $begingroup$
      @Adrian Keister, yes that looks correct.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:49














    1












    1








    1





    $begingroup$

    We take the Chessanator hint, and note that $Ucap U^{perp}={0},$ the zero vector. If $v=0,$ then we are done trivially because $0in U^{perp}.$ But now, suppose, by way of establishing a contradiction, that $vin V,$ and $vnot=0$. Then, by assumption, we can write $v=u+u^{perp},$ where $uin U$ and $u^{perp}in U^{perp}$. It must be that
    $$langle v,urangle+langle u,vrangle=langle u+u^{perp},urangle+langle u,u+u^{perp}rangle=langle u,urangle+langle u,urangle =2langle u,urangle.$$
    If $u=0,$ we are done and $vin U^{perp}.$ If $unot=0,$ then we have a case where $langle v,urangle+langle u,vrangle > langle u,urangle,$ which cannot be, by assumption. Therefore, $u=0,$ and the theorem is proved.






    share|cite|improve this answer











    $endgroup$



    We take the Chessanator hint, and note that $Ucap U^{perp}={0},$ the zero vector. If $v=0,$ then we are done trivially because $0in U^{perp}.$ But now, suppose, by way of establishing a contradiction, that $vin V,$ and $vnot=0$. Then, by assumption, we can write $v=u+u^{perp},$ where $uin U$ and $u^{perp}in U^{perp}$. It must be that
    $$langle v,urangle+langle u,vrangle=langle u+u^{perp},urangle+langle u,u+u^{perp}rangle=langle u,urangle+langle u,urangle =2langle u,urangle.$$
    If $u=0,$ we are done and $vin U^{perp}.$ If $unot=0,$ then we have a case where $langle v,urangle+langle u,vrangle > langle u,urangle,$ which cannot be, by assumption. Therefore, $u=0,$ and the theorem is proved.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Jan 31 at 16:45

























    answered Jan 31 at 16:14









    Adrian KeisterAdrian Keister

    5,26971933




    5,26971933












    • $begingroup$
      $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
      $endgroup$
      – user596656
      Jan 31 at 16:24










    • $begingroup$
      I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
      $endgroup$
      – Adrian Keister
      Jan 31 at 16:34










    • $begingroup$
      Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:37










    • $begingroup$
      I think with that change this proof is definitely more elegant than my own.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:38






    • 1




      $begingroup$
      @Adrian Keister, yes that looks correct.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:49


















    • $begingroup$
      $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
      $endgroup$
      – user596656
      Jan 31 at 16:24










    • $begingroup$
      I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
      $endgroup$
      – Adrian Keister
      Jan 31 at 16:34










    • $begingroup$
      Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:37










    • $begingroup$
      I think with that change this proof is definitely more elegant than my own.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:38






    • 1




      $begingroup$
      @Adrian Keister, yes that looks correct.
      $endgroup$
      – Floris Claassens
      Jan 31 at 16:49
















    $begingroup$
    $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
    $endgroup$
    – user596656
    Jan 31 at 16:24




    $begingroup$
    $V=Uoplus U^perp$,how does that mean that if $vnotin Uimplies vin U^perp$
    $endgroup$
    – user596656
    Jan 31 at 16:24












    $begingroup$
    I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
    $endgroup$
    – Adrian Keister
    Jan 31 at 16:34




    $begingroup$
    I already made it clear that $Ucap U^{perp}={0}$. There's only one vector in both $U$ and $U^{perp}$. And, in the case where $vnot=0,$ if it's in $V$ but not $U,$ it must be in $U^{perp}.$
    $endgroup$
    – Adrian Keister
    Jan 31 at 16:34












    $begingroup$
    Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:37




    $begingroup$
    Join_PhD has a point. I would propose the following fix. We only know that $vin V$ so we know that $v=v_{1}+v_{2}$ with $v_{1}in U$ and $v_{2}in U^{perp}$. Then $langle v_{1},vrangle+langle v,v_{1}rangle=2langle v_{1},v_{1}rangle>langle v_{1},v_{1}rangle$.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:37












    $begingroup$
    I think with that change this proof is definitely more elegant than my own.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:38




    $begingroup$
    I think with that change this proof is definitely more elegant than my own.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:38




    1




    1




    $begingroup$
    @Adrian Keister, yes that looks correct.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:49




    $begingroup$
    @Adrian Keister, yes that looks correct.
    $endgroup$
    – Floris Claassens
    Jan 31 at 16:49











    0












    $begingroup$

    Suppose there is some $uin U$ such that $langle u,vrangleneq 0$. Pick $lambdainmathbb{C}$ and take $w=lambda u$, such that $langle w,vrangle>0$ and $|w|=1$.



    Now let $r>0$ and consider
    $$langle v,rwrangle+langle rw,vrangleleq |rw|^{2}=r^{2}Leftrightarrow r^{2}-2rlangle v,wranglegeq0$$
    which only holds for $rleq0$ and $rgeq 2langle v,wrangle$. So for $r=langle v,wrangle$ we find
    $$langle v,rwrangle+langle rw,vrangle=2langle v,wrangle^{2}geq langle v,wrangle^{2}=|rw|^{2}$$
    which is a contradiction.






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Suppose there is some $uin U$ such that $langle u,vrangleneq 0$. Pick $lambdainmathbb{C}$ and take $w=lambda u$, such that $langle w,vrangle>0$ and $|w|=1$.



      Now let $r>0$ and consider
      $$langle v,rwrangle+langle rw,vrangleleq |rw|^{2}=r^{2}Leftrightarrow r^{2}-2rlangle v,wranglegeq0$$
      which only holds for $rleq0$ and $rgeq 2langle v,wrangle$. So for $r=langle v,wrangle$ we find
      $$langle v,rwrangle+langle rw,vrangle=2langle v,wrangle^{2}geq langle v,wrangle^{2}=|rw|^{2}$$
      which is a contradiction.






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Suppose there is some $uin U$ such that $langle u,vrangleneq 0$. Pick $lambdainmathbb{C}$ and take $w=lambda u$, such that $langle w,vrangle>0$ and $|w|=1$.



        Now let $r>0$ and consider
        $$langle v,rwrangle+langle rw,vrangleleq |rw|^{2}=r^{2}Leftrightarrow r^{2}-2rlangle v,wranglegeq0$$
        which only holds for $rleq0$ and $rgeq 2langle v,wrangle$. So for $r=langle v,wrangle$ we find
        $$langle v,rwrangle+langle rw,vrangle=2langle v,wrangle^{2}geq langle v,wrangle^{2}=|rw|^{2}$$
        which is a contradiction.






        share|cite|improve this answer









        $endgroup$



        Suppose there is some $uin U$ such that $langle u,vrangleneq 0$. Pick $lambdainmathbb{C}$ and take $w=lambda u$, such that $langle w,vrangle>0$ and $|w|=1$.



        Now let $r>0$ and consider
        $$langle v,rwrangle+langle rw,vrangleleq |rw|^{2}=r^{2}Leftrightarrow r^{2}-2rlangle v,wranglegeq0$$
        which only holds for $rleq0$ and $rgeq 2langle v,wrangle$. So for $r=langle v,wrangle$ we find
        $$langle v,rwrangle+langle rw,vrangle=2langle v,wrangle^{2}geq langle v,wrangle^{2}=|rw|^{2}$$
        which is a contradiction.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 31 at 16:30









        Floris ClaassensFloris Claassens

        1,32829




        1,32829






























            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%2f3095020%2fprove-that-v-in-u-perp%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

            'app-layout' is not a known element: how to share Component with different Modules

            android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

            WPF add header to Image with URL pettitions [duplicate]