Notation for repeated composition of functions












5












$begingroup$


I have a repeated composition of functions ${T_n}(z) = {tau _0} circ {tau _1} circ {tau _2} circ cdots circ {tau _n}(z)$



By analogy with $sumlimits_{i = 1}^n {} ,prodlimits_{i = 1}^n {} ,bigcuplimits_{i = 1}^n {} ,bigcaplimits_{i = 1}^n {} ,$
I want to write ${T_n}(z) = left( {mathop circ limits_{i = 0}^n {tau _i}} right)(z)$ or even ${T_n}(z) = {mathop circ limits_{i = 0}^n {tau _i}} (z)$. Can I do this?






notation function-and-relation-composition







share|cite|improve this question









$endgroup$

















    5












    $begingroup$


    I have a repeated composition of functions ${T_n}(z) = {tau _0} circ {tau _1} circ {tau _2} circ cdots circ {tau _n}(z)$



    By analogy with $sumlimits_{i = 1}^n {} ,prodlimits_{i = 1}^n {} ,bigcuplimits_{i = 1}^n {} ,bigcaplimits_{i = 1}^n {} ,$
    I want to write ${T_n}(z) = left( {mathop circ limits_{i = 0}^n {tau _i}} right)(z)$ or even ${T_n}(z) = {mathop circ limits_{i = 0}^n {tau _i}} (z)$. Can I do this?






    notation function-and-relation-composition







    share|cite|improve this question









    $endgroup$















      5












      5








      5


      1



      $begingroup$


      I have a repeated composition of functions ${T_n}(z) = {tau _0} circ {tau _1} circ {tau _2} circ cdots circ {tau _n}(z)$



      By analogy with $sumlimits_{i = 1}^n {} ,prodlimits_{i = 1}^n {} ,bigcuplimits_{i = 1}^n {} ,bigcaplimits_{i = 1}^n {} ,$
      I want to write ${T_n}(z) = left( {mathop circ limits_{i = 0}^n {tau _i}} right)(z)$ or even ${T_n}(z) = {mathop circ limits_{i = 0}^n {tau _i}} (z)$. Can I do this?






      notation function-and-relation-composition







      share|cite|improve this question









      $endgroup$




      I have a repeated composition of functions ${T_n}(z) = {tau _0} circ {tau _1} circ {tau _2} circ cdots circ {tau _n}(z)$



      By analogy with $sumlimits_{i = 1}^n {} ,prodlimits_{i = 1}^n {} ,bigcuplimits_{i = 1}^n {} ,bigcaplimits_{i = 1}^n {} ,$
      I want to write ${T_n}(z) = left( {mathop circ limits_{i = 0}^n {tau _i}} right)(z)$ or even ${T_n}(z) = {mathop circ limits_{i = 0}^n {tau _i}} (z)$. Can I do this?






      notation function-and-relation-composition




      notation function-and-relation-composition






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Sep 10 '14 at 13:07









      BudgieJaneBudgieJane

      667




      667






















          3 Answers
          3






          active

          oldest

          votes


















          3












          $begingroup$

          If I were writing something in which I had to do a large number of these, the following is probably not quite what I would do:
          $$
          overset{n}{underset{k=0}bigcirc} f_k quad text{ or } quad overset{0}{underset{k=n}bigcirc} f_k .
          $$
          Instead, I'd go over to tex.stackexchange.com and ask how to make this thing look respectable instead of like a workaround. I'd probably want it to be comparable in size and boldness to something like $displaystylebigcap$ in $displaystylebigcap_{k=0}^n A_k$ or to $displaystylebigoplus$. Before the begin{document} I'd put newcommand{Circ}{blah blah blah} (with a capital "C" distinguishing it from circ.






          share|cite|improve this answer











          $endgroup$





















            2












            $begingroup$

            Basically you can do anything. Notice, however, that the classical operators $sum$ and $prod$ do not coincide with the symbols they represent. And old books used to have $sum$ instead of $bigcup$ and $prod$ instead of $bigcap$.



            I personally understand the notation $mathop{circ}_{n=1}^N$, but it doesn't look appealing. By analogy, why don't you define $$mathop{rm C}limits_{n=1}^N $$ or $$mathop{rm K}limits_{n=1}^N ?$$
            Anyway, I don't like them either...






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
              $endgroup$
              – BudgieJane
              Sep 10 '14 at 17:55



















            2












            $begingroup$

            Let $f_n(x)$ be a sequence of functions indexed by $n$.



            Define a new sequence of functions $F_k(x)$ indexed by $k$:



            $$
            F_k(x) =
            begin{cases}
            f_0(x) &: k=0\
            (f_kcirc F_{k-1})(x)&: kgt 0
            end{cases}
            $$



            So you have, for example
            $$
            begin{align}
            F_0(x) &= f_0(x)\
            F_1(x) &= (f_1 circ f_0)(x)\
            F_2(x) &= (f_2 circ F_1)(x) = (f_2 circ f_1 circ f_0)(x)\
            &dots\
            F_{n}(x) &= (f_ncirc f_{n-1} circ cdots circ f_0)(x)\
            end{align}
            $$



            Then for your composition $f_ncirc f_{n-1} circ cdots circ f_0$ of $n$ terms you can simply write $F_n$.



            Of course you can define a new sequence $G_n$ for the ascending direction, i.e., $G_2 = f_0 circ f_1 circ f_2$.






            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%2f926247%2fnotation-for-repeated-composition-of-functions%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              3












              $begingroup$

              If I were writing something in which I had to do a large number of these, the following is probably not quite what I would do:
              $$
              overset{n}{underset{k=0}bigcirc} f_k quad text{ or } quad overset{0}{underset{k=n}bigcirc} f_k .
              $$
              Instead, I'd go over to tex.stackexchange.com and ask how to make this thing look respectable instead of like a workaround. I'd probably want it to be comparable in size and boldness to something like $displaystylebigcap$ in $displaystylebigcap_{k=0}^n A_k$ or to $displaystylebigoplus$. Before the begin{document} I'd put newcommand{Circ}{blah blah blah} (with a capital "C" distinguishing it from circ.






              share|cite|improve this answer











              $endgroup$


















                3












                $begingroup$

                If I were writing something in which I had to do a large number of these, the following is probably not quite what I would do:
                $$
                overset{n}{underset{k=0}bigcirc} f_k quad text{ or } quad overset{0}{underset{k=n}bigcirc} f_k .
                $$
                Instead, I'd go over to tex.stackexchange.com and ask how to make this thing look respectable instead of like a workaround. I'd probably want it to be comparable in size and boldness to something like $displaystylebigcap$ in $displaystylebigcap_{k=0}^n A_k$ or to $displaystylebigoplus$. Before the begin{document} I'd put newcommand{Circ}{blah blah blah} (with a capital "C" distinguishing it from circ.






                share|cite|improve this answer











                $endgroup$
















                  3












                  3








                  3





                  $begingroup$

                  If I were writing something in which I had to do a large number of these, the following is probably not quite what I would do:
                  $$
                  overset{n}{underset{k=0}bigcirc} f_k quad text{ or } quad overset{0}{underset{k=n}bigcirc} f_k .
                  $$
                  Instead, I'd go over to tex.stackexchange.com and ask how to make this thing look respectable instead of like a workaround. I'd probably want it to be comparable in size and boldness to something like $displaystylebigcap$ in $displaystylebigcap_{k=0}^n A_k$ or to $displaystylebigoplus$. Before the begin{document} I'd put newcommand{Circ}{blah blah blah} (with a capital "C" distinguishing it from circ.






                  share|cite|improve this answer











                  $endgroup$



                  If I were writing something in which I had to do a large number of these, the following is probably not quite what I would do:
                  $$
                  overset{n}{underset{k=0}bigcirc} f_k quad text{ or } quad overset{0}{underset{k=n}bigcirc} f_k .
                  $$
                  Instead, I'd go over to tex.stackexchange.com and ask how to make this thing look respectable instead of like a workaround. I'd probably want it to be comparable in size and boldness to something like $displaystylebigcap$ in $displaystylebigcap_{k=0}^n A_k$ or to $displaystylebigoplus$. Before the begin{document} I'd put newcommand{Circ}{blah blah blah} (with a capital "C" distinguishing it from circ.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Dec 21 '18 at 10:41









                  Sik Feng Cheong

                  1579




                  1579










                  answered Jan 8 '15 at 23:28









                  Michael HardyMichael Hardy

                  1




                  1























                      2












                      $begingroup$

                      Basically you can do anything. Notice, however, that the classical operators $sum$ and $prod$ do not coincide with the symbols they represent. And old books used to have $sum$ instead of $bigcup$ and $prod$ instead of $bigcap$.



                      I personally understand the notation $mathop{circ}_{n=1}^N$, but it doesn't look appealing. By analogy, why don't you define $$mathop{rm C}limits_{n=1}^N $$ or $$mathop{rm K}limits_{n=1}^N ?$$
                      Anyway, I don't like them either...






                      share|cite|improve this answer









                      $endgroup$













                      • $begingroup$
                        I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
                        $endgroup$
                        – BudgieJane
                        Sep 10 '14 at 17:55
















                      2












                      $begingroup$

                      Basically you can do anything. Notice, however, that the classical operators $sum$ and $prod$ do not coincide with the symbols they represent. And old books used to have $sum$ instead of $bigcup$ and $prod$ instead of $bigcap$.



                      I personally understand the notation $mathop{circ}_{n=1}^N$, but it doesn't look appealing. By analogy, why don't you define $$mathop{rm C}limits_{n=1}^N $$ or $$mathop{rm K}limits_{n=1}^N ?$$
                      Anyway, I don't like them either...






                      share|cite|improve this answer









                      $endgroup$













                      • $begingroup$
                        I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
                        $endgroup$
                        – BudgieJane
                        Sep 10 '14 at 17:55














                      2












                      2








                      2





                      $begingroup$

                      Basically you can do anything. Notice, however, that the classical operators $sum$ and $prod$ do not coincide with the symbols they represent. And old books used to have $sum$ instead of $bigcup$ and $prod$ instead of $bigcap$.



                      I personally understand the notation $mathop{circ}_{n=1}^N$, but it doesn't look appealing. By analogy, why don't you define $$mathop{rm C}limits_{n=1}^N $$ or $$mathop{rm K}limits_{n=1}^N ?$$
                      Anyway, I don't like them either...






                      share|cite|improve this answer









                      $endgroup$



                      Basically you can do anything. Notice, however, that the classical operators $sum$ and $prod$ do not coincide with the symbols they represent. And old books used to have $sum$ instead of $bigcup$ and $prod$ instead of $bigcap$.



                      I personally understand the notation $mathop{circ}_{n=1}^N$, but it doesn't look appealing. By analogy, why don't you define $$mathop{rm C}limits_{n=1}^N $$ or $$mathop{rm K}limits_{n=1}^N ?$$
                      Anyway, I don't like them either...







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Sep 10 '14 at 13:14









                      SiminoreSiminore

                      30.4k33368




                      30.4k33368












                      • $begingroup$
                        I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
                        $endgroup$
                        – BudgieJane
                        Sep 10 '14 at 17:55


















                      • $begingroup$
                        I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
                        $endgroup$
                        – BudgieJane
                        Sep 10 '14 at 17:55
















                      $begingroup$
                      I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
                      $endgroup$
                      – BudgieJane
                      Sep 10 '14 at 17:55




                      $begingroup$
                      I can't use K as that's already in use for continued fractions, because K = Kettenbruch, the German for Continued Fraction.
                      $endgroup$
                      – BudgieJane
                      Sep 10 '14 at 17:55











                      2












                      $begingroup$

                      Let $f_n(x)$ be a sequence of functions indexed by $n$.



                      Define a new sequence of functions $F_k(x)$ indexed by $k$:



                      $$
                      F_k(x) =
                      begin{cases}
                      f_0(x) &: k=0\
                      (f_kcirc F_{k-1})(x)&: kgt 0
                      end{cases}
                      $$



                      So you have, for example
                      $$
                      begin{align}
                      F_0(x) &= f_0(x)\
                      F_1(x) &= (f_1 circ f_0)(x)\
                      F_2(x) &= (f_2 circ F_1)(x) = (f_2 circ f_1 circ f_0)(x)\
                      &dots\
                      F_{n}(x) &= (f_ncirc f_{n-1} circ cdots circ f_0)(x)\
                      end{align}
                      $$



                      Then for your composition $f_ncirc f_{n-1} circ cdots circ f_0$ of $n$ terms you can simply write $F_n$.



                      Of course you can define a new sequence $G_n$ for the ascending direction, i.e., $G_2 = f_0 circ f_1 circ f_2$.






                      share|cite|improve this answer









                      $endgroup$


















                        2












                        $begingroup$

                        Let $f_n(x)$ be a sequence of functions indexed by $n$.



                        Define a new sequence of functions $F_k(x)$ indexed by $k$:



                        $$
                        F_k(x) =
                        begin{cases}
                        f_0(x) &: k=0\
                        (f_kcirc F_{k-1})(x)&: kgt 0
                        end{cases}
                        $$



                        So you have, for example
                        $$
                        begin{align}
                        F_0(x) &= f_0(x)\
                        F_1(x) &= (f_1 circ f_0)(x)\
                        F_2(x) &= (f_2 circ F_1)(x) = (f_2 circ f_1 circ f_0)(x)\
                        &dots\
                        F_{n}(x) &= (f_ncirc f_{n-1} circ cdots circ f_0)(x)\
                        end{align}
                        $$



                        Then for your composition $f_ncirc f_{n-1} circ cdots circ f_0$ of $n$ terms you can simply write $F_n$.



                        Of course you can define a new sequence $G_n$ for the ascending direction, i.e., $G_2 = f_0 circ f_1 circ f_2$.






                        share|cite|improve this answer









                        $endgroup$
















                          2












                          2








                          2





                          $begingroup$

                          Let $f_n(x)$ be a sequence of functions indexed by $n$.



                          Define a new sequence of functions $F_k(x)$ indexed by $k$:



                          $$
                          F_k(x) =
                          begin{cases}
                          f_0(x) &: k=0\
                          (f_kcirc F_{k-1})(x)&: kgt 0
                          end{cases}
                          $$



                          So you have, for example
                          $$
                          begin{align}
                          F_0(x) &= f_0(x)\
                          F_1(x) &= (f_1 circ f_0)(x)\
                          F_2(x) &= (f_2 circ F_1)(x) = (f_2 circ f_1 circ f_0)(x)\
                          &dots\
                          F_{n}(x) &= (f_ncirc f_{n-1} circ cdots circ f_0)(x)\
                          end{align}
                          $$



                          Then for your composition $f_ncirc f_{n-1} circ cdots circ f_0$ of $n$ terms you can simply write $F_n$.



                          Of course you can define a new sequence $G_n$ for the ascending direction, i.e., $G_2 = f_0 circ f_1 circ f_2$.






                          share|cite|improve this answer









                          $endgroup$



                          Let $f_n(x)$ be a sequence of functions indexed by $n$.



                          Define a new sequence of functions $F_k(x)$ indexed by $k$:



                          $$
                          F_k(x) =
                          begin{cases}
                          f_0(x) &: k=0\
                          (f_kcirc F_{k-1})(x)&: kgt 0
                          end{cases}
                          $$



                          So you have, for example
                          $$
                          begin{align}
                          F_0(x) &= f_0(x)\
                          F_1(x) &= (f_1 circ f_0)(x)\
                          F_2(x) &= (f_2 circ F_1)(x) = (f_2 circ f_1 circ f_0)(x)\
                          &dots\
                          F_{n}(x) &= (f_ncirc f_{n-1} circ cdots circ f_0)(x)\
                          end{align}
                          $$



                          Then for your composition $f_ncirc f_{n-1} circ cdots circ f_0$ of $n$ terms you can simply write $F_n$.



                          Of course you can define a new sequence $G_n$ for the ascending direction, i.e., $G_2 = f_0 circ f_1 circ f_2$.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Oct 24 '16 at 1:36









                          chharveychharvey

                          1,37131839




                          1,37131839






























                              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%2f926247%2fnotation-for-repeated-composition-of-functions%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

                              Quarter-circle Tiles

                              Image
                              up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
                              Read more

                              build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

                              Image
                              0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
                              Read more

                              Mont Emei

                              Image
                              Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
                              Read more