Not signed in (Sign In)

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

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nforum nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

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.
    • CommentAuthormrmuon
    • CommentTimeOct 26th 2019

    I have 2 examples of symmetric multicategories (colored operads of sets) that are simple enough that I expect they already exist in the literature. I’m hoping that someone here can point me to suitable references. I haven’t found anything in Leinster’s book.

    The first example, MultiCC, is constructed from an ordinary category, CC. The objects are just the objects of CC. The nn-ary multimorphisms are nn-tuples of morphisms of CC (with the same target). The symmetric group acts by permuting the components of these nn-tuples. The jj’th partial composition is composition with the jj’th component.

    That seems ludicrously simplistic, but I have actually found it useful!

    For the second example, IndTree, the objects (colors) are the natural numbers. (I think of a rooted tree as a directed graph with the edges directed away from the root.) An nn-ary multimorphism is a rooted tree with nn vertices and 1. the vertices are ordered, 2. the vertices are colored with natural numbers, 3. the edges coming from a vertex colored rr are each colored with a different number from 11 to rr. The symmetric group acts by permuting the order of the vertices.

    The partial composition S jTS \circ_j T is given by replacing the jj’th vertex of SS with TT, and attaching the edges on a way determined by the colorings. I think this is easiest to describe by giving an action of IndTree.

    Consider some arbitrary set, XX. An rr-colored function is a function X rXX^r\to X. An nn-ary multimorphism in IndTree describes a way of composing nn such functions. The partial composition S jTS \circ_j T corresponds to composing some functions according to TT, and then composing the result with some more functions according to SS.

    Obviously, my names here are just placeholders.

    • CommentRowNumber2.
    • CommentAuthorDmitri Pavlov
    • CommentTimeOct 26th 2019
    The symmetric multicategory MultiC is simply the symmetric multicategory associated to the monoidal category given by the freely adding coproducts to C.

    The second operad is similar in spirit to the operad of trees by Moerdijk and Weiss, but with rather different details.
    • CommentRowNumber3.
    • CommentAuthorMike Shulman
    • CommentTimeOct 27th 2019

    I’m sure I’ve seen your MultiC somewhere, and I thought it was in Leinster’s book, but I could be wrong.

    Your IndTree sounds kind of like the free symmetric multicategory generated by one rr-ary morphism for all rr, but I don’t understand how “the objects are natural numbers” squares with your description of an action of it on one set – if the objects are natural numbers, then an “action” of it should take place on a countable family of sets.

    • CommentRowNumber4.
    • CommentAuthorRuneHaugseng
    • CommentTimeOct 27th 2019

    I think what Dmitri describes is rather the “symmetric monoidal envelope” of MultiC (the canonical enlargement to a symmetric monoidal category), while if C has coproducts then MultiC itself is the symmetric monoidal structure on C with coproduct as tensor product.

    • CommentRowNumber5.
    • CommentAuthormrmuon
    • CommentTimeOct 27th 2019

    Mike:

    IndTree acts on a set of functions. There is a base map from that set to the set of natural numbers. Specifically, any function X rXX^r\to X is mapped to rr. I think that set is the endomorphism operad of XX.

    It is now occurring to me that IndTree is the colored operad governing non symmetric operads, i.e., a IndTree-algebra is the same thing as a ns-operad (in any given category).

    • CommentRowNumber6.
    • CommentAuthorMike Shulman
    • CommentTimeOct 28th 2019

    Ah, yes. I was confused because I expected you to be describing a general action of IndTree, but you were just describing an example of such an action (on functions).