A bialgebraic characterization of symmetric powers in Q 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 n to itself. If the symmetric monoidal category is Q 0-linear, that is, enriched over Q 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 An in a splitting of the idempotent 1n!σ ∈ SnΣσ A n → A 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 Q 0-linear symmetric monoidal category a bijection between operations making a graded object (An)n 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 Q 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 Q 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 N-graded vector spaces.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…