Suppose $U_1,dots,U_k$ and $V_1,dots,V_k$ are $ntimes n$ unitary matrices. Show that $|U_1cdots U_k-V_1cdots...












4












$begingroup$


Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
$$|T|:=sup{|Tv|_{W}:|v|_{V}=1}$$ where $|v_{V}|:=sqrt{langle v,vrangle}$ and $|Tv|_{W}:=sqrt{langle Tv,Tvrangle}$.



Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n {times} n$ unitary matrices. Show that
$$|U_1cdots U_k-V_1cdots V_k| leq sum_{i=1}^{k}|U_i-V_i|$$



I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!






linear-algebra matrices functional-analysis norm







share|cite|improve this question











$endgroup$

















    4












    $begingroup$


    Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
    $$|T|:=sup{|Tv|_{W}:|v|_{V}=1}$$ where $|v_{V}|:=sqrt{langle v,vrangle}$ and $|Tv|_{W}:=sqrt{langle Tv,Tvrangle}$.



    Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n {times} n$ unitary matrices. Show that
    $$|U_1cdots U_k-V_1cdots V_k| leq sum_{i=1}^{k}|U_i-V_i|$$



    I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!






    linear-algebra matrices functional-analysis norm







    share|cite|improve this question











    $endgroup$















      4












      4








      4


      1



      $begingroup$


      Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
      $$|T|:=sup{|Tv|_{W}:|v|_{V}=1}$$ where $|v_{V}|:=sqrt{langle v,vrangle}$ and $|Tv|_{W}:=sqrt{langle Tv,Tvrangle}$.



      Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n {times} n$ unitary matrices. Show that
      $$|U_1cdots U_k-V_1cdots V_k| leq sum_{i=1}^{k}|U_i-V_i|$$



      I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!






      linear-algebra matrices functional-analysis norm







      share|cite|improve this question











      $endgroup$




      Let $V,W$ be complex inner product spaces. Suppose $T: V to W$ is a linear map, then we define
      $$|T|:=sup{|Tv|_{W}:|v|_{V}=1}$$ where $|v_{V}|:=sqrt{langle v,vrangle}$ and $|Tv|_{W}:=sqrt{langle Tv,Tvrangle}$.



      Question: Suppose $U_1,ldots,U_k$ and $V_1,ldots,V_k$ are $n {times} n$ unitary matrices. Show that
      $$|U_1cdots U_k-V_1cdots V_k| leq sum_{i=1}^{k}|U_i-V_i|$$



      I have tried to use triangle inequality for norms and induction but failed. Can anyone give some hints? Thank you!






      linear-algebra matrices functional-analysis norm




      linear-algebra matrices functional-analysis norm






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 20 mins ago









      Asaf Karagila♦

      306k33438769




      306k33438769










      asked 3 hours ago









      bbwbbw

      52239




      52239






















          1 Answer
          1






          active

          oldest

          votes


















          7












          $begingroup$

          For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
          $$
          begin{array}{ll}
          & ||U_1 U_2 - V_1 V_2||\ \
          = & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
          = &
          || ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
          leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
          end{array}
          $$
          (The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_{2}|| = 1$, so
          $$
          || ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
          $$
          A similar bound obtains for $||V_1 (U_2 - V_2) ||$.



          This should give you enough "building blocks".:)






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you so much!
            $endgroup$
            – bbw
            2 hours ago






          • 1




            $begingroup$
            You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
            $endgroup$
            – avs
            2 hours ago











          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%2f3149889%2fsuppose-u-1-dots-u-k-and-v-1-dots-v-k-are-n-times-n-unitary-matrices-sh%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









          7












          $begingroup$

          For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
          $$
          begin{array}{ll}
          & ||U_1 U_2 - V_1 V_2||\ \
          = & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
          = &
          || ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
          leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
          end{array}
          $$
          (The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_{2}|| = 1$, so
          $$
          || ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
          $$
          A similar bound obtains for $||V_1 (U_2 - V_2) ||$.



          This should give you enough "building blocks".:)






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you so much!
            $endgroup$
            – bbw
            2 hours ago






          • 1




            $begingroup$
            You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
            $endgroup$
            – avs
            2 hours ago
















          7












          $begingroup$

          For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
          $$
          begin{array}{ll}
          & ||U_1 U_2 - V_1 V_2||\ \
          = & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
          = &
          || ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
          leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
          end{array}
          $$
          (The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_{2}|| = 1$, so
          $$
          || ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
          $$
          A similar bound obtains for $||V_1 (U_2 - V_2) ||$.



          This should give you enough "building blocks".:)






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you so much!
            $endgroup$
            – bbw
            2 hours ago






          • 1




            $begingroup$
            You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
            $endgroup$
            – avs
            2 hours ago














          7












          7








          7





          $begingroup$

          For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
          $$
          begin{array}{ll}
          & ||U_1 U_2 - V_1 V_2||\ \
          = & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
          = &
          || ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
          leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
          end{array}
          $$
          (The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_{2}|| = 1$, so
          $$
          || ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
          $$
          A similar bound obtains for $||V_1 (U_2 - V_2) ||$.



          This should give you enough "building blocks".:)






          share|cite|improve this answer











          $endgroup$



          For $k = 1$, the inequality becomes an identity. So, start with the special case $k = 2$:
          $$
          begin{array}{ll}
          & ||U_1 U_2 - V_1 V_2||\ \
          = & ||U_1 U_2 - V_1 U_2 + V_1 U_2 - V_1 V_2||\ \
          = &
          || ( U_1 - V_1) U_2 + V_1 (U_2 - V_2) || \ \
          leq & ||( U_1 - V_1) U_2 || + ||V_1 (U_2 - V_2) ||.\
          end{array}
          $$
          (The last inequality is the triangle inequality.) Now, since $U_2$ is unitary, we have $||U_{2}|| = 1$, so
          $$
          || ( U_1 - V_1) U_2 || leq || U_1 - V_1 ||.
          $$
          A similar bound obtains for $||V_1 (U_2 - V_2) ||$.



          This should give you enough "building blocks".:)







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited 2 hours ago

























          answered 3 hours ago









          avsavs

          3,434513




          3,434513












          • $begingroup$
            Thank you so much!
            $endgroup$
            – bbw
            2 hours ago






          • 1




            $begingroup$
            You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
            $endgroup$
            – avs
            2 hours ago


















          • $begingroup$
            Thank you so much!
            $endgroup$
            – bbw
            2 hours ago






          • 1




            $begingroup$
            You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
            $endgroup$
            – avs
            2 hours ago
















          $begingroup$
          Thank you so much!
          $endgroup$
          – bbw
          2 hours ago




          $begingroup$
          Thank you so much!
          $endgroup$
          – bbw
          2 hours ago




          1




          1




          $begingroup$
          You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
          $endgroup$
          – avs
          2 hours ago




          $begingroup$
          You are welcome. I edited to remove the (unjustified) assumption that the matrices commute.:)
          $endgroup$
          – avs
          2 hours ago


















          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%2f3149889%2fsuppose-u-1-dots-u-k-and-v-1-dots-v-k-are-n-times-n-unitary-matrices-sh%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

          Contact image not getting when fetch all contact list from iPhone by CNContact

          Image
          up vote 0 down vote favorite I know this question already asked but not getting solution. From this code I will get all the information from the contact but image not found when open vcf files on mac os, also not getting when share this file. I use this stackoverflow link here but It's not help full. var contacts = [CNContact]() let keys = [CNContactVCardSerialization.descriptorForRequiredKeys() ] as [Any] let request = CNContactFetchRequest(keysToFetch: keys as! [CNKeyDescriptor]) do { try self.contactStore.enumerateContacts(with: request) { (contact, stop) in // Array containing all unified contacts from everywhere contacts.append(contact) } } catch { print("unable to fetch contacts") } do { let data = try
          Read more

          count number of partitions of a set with n elements into k subsets

          Image
          up vote 6 down vote favorite 1 This program is for count number of partitions of a set with n elements into k subsets I am confusing here return k*countP(n-1, k) + countP(n-1, k-1); can some one explain what is happening here? why we are multiplying with k? NOTE->I know this is not the best way to calculate number of partitions that would be DP // A C++ program to count number of partitions // of a set with n elements into k subsets #include<iostream> using namespace std; // Returns count of different partitions of n // elements in k subsets int countP(int n, int k) { // Base cases if (n == 0 || k == 0 || k > n) return 0; if (k == 1 || k == n) return 1; // S(n+1, k) = k*S(n, k) + S(n, k-1) return k*countP(n-1, k) + countP(n-1, k-1); } // Driver program int ma
          Read more

          A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

          Image
          0 I found a lot of questions abount appendices and ToC. Many users want appendices to be grouped in an Appendix part, however some problems arise with ToC, hyperref, PDF viewer bookmarks, and so on. There are different solutions which require extra packages, command patching and other extra code, however none of them satisfies me. I almost found an easy way to accomplish a good result, where appendices are added to bookmarks in the right way and hyperref links point to the right page. However, the number of the "Appendix" part page is wrong (it's the number of appendix A). Is there any EASY way to fix that? This is a MWE: documentclass{book} usepackage[nottoc,notlot,notlof]{tocbibind} usepackage{hyperref} begin{document} frontmatter tableofcontents mainmatter part{First} chapter{
          Read more