pith. sign in

arxiv: 2505.22931 · v2 · submitted 2025-05-28 · 🧮 math.CT · cs.LO

From Copying to Corelations via Ancestry Partitions

Andreu Ballus Santacana This is my paper

Pith reviewed 2026-05-19 13:57 UTC · model grok-4.3

classification 🧮 math.CT cs.LO
keywords PROPcorelationscocommutative comonoidsancestry functorstring diagramsquotientcospanscategory theory
0
0 comments X

The pith

The free PROP on a binary copying generator quotients by ancestry partitions to the PROP of non-counital cocommutative comonoids.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that the free PROP Syn(δ) generated by one binary operation δ can be quotiented using an ancestry functor that identifies morphisms according to connected components in their underlying undirected string diagrams. This produces a quotient PROP AncQ that is equivalent to Cocom, the PROP whose operations and relations describe non-counital cocommutative comonoids. A sympathetic reader would care because the construction supplies an explicit bridge from a minimal copying generator to a standard algebraic structure, showing how ancestry equivalence classes enforce the required cocommutativity and non-counitality while embedding the result inside the existing cospan and corelation framework.

Core claim

The induced quotient AncQ := Syn(δ)/ker(Π) is equivalent as a PROP to Cocom, the PROP for non-counital cocommutative comonoids, where the ancestry functor Π: Syn(δ) → FinCorel is defined by connected components of the underlying undirected string diagram and has image the sub-PROP FinCorel° of finite corelations with exactly one input and at least one output.

What carries the argument

The ancestry functor Π, which sends each morphism of Syn(δ) to the finite corelation given by the connected components of its underlying undirected string diagram.

If this is right

  • The image of the ancestry functor is precisely the sub-PROP of finite corelations whose classes have exactly one input and at least one output.
  • The construction sits inside the cospan framework in which Cospan(FinSet) collapses under jointly epic corestriction to FinCorel, the PROP for extraspecial commutative Frobenius monoids.
  • The PROP-level identification supplies a concrete presentation of Cocom obtained by quotienting the free copying PROP.
  • Pushout-style gluing realized by Cospan(B) as a free hypergraph category contains this quotient as a special case.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar ancestry quotients could be defined on free PROPs generated by other arities to recover additional algebraic structures.
  • The explicit link between string-diagram components and corelations may let one transfer diagrammatic rewriting techniques directly to comonoid calculations.
  • Adding a counit generator to the original PROP and repeating the ancestry construction might yield the counital version of Cocom in a parallel way.

Load-bearing premise

The ancestry functor defined via connected components of undirected string diagrams is a PROP morphism whose kernel produces a quotient whose morphisms and compositions match exactly those of non-counital cocommutative comonoids.

What would settle it

Explicitly enumerate the distinct morphisms of small arities such as (1,2) and (2,3) in the quotient AncQ and check whether their count and composition table coincide with the standard basis and relations of the PROP Cocom.

read the original abstract

We study the free PROP $\mathrm{Syn}(\delta)$ on a single binary generator $\delta:1\to 2$. The ancestry functor $\Pi:\mathrm{Syn}(\delta)\to \mathrm{FinCorel}$, defined by connected components of the underlying undirected string diagram, has image the sub-PROP $\mathrm{FinCorel}^{\circ}$ of finite corelations whose equivalence classes contain exactly one input and at least one output. The induced quotient [ \mathrm{AncQ}:=\mathrm{Syn}(\delta)/\ker(\Pi) ] is equivalent as a PROP to $\mathrm{Cocom}$, the PROP for non-counital cocommutative comonoids. We then locate this primitive construction inside the standard cospan/corelation framework: $\mathrm{Cospan}(\mathcal B)$ realizes pushout-style gluing as a free hypergraph category; $\mathrm{Cospan}(\mathrm{FinSet})$ collapses under jointly epic corestriction to $\mathrm{FinCorel}$, the PROP for extraspecial commutative Frobenius monoids; and the Yoneda envelope [ \mathcal W=\mathrm{Fun}(\mathrm{FinCorel}^{op},\mathrm{Spc}) ] is a presheaf $\infty$-topos carrying the standard subobject, modality, and monotone fixed-point apparatus. The PROP-level identification $\mathrm{AncQ}\simeq \mathrm{Cocom}$ is the only result claimed as new; the remaining material is organizational and reduces explicitly to cited classical results.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper constructs the free PROP Syn(δ) generated by a single binary operation δ:1→2. It defines an ancestry functor Π: Syn(δ) → FinCorel by taking connected components of the underlying undirected string diagram. The image of Π is the sub-PROP FinCorel^∘ of corelations with exactly one input and at least one output. The induced quotient AncQ := Syn(δ)/ker(Π) is claimed to be equivalent as a PROP to Cocom, the PROP for non-counital cocommutative comonoids. The remaining sections embed the construction into the standard cospan/corelation framework, noting that Cospan(FinSet) collapses to FinCorel (the PROP for extraspecial commutative Frobenius monoids) and that the Yoneda envelope of FinCorel is a presheaf ∞-topos; these parts are presented as reductions to classical results.

Significance. If the central equivalence holds, the work supplies a primitive, parameter-free route from the free PROP on copying to the cocommutative comonoid PROP via ancestry partitions and undirected connected components. This links directly to the cospan and corelation presentations of hypergraph categories and may clarify how direction-forgetting interacts with PROP composition. The organizational material is explicitly reduced to cited results on Cospan and FinCorel, so the novelty is localized to the AncQ ≃ Cocom identification.

major comments (2)
  1. [§3] §3 (Definition of Π and the quotient): The claim that Π is a PROP morphism (hence that ker(Π) is a congruence and AncQ is a well-defined PROP) rests on the assertion that connected components of the undirected diagram after gluing outputs to inputs equal the composition of the corresponding corelations in FinCorel. No explicit verification of this preservation property for sequential composition is supplied; without it the induced quotient cannot be guaranteed to be equivalent to Cocom. This is load-bearing for the central result.
  2. [§4] §4 (Equivalence AncQ ≃ Cocom): The proof that the quotient morphisms precisely recover the operations of non-counital cocommutative comonoids is stated but not expanded; in particular, it is not shown that every generator of Cocom arises from an ancestry class and that no extra relations are imposed by the kernel. A concrete check against the standard presentation of Cocom (e.g., via the coassociativity and cocommutativity axioms) would strengthen the claim.
minor comments (2)
  1. [§2] Notation: the symbol δ is used both for the generator and, implicitly, for its images under the free PROP; a brief clarification in the preliminaries would avoid ambiguity.
  2. [§5] The abstract states that the remaining material 'reduces explicitly to cited classical results,' but the main text does not list the precise citations for the collapse Cospan(FinSet) → FinCorel; adding these references would improve traceability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and for identifying points where additional explicit verification would strengthen the manuscript. We address the major comments below and will revise the paper to incorporate the requested details.

read point-by-point responses

  1. Referee: [§3] §3 (Definition of Π and the quotient): The claim that Π is a PROP morphism (hence that ker(Π) is a congruence and AncQ is a well-defined PROP) rests on the assertion that connected components of the undirected diagram after gluing outputs to inputs equal the composition of the corresponding corelations in FinCorel. No explicit verification of this preservation property for sequential composition is supplied; without it the induced quotient cannot be guaranteed to be equivalent to Cocom. This is load-bearing for the central result.

    Authors: We agree that an explicit verification of sequential composition preservation under Π is necessary to rigorously establish that Π is a PROP morphism. In the revised manuscript we will add a self-contained argument showing that the ancestry partitions (connected components) of the glued undirected string diagrams coincide with the composition of the corresponding corelations in FinCorel. This will confirm that ker(Π) is a congruence and that the quotient AncQ is well-defined as a PROP. revision: yes

  2. Referee: [§4] §4 (Equivalence AncQ ≃ Cocom): The proof that the quotient morphisms precisely recover the operations of non-counital cocommutative comonoids is stated but not expanded; in particular, it is not shown that every generator of Cocom arises from an ancestry class and that no extra relations are imposed by the kernel. A concrete check against the standard presentation of Cocom (e.g., via the coassociativity and cocommutativity axioms) would strengthen the claim.

    Authors: We accept that the current presentation of the equivalence would be improved by an expanded, concrete verification. In the revision we will explicitly construct the PROP morphism from AncQ to Cocom, show that every generator of the standard presentation of Cocom is the image of an ancestry class, and verify directly that the kernel imposes precisely the coassociativity and cocommutativity relations (and no others) by checking the axioms on representatives. revision: yes

Circularity Check

0 steps flagged

No circularity: central equivalence is a direct construction from definitions of Syn(δ) and Π

full rationale

The paper defines the free PROP Syn(δ) on a binary generator, introduces the ancestry functor Π explicitly via connected components of the underlying undirected string diagram, forms the quotient AncQ by ker(Π), and derives its equivalence to Cocom as a PROP. This chain is self-contained and first-principles; the abstract states that the identification is the sole new claim while all other material reduces to cited classical results on cospans and corelations. No step reduces a claimed prediction to a fitted input, self-defines a key object in terms of the target, or relies on a load-bearing self-citation whose content is unverified. The skeptic concern about whether Π preserves composition is a question of proof correctness, not a circularity in the derivation itself.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The construction rests on the existence of the free PROP on a binary generator and on the standard definition of the ancestry functor via connected components; no new free parameters or invented entities are introduced.

axioms (2)
  • standard math The free PROP Syn(δ) on a single binary generator δ:1→2 exists and admits the standard string-diagram representation.
    Invoked in the opening sentence of the abstract as the starting object of the construction.
  • domain assumption The ancestry functor Π is a well-defined PROP morphism from Syn(δ) to FinCorel.
    Stated as the definition that induces the quotient AncQ.

pith-pipeline@v0.9.0 · 5793 in / 1443 out tokens · 72519 ms · 2026-05-19T13:57:24.924735+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages · 1 internal anchor

  1. [1]

    Difference That Preserves: From Transcendental Genesis to a Genealogical Foundation of Mathematics.Foundations of Science(2026), 1–26

    Ballús Santacana, A. Difference That Preserves: From Transcendental Genesis to a Genealogical Foundation of Mathematics.Foundations of Science(2026), 1–26. Springer Netherlands. Published online 27 January 2026.https://doi.org/10.1007/ s10699-025-10028-x

    work page 2026

  2. [2]

    String diagram rewrite theory I: Rewriting with Frobenius structure.Journal of the ACM69 (2022), No

    Bonchi, F., Gadducci, F., Kissinger, A., Sobociński, P., and Zanasi, F. String diagram rewrite theory I: Rewriting with Frobenius structure.Journal of the ACM69 (2022), No. 2, Article 14, 1–58.https://doi.org/10.1145/3502719. 18 A preprint

    work page doi:10.1145/3502719 2022

  3. [3]

    and Fong, B

    Coya, B. and Fong, B. Corelations are the prop for extraspecial commutative Frobenius monoids.Theory and Applications of Categories32 (2017), 380–395

    work page 2017

  4. [4]

    Decorated cospans.Theory and Applications of Categories30 (2015), No

    Fong, B. Decorated cospans.Theory and Applications of Categories30 (2015), No. 33, 1096–1120

    work page 2015

  5. [5]

    thesis, University of Oxford, 2016

    Fong, B.The Algebra of Open and Interconnected Systems.D.Phil. thesis, University of Oxford, 2016

    work page 2016

  6. [6]

    and Spivak, D.I

    Fong, B. and Spivak, D.I. Hypergraph categories.Journal of Pure and Applied Algebra 223 (2019), 4746–4777

    work page 2019

  7. [7]

    Finite sets and symmetric simplicial sets.Theory and Applications of Cat- egories8 (2001), 244–252

    Grandis, M. Finite sets and symmetric simplicial sets.Theory and Applications of Cat- egories8 (2001), 244–252

    work page 2001

  8. [8]

    and Robertson, M

    Hackney, P. and Robertson, M. On the category of props.Applied Categorical Structures 23 (2015), 543–573

    work page 2015

  9. [9]

    Composing PROPs.Theory and Applications of Categories13 (2004), 147–163

    Lack, S. Composing PROPs.Theory and Applications of Categories13 (2004), 147–163

    work page 2004

  10. [10]

    Lurie, J.Higher Topos Theory.Annals of Mathematics Studies 170, Princeton Univer- sity Press, 2009

    work page 2009

  11. [11]

    Mac Lane, S.Categories for the Working Mathematician.2nd ed., Graduate Texts in Mathematics 5, Springer, 1998

    work page 1998

  12. [12]

    On the PROP corresponding to bialgebras.Cahiers de Topologie et Géométrie Différentielle Catégoriques43 (2002), 221–239

    Pirashvili, T. On the PROP corresponding to bialgebras.Cahiers de Topologie et Géométrie Différentielle Catégoriques43 (2002), 221–239

    work page 2002

  13. [13]

    Generic commutative separable algebras and cospans of graphs.Theory and Applications of Categories15 (2005), 164– 177

    Rosebrugh, R., Sabadini, N., and Walters, R.F.C. Generic commutative separable algebras and cospans of graphs.Theory and Applications of Categories15 (2005), 164– 177

    work page 2005

  14. [14]

    A survey of graphical languages for monoidal categories

    Selinger, P. A survey of graphical languages for monoidal categories. InNew Structures for Physics, Lecture Notes in Physics 813, Springer, 2011, 289–355

    work page 2011

  15. [15]

    All $(\infty,1)$-toposes have strict univalent universes

    Shulman, M. All(∞,1)-toposes have strict univalent universes.Preprint, arXiv:1904.07004, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1904

  16. [16]

    A lattice-theoretical fixpoint theorem and its applications.Pacific Journal of Mathematics5 (1955), 285–309

    Tarski, A. A lattice-theoretical fixpoint theorem and its applications.Pacific Journal of Mathematics5 (1955), 285–309. 19

    work page 1955