The category of $T$ algebras on Set is equivalent to the category of monoids












0














Let Set denote the category of sets.



Let $T:$ Set $to$ Set be the functor that sends a set $X$ to the set of finite words on $X$.



That is, $TX = {[x_m,..,x_1] : m = 0,1,2,3..., x_i in X}$



$T$ can be considered a monad on Set with multiplication given by concatenation, and the unit by $x to [x]$.




I'm trying to show explicitly that the category of $T$ algebras on Set
is equivalent to the category of monoids (unital).




To do this we can define a functor $F:$ Mon $to$ Alg$_T$(Set) by $F(m) = (m,a)$ where $a: Tm to m$ is s.t $a([f_n,..,f_1]) = f_n...f_1$.



I have shown that this functor is fully faithful.



However I'm not sure I understand if it is essentially surjective.



Letting $(X,a_X) in$ Alg$_T$(Set). I thought of defining a monoid $m$ as $TX$, where the action is concatenation, and the unit is simply the empty word.



Doing this yields a natural map in Alg$_T$(Set) from $TX$ to $X$, namely $a_X$. Clearly this map is onto because $a_X([x]) = x$ by definition of $(X, a_X)$ being an algebra.



But is this map injective?










share|cite|improve this question






















  • Why would you want this map to be injective ?
    – Max
    Dec 26 at 14:58










  • @Max because I need to show that $F$ is essentially surjective, so I need that $(X,a_X)$ is in the essential range.
    – Mariah
    Dec 26 at 15:09










  • Oh right I didn't understand what you were trying to do. But it isn't injective. You want to see that $X$ is the underlying set of a monoid. To define the multiplication of $x,y$, put $xtimes y := a_X([x,y])$
    – Max
    Dec 26 at 15:13










  • @Max ok, but then what do we consider the identity element? It should be a word in $X$ by your statement, but this doesn't make sense. This structure you suggested allows for writing $a_X([x]) = x$ indeed, but don't we need the identity to be in $X$?
    – Mariah
    Dec 26 at 16:25










  • $a_X()$ will be the identity. Let me write an answer it will be clearer
    – Max
    Dec 26 at 16:46
















0














Let Set denote the category of sets.



Let $T:$ Set $to$ Set be the functor that sends a set $X$ to the set of finite words on $X$.



That is, $TX = {[x_m,..,x_1] : m = 0,1,2,3..., x_i in X}$



$T$ can be considered a monad on Set with multiplication given by concatenation, and the unit by $x to [x]$.




I'm trying to show explicitly that the category of $T$ algebras on Set
is equivalent to the category of monoids (unital).




To do this we can define a functor $F:$ Mon $to$ Alg$_T$(Set) by $F(m) = (m,a)$ where $a: Tm to m$ is s.t $a([f_n,..,f_1]) = f_n...f_1$.



I have shown that this functor is fully faithful.



However I'm not sure I understand if it is essentially surjective.



Letting $(X,a_X) in$ Alg$_T$(Set). I thought of defining a monoid $m$ as $TX$, where the action is concatenation, and the unit is simply the empty word.



Doing this yields a natural map in Alg$_T$(Set) from $TX$ to $X$, namely $a_X$. Clearly this map is onto because $a_X([x]) = x$ by definition of $(X, a_X)$ being an algebra.



But is this map injective?










share|cite|improve this question






















  • Why would you want this map to be injective ?
    – Max
    Dec 26 at 14:58










  • @Max because I need to show that $F$ is essentially surjective, so I need that $(X,a_X)$ is in the essential range.
    – Mariah
    Dec 26 at 15:09










  • Oh right I didn't understand what you were trying to do. But it isn't injective. You want to see that $X$ is the underlying set of a monoid. To define the multiplication of $x,y$, put $xtimes y := a_X([x,y])$
    – Max
    Dec 26 at 15:13










  • @Max ok, but then what do we consider the identity element? It should be a word in $X$ by your statement, but this doesn't make sense. This structure you suggested allows for writing $a_X([x]) = x$ indeed, but don't we need the identity to be in $X$?
    – Mariah
    Dec 26 at 16:25










  • $a_X()$ will be the identity. Let me write an answer it will be clearer
    – Max
    Dec 26 at 16:46














0












0








0







Let Set denote the category of sets.



Let $T:$ Set $to$ Set be the functor that sends a set $X$ to the set of finite words on $X$.



That is, $TX = {[x_m,..,x_1] : m = 0,1,2,3..., x_i in X}$



$T$ can be considered a monad on Set with multiplication given by concatenation, and the unit by $x to [x]$.




I'm trying to show explicitly that the category of $T$ algebras on Set
is equivalent to the category of monoids (unital).




To do this we can define a functor $F:$ Mon $to$ Alg$_T$(Set) by $F(m) = (m,a)$ where $a: Tm to m$ is s.t $a([f_n,..,f_1]) = f_n...f_1$.



I have shown that this functor is fully faithful.



However I'm not sure I understand if it is essentially surjective.



Letting $(X,a_X) in$ Alg$_T$(Set). I thought of defining a monoid $m$ as $TX$, where the action is concatenation, and the unit is simply the empty word.



Doing this yields a natural map in Alg$_T$(Set) from $TX$ to $X$, namely $a_X$. Clearly this map is onto because $a_X([x]) = x$ by definition of $(X, a_X)$ being an algebra.



But is this map injective?










share|cite|improve this question













Let Set denote the category of sets.



Let $T:$ Set $to$ Set be the functor that sends a set $X$ to the set of finite words on $X$.



That is, $TX = {[x_m,..,x_1] : m = 0,1,2,3..., x_i in X}$



$T$ can be considered a monad on Set with multiplication given by concatenation, and the unit by $x to [x]$.




I'm trying to show explicitly that the category of $T$ algebras on Set
is equivalent to the category of monoids (unital).




To do this we can define a functor $F:$ Mon $to$ Alg$_T$(Set) by $F(m) = (m,a)$ where $a: Tm to m$ is s.t $a([f_n,..,f_1]) = f_n...f_1$.



I have shown that this functor is fully faithful.



However I'm not sure I understand if it is essentially surjective.



Letting $(X,a_X) in$ Alg$_T$(Set). I thought of defining a monoid $m$ as $TX$, where the action is concatenation, and the unit is simply the empty word.



Doing this yields a natural map in Alg$_T$(Set) from $TX$ to $X$, namely $a_X$. Clearly this map is onto because $a_X([x]) = x$ by definition of $(X, a_X)$ being an algebra.



But is this map injective?







category-theory monoid algebras monads






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 26 at 14:50









Mariah

1,340518




1,340518












  • Why would you want this map to be injective ?
    – Max
    Dec 26 at 14:58










  • @Max because I need to show that $F$ is essentially surjective, so I need that $(X,a_X)$ is in the essential range.
    – Mariah
    Dec 26 at 15:09










  • Oh right I didn't understand what you were trying to do. But it isn't injective. You want to see that $X$ is the underlying set of a monoid. To define the multiplication of $x,y$, put $xtimes y := a_X([x,y])$
    – Max
    Dec 26 at 15:13










  • @Max ok, but then what do we consider the identity element? It should be a word in $X$ by your statement, but this doesn't make sense. This structure you suggested allows for writing $a_X([x]) = x$ indeed, but don't we need the identity to be in $X$?
    – Mariah
    Dec 26 at 16:25










  • $a_X()$ will be the identity. Let me write an answer it will be clearer
    – Max
    Dec 26 at 16:46


















  • Why would you want this map to be injective ?
    – Max
    Dec 26 at 14:58










  • @Max because I need to show that $F$ is essentially surjective, so I need that $(X,a_X)$ is in the essential range.
    – Mariah
    Dec 26 at 15:09










  • Oh right I didn't understand what you were trying to do. But it isn't injective. You want to see that $X$ is the underlying set of a monoid. To define the multiplication of $x,y$, put $xtimes y := a_X([x,y])$
    – Max
    Dec 26 at 15:13










  • @Max ok, but then what do we consider the identity element? It should be a word in $X$ by your statement, but this doesn't make sense. This structure you suggested allows for writing $a_X([x]) = x$ indeed, but don't we need the identity to be in $X$?
    – Mariah
    Dec 26 at 16:25










  • $a_X()$ will be the identity. Let me write an answer it will be clearer
    – Max
    Dec 26 at 16:46
















Why would you want this map to be injective ?
– Max
Dec 26 at 14:58




Why would you want this map to be injective ?
– Max
Dec 26 at 14:58












@Max because I need to show that $F$ is essentially surjective, so I need that $(X,a_X)$ is in the essential range.
– Mariah
Dec 26 at 15:09




@Max because I need to show that $F$ is essentially surjective, so I need that $(X,a_X)$ is in the essential range.
– Mariah
Dec 26 at 15:09












Oh right I didn't understand what you were trying to do. But it isn't injective. You want to see that $X$ is the underlying set of a monoid. To define the multiplication of $x,y$, put $xtimes y := a_X([x,y])$
– Max
Dec 26 at 15:13




Oh right I didn't understand what you were trying to do. But it isn't injective. You want to see that $X$ is the underlying set of a monoid. To define the multiplication of $x,y$, put $xtimes y := a_X([x,y])$
– Max
Dec 26 at 15:13












@Max ok, but then what do we consider the identity element? It should be a word in $X$ by your statement, but this doesn't make sense. This structure you suggested allows for writing $a_X([x]) = x$ indeed, but don't we need the identity to be in $X$?
– Mariah
Dec 26 at 16:25




@Max ok, but then what do we consider the identity element? It should be a word in $X$ by your statement, but this doesn't make sense. This structure you suggested allows for writing $a_X([x]) = x$ indeed, but don't we need the identity to be in $X$?
– Mariah
Dec 26 at 16:25












$a_X()$ will be the identity. Let me write an answer it will be clearer
– Max
Dec 26 at 16:46




$a_X()$ will be the identity. Let me write an answer it will be clearer
– Max
Dec 26 at 16:46










1 Answer
1






active

oldest

votes


















1














You're starting from a $T$-algebra $(X,a_X)$, and you wish to show that it is isomorphic to $F(M)$ for some monoid $M$.



In particular, since $F(M)$ is of the form $(M,h)$ for $h:TMto M, [m_1,...,m_n]mapsto m_1...m_n$, then if there is such an isomorphism $f:Xto M$ and if $x,yin X$, then $hcirc T(f)([x,y]) = h([f(x),f(y)])=f(x)f(y)$ and $hcirc T(f)([x,y] ) = fcirc a_X([x,y])$.



Considering that $f$ is a bijection and thus identifying $M$ and $X$ with it, we get a monoid structure on $X$ such that $a_X([x,y]) = xy$.



Thus now if we want to find $M$, we know what we should do : define multiplication on $X$ by the formula $xy := a_X([x,y])$; and check that this makes $X$ into a monoid such that $F(X) simeq (X,a_X)$ (actually it will be an equality !)



To prove that $X$ is indeed a monoid with this operation, you will need to use the different properties of the monad and axioms of $T$-algebra.



Associativity will follow from the associativity axiom of $T$-algebras that says that this should commute :



$require{AMScd} begin{CD}
TTX @>{mu_X}>> TX\ @V{T(a_X)}VV @VV{a_X}V\
TX @>>{a_X}> X
end{CD}$



and the unit will be $a_X([ ])$ and the fact that this is a unit will follow from the associativity axiom for $T$-algebras, together with the unit axiom of $T$-algebras that says that this should commute :



$require{AMScd} begin{CD}
X @>{eta_X}>> TX\ @V{id_X}VV @VV{a_X}V\
X @>>{id_X}> X
end{CD}$



You then need to prove that $a_X([x_1,...,x_n]) = x_1...x_n$ but this will follow from associativity again. I'll let you check the details.






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',
    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%2f3052996%2fthe-category-of-t-algebras-on-set-is-equivalent-to-the-category-of-monoids%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









    1














    You're starting from a $T$-algebra $(X,a_X)$, and you wish to show that it is isomorphic to $F(M)$ for some monoid $M$.



    In particular, since $F(M)$ is of the form $(M,h)$ for $h:TMto M, [m_1,...,m_n]mapsto m_1...m_n$, then if there is such an isomorphism $f:Xto M$ and if $x,yin X$, then $hcirc T(f)([x,y]) = h([f(x),f(y)])=f(x)f(y)$ and $hcirc T(f)([x,y] ) = fcirc a_X([x,y])$.



    Considering that $f$ is a bijection and thus identifying $M$ and $X$ with it, we get a monoid structure on $X$ such that $a_X([x,y]) = xy$.



    Thus now if we want to find $M$, we know what we should do : define multiplication on $X$ by the formula $xy := a_X([x,y])$; and check that this makes $X$ into a monoid such that $F(X) simeq (X,a_X)$ (actually it will be an equality !)



    To prove that $X$ is indeed a monoid with this operation, you will need to use the different properties of the monad and axioms of $T$-algebra.



    Associativity will follow from the associativity axiom of $T$-algebras that says that this should commute :



    $require{AMScd} begin{CD}
    TTX @>{mu_X}>> TX\ @V{T(a_X)}VV @VV{a_X}V\
    TX @>>{a_X}> X
    end{CD}$



    and the unit will be $a_X([ ])$ and the fact that this is a unit will follow from the associativity axiom for $T$-algebras, together with the unit axiom of $T$-algebras that says that this should commute :



    $require{AMScd} begin{CD}
    X @>{eta_X}>> TX\ @V{id_X}VV @VV{a_X}V\
    X @>>{id_X}> X
    end{CD}$



    You then need to prove that $a_X([x_1,...,x_n]) = x_1...x_n$ but this will follow from associativity again. I'll let you check the details.






    share|cite|improve this answer


























      1














      You're starting from a $T$-algebra $(X,a_X)$, and you wish to show that it is isomorphic to $F(M)$ for some monoid $M$.



      In particular, since $F(M)$ is of the form $(M,h)$ for $h:TMto M, [m_1,...,m_n]mapsto m_1...m_n$, then if there is such an isomorphism $f:Xto M$ and if $x,yin X$, then $hcirc T(f)([x,y]) = h([f(x),f(y)])=f(x)f(y)$ and $hcirc T(f)([x,y] ) = fcirc a_X([x,y])$.



      Considering that $f$ is a bijection and thus identifying $M$ and $X$ with it, we get a monoid structure on $X$ such that $a_X([x,y]) = xy$.



      Thus now if we want to find $M$, we know what we should do : define multiplication on $X$ by the formula $xy := a_X([x,y])$; and check that this makes $X$ into a monoid such that $F(X) simeq (X,a_X)$ (actually it will be an equality !)



      To prove that $X$ is indeed a monoid with this operation, you will need to use the different properties of the monad and axioms of $T$-algebra.



      Associativity will follow from the associativity axiom of $T$-algebras that says that this should commute :



      $require{AMScd} begin{CD}
      TTX @>{mu_X}>> TX\ @V{T(a_X)}VV @VV{a_X}V\
      TX @>>{a_X}> X
      end{CD}$



      and the unit will be $a_X([ ])$ and the fact that this is a unit will follow from the associativity axiom for $T$-algebras, together with the unit axiom of $T$-algebras that says that this should commute :



      $require{AMScd} begin{CD}
      X @>{eta_X}>> TX\ @V{id_X}VV @VV{a_X}V\
      X @>>{id_X}> X
      end{CD}$



      You then need to prove that $a_X([x_1,...,x_n]) = x_1...x_n$ but this will follow from associativity again. I'll let you check the details.






      share|cite|improve this answer
























        1












        1








        1






        You're starting from a $T$-algebra $(X,a_X)$, and you wish to show that it is isomorphic to $F(M)$ for some monoid $M$.



        In particular, since $F(M)$ is of the form $(M,h)$ for $h:TMto M, [m_1,...,m_n]mapsto m_1...m_n$, then if there is such an isomorphism $f:Xto M$ and if $x,yin X$, then $hcirc T(f)([x,y]) = h([f(x),f(y)])=f(x)f(y)$ and $hcirc T(f)([x,y] ) = fcirc a_X([x,y])$.



        Considering that $f$ is a bijection and thus identifying $M$ and $X$ with it, we get a monoid structure on $X$ such that $a_X([x,y]) = xy$.



        Thus now if we want to find $M$, we know what we should do : define multiplication on $X$ by the formula $xy := a_X([x,y])$; and check that this makes $X$ into a monoid such that $F(X) simeq (X,a_X)$ (actually it will be an equality !)



        To prove that $X$ is indeed a monoid with this operation, you will need to use the different properties of the monad and axioms of $T$-algebra.



        Associativity will follow from the associativity axiom of $T$-algebras that says that this should commute :



        $require{AMScd} begin{CD}
        TTX @>{mu_X}>> TX\ @V{T(a_X)}VV @VV{a_X}V\
        TX @>>{a_X}> X
        end{CD}$



        and the unit will be $a_X([ ])$ and the fact that this is a unit will follow from the associativity axiom for $T$-algebras, together with the unit axiom of $T$-algebras that says that this should commute :



        $require{AMScd} begin{CD}
        X @>{eta_X}>> TX\ @V{id_X}VV @VV{a_X}V\
        X @>>{id_X}> X
        end{CD}$



        You then need to prove that $a_X([x_1,...,x_n]) = x_1...x_n$ but this will follow from associativity again. I'll let you check the details.






        share|cite|improve this answer












        You're starting from a $T$-algebra $(X,a_X)$, and you wish to show that it is isomorphic to $F(M)$ for some monoid $M$.



        In particular, since $F(M)$ is of the form $(M,h)$ for $h:TMto M, [m_1,...,m_n]mapsto m_1...m_n$, then if there is such an isomorphism $f:Xto M$ and if $x,yin X$, then $hcirc T(f)([x,y]) = h([f(x),f(y)])=f(x)f(y)$ and $hcirc T(f)([x,y] ) = fcirc a_X([x,y])$.



        Considering that $f$ is a bijection and thus identifying $M$ and $X$ with it, we get a monoid structure on $X$ such that $a_X([x,y]) = xy$.



        Thus now if we want to find $M$, we know what we should do : define multiplication on $X$ by the formula $xy := a_X([x,y])$; and check that this makes $X$ into a monoid such that $F(X) simeq (X,a_X)$ (actually it will be an equality !)



        To prove that $X$ is indeed a monoid with this operation, you will need to use the different properties of the monad and axioms of $T$-algebra.



        Associativity will follow from the associativity axiom of $T$-algebras that says that this should commute :



        $require{AMScd} begin{CD}
        TTX @>{mu_X}>> TX\ @V{T(a_X)}VV @VV{a_X}V\
        TX @>>{a_X}> X
        end{CD}$



        and the unit will be $a_X([ ])$ and the fact that this is a unit will follow from the associativity axiom for $T$-algebras, together with the unit axiom of $T$-algebras that says that this should commute :



        $require{AMScd} begin{CD}
        X @>{eta_X}>> TX\ @V{id_X}VV @VV{a_X}V\
        X @>>{id_X}> X
        end{CD}$



        You then need to prove that $a_X([x_1,...,x_n]) = x_1...x_n$ but this will follow from associativity again. I'll let you check the details.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 26 at 16:59









        Max

        12.8k11040




        12.8k11040






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3052996%2fthe-category-of-t-algebras-on-set-is-equivalent-to-the-category-of-monoids%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

            Human spaceflight

            Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

            File:DeusFollowingSea.jpg