Login
You're viewing the functional.cafe public feed.
  • Sep 8, 2026, 9:05 PM

    Please, no more poetry, what's a coend?!

    It's what we need to do to combine two sets of arrows p(c,d) and q(d,e).

    (q o p)(c,e) = S^d p(c,d)×q(d,e)

    The composition q after p (q o p) should give a profunctor that returns all possible ways to get from c to e.

    Then the set of combined arrows has an element for every p(c,d) times every arrow in q(d,e).

    Note the superscript d on the integral sign S? It's a variable running over all of D. Now that's another way to make sets of arrows? Didn't I just introduce hom-sets for that? I think we need sets as output, and hence should make sure we can handle them as input, too. However, I still feel somewhat confused in this regard.

    There's, of course, an axiomatic way to describe coends. You need to implement these:

    i_x: P(x,x)->S^a P(a,a)
    α_x: P(x,x)->s

    so there is a unique function h such that

    α_x = h o i_x

    While I might have successfully butchered copy pasting that definition from @bartosz blog post, I have no idea how to make use of it. – It features profunctors where C and D are the same. You can keep composing those, whereas we would have to contend following at most one of Pavuk's threads on any of our ways from C to D.

    I might also struggle a little to answer this one: Isn't a profunctor just a functor? – It certainly is a functor if I look at the arrow in P's type:

    P: C^op,D -> Set

    But it is not a functor F of this type:

    F: C->D

    The consistency requirements for profunctors are weaker.

    2/3

    💬 1🔄 0⭐ 0

Replies