SearcharxivSearch

arXiv · 2308.02094

A bialgebraic characterization of symmetric powers in $\mathbb{Q}_{\ge 0}$-linear symmetric monoidal categories

Abstract

In any symmetric monoidal category, the $n$-th (co)equalizer symmetric power of an object $A$ is the (co)equalizer of all the permutations from $A^{\otimes n}$ to itself. If the symmetric monoidal category is $\mathbb{Q}_{\ge 0}$-linear, that is, enriched over $\mathbb{Q}_{\ge 0}$-modules, the notions of $n$-th equalizer symmetric power and $n$-th coequalizer symmetric power are equivalent. In this context, the $n$-th symmetric power of $A$ can be described as the intermediate object $A_n$ in a splitting of the idempotent $\frac{1}{n!}\underset{\sigma \in S_n}{\sum}\sigma\colon A^{\otimes n} \rightarrow A^{\otimes n}$. We define a permutation splitting as a countable family of such splittings. The main goal of this paper is to prove two theorems. The first theorem exhibits in any $\mathbb{Q}_{\ge 0}$-linear symmetric monoidal category a bijection between operations making a graded object $(A_n)_{n \ge 0}$ into a permutation splitting and operations making this graded object into a bialgebraic structure that we call a binomial bimonoid. Binomial bimonoids can be defined in any additive symmetric monoidal category. The second theorem shows that, in any $\mathbb{Q}_{\ge 0}$-linear symmetric monoidal category, the biassociativity and bicommutativity axioms may be omitted from the definition of a binomial bimonoid. We then show that being a binomial bimonoid in a $\mathbb{Q}_{\ge 0}$-linear symmetric monoidal category is a property: two binomial bimonoids are isomorphic whenever their underlying graded objects are isomorphic. This result does not extend to arbitrary additive symmetric monoidal categories since both the one-variable polynomial algebra and the one-variable divided power polynomial algebra over a field $k$ of positive characteristic are non-isomorphic binomial $k$-bialgebras with isomorphic underlying $\mathbb{N}$-graded vector spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Jean-Baptiste Vienney. 2023-08-04. A bialgebraic characterization of symmetric powers in $\mathbb{Q}_{\ge 0}$-linear symmetric monoidal categories. https://arxiv.org/abs/2308.02094

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT