Cograph

Cograph of a function

The cograph of a function f : A → B : 𝑓 → 𝐴 𝐵 f:A\to B is a quotient of the coproduct A + B 𝐴 𝐵 A+B by the equivalence relation generated from ι 1 ⁢ ( a ) ∼ ι 2 ⁢ ( b ) := ( f ⁢ ( a ) = b ) similar-to subscript 𝜄 1 𝑎 subscript 𝜄 2 𝑏 assign 𝑓 𝑎 𝑏 \iota_{1}(a)\sim\iota_{2}(b):=(f(a)=b) .

We can also describe the cograph as a category, using the following (strict) pullback:

Cograph⁢(f)Cograph𝑓{{\mathrm{Cograph}(f)}}Set∙subscriptSet∙{{\mathrm{Set}_{\bullet}}}Δ1subscriptΔ1{{\Delta_{1}}}SetSet{{\mathrm{Set}}}⌟⌟\scriptstyle{\lrcorner}f~~𝑓\scriptstyle{\tilde{f}}

In displayed land, this would be the pullback of pointed sets along the functor that picks out the domain and codomain of f 𝑓 f , along with the map between them. Therefore, the resulting category would have objects A ⇾ [ 0 ] ⇾ 𝐴 delimited-[] 0 A\rightarrowtriangle[0] , B ⇾ [ 1 ] ⇾ 𝐵 delimited-[] 1 B\rightarrowtriangle[1] , and a proofs that f ⁢ ( a ) = b 𝑓 𝑎 𝑏 f(a)=b over [ 0 ] → [ 1 ] → delimited-[] 0 delimited-[] 1 [0]\to[1] .

Cograph of a functor

We can also form the cograph of a functor F : 𝒞 → 𝒟 : 𝐹 → 𝒞 𝒟 F:\mathcal{C}\to\mathcal{D} ; this yields a fibration over the interval category, where 𝒞 0 ⇾ [ 0 ] ⇾ subscript 𝒞 0 delimited-[] 0 \mathcal{C}_{0}\rightarrowtriangle[0] , 𝒟 0 ⇾ [ 1 ] ⇾ subscript 𝒟 0 delimited-[] 1 \mathcal{D}_{0}\rightarrowtriangle[1] , and 𝒟 ⁢ ( F ⁢ ( c ) , d ) ⇾ ( [ 0 ] → [ 1 ] ) ⇾ 𝒟 𝐹 𝑐 𝑑 → delimited-[] 0 delimited-[] 1 \mathcal{D}(F(c),d)\rightarrowtriangle([0]\to[1])

Cograph of a profunctor

More generally, the cograph of a profunctor P : 𝒟 ↛ 𝒞 : 𝑃 ↛ 𝒟 𝒞 P:\mathcal{D}\nrightarrow\mathcal{C} is a fibration over the interval category, where 𝒞 0 ⇾ [ 0 ] ⇾ subscript 𝒞 0 delimited-[] 0 \mathcal{C}_{0}\rightarrowtriangle[0] , 𝒟 0 ⇾ [ 1 ] ⇾ subscript 𝒟 0 delimited-[] 1 \mathcal{D}_{0}\rightarrowtriangle[1] , and P ⁢ ( c , d ) ⇾ ( [ 0 ] → [ 1 ] ) ⇾ 𝑃 𝑐 𝑑 → delimited-[] 0 delimited-[] 1 P(c,d)\rightarrowtriangle([0]\to[1])

Cograph of a 2-sided fibration

References