Matrices properties discussion












0












$begingroup$


I have been thinking about the most interesting property of the matrices that I have learnt and I finally concluded that the one that is the most interesting one is the Cauchy Theorem of determinant which states that for $A, Binmathbb{C}^{n, n} $
$$
det (AB) =det(A) cdot det(B)
$$

My question is what is Your favourite and the most beautiful theorem (or maybe some trick) for matrices?










share|cite|improve this question









$endgroup$












  • $begingroup$
    I got two favorites: SVD and Schur decomposition!
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:10










  • $begingroup$
    @Mostafa Ayaz Can you post the description of them?
    $endgroup$
    – avan1235
    Feb 3 at 9:26










  • $begingroup$
    Sure! Just gimme a second :)
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:26










  • $begingroup$
    "Most interesting ones" : on which creteria ? Is it Usefulness ? There are hundreds of them... Is it Aesthetics ? It depends of one's sense of (mathematical) beauty...
    $endgroup$
    – Jean Marie
    Feb 3 at 11:28










  • $begingroup$
    Any which you would like to choose @Jean Marie
    $endgroup$
    – avan1235
    Feb 3 at 12:24
















0












$begingroup$


I have been thinking about the most interesting property of the matrices that I have learnt and I finally concluded that the one that is the most interesting one is the Cauchy Theorem of determinant which states that for $A, Binmathbb{C}^{n, n} $
$$
det (AB) =det(A) cdot det(B)
$$

My question is what is Your favourite and the most beautiful theorem (or maybe some trick) for matrices?










share|cite|improve this question









$endgroup$












  • $begingroup$
    I got two favorites: SVD and Schur decomposition!
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:10










  • $begingroup$
    @Mostafa Ayaz Can you post the description of them?
    $endgroup$
    – avan1235
    Feb 3 at 9:26










  • $begingroup$
    Sure! Just gimme a second :)
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:26










  • $begingroup$
    "Most interesting ones" : on which creteria ? Is it Usefulness ? There are hundreds of them... Is it Aesthetics ? It depends of one's sense of (mathematical) beauty...
    $endgroup$
    – Jean Marie
    Feb 3 at 11:28










  • $begingroup$
    Any which you would like to choose @Jean Marie
    $endgroup$
    – avan1235
    Feb 3 at 12:24














0












0








0





$begingroup$


I have been thinking about the most interesting property of the matrices that I have learnt and I finally concluded that the one that is the most interesting one is the Cauchy Theorem of determinant which states that for $A, Binmathbb{C}^{n, n} $
$$
det (AB) =det(A) cdot det(B)
$$

My question is what is Your favourite and the most beautiful theorem (or maybe some trick) for matrices?










share|cite|improve this question









$endgroup$




I have been thinking about the most interesting property of the matrices that I have learnt and I finally concluded that the one that is the most interesting one is the Cauchy Theorem of determinant which states that for $A, Binmathbb{C}^{n, n} $
$$
det (AB) =det(A) cdot det(B)
$$

My question is what is Your favourite and the most beautiful theorem (or maybe some trick) for matrices?







linear-algebra matrices






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Feb 3 at 8:52









avan1235avan1235

3578




3578












  • $begingroup$
    I got two favorites: SVD and Schur decomposition!
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:10










  • $begingroup$
    @Mostafa Ayaz Can you post the description of them?
    $endgroup$
    – avan1235
    Feb 3 at 9:26










  • $begingroup$
    Sure! Just gimme a second :)
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:26










  • $begingroup$
    "Most interesting ones" : on which creteria ? Is it Usefulness ? There are hundreds of them... Is it Aesthetics ? It depends of one's sense of (mathematical) beauty...
    $endgroup$
    – Jean Marie
    Feb 3 at 11:28










  • $begingroup$
    Any which you would like to choose @Jean Marie
    $endgroup$
    – avan1235
    Feb 3 at 12:24


















  • $begingroup$
    I got two favorites: SVD and Schur decomposition!
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:10










  • $begingroup$
    @Mostafa Ayaz Can you post the description of them?
    $endgroup$
    – avan1235
    Feb 3 at 9:26










  • $begingroup$
    Sure! Just gimme a second :)
    $endgroup$
    – Mostafa Ayaz
    Feb 3 at 9:26










  • $begingroup$
    "Most interesting ones" : on which creteria ? Is it Usefulness ? There are hundreds of them... Is it Aesthetics ? It depends of one's sense of (mathematical) beauty...
    $endgroup$
    – Jean Marie
    Feb 3 at 11:28










  • $begingroup$
    Any which you would like to choose @Jean Marie
    $endgroup$
    – avan1235
    Feb 3 at 12:24
















$begingroup$
I got two favorites: SVD and Schur decomposition!
$endgroup$
– Mostafa Ayaz
Feb 3 at 9:10




$begingroup$
I got two favorites: SVD and Schur decomposition!
$endgroup$
– Mostafa Ayaz
Feb 3 at 9:10












$begingroup$
@Mostafa Ayaz Can you post the description of them?
$endgroup$
– avan1235
Feb 3 at 9:26




$begingroup$
@Mostafa Ayaz Can you post the description of them?
$endgroup$
– avan1235
Feb 3 at 9:26












$begingroup$
Sure! Just gimme a second :)
$endgroup$
– Mostafa Ayaz
Feb 3 at 9:26




$begingroup$
Sure! Just gimme a second :)
$endgroup$
– Mostafa Ayaz
Feb 3 at 9:26












$begingroup$
"Most interesting ones" : on which creteria ? Is it Usefulness ? There are hundreds of them... Is it Aesthetics ? It depends of one's sense of (mathematical) beauty...
$endgroup$
– Jean Marie
Feb 3 at 11:28




$begingroup$
"Most interesting ones" : on which creteria ? Is it Usefulness ? There are hundreds of them... Is it Aesthetics ? It depends of one's sense of (mathematical) beauty...
$endgroup$
– Jean Marie
Feb 3 at 11:28












$begingroup$
Any which you would like to choose @Jean Marie
$endgroup$
– avan1235
Feb 3 at 12:24




$begingroup$
Any which you would like to choose @Jean Marie
$endgroup$
– avan1235
Feb 3 at 12:24










1 Answer
1






active

oldest

votes


















2












$begingroup$

The Schur decomposition is defined for any square matrix as follows:




For any $ntimes n$ matrix $A$, there exist (non necessarily unique) unitary $Q_{ntimes n}$ and upper-triangular $U_{ntimes n}$ such that:$$A=QUQ^H$$where $^H$ denotes the Hermitian operator (conjugate-transpose operator) and a unitary matrix is any square matrix $Q$ with the property $QQ^H=I$.




Also the SVD is a very important and beautiful matrix decomposition (probably the best ever!) defined for any arbitrary matrix as follows:




The Singular Value Decomposition of an $mtimes n$ matrix $A$ is any triple $(U_{mtimes m},D_{mtimes n},V_{ntimes n})$ such that $$A=UDV^H$$where $U,V$ are unitary and $D$ is diagonal as the non-diagonal entries (i.e. entries $d_{ij}$ with $ine j$) are all zero.




Such a decomposition exists for any matrix.



The existence of SVD for a matrix $A$ is followed a very interesting background. As any matrix $A$ can be interpreted as a linear operator from $Bbb R^n$ onto $Bbb R^m$, one can split the $A$-operation of a vector as below:



Operation 1 : a vector is first rotated in $Bbb R^n$ by multiplying in $V$ ($V$-operation).



Operation 2 : the outcome vector is then multiplied in $D$ which can be interpreted as a scale and transformation from $Bbb R^n$ to $Bbb R^m$ ($D$-operation).



Operation 3 : the final vector is once more rotated in $Bbb R^m$ to yield the result.



SVD enjoys a widespread use in mathematical frameworks. For more information about these two and more useful decompositions (such as Cholesky decomposition for a symmetric non-negative definite matrix), I suggest you the following links:



https://en.wikipedia.org/wiki/Singular_value_decomposition



https://en.wikipedia.org/wiki/Schur_decomposition



https://en.wikipedia.org/wiki/Matrix_decomposition






share|cite|improve this answer









$endgroup$














    Your Answer








    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%2f3098332%2fmatrices-properties-discussion%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$

    The Schur decomposition is defined for any square matrix as follows:




    For any $ntimes n$ matrix $A$, there exist (non necessarily unique) unitary $Q_{ntimes n}$ and upper-triangular $U_{ntimes n}$ such that:$$A=QUQ^H$$where $^H$ denotes the Hermitian operator (conjugate-transpose operator) and a unitary matrix is any square matrix $Q$ with the property $QQ^H=I$.




    Also the SVD is a very important and beautiful matrix decomposition (probably the best ever!) defined for any arbitrary matrix as follows:




    The Singular Value Decomposition of an $mtimes n$ matrix $A$ is any triple $(U_{mtimes m},D_{mtimes n},V_{ntimes n})$ such that $$A=UDV^H$$where $U,V$ are unitary and $D$ is diagonal as the non-diagonal entries (i.e. entries $d_{ij}$ with $ine j$) are all zero.




    Such a decomposition exists for any matrix.



    The existence of SVD for a matrix $A$ is followed a very interesting background. As any matrix $A$ can be interpreted as a linear operator from $Bbb R^n$ onto $Bbb R^m$, one can split the $A$-operation of a vector as below:



    Operation 1 : a vector is first rotated in $Bbb R^n$ by multiplying in $V$ ($V$-operation).



    Operation 2 : the outcome vector is then multiplied in $D$ which can be interpreted as a scale and transformation from $Bbb R^n$ to $Bbb R^m$ ($D$-operation).



    Operation 3 : the final vector is once more rotated in $Bbb R^m$ to yield the result.



    SVD enjoys a widespread use in mathematical frameworks. For more information about these two and more useful decompositions (such as Cholesky decomposition for a symmetric non-negative definite matrix), I suggest you the following links:



    https://en.wikipedia.org/wiki/Singular_value_decomposition



    https://en.wikipedia.org/wiki/Schur_decomposition



    https://en.wikipedia.org/wiki/Matrix_decomposition






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$

      The Schur decomposition is defined for any square matrix as follows:




      For any $ntimes n$ matrix $A$, there exist (non necessarily unique) unitary $Q_{ntimes n}$ and upper-triangular $U_{ntimes n}$ such that:$$A=QUQ^H$$where $^H$ denotes the Hermitian operator (conjugate-transpose operator) and a unitary matrix is any square matrix $Q$ with the property $QQ^H=I$.




      Also the SVD is a very important and beautiful matrix decomposition (probably the best ever!) defined for any arbitrary matrix as follows:




      The Singular Value Decomposition of an $mtimes n$ matrix $A$ is any triple $(U_{mtimes m},D_{mtimes n},V_{ntimes n})$ such that $$A=UDV^H$$where $U,V$ are unitary and $D$ is diagonal as the non-diagonal entries (i.e. entries $d_{ij}$ with $ine j$) are all zero.




      Such a decomposition exists for any matrix.



      The existence of SVD for a matrix $A$ is followed a very interesting background. As any matrix $A$ can be interpreted as a linear operator from $Bbb R^n$ onto $Bbb R^m$, one can split the $A$-operation of a vector as below:



      Operation 1 : a vector is first rotated in $Bbb R^n$ by multiplying in $V$ ($V$-operation).



      Operation 2 : the outcome vector is then multiplied in $D$ which can be interpreted as a scale and transformation from $Bbb R^n$ to $Bbb R^m$ ($D$-operation).



      Operation 3 : the final vector is once more rotated in $Bbb R^m$ to yield the result.



      SVD enjoys a widespread use in mathematical frameworks. For more information about these two and more useful decompositions (such as Cholesky decomposition for a symmetric non-negative definite matrix), I suggest you the following links:



      https://en.wikipedia.org/wiki/Singular_value_decomposition



      https://en.wikipedia.org/wiki/Schur_decomposition



      https://en.wikipedia.org/wiki/Matrix_decomposition






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$

        The Schur decomposition is defined for any square matrix as follows:




        For any $ntimes n$ matrix $A$, there exist (non necessarily unique) unitary $Q_{ntimes n}$ and upper-triangular $U_{ntimes n}$ such that:$$A=QUQ^H$$where $^H$ denotes the Hermitian operator (conjugate-transpose operator) and a unitary matrix is any square matrix $Q$ with the property $QQ^H=I$.




        Also the SVD is a very important and beautiful matrix decomposition (probably the best ever!) defined for any arbitrary matrix as follows:




        The Singular Value Decomposition of an $mtimes n$ matrix $A$ is any triple $(U_{mtimes m},D_{mtimes n},V_{ntimes n})$ such that $$A=UDV^H$$where $U,V$ are unitary and $D$ is diagonal as the non-diagonal entries (i.e. entries $d_{ij}$ with $ine j$) are all zero.




        Such a decomposition exists for any matrix.



        The existence of SVD for a matrix $A$ is followed a very interesting background. As any matrix $A$ can be interpreted as a linear operator from $Bbb R^n$ onto $Bbb R^m$, one can split the $A$-operation of a vector as below:



        Operation 1 : a vector is first rotated in $Bbb R^n$ by multiplying in $V$ ($V$-operation).



        Operation 2 : the outcome vector is then multiplied in $D$ which can be interpreted as a scale and transformation from $Bbb R^n$ to $Bbb R^m$ ($D$-operation).



        Operation 3 : the final vector is once more rotated in $Bbb R^m$ to yield the result.



        SVD enjoys a widespread use in mathematical frameworks. For more information about these two and more useful decompositions (such as Cholesky decomposition for a symmetric non-negative definite matrix), I suggest you the following links:



        https://en.wikipedia.org/wiki/Singular_value_decomposition



        https://en.wikipedia.org/wiki/Schur_decomposition



        https://en.wikipedia.org/wiki/Matrix_decomposition






        share|cite|improve this answer









        $endgroup$



        The Schur decomposition is defined for any square matrix as follows:




        For any $ntimes n$ matrix $A$, there exist (non necessarily unique) unitary $Q_{ntimes n}$ and upper-triangular $U_{ntimes n}$ such that:$$A=QUQ^H$$where $^H$ denotes the Hermitian operator (conjugate-transpose operator) and a unitary matrix is any square matrix $Q$ with the property $QQ^H=I$.




        Also the SVD is a very important and beautiful matrix decomposition (probably the best ever!) defined for any arbitrary matrix as follows:




        The Singular Value Decomposition of an $mtimes n$ matrix $A$ is any triple $(U_{mtimes m},D_{mtimes n},V_{ntimes n})$ such that $$A=UDV^H$$where $U,V$ are unitary and $D$ is diagonal as the non-diagonal entries (i.e. entries $d_{ij}$ with $ine j$) are all zero.




        Such a decomposition exists for any matrix.



        The existence of SVD for a matrix $A$ is followed a very interesting background. As any matrix $A$ can be interpreted as a linear operator from $Bbb R^n$ onto $Bbb R^m$, one can split the $A$-operation of a vector as below:



        Operation 1 : a vector is first rotated in $Bbb R^n$ by multiplying in $V$ ($V$-operation).



        Operation 2 : the outcome vector is then multiplied in $D$ which can be interpreted as a scale and transformation from $Bbb R^n$ to $Bbb R^m$ ($D$-operation).



        Operation 3 : the final vector is once more rotated in $Bbb R^m$ to yield the result.



        SVD enjoys a widespread use in mathematical frameworks. For more information about these two and more useful decompositions (such as Cholesky decomposition for a symmetric non-negative definite matrix), I suggest you the following links:



        https://en.wikipedia.org/wiki/Singular_value_decomposition



        https://en.wikipedia.org/wiki/Schur_decomposition



        https://en.wikipedia.org/wiki/Matrix_decomposition







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Feb 3 at 9:56









        Mostafa AyazMostafa Ayaz

        18.1k31040




        18.1k31040






























            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%2f3098332%2fmatrices-properties-discussion%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

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

            SQL update select statement

            WPF add header to Image with URL pettitions [duplicate]