arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.2874math.CTmath.QA
收藏

多项式函子与树

Polynomial functors and trees

Joachim Kock

摘要:

我们探讨多项式函子和(根)树之间的关系。在第一部分中,我们使用多项式函子推导出一个新的方便的形式主义的树,并获得一个自然的和概念性的构造的类别$Ω$的Moerdijk和Weiss,其主要性质的一些因子分解系统的条款进行了描述。虽然构造的动机和解释的多项式函子,他们都相当于有限集的基本操作。在第二部分中,我们描述了多项式endofunctors和monad的结构,从树的范畴上的多项式endofunctors和monad的几个神经函子到预层的图像特征。基上的多项式内函子和单子的特征在于装饰树范畴上的层条件。在绝对情况下,需要一个进一步的条件,一个特定的投射性条件,它也用于在(有色)集合和运算符中搜索多项式内函子和单子。

英文摘要:

We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category $Ω$ of Moerdijk and Weiss; its main properties are described in terms of some factorisation systems. Although the constructions are motivated and explained in terms of polynomial functors, they all amount to elementary manipulations with finite sets. In the second part we describe polynomial endofunctors and monads as structures built from trees, characterising the images of several nerve functors from polynomial endofunctors and monads into presheaves on categories of trees. Polynomial endofunctors and monads over a base are characterised by a sheaf condition on categories of decorated trees. In the absolute case, one further condition is needed, a certain projectivity condition, which serves also to characterise polynomial endofunctors and monads among (coloured) collections and operads.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑