Braided bialgebras in a generated monoidal Ab-category
We start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out t
We start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out to be modules for these bialgebras
💡 Research Summary
The paper begins with a small strict monoidal braided Ab‑category C, i.e. a category whose hom‑sets are abelian groups, equipped with a strict tensor product and a braiding that satisfies the usual hexagon identities. The author’s first goal is to enlarge C to a more flexible environment in which the strictness constraints are relaxed while preserving the braided structure. To this end a “generated” monoidal category Ċ is constructed: objects of Ċ are obtained by taking finite tensor products and finite direct sums of objects of C, and then closing under these operations. Because strict associativity is no longer assumed, explicit associators α_{X,Y,Z} : (X⊗Y)⊗Z → X⊗(Y⊗Z) and unitors λ_X : I⊗X → X, ρ_X : X⊗I → X are introduced. The paper shows that these coherence morphisms can be chosen so that they are compatible with the original braiding c_{X,Y} : X⊗Y → Y⊗X; in particular the hexagon equations continue to hold in Ċ. This step is a categorical analogue of passing from a strict monoidal presentation to a freely generated non‑strict one, and it is carried out entirely within the realm of Ab‑categories, guaranteeing that all hom‑sets remain abelian groups.
Having built Ċ, the second major contribution is the construction of braided bialgebras inside it. The author starts from the unit object I of Ċ. Its endomorphism ring End(I) is naturally a coalgebra (the comultiplication is given by the identity map composed with the unitors, and the counit is the identity of I). Using this coalgebra as a seed, a family of objects B in Ċ is defined together with multiplication m_B : B⊗B → B and unit η_B : I → B, as well as comultiplication Δ_B : B → B⊗B and counit ε_B : B → I. The crucial point is that the multiplication is required to be “braided‑commutative”: m_B ∘ c_{B,B} = m_B, where c_{B,B} is the braiding on B⊗B. This condition replaces ordinary commutativity and is precisely what makes B a braided bialgebra rather than an ordinary one. The paper verifies all bialgebra axioms (associativity, coassociativity, unit, counit, and the compatibility between multiplication and comultiplication) in the presence of the associators and unitors of Ċ, showing that the coherence data does not interfere with the algebraic structure.
A particularly striking result is that every original object X∈C becomes a left (or right) module over the newly constructed braided bialgebra B. The module action μ_X : B⊗X → X is defined using the canonical isomorphisms between B⊗X and X⊗B provided by the braiding, together with the multiplication of B and the associators of Ċ. The paper proves that μ_X satisfies the usual module axioms (associativity with respect to m_B and unitality with respect to η_B) and that these axioms are stable under the coherence isomorphisms of the non‑strict category. Consequently, the passage from C to Ċ not only creates a richer ambient category but also automatically equips the original objects with a natural module structure over a braided bialgebra that lives in the larger category.
To illustrate the abstract theory, the author works out two concrete families of examples. First, taking C to be the category of finite‑dimensional vector spaces over a field k (with the usual tensor product) yields Ċ as the category of all finite direct sums of tensor powers of vector spaces. In this setting the construction reproduces the familiar polynomial algebra k
📜 Original Paper Content
🚀 Synchronizing high-quality layout from 1TB storage...