scholarly journals Freely adjoining monoidal duals

2020 ◽  
pp. 1-21
Author(s):  
Kevin Coulembier ◽  
Ross Street ◽  
Michel van den Bergh
Keyword(s):  
Full Subcategory ◽  
Monoidal Category ◽  
Dual Pair ◽  
Explicit Model ◽  
Monoidal Categories ◽  
Monoidal Functor ◽  
Simplicial Category ◽  
Combinatorial Model ◽  
The Relationship ◽  
Distinguished Object

Abstract Given a monoidal category $\mathcal C$ with an object J, we construct a monoidal category $\mathcal C[{J^ \vee }]$ by freely adjoining a right dual ${J^ \vee }$ to J. We show that the canonical strong monoidal functor $\Omega :\mathcal C \to \mathcal C[{J^ \vee }]$ provides the unit for a biadjunction with the forgetful 2-functor from the 2-category of monoidal categories with a distinguished dual pair to the 2-category of monoidal categories with a distinguished object. We show that $\Omega :\mathcal C \to \mathcal C[{J^ \vee }]$ is fully faithful and provide coend formulas for homs of the form $\mathcal C[{J^ \vee }](U,\,\Omega A)$ and $\mathcal C[{J^ \vee }](\Omega A,U)$ for $A \in \mathcal C$ and $U \in \mathcal C[{J^ \vee }]$ . If ${\rm{N}}$ denotes the free strict monoidal category on a single generating object 1, then ${\rm{N[}}{{\rm{1}}^ \vee }{\rm{]}}$ is the free monoidal category Dpr containing a dual pair – ˧ + of objects. As we have the monoidal pseudopushout $\mathcal C[{J^ \vee }] \simeq {\rm{Dpr}}{{\rm{ + }}_{\rm{N}}}\mathcal C$ , it is of interest to have an explicit model of Dpr: we provide both geometric and combinatorial models. We show that the (algebraist’s) simplicial category Δ is a monoidal full subcategory of Dpr and explain the relationship with the free 2-category Adj containing an adjunction. We describe a generalization of Dpr which includes, for example, a combinatorial model Dseq for the free monoidal category containing a duality sequence X0 ˧ X1 ˧ X2 ˧ … of objects. Actually, Dpr is a monoidal full subcategory of Dseq.

scholarly journals Elementary remarks on units in monoidal categories

2008 ◽  
Vol 144 (1) ◽  
pp. 53-76 ◽  
Author(s):  
JOACHIM KOCK
Keyword(s):  
Category Theory ◽  
Compatibility Condition ◽  
Monoidal Category ◽  
Monoidal Categories ◽  
Alternative Definition ◽  
Monoidal Functor ◽  
Higher Category Theory ◽  
Definition Of

AbstractWe explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellable idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of left-right constraints, and is motivated by higher category theory. To start, we describe the semi-monoidal category of all possible unit structures on a given semi-monoidal category and observe that it is contractible (if non-empty). Then we prove that the two notions of units are equivalent in a strong functorial sense. Next, it is shown that the unit compatibility condition for a (strong) monoidal functor is precisely the condition for the functor to lift to the categories of units, and it is explained how the notion of Saavedra unit naturally leads to the equivalent non-algebraic notion of fair monoidal category, where the contractible multitude of units is considered as a whole instead of choosing one unit. To finish, the lax version of the unit comparison is considered. The paper is self-contained. All arguments are elementary, some of them of a certain beauty.

scholarly journals Monoidal Categories Enriched in Braided Monoidal Categories

2017 ◽  
Vol 2019 (11) ◽  
pp. 3527-3579 ◽  
Author(s):  
Scott Morrison ◽  
David Penneys
Keyword(s):  
Monoidal Category ◽  
Cartesian Product ◽  
Basic Theory ◽  
Monoidal Categories ◽  
Enriched Category ◽  
Enriched Categories ◽  
Monoidal Functor ◽  
Natural Transformations ◽  
Braided Monoidal Categories ◽  
Set Up

Abstract We introduce the notion of a monoidal category enriched in a braided monoidal category $\mathcal{V}$. We set up the basic theory, and prove a classification result in terms of braided oplax monoidal functors to the Drinfeld centre of some monoidal category $\mathcal{T}$. Even the basic theory is interesting; it shares many characteristics with the theory of monoidal categories enriched in a symmetric monoidal category, but lacks some features. Of particular note, there is no cartesian product of braided-enriched categories, and the natural transformations do not form a 2-category, but rather satisfy a braided interchange relation. Strikingly, our classification is slightly more general than what one might have anticipated in terms of strong monoidal functors $\mathcal{V}\to Z(\mathcal{T})$. We would like to understand this further; in a future article, we show that the functor is strong if and only if the enriched category is ‘complete’ in a certain sense. Nevertheless it remains to understand what non-complete enriched categories may look like. One should think of our construction as a generalization of de-equivariantization, which takes a strong monoidal functor ${\mathsf {Rep}}(G) \to Z(\mathcal{T})$ for some finite group $G$ and a monoidal category $\mathcal{T}$, and produces a new monoidal category $\mathcal{T} _{{/\hspace{-2px}/}G}$. In our setting, given any braided oplax monoidal functor $\mathcal{V} \to Z(\mathcal{T})$, for any braided $\mathcal{V}$, we produce $\mathcal{T} _{{/\hspace{-2px}/}\mathcal{V}}$: this is not usually an ‘honest’ monoidal category, but is instead $\mathcal{V}$-enriched. If $\mathcal{V}$ has a braided lax monoidal functor to ${\mathsf {Vec}}$, we can use this to reduce the enrichment to ${\mathsf {Vec}}$, and this recovers de-equivariantization as a special case. This is the published version of arXiv:1701.00567.

scholarly journals On traced monoidal closed categories

2009 ◽  
Vol 19 (2) ◽  
pp. 217-244 ◽  
Author(s):  
MASAHITO HASEGAWA
Keyword(s):  
Fixed Point ◽  
Full Subcategory ◽  
Monoidal Category ◽  
Structure Theorem ◽  
Linear Logic ◽  
Monoidal Categories ◽  
Simple Observation ◽  
Fixed Point Computation ◽  
Canonical Inclusion ◽  
Monoidal Closed Category

The structure theorem of Joyal, Street and Verity says that every traced monoidal category arises as a monoidal full subcategory of the tortile monoidal category Int. In this paper we focus on a simple observation that a traced monoidal category is closed if and only if the canonical inclusion from into Int has a right adjoint. Thus, every traced monoidal closed category arises as a monoidal co-reflexive full subcategory of a tortile monoidal category. From this, we derive a series of facts for traced models of linear logic, and some for models of fixed-point computation. To make the paper more self-contained, we also include various background results for traced monoidal categories.

scholarly journals Reflective subcategories

2000 ◽  
Vol 42 (1) ◽  
pp. 97-113 ◽  
Author(s):  
Juan Rada ◽  
Manuel Saorín ◽  
Alberto del Valle
Keyword(s):  
Category Theory ◽  
Full Subcategory ◽  
Subject Classification ◽  
Adjoint Functor ◽  
Direct Limits ◽  
The Relationship ◽  
Good Behaviour

Given a full subcategory [Fscr ] of a category [Ascr ], the existence of left [Fscr ]-approximations (or [Fscr ]-preenvelopes) completing diagrams in a unique way is equivalent to the fact that [Fscr ] is reflective in [Ascr ], in the classical terminology of category theory.In the first part of the paper we establish, for a rather general [Ascr ], the relationship between reflectivity and covariant finiteness of [Fscr ] in [Ascr ], and generalize Freyd's adjoint functor theorem (for inclusion functors) to not necessarily complete categories. Also, we study the good behaviour of reflections with respect to direct limits. Most results in this part are dualizable, thus providing corresponding versions for coreflective subcategories.In the second half of the paper we give several examples of reflective subcategories of abelian and module categories, mainly of subcategories of the form Copres (M) and Add (M). The second case covers the study of all covariantly finite, generalized Krull-Schmidt subcategories of {\rm Mod}_{R}, and has some connections with the “pure-semisimple conjecture”.1991 Mathematics Subject Classification 18A40, 16D90, 16E70.

scholarly journals Reflective Full Subcategories of the Category ofL-Posets

2012 ◽  
Vol 2012 ◽  
pp. 1-11
Author(s):  
Hongping Liu ◽  
Qingguo Li ◽  
Xiangnan Zhou
Keyword(s):  
Special Class ◽  
Full Subcategory ◽  
Closure Operators ◽  
The Relationship ◽  
Equivalent Description

This paper focuses on the relationship betweenL-posets and completeL-lattices from the categorical view. By considering a special class of fuzzy closure operators, we prove that the category of completeL-lattices is a reflective full subcategory of the category ofL-posets with appropriate morphisms. Moreover, we characterize the Dedekind-MacNeille completions ofL-posets and provide an equivalent description for them.

scholarly journals Monoidal Categories, 2-Traces, and Cyclic Cohomology

2019 ◽  
Vol 62 (02) ◽  
pp. 293-312 ◽  
Author(s):  
Mohammad Hassanzadeh ◽  
Masoud Khalkhali ◽  
Ilya Shapiro
Keyword(s):  
Associative Algebra ◽  
Monoidal Category ◽  
Cyclic Homology ◽  
Cyclic Cohomology ◽  
Monoidal Categories ◽  
Central Pair ◽  
Cyclic Type ◽  
Unital Associative Algebra

AbstractIn this paper we show that to a unital associative algebra object (resp. co-unital co-associative co-algebra object) of any abelian monoidal category ( $\mathscr{C},\otimes$ ) endowed with a symmetric 2-trace, i.e., an $F\in \text{Fun}(\mathscr{C},\text{Vec})$ satisfying some natural trace-like conditions, one can attach a cyclic (resp. cocyclic) module, and therefore speak of the (co)cyclic homology of the (co)algebra “with coefficients in $F$ ”. Furthermore, we observe that if $\mathscr{M}$ is a $\mathscr{C}$ -bimodule category and $(F,M)$ is a stable central pair, i.e., $F\in \text{Fun}(\mathscr{M},\text{Vec})$ and $M\in \mathscr{M}$ satisfy certain conditions, then $\mathscr{C}$ acquires a symmetric 2-trace. The dual notions of symmetric 2-contratraces and stable central contrapairs are derived as well. As an application we can recover all Hopf cyclic type (co)homology theories.

Hom-L-R-smash biproduct and the category of Hom–Yetter–Drinfel’d–Long bimodules

2018 ◽  
Vol 17 (07) ◽  
pp. 1850133 ◽  
Author(s):  
Daowei Lu ◽  
Xiaohui Zhang
Keyword(s):  
Hopf Algebra ◽  
Tensor Product ◽  
Monoidal Category ◽  
Admissible Pair ◽  
Smash Product ◽  
Monoidal Categories ◽  
Finite Dimensional

Let [Formula: see text] be a Hom-bialgebra. In this paper, we firstly introduce the notion of Hom-L-R smash coproduct [Formula: see text], where [Formula: see text] is a Hom-coalgebra. Then for a Hom-algebra and Hom-coalgebra [Formula: see text], we introduce the notion of Hom-L-R-admissible pair [Formula: see text]. We prove that [Formula: see text] becomes a Hom-bialgebra under Hom-L-R smash product and Hom-L-R smash coproduct. Next, we will introduce a prebraided monoidal category [Formula: see text] of Hom–Yetter–Drinfel’d–Long bimodules and show that Hom-L-R-admissible pair [Formula: see text] actually corresponds to a bialgebra in the category [Formula: see text], when [Formula: see text] and [Formula: see text] are involutions. Finally, we prove that when [Formula: see text] is finite dimensional Hom-Hopf algebra, [Formula: see text] is isomorphic to the Yetter–Drinfel’d category [Formula: see text] as braid monoidal categories where [Formula: see text] is the tensor product Hom–Hopf algebra.

scholarly journals Autonomization of Monoidal Categories

2017 ◽  
Author(s):  
Antonin Delpeuch
Keyword(s):  
Monoidal Category ◽  
Point Of View ◽  
Monoidal Categories ◽  
Categorical Point

We define the free autonomous category generated by a monoidal category and study some of its properties. From a linguistic perspective, this expands the range of possible models of meaning within the distributional compositional framework, by allowing nonlinearities in maps. From a categorical point of view, this provides a factorization of the construction in [Preller and Lambek, 2007] of the free autonomous category generated by a category. ; Comment: Under review. Comments welcome!

scholarly journals On geometry of interaction for polarized linear logic

2017 ◽  
Vol 28 (10) ◽  
pp. 1639-1694
Author(s):  
MASAHIRO HAMANO ◽  
PHILIP SCOTT
Keyword(s):  
Proof Theory ◽  
Monoidal Category ◽  
Linear Logic ◽  
Cut Elimination ◽  
List Type ◽  
Monoidal Categories ◽  
Categorical Structure ◽  
Categorical Models ◽  
Focusing Property ◽  
Special Case

We present Geometry of Interaction (GoI) models for Multiplicative Polarized Linear Logic, MLLP, which is the multiplicative fragment of Olivier Laurent's Polarized Linear Logic. This is done by uniformly adding multi-points to various categorical models of GoI. Multi-points are shown to play an essential role in semantically characterizing the dynamics of proof networks in polarized proof theory. For example, they permit us to characterize the key feature of polarization, focusing, as well as being fundamental to our construction of concrete polarized GoI models.Our approach to polarized GoI involves following two independent studies, based on different categorical perspectives of GoI: (i)Inspired by the work of Abramsky, Haghverdi and Scott, a polarized GoI situation is defined in which multi-points are added to a traced monoidal category equipped with a reflexive object U. Using this framework, categorical versions of Girard's execution formula are defined, as well as the GoI interpretation of MLLP proofs. Running the execution formula is shown to characterize the focusing property (and thus polarities) as well as the dynamics of cut elimination.(ii)The Int construction of Joyal–Street–Verity is another fundamental categorical structure for modelling GoI. Here, we investigate it in a multi-pointed setting. Our presentation yields a compact version of Hamano–Scott's polarized categories, and thus denotational models of MLLP. These arise from a contravariant duality between monoidal categories of positive and negative objects, along with an appropriate bimodule structure (representing ‘non-focused proofs’) between them.Finally, as a special case of (ii) above, a compact model of MLLP is also presented based on Rel (the category of sets and relations) equipped with multi-points.

scholarly journals Coherence for monoidal endofunctors

2010 ◽  
Vol 20 (4) ◽  
pp. 523-543 ◽  
Author(s):  
KOSTA DOŠEN ◽  
ZORAN PETRIĆ
Keyword(s):  
Monoidal Category ◽  
Natural Transformation ◽  
Monoidal Categories ◽  
Monoidal Structure ◽  
Natural Transformations ◽  
Finite Products ◽  
Relational Graphs

The goal of this paper is to prove coherence results with respect to relational graphs for monoidal endofunctors, that is, endofunctors of a monoidal category that preserve the monoidal structure up to a natural transformation that need not be an isomorphism. These results are proved first in the absence of symmetry in the monoidal structure, and then with this symmetry. In the later parts of the paper, the coherence results are extended to monoidal endofunctors in monoidal categories that have diagonal or codiagonal natural transformations, or where the monoidal structure is given by finite products or coproducts. Monoidal endofunctors are interesting because they stand behind monoidal monads and comonads, for which coherence will be proved in a sequel to this paper.

Sign in / Sign up

Export Citation Format

Share Document