Not signed in (Sign In)

Start a new discussion

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Discussion Tag Cloud

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorJon Beardsley
    • CommentTimeJul 21st 2016

    Couldn’t find a latest changes discussion for symmetric sequence so I am just reporting that I added a little bit to that page. In particular, I added another slicker definition in the case that we are interested in a symmetric sequence for the sequence of symmetric groups.

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeJul 22nd 2016

    Where you mention the use for operads, I have added a pointer specifically to symmetric operad.

    Where you mention the definition of operads as monoids, I have added a pointer to Operad – Definition as monoids.

    • CommentRowNumber3.
    • CommentAuthorTodd_Trimble
    • CommentTimeJul 24th 2016

    If the slicker definition mentioned in #1 refers to Definition 2, then I’m sorry, but that’s a mistake. As definition 1 indicates, the category of symmetric sequences is equivalent to the category of just plain functors out of Σ\Sigma (the groupoid coproduct of finite permutation groups Σ n\Sigma_n) or just plain functors out of the category FBFB of finite sets and bijections.

    Now if CC is symmetric monoidal, then symmetric monoidal functors F:FBCF: FB \to C might (for some authors) mean strong symmetric monoidal functors, where “strong” means that the structural maps F(S)F(T)F(ST)F(S) \otimes F(T) \to F(S \otimes T) and IF(I)I \to F(I) are isomorphisms. But since for Σ\Sigma or FBFB each object is isomorphic to 1 n1^{\otimes n} for some nn, we get that each strong symmetric monoidal functor F:FBCF: FB \to C is uniquely (up to isomorphism) determined by the value F(1)F(1). More precisely, the category of strong symmetric monoidal functors ΣC\Sigma \to C and monoidal natural transformations between them is equivalent to CC, which is clearly not what we want. Even better, we could say that Σ\Sigma or FBFB is the free symmetric monoidal category on one object, and this is a starting point of Kelly’s elegant theory of operads.

    Even if symmetric monoidal functor is meant in the lax sense (where the structural constraints need not be isos), we still get some notion which differs from the intended one.

    • CommentRowNumber4.
    • CommentAuthorJon Beardsley
    • CommentTimeJul 24th 2016

    Oh yeah you’re definitely right. This, and the thing about operads being commutative monoids, was some kind of weird confused fugue state I was having in my brain. I realized it and changed it in a few places, but appear to have forgotten all the places I had done it. I’ll change that.

Add your comments
  • Please log in or leave your comment as a "guest post". If commenting as a "guest", please include your name in the message as a courtesy. Note: only certain categories allow guest posts.
  • To produce a hyperlink to an nLab entry, simply put double square brackets around its name, e.g. [[category]]. To use (La)TeX mathematics in your post, make sure Markdown+Itex is selected below and put your mathematics between dollar signs as usual. Only a subset of the usual TeX math commands are accepted: see here for a list.

  • (Help)