How can I find the inverse of a permutation?











up vote
2
down vote

favorite












My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?




The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
$$left(begin{matrix}
1 & 2 & 3 & cdots & n\
a_1 & a_2 & a_3 & cdots & a_n
end{matrix}right)$$

the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
$$left(begin{matrix}
a_1 & a_2 & a_3 & cdots & n\
1 & 2 & 3 & cdots & n
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & cdots & n\
a'_1 & a'_2 & a'_3 & cdots & a'_n
end{matrix}right) $$

For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since



$$left(begin{matrix}
5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
end{matrix}right) $$




— Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.










share|cite|improve this question


























    up vote
    2
    down vote

    favorite












    My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?




    The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
    $$left(begin{matrix}
    1 & 2 & 3 & cdots & n\
    a_1 & a_2 & a_3 & cdots & a_n
    end{matrix}right)$$

    the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
    $$left(begin{matrix}
    a_1 & a_2 & a_3 & cdots & n\
    1 & 2 & 3 & cdots & n
    end{matrix}right)=left(begin{matrix}
    1 & 2 & 3 & cdots & n\
    a'_1 & a'_2 & a'_3 & cdots & a'_n
    end{matrix}right) $$

    For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since



    $$left(begin{matrix}
    5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
    1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
    end{matrix}right)=left(begin{matrix}
    1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
    3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
    end{matrix}right) $$




    — Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.










    share|cite|improve this question
























      up vote
      2
      down vote

      favorite









      up vote
      2
      down vote

      favorite











      My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?




      The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
      $$left(begin{matrix}
      1 & 2 & 3 & cdots & n\
      a_1 & a_2 & a_3 & cdots & a_n
      end{matrix}right)$$

      the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
      $$left(begin{matrix}
      a_1 & a_2 & a_3 & cdots & n\
      1 & 2 & 3 & cdots & n
      end{matrix}right)=left(begin{matrix}
      1 & 2 & 3 & cdots & n\
      a'_1 & a'_2 & a'_3 & cdots & a'_n
      end{matrix}right) $$

      For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since



      $$left(begin{matrix}
      5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
      1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
      end{matrix}right)=left(begin{matrix}
      1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
      3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
      end{matrix}right) $$




      — Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.










      share|cite|improve this question













      My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?




      The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
      $$left(begin{matrix}
      1 & 2 & 3 & cdots & n\
      a_1 & a_2 & a_3 & cdots & a_n
      end{matrix}right)$$

      the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
      $$left(begin{matrix}
      a_1 & a_2 & a_3 & cdots & n\
      1 & 2 & 3 & cdots & n
      end{matrix}right)=left(begin{matrix}
      1 & 2 & 3 & cdots & n\
      a'_1 & a'_2 & a'_3 & cdots & a'_n
      end{matrix}right) $$

      For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since



      $$left(begin{matrix}
      5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
      1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
      end{matrix}right)=left(begin{matrix}
      1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
      3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
      end{matrix}right) $$




      — Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.







      permutations inverse






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 15 at 6:39









      Jonathan Komar

      1287




      1287






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).






          share|cite|improve this answer






























            up vote
            1
            down vote













            Given permutation is: 591826473
            To get the inverse of this first write down the position of 1
            It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.






            share|cite|improve this answer





















            • I get how. I don‘t get the explanation in the quotation.
              – Jonathan Komar
              Nov 15 at 10:38












            • I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
              – P Vanchinathan
              Nov 15 at 10:40










            • I was of course referring to question contents. Wuestenfux addressed the issue from the book.
              – Jonathan Komar
              Nov 15 at 10:42













            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: 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%2f2999320%2fhow-can-i-find-the-inverse-of-a-permutation%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








            up vote
            2
            down vote



            accepted










            The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).






            share|cite|improve this answer



























              up vote
              2
              down vote



              accepted










              The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).






              share|cite|improve this answer

























                up vote
                2
                down vote



                accepted







                up vote
                2
                down vote



                accepted






                The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).






                share|cite|improve this answer














                The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Nov 15 at 9:46

























                answered Nov 15 at 8:46









                Wuestenfux

                2,5821410




                2,5821410






















                    up vote
                    1
                    down vote













                    Given permutation is: 591826473
                    To get the inverse of this first write down the position of 1
                    It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.






                    share|cite|improve this answer





















                    • I get how. I don‘t get the explanation in the quotation.
                      – Jonathan Komar
                      Nov 15 at 10:38












                    • I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
                      – P Vanchinathan
                      Nov 15 at 10:40










                    • I was of course referring to question contents. Wuestenfux addressed the issue from the book.
                      – Jonathan Komar
                      Nov 15 at 10:42

















                    up vote
                    1
                    down vote













                    Given permutation is: 591826473
                    To get the inverse of this first write down the position of 1
                    It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.






                    share|cite|improve this answer





















                    • I get how. I don‘t get the explanation in the quotation.
                      – Jonathan Komar
                      Nov 15 at 10:38












                    • I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
                      – P Vanchinathan
                      Nov 15 at 10:40










                    • I was of course referring to question contents. Wuestenfux addressed the issue from the book.
                      – Jonathan Komar
                      Nov 15 at 10:42















                    up vote
                    1
                    down vote










                    up vote
                    1
                    down vote









                    Given permutation is: 591826473
                    To get the inverse of this first write down the position of 1
                    It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.






                    share|cite|improve this answer












                    Given permutation is: 591826473
                    To get the inverse of this first write down the position of 1
                    It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Nov 15 at 10:06









                    P Vanchinathan

                    14.6k12036




                    14.6k12036












                    • I get how. I don‘t get the explanation in the quotation.
                      – Jonathan Komar
                      Nov 15 at 10:38












                    • I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
                      – P Vanchinathan
                      Nov 15 at 10:40










                    • I was of course referring to question contents. Wuestenfux addressed the issue from the book.
                      – Jonathan Komar
                      Nov 15 at 10:42




















                    • I get how. I don‘t get the explanation in the quotation.
                      – Jonathan Komar
                      Nov 15 at 10:38












                    • I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
                      – P Vanchinathan
                      Nov 15 at 10:40










                    • I was of course referring to question contents. Wuestenfux addressed the issue from the book.
                      – Jonathan Komar
                      Nov 15 at 10:42


















                    I get how. I don‘t get the explanation in the quotation.
                    – Jonathan Komar
                    Nov 15 at 10:38






                    I get how. I don‘t get the explanation in the quotation.
                    – Jonathan Komar
                    Nov 15 at 10:38














                    I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
                    – P Vanchinathan
                    Nov 15 at 10:40




                    I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
                    – P Vanchinathan
                    Nov 15 at 10:40












                    I was of course referring to question contents. Wuestenfux addressed the issue from the book.
                    – Jonathan Komar
                    Nov 15 at 10:42






                    I was of course referring to question contents. Wuestenfux addressed the issue from the book.
                    – Jonathan Komar
                    Nov 15 at 10:42




















                     

                    draft saved


                    draft discarded



















































                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2999320%2fhow-can-i-find-the-inverse-of-a-permutation%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

                    How to change which sound is reproduced for terminal bell?

                    Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

                    Can I use Tabulator js library in my java Spring + Thymeleaf project?