{"id":"2ce6e984-1cc7-4f46-9259-98ec5d483cc8","arxiv_id":"1908.02633","paper_version":2,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper defines 'supply' of a prop in a symmetric monoidal category and proves that associators, unitors, and braidings are automatically homomorphisms for any supply.","lead":"This paper introduces a formal definition of 'supply', meaning every object in a symmetric monoidal category carries an algebraic structure compatible with the monoidal product, and proves the structural isomorphisms are automatically compatible. It provides a unified framework for structures like comonoids, Frobenius monoids, and involutions, simplifying proofs across category theory and applications.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"The reader identified the proof of Theorem 3.15 as resting on an unstated coherence identification. I examined this step and found it to be a standard, correct application of Mac Lane's coherence theorem. The composite map σ;α;σ and α⊗m are both canonical isomorphisms with the same domain, codomain, and underlying permutation of atomic variables; coherence forces equality. The surrounding diagram chase is valid: the central square is naturality of the associator, and the outer squares follow from two applications of condition (iii) in Definition 3.1. I also checked Theorem 3.18's equivalence and Theorem 4.7's preservation result for hidden dependencies; none were found. Since the reader's weakest assumption is not actually fragile, the verdict remains ACCEPT at HIGH confidence.","tokens_in":13773,"tokens_out":14248,"duration_ms":129724,"concrete_test":"Verify the coherence identification for m=2 in a non-strict symmetric monoidal category, e.g., finite-dimensional vector spaces with the usual associator and braiding: evaluate the composite σ; α; σ on basis vectors ((a⊗b)⊗c)⊗((a'⊗b')⊗c') and check that it equals α⊗α. If the equality holds, the disputed step in Theorem 3.15 is confirmed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Careful review of Theorem 3.15 and its surrounding argument did not surface a soundness problem. The proof's use of Mac Lane's coherence theorem is legitimate: the composite horizontal map in the associator diagram is a canonical isomorphism from ((a⊗b)⊗c)⊗m to (a⊗(b⊗c))⊗m, and the tensor power of the associator is the unique canonical isomorphism between these objects with the same (identity) permutation of atomic variables; Mac Lane's coherence theorem guarantees equality. The left and right squares decompose as claimed into two applications of Eq. (5), and the center square is naturality of the associator. The unitor and braiding cases are analogous. No circularity or hidden assumption was found in the chain from Definition 3.1 through Theorem 3.15 to Theorems 3.18 and 4.7. The proof is terse but mathematically sound.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":13890,"tokens_out":33298,"duration_ms":401945,"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":[{"comment":"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.","section":"Section 3.3, Proposition 3.24"}],"minor_comments":[{"comment":"There are spacing artifacts in the abstract (\"dis joint\", \"severa l\"); these should be corrected in the final version.","section":"Abstract"},{"comment":"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.","section":"Example 3.6"},{"comment":"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.","section":"Theorem 3.15 proof"},{"comment":"The notation s_c(m):=[c, m..., c] is ambiguous; it should be defined explicitly as the list consisting of m copies of c.","section":"Proposition 3.28"},{"comment":"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.","section":"Theorem 3.18 proof"}],"recommendation":"major_revision","confidential_remarks":"The central contribution of the paper appears sound: the proof of Theorem 3.15 is a legitimate use of coherence, and the main theorems 3.18 and 4.7 rest on it. The difficulty is Proposition 3.24, whose proof contains a demonstrably false claim about full faithfulness. Since this proposition is not used in the main theorems, a repair should be feasible, but the statement or its proof needs to be corrected before the paper can be accepted."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The short version: this is a solid, genuinely useful paper. It defines the notion of a supply of a prop in a symmetric monoidal category, which really hasn't been given in this generality before, and proves the main facts you'd want: all coherence isomorphisms are supply homomorphisms (Theorem 3.15), supply preservation makes strongators homomorphisms (Theorem 4.7), and supplies extend to strictifications. The paper is clear and well-written; the examples do real work, especially Rel supplying comonoids and the hypergraph category examples.\n\nThe central proof, Theorem 3.15, is the soft spot in presentation. The diagram chase is compressed at the point where the composite of symmetry isomorphisms and associators gets identified with the tensor power of the associator, and the justification is a terse appeal to Mac Lane's coherence theorem. That's a legitimate use—the stress-test note confirms the identification is the canonical isomorphism with the right permutation, so the proof is sound. Still, a referee would probably ask for one more sentence of expansion there.\n\nThe other minor thing is the citation pattern: several examples and the counterexample in Remark 3.26 point to the authors' own work (FS19a, FS19c). That's not a problem, since the main theorems don't rely on those citations, but it is worth noting that the 'crucial' counterexample showing supplies don't transfer along equivalences is unpublished work in preparation at the time.\n\nOne more small thing: Proposition 3.24 uses the axiom of choice, and the paper says so; that's fine. The appendix proof of biproducts in SMC is sketchy but enough.\n\nWho is this for? Any category theorist working with hypergraph categories, Frobenius monoids, compact closed structures, or categorical probability. The vocabulary alone is worth having. I'd cite it, and I'd send it out for review if I were the editor. My recommendation: accept, possibly with a request to expand the proof of Theorem 3.15 slightly.","headline":"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.","tokens_in":14413,"tokens_out":2143,"would_cite":true,"duration_ms":22247,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["18M05"],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["symmetric monoidal categories","props","supply","coherence isomorphisms","homomorphisms","hypergraph categories","strictification","strong monoidal functors"],"falsifier":"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.","tokens_in":13566,"feed_emoji":"🧩","tokens_out":10958,"duration_ms":104109,"temperature":0.7,"pith_summary":"Many symmetric monoidal categories carry an algebraic structure on every object that is compatible with the monoidal product and unit. This paper gives the first formal definition of such a situation, calling it a supply of the structure encoded by a prop. The central result is that no extra compatibility axioms are needed for coherence: the associators, unitors, and braiding of the ambient category are automatically homomorphisms for any supply. This yields a compact equivalent definition of supply and a preservation theorem for strong monoidal functors. The paper also shows how supplies transfer to prop images, biproducts, and strictifications.","feed_headline":"Coherence maps are always homomorphisms for any supplied structure","feed_subtitle":"The paper's new definition makes associators, unitors, and braidings automatically respect any supplied structure.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Supplies the coherence theorem for symmetric monoidal categories used to identify canonical isomorphism composites in the proof of Theorem 3.15.","marker":"[Mac98, Theorem XI.1]"},{"why":"Establishes that homomorphic supply of commutative comonoids is equivalent to cartesian monoidal structure, a key motivating example for the definition.","marker":"[Fox76]"},{"why":"Introduces hypergraph categories as categories supplying Frobenius monoids, a main family of examples and the source of the non-transfer counterexample.","marker":"[FS19c]"}],"fun_headline_variants":["Supply in monoidal categories makes coherence maps homomorphisms","New supply definition forces coherence maps to be homomorphisms","Supply ensures coherence maps are homomorphisms automatically","For any supply, associators, unitors, and braidings are homomorphisms"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Supply in monoidal categories makes coherence maps homomorphisms","New supply definition forces coherence maps to be homomorphisms","Supply ensures coherence maps are homomorphisms automatically","For any supply, associators, unitors, and braidings are homomorphisms"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000766,"raw_usage":{"total_tokens":3380,"prompt_tokens":909,"completion_tokens":2471,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":525,"completion_tokens_details":{"reasoning_tokens":2399}},"tokens_in":525,"tokens_out":2471,"duration_ms":19657,"temperature":1.0,"reasoning_tokens":2399,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:38:54.565886+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[],"review_version":1}