REVIEW 1 major objections 5 minor 2 cited by
Supplying bells and whistles in symmetric monoidal categories
T0 review · 1 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The paper defines what it means for a symmetric monoidal category to supply an algebraic structure, and proves that all coherence isomorphisms are automatically homomorphisms for any supply.
desk verdict A clean, useful paper that earns its general definition of supply; the main theorem holds up, and the only real weakness is a terse proof in one place. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the prop $P$, a strict symmetric monoidal category whose objects are the natural numbers; it encodes the algebraic theory being supplied. A supply is a family of strong monoidal functors $s_c : P \to \mathcal{C}$ with $s_c(m)=c^{\otimes m}$, compatible through the symmetry isomorphisms. The argument is carried by the coherence theorem for symmetric monoidal categories, which guarantees that the symmetry isomorphisms that permute tensor-power factors are canonical and compose coherently; this makes the diagram chases in Theorems 3.15 and 4.7 go through. The paper also introduces $\mathcal{C}_0$, the subcategory of objects and coherence maps, which serves as the domain for the equivalent functorial definition.
What would settle it
Choose a concrete prop and supply, such as the prop for commutative comonoids and the category $\mathsf{Rel}$ with its canonical supply, and directly check whether the braiding or an associator satisfies the homomorphism diagram (6) for the comultiplication. The theorem predicts the diagram always commutes, so a single verified failure would disprove Theorem 3.15.
Extended reading notes
Core claim
On the paper's own terms, the discovery is that a supply of a prop $P$ in a symmetric monoidal category $\mathcal{C}$ — a compatible choice, for each object $c$, of a strong monoidal functor $s_c : P \to \mathcal{C}$ sending $m$ to $c^{\otimes m}$ — automatically interacts correctly with every coherence isomorphism of $\mathcal{C}$. Theorem 3.15 states that all associators, unitors, and braidings in $\mathcal{C}$ are $s$-homomorphisms for any supply $s$. From this, Theorem 3.18 gives an equivalent definition: a supply is exactly a strong monoidal functor $P \to \mathrm{SMF}(\mathcal{C}_0, \mathcal{C})$ satisfying two conditions, where $\mathcal{C}_0$ is the subcategory generated by objects and coherence maps. Theorem 4.7 extends the same automatic-homomorphism phenomenon to strong monoidal functors that preserve supplies: their strongators are homomorphisms for the target supply.
Load-bearing premise
The load-bearing premise is the standard coherence theorem for symmetric monoidal categories, which identifies certain composite isomorphisms built from symmetries and associators as the tensor power of the associator; if that identification were false, Theorem 3.15 would not follow.
Editorial extensions
If this is right
- For any supply, the associators, unitors, and braiding of $\mathcal{C}$ are automatically $s$-homomorphisms, so the supplied structure is coherent with the ambient monoidal structure without extra axioms.
- A supply can be redefined as a strong monoidal functor $P \to \mathrm{SMF}(\mathcal{C}_0, \mathcal{C})$ with two simple conditions, giving a shorter and more structured description.
- Strong monoidal functors that preserve supplies send homomorphisms to homomorphisms, and their strongators are homomorphisms; supply-preservation therefore composes cleanly.
- Supplies transfer along prop functors $P' \to P$, to biproducts, along essentially surjective strict monoidal functors, and to the strictification of $\mathcal{C}$, so the standard constructions preserve the phenomenon.
- Every symmetric monoidal category uniquely supplies symmetries, and homomorphic supply of commutative comonoids recovers cartesian monoidal categories.
Reading between the lines
- The same automatic-coherence pattern likely extends to enriched settings: replacing props with 2-props and categories with symmetric monoidal 2-categories should make supplied structure compatible with 2-dimensional coherence cells as well.
- The equivalent definition via $\mathcal{C}_0$ suggests a classification question: for a fixed $\mathcal{C}$, supplies of $P$ correspond to strong monoidal functors $P \to \mathrm{SMF}(\mathcal{C}_0,\mathcal{C})$, so homming $P$ into that endomorphism-style category could separate the possible supplies.
- A concrete check in a familiar category, such as verifying that the associator in finite-dimensional vector spaces is a homomorphism for the canonical compact-closed supply, would make the abstract diagram chase tangible.
- Because supplies transfer to strictifications, string-diagram proofs for supplied structures can be carried out in strict monoidal categories without loss of generality, which may simplify applications to hypergraph categories.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a formal notion of "supply" of an algebraic structure encoded by a prop P in a symmetric monoidal category C. A supply assigns to every object c∈C a strong monoidal functor P→C sending m to c^⊗m, compatible with the tensor product via symmetry isomorphisms. The main results are: (1) Theorem 3.15, that all coherence isomorphisms of C (associators, unitors, braidings) are automatically homomorphisms for any supply; (2) Theorem 3.18, an equivalent reformulation of a supply as a strong monoidal functor P→SMF(C0,C); (3) several transfer results, including Proposition 3.24 (transfer along strict essentially surjective monoidal functors) and Proposition 3.28 (transfer to the Mac Lane strictification); and (4) Theorem 4.7, that the strongators of a supply-preserving strong monoidal functor are homomorphisms. The paper is clearly written and contains many worked examples, including Rel supplying commutative comonoids, involutions, self-duals, and Frobenius monoids.
Significance. If the central results hold, the paper provides a useful and unifying framework for a notion that appears across categorical probability, hypergraph categories, and categorical algebra. The main theorem that coherence isomorphisms are automatically supply homomorphisms is nontrivial and is used to give a compact reformulation of supply. The preservation theorem for strong monoidal functors is also valuable. The proof of Theorem 3.15 is a standard diagram chase using Mac Lane's coherence theorem, and the overall line of argument from Definition 3.1 to Theorems 3.18 and 4.7 is convincing. The paper is self-contained and benefits from a good set of examples, including explicit counterexamples to naive transfer along equivalences.
major comments (1)
- [Section 3.3, Proposition 3.24] The proof of Proposition 3.24 contains a false assertion. It states that a strict symmetric monoidal functor F:C→D induces a strictly monoidal functor F0:C0→D0 that is "in fact fully faithful." This is not true in general. For example, let C be the terminal symmetric monoidal category I and let D be the one-object symmetric monoidal category whose morphisms form the group C2, with strict associator, unitor λ=ρ equal to the nonidentity element, and braiding identity; this is a symmetric monoidal category. The unique strict monoidal functor I→D is essentially surjective, but F0 is not full because Hom_{D0}(I_D,I_D) contains the nonidentity unitor while Hom_{C0}(*,*) is trivial. Consequently the functor SMF(F0,D) need not be an equivalence, and the construction of the supply t on D via an inverse equivalence is not justified. A corrected proof of Proposition 3.24, or a revised statement, is required.
minor comments (5)
- [Abstract] There are spacing artifacts in the abstract ("dis joint", "severa l"); these should be corrected in the final version.
- [Example 3.6] The compatibility condition for involutions appears to contain a typo: it should read i_{c⊗d}=i_c⊗i_d, not i_{c⊗d}=i_c⊗id.
- [Theorem 3.15 proof] The step where Mac Lane's coherence theorem is used to identify the composite horizontal maps as the relevant tensor powers of associators is terse; adding a sentence explaining that the composite is the unique canonical isomorphism between the two tensor expressions would improve readability.
- [Proposition 3.28] The notation s_c(m):=[c, m..., c] is ambiguous; it should be defined explicitly as the list consisting of m copies of c.
- [Theorem 3.18 proof] The proof is compressed, especially the verification of the three enumerated points; expanding this verification would help the reader trust the claimed one-to-one correspondence.
Circularity Check
No circularity: the central theorems are derived from Definition 3.1 by diagram chases and Mac Lane coherence, not by fitting or self-citation.
full rationale
The main derivation chain is Definition 3.1 → Theorem 3.15 → Theorem 3.18 → Theorem 4.7. Definition 3.1 defines supply via strong monoidal functors s_c with object assignment c^{⊗m}, coherence strongators, and the compatibility diagrams in Eq. (5). The homomorphism statement of Theorem 3.15 is not part of the definition; it is proved by inserting coherence isomorphisms and using Eq. (5), naturality of the associator, and Mac Lane's coherence theorem. Theorem 3.18 repackages this result as an equivalent formulation, and its proof explicitly relies on Theorem 3.15 rather than assuming the conclusion. Theorem 4.7 is proved from the preservation diagram Eq. (13) and Eq. (5), with no hidden premise. The self-citations ([FS19a], [FS19b], [FS19c], [Fri19]) are used for examples, context, and a counterexample in Remark 3.26; they are not load-bearing for the main theorems, and [Fri19] is acknowledged as independent prior work. No fitted parameter is renamed as a prediction, and no conclusion is hidden in a premise. The proof is terse but mathematically self-contained, so no significant circularity is present.
Assumptions & free parameters
assumptions (4)
- standard math Mac Lane's coherence theorem for symmetric monoidal categories
- domain assumption Axiom of choice for fully faithful essentially surjective functors
- domain assumption Standard set-theoretic foundations with a category of sets
- standard math The 2-category SMC has products, coproducts, and biproducts
invented entities (1)
-
Supply of a prop P in a symmetric monoidal category C
independent evidence
Cite this review
Pith. "Pith review of Supplying bells and whistles in symmetric monoidal categories." pith.science (2026). https://pith.science/paper/MK2G3KGF
@misc{pith2026190802633,
author = {Pith},
title = {Pith review of: Supplying bells and whistles in symmetric monoidal categories},
year = {2026},
howpublished = {\url{https://pith.science/paper/MK2G3KGF}},
note = {Machine review of arXiv:1908.02633}
}
abstract
It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally and say that $\mathcal{C}$ supplies the algebraic structure. For example, the category $\mathsf{Rel}$ of relations between sets has monoidal structures given by both cartesian product and disjoint union, and with respect to either one it supplies comonoids. We prove several facts about the notion of supply, e.g. that the associators, unitors, and braiding of $\mathcal{C}$ are automatically homomorphisms for any supply, as are the coherence isomorphisms for any strong symmetric monoidal functor that preserve supplies. We also show that any supply of structure in a symmetric monoidal category can be extended to a supply of that structure on its strictification.
Forward citations
Cited by 2 Pith papers
-
A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
Markov categories provide a synthetic, axiom-based framework in which conditional independence, sufficiency, completeness, and classical theorems such as Basu and Bahadur hold uniformly across many probability theories.
-
A taxonomy of categories for relations
Provides a taxonomy of categories for relations by framing them as Kleisli categories of symmetric monoidal monads.
Reference graph
Works this paper leans on
-
[1]
Cartesian diff erential categories
[BCS09] RF Blute, JRB Cockett, and RAG Seely. “Cartesian diff erential categories”. In: Theory and Applications of Categories 22.23 (2009), pp. 622–672 (see page 3). [Car91] Aurelio Carboni. “Matrices, relations, and group re presentations”. In: Journal of Algebra 136.2 (1991), pp. 497–529 (see page 2). [CJ19] Kenta Cho and Bart Jacobs. “Disintegration and...
work page 2009
-
[5]
New Y ork: Springer-Verlag, 1998 (seepage 4). 17 A Products, coproducts, and biproducts in SMC In a category with products, we denote the pairing of f : A→ B and g : A→ C by ⟨f, g⟩: A→ B× C. We will denote copairings by [−,−]. Theorem (2.3). The 2-category SMC of symmetric monoidal categories, strong monoidal func- tors, and monoidal natural transformatio...
work page 1998
-
[2019]
Regular and relati onal categories: Revis- iting ’Cartesian bicategories I’
arXiv: 1908.07021 (see pages 2, 4). [FS19a] Brendan Fong and David I Spivak. “Regular and relati onal categories: Revis- iting ’Cartesian bicategories I’”. In: Preprint (2019). arXiv: 1909 . 00069 (see pages 3, 12). [FS19b] Brendan Fong and David I. Spivak. “ Abelian Calculi ”. To appear . 2019 (see pages 3, 17). [FS19c] Brendan Fong and David I. Spivak. ...
arXiv 2019
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.