How to show that the set of orthogonal n x n matrices forms a group under multiplication

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












I am studying orthogonal matrices and I am not sure if to show if a set of orthogonal n x n matrices forms a group under multiplication we must check each of the group axioms.



I found that the axioms are:



1.Closure
2.Associativity
3.Existence of identity matrix
4. Existence of the inverse matrix.



I edited my question, since I was able to find more information about this topic.



This group is called O(n)



To check the four axioms I did:



Let A and B $in$ O(n), denoted as orthogonal matrices and assume that C=AB then:



Closure:



To prove that C $in$ O(n) we must prove that C is a real n x n orthogonal matrix with uni-modular determinant. Since A and B are real n x n matrices, C is also real n x n matrix so,



$C^TC=(AB)^T AB=B^T A^T AB = B^TB=I$



Associativity:



Matrix multiplications associative, so the law holds for O(n) group elements.
I am not sure if this is enough to prove associativity.



Identity element:



The n x n identity matrix I represents the identity element.
In this case I am not sure if this is enough to prove the identity element.



Inverse element:



Let $A^-1$ be the inverse of A, then we need to prove that $A^-1$ $ in$ O(n) since $(A^-1)^T=(A^T)^-1$ we have that:



$(A^-1)^T A^-1=(A^T)^-1 A ^-1=(AA^T)^-1=I^-1=I$



Can anyone check if what I did is correct? I also would like to know if I can prove the Associativity and the identity element in a better way.



thanks










share|cite|improve this question























  • You can use the subgroup test instead of going through each axiom if you like (assuming you've already proven that the set of all $ntimes n$ invertible matrices is a group under multiplication (i.e. the general linear group)).
    – user137731
    Feb 26 '17 at 3:19










  • It woud be useful to know where you got stuck.
    – Mariano Suárez-Álvarez
    Feb 26 '17 at 3:32










  • HI, I edited my question, I am not showing my answer.
    – user290335
    Feb 26 '17 at 17:09










  • @Bye_World for this I would like to use the axioms thank you for your help.
    – user290335
    Feb 26 '17 at 17:10














up vote
0
down vote

favorite












I am studying orthogonal matrices and I am not sure if to show if a set of orthogonal n x n matrices forms a group under multiplication we must check each of the group axioms.



I found that the axioms are:



1.Closure
2.Associativity
3.Existence of identity matrix
4. Existence of the inverse matrix.



I edited my question, since I was able to find more information about this topic.



This group is called O(n)



To check the four axioms I did:



Let A and B $in$ O(n), denoted as orthogonal matrices and assume that C=AB then:



Closure:



To prove that C $in$ O(n) we must prove that C is a real n x n orthogonal matrix with uni-modular determinant. Since A and B are real n x n matrices, C is also real n x n matrix so,



$C^TC=(AB)^T AB=B^T A^T AB = B^TB=I$



Associativity:



Matrix multiplications associative, so the law holds for O(n) group elements.
I am not sure if this is enough to prove associativity.



Identity element:



The n x n identity matrix I represents the identity element.
In this case I am not sure if this is enough to prove the identity element.



Inverse element:



Let $A^-1$ be the inverse of A, then we need to prove that $A^-1$ $ in$ O(n) since $(A^-1)^T=(A^T)^-1$ we have that:



$(A^-1)^T A^-1=(A^T)^-1 A ^-1=(AA^T)^-1=I^-1=I$



Can anyone check if what I did is correct? I also would like to know if I can prove the Associativity and the identity element in a better way.



thanks










share|cite|improve this question























  • You can use the subgroup test instead of going through each axiom if you like (assuming you've already proven that the set of all $ntimes n$ invertible matrices is a group under multiplication (i.e. the general linear group)).
    – user137731
    Feb 26 '17 at 3:19










  • It woud be useful to know where you got stuck.
    – Mariano Suárez-Álvarez
    Feb 26 '17 at 3:32










  • HI, I edited my question, I am not showing my answer.
    – user290335
    Feb 26 '17 at 17:09










  • @Bye_World for this I would like to use the axioms thank you for your help.
    – user290335
    Feb 26 '17 at 17:10












up vote
0
down vote

favorite









up vote
0
down vote

favorite











I am studying orthogonal matrices and I am not sure if to show if a set of orthogonal n x n matrices forms a group under multiplication we must check each of the group axioms.



I found that the axioms are:



1.Closure
2.Associativity
3.Existence of identity matrix
4. Existence of the inverse matrix.



I edited my question, since I was able to find more information about this topic.



This group is called O(n)



To check the four axioms I did:



Let A and B $in$ O(n), denoted as orthogonal matrices and assume that C=AB then:



Closure:



To prove that C $in$ O(n) we must prove that C is a real n x n orthogonal matrix with uni-modular determinant. Since A and B are real n x n matrices, C is also real n x n matrix so,



$C^TC=(AB)^T AB=B^T A^T AB = B^TB=I$



Associativity:



Matrix multiplications associative, so the law holds for O(n) group elements.
I am not sure if this is enough to prove associativity.



Identity element:



The n x n identity matrix I represents the identity element.
In this case I am not sure if this is enough to prove the identity element.



Inverse element:



Let $A^-1$ be the inverse of A, then we need to prove that $A^-1$ $ in$ O(n) since $(A^-1)^T=(A^T)^-1$ we have that:



$(A^-1)^T A^-1=(A^T)^-1 A ^-1=(AA^T)^-1=I^-1=I$



Can anyone check if what I did is correct? I also would like to know if I can prove the Associativity and the identity element in a better way.



thanks










share|cite|improve this question















I am studying orthogonal matrices and I am not sure if to show if a set of orthogonal n x n matrices forms a group under multiplication we must check each of the group axioms.



I found that the axioms are:



1.Closure
2.Associativity
3.Existence of identity matrix
4. Existence of the inverse matrix.



I edited my question, since I was able to find more information about this topic.



This group is called O(n)



To check the four axioms I did:



Let A and B $in$ O(n), denoted as orthogonal matrices and assume that C=AB then:



Closure:



To prove that C $in$ O(n) we must prove that C is a real n x n orthogonal matrix with uni-modular determinant. Since A and B are real n x n matrices, C is also real n x n matrix so,



$C^TC=(AB)^T AB=B^T A^T AB = B^TB=I$



Associativity:



Matrix multiplications associative, so the law holds for O(n) group elements.
I am not sure if this is enough to prove associativity.



Identity element:



The n x n identity matrix I represents the identity element.
In this case I am not sure if this is enough to prove the identity element.



Inverse element:



Let $A^-1$ be the inverse of A, then we need to prove that $A^-1$ $ in$ O(n) since $(A^-1)^T=(A^T)^-1$ we have that:



$(A^-1)^T A^-1=(A^T)^-1 A ^-1=(AA^T)^-1=I^-1=I$



Can anyone check if what I did is correct? I also would like to know if I can prove the Associativity and the identity element in a better way.



thanks







linear-algebra proof-explanation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 2 at 5:57









Did

243k23209444




243k23209444










asked Feb 26 '17 at 2:58









user290335

457517




457517











  • You can use the subgroup test instead of going through each axiom if you like (assuming you've already proven that the set of all $ntimes n$ invertible matrices is a group under multiplication (i.e. the general linear group)).
    – user137731
    Feb 26 '17 at 3:19










  • It woud be useful to know where you got stuck.
    – Mariano Suárez-Álvarez
    Feb 26 '17 at 3:32










  • HI, I edited my question, I am not showing my answer.
    – user290335
    Feb 26 '17 at 17:09










  • @Bye_World for this I would like to use the axioms thank you for your help.
    – user290335
    Feb 26 '17 at 17:10
















  • You can use the subgroup test instead of going through each axiom if you like (assuming you've already proven that the set of all $ntimes n$ invertible matrices is a group under multiplication (i.e. the general linear group)).
    – user137731
    Feb 26 '17 at 3:19










  • It woud be useful to know where you got stuck.
    – Mariano Suárez-Álvarez
    Feb 26 '17 at 3:32










  • HI, I edited my question, I am not showing my answer.
    – user290335
    Feb 26 '17 at 17:09










  • @Bye_World for this I would like to use the axioms thank you for your help.
    – user290335
    Feb 26 '17 at 17:10















You can use the subgroup test instead of going through each axiom if you like (assuming you've already proven that the set of all $ntimes n$ invertible matrices is a group under multiplication (i.e. the general linear group)).
– user137731
Feb 26 '17 at 3:19




You can use the subgroup test instead of going through each axiom if you like (assuming you've already proven that the set of all $ntimes n$ invertible matrices is a group under multiplication (i.e. the general linear group)).
– user137731
Feb 26 '17 at 3:19












It woud be useful to know where you got stuck.
– Mariano Suárez-Álvarez
Feb 26 '17 at 3:32




It woud be useful to know where you got stuck.
– Mariano Suárez-Álvarez
Feb 26 '17 at 3:32












HI, I edited my question, I am not showing my answer.
– user290335
Feb 26 '17 at 17:09




HI, I edited my question, I am not showing my answer.
– user290335
Feb 26 '17 at 17:09












@Bye_World for this I would like to use the axioms thank you for your help.
– user290335
Feb 26 '17 at 17:10




@Bye_World for this I would like to use the axioms thank you for your help.
– user290335
Feb 26 '17 at 17:10










2 Answers
2






active

oldest

votes

















up vote
2
down vote













$(U_1 U_2)^T (U_1 U_2) = I$, hence $U_1 circ U_2$ is orthogonal.



Associativity follows from associativity of matrix multiplication.



The matrix $I$ is an identity for matrix multiplication.



$U^T U = U U^T = I$, hence $U^-1 = U^T$ is the required inverse.






share|cite|improve this answer




















  • Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
    – user290335
    Feb 26 '17 at 17:08










  • I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
    – copper.hat
    Feb 26 '17 at 22:50

















up vote
-3
down vote













Your doubt about the identity element is correct.



First you need to show that $I in O(n)$ by showing that
$$I^TI=II^T=I,~~textsince~I^T=I.$$
Then
$$AI=IA=A, forall Ain O(n).$$






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: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2161738%2fhow-to-show-that-the-set-of-orthogonal-n-x-n-matrices-forms-a-group-under-multip%23new-answer', 'question_page');

    );

    Post as a guest






























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    2
    down vote













    $(U_1 U_2)^T (U_1 U_2) = I$, hence $U_1 circ U_2$ is orthogonal.



    Associativity follows from associativity of matrix multiplication.



    The matrix $I$ is an identity for matrix multiplication.



    $U^T U = U U^T = I$, hence $U^-1 = U^T$ is the required inverse.






    share|cite|improve this answer




















    • Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
      – user290335
      Feb 26 '17 at 17:08










    • I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
      – copper.hat
      Feb 26 '17 at 22:50














    up vote
    2
    down vote













    $(U_1 U_2)^T (U_1 U_2) = I$, hence $U_1 circ U_2$ is orthogonal.



    Associativity follows from associativity of matrix multiplication.



    The matrix $I$ is an identity for matrix multiplication.



    $U^T U = U U^T = I$, hence $U^-1 = U^T$ is the required inverse.






    share|cite|improve this answer




















    • Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
      – user290335
      Feb 26 '17 at 17:08










    • I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
      – copper.hat
      Feb 26 '17 at 22:50












    up vote
    2
    down vote










    up vote
    2
    down vote









    $(U_1 U_2)^T (U_1 U_2) = I$, hence $U_1 circ U_2$ is orthogonal.



    Associativity follows from associativity of matrix multiplication.



    The matrix $I$ is an identity for matrix multiplication.



    $U^T U = U U^T = I$, hence $U^-1 = U^T$ is the required inverse.






    share|cite|improve this answer












    $(U_1 U_2)^T (U_1 U_2) = I$, hence $U_1 circ U_2$ is orthogonal.



    Associativity follows from associativity of matrix multiplication.



    The matrix $I$ is an identity for matrix multiplication.



    $U^T U = U U^T = I$, hence $U^-1 = U^T$ is the required inverse.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Feb 26 '17 at 3:26









    copper.hat

    123k557156




    123k557156











    • Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
      – user290335
      Feb 26 '17 at 17:08










    • I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
      – copper.hat
      Feb 26 '17 at 22:50
















    • Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
      – user290335
      Feb 26 '17 at 17:08










    • I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
      – copper.hat
      Feb 26 '17 at 22:50















    Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
    – user290335
    Feb 26 '17 at 17:08




    Hi, I edited my question so I could show my work. Is there any other way to prove the associativity and the Identity matrix? Thanks
    – user290335
    Feb 26 '17 at 17:08












    I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
    – copper.hat
    Feb 26 '17 at 22:50




    I don't know what you mean by 'and the identity matrix'. The group operation is matrix multiplication, so I am not sure how one would show associativity other than showing associativity of matrix multiplication.
    – copper.hat
    Feb 26 '17 at 22:50










    up vote
    -3
    down vote













    Your doubt about the identity element is correct.



    First you need to show that $I in O(n)$ by showing that
    $$I^TI=II^T=I,~~textsince~I^T=I.$$
    Then
    $$AI=IA=A, forall Ain O(n).$$






    share|cite|improve this answer
























      up vote
      -3
      down vote













      Your doubt about the identity element is correct.



      First you need to show that $I in O(n)$ by showing that
      $$I^TI=II^T=I,~~textsince~I^T=I.$$
      Then
      $$AI=IA=A, forall Ain O(n).$$






      share|cite|improve this answer






















        up vote
        -3
        down vote










        up vote
        -3
        down vote









        Your doubt about the identity element is correct.



        First you need to show that $I in O(n)$ by showing that
        $$I^TI=II^T=I,~~textsince~I^T=I.$$
        Then
        $$AI=IA=A, forall Ain O(n).$$






        share|cite|improve this answer












        Your doubt about the identity element is correct.



        First you need to show that $I in O(n)$ by showing that
        $$I^TI=II^T=I,~~textsince~I^T=I.$$
        Then
        $$AI=IA=A, forall Ain O(n).$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Sep 2 at 5:29









        mhmurad

        11




        11



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2161738%2fhow-to-show-that-the-set-of-orthogonal-n-x-n-matrices-forms-a-group-under-multip%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            tkz-euclide: tkzDrawCircle[R] not working

            How to combine Bézier curves to a surface?

            1st Magritte Awards