Skip to content

A Carrier is a G_s-coalgebra in R = Sh(T,J): a sheaf X equipped with stepping maps γ_t : X(t) → X(s★t) satisfying counit and coassociativity. It is the forward pole of the Passage duality, the dual object to the fiber doctrine H in the Chu pairing.
Table of contents

Carrier

What it is

A Carrier is a G_s-coalgebra in R=Sh(T,J)R = \mathbf{Sh}(T, J): a sheaf XRX \in R equipped with a family of stepping maps

γt:X(t)X(st),natural in t,\gamma_t : X(t) \to X(s \star t), \quad \text{natural in } t,

where GsG_s is the directed step comonad Gs(F)(t)=F(st)G_s(F)(t) = F(s \star t) on RR. The stepping maps are the components of a coalgebra structure map γ:XGs(X)\gamma : X \to G_s(X).

Two laws must hold (Eilenberg–Moore 1965; Mac Lane CWM §VI):

Counit law. εtγt=idX(t)\varepsilon_t \circ \gamma_t = \mathrm{id}_{X(t)}, where εt:X(st)X(t)\varepsilon_t : X(s \star t) \to X(t) is the restriction map X(it)X(i_t) along the prefix inclusion it:tsti_t : t \hookrightarrow s \star t. Stepping forward one step then restricting back is the identity. The stepping map is a section of the counit — occupancy is faithful.

Coassociativity. δX,tγt=Gs(γ)tγt\delta_{X,t} \circ \gamma_t = G_s(\gamma)_t \circ \gamma_t, i.e., γstγt=νX(t)\gamma_{s \star t} \circ \gamma_t = \nu_X(t) where νX:Gs(X)Gs(Gs(X))\nu_X : G_s(X) \to G_s(G_s(X)) is the comultiplication. Two sequential applications of γ\gamma cohere with the comonad’s own comultiplication. Sequential service composes without ambiguity.

The carrier is the forward pole of the Passage duality: restriction maps H(f):HtHtH(f) : H_{t'} \to H_t go backward along histories; stepping maps γt:X(t)X(st)\gamma_t : X(t) \to X(s \star t) go forward. These are the two directions a structure over TT can face (Uustalu & Vene 2005; Orchard 2012).

The category of Carriers

The category of GsG_s-coalgebras, GsG_s-Coalg (the co-Eilenberg–Moore category, Eilenberg–Moore 1965), has:

  • Objects: Carriers (X,γ)(X, \gamma) as above
  • Morphisms: sheaf maps f:XYf : X \to Y commuting with stepping — Gs(f)γX=γYfG_s(f) \circ \gamma_X = \gamma_Y \circ f. A morphism is a simulation: it sends each state of XX to a state of YY in a way that respects how both advance under ss.
  • Cofree Carrier over XX: the object (Gs(X),δX)(G_s(X), \delta_X), where δX:Gs(X)Gs(Gs(X))\delta_X : G_s(X) \to G_s(G_s(X)) is the comultiplication. Universal property: every Carrier (Y,γY)(Y, \gamma_Y) with a sheaf map f:YXf : Y \to X factors uniquely through the cofree Carrier via fˉ=Gs(f)γY\bar{f} = G_s(f) \circ \gamma_Y (proof: requires comonad laws and naturality of δ\delta; stated as a claim in cofree coalgebra).
  • CoKleisli category coKl(Gs)\mathrm{coKl}(G_s): same objects as RR; morphisms FGF \to G are sheaf maps Gs(F)GG_s(F) \to G (reading FF one step ahead, producing GG now); composition gcoKlf=gGs(f)δFg \circ_{\mathrm{coKl}} f = g \circ G_s(f) \circ \delta_F; identity on FF is the counit εF:Gs(F)F\varepsilon_F : G_s(F) \to F. This is the free category of ss-mediated transitions — every ss-mediated process factors through it.
Math object Role
(X,γ)(X, \gamma)GsG_s-coalgebra Carrier (this spec)
Sheaf XRX \in R State space: what the Carrier holds at each history
Stepping maps γt:X(t)X(st)\gamma_t : X(t) \to X(s \star t) Forward transition: how state advances when step ss is received
Restriction maps H(f):HtHtH(f) : H_{t'} \to H_t Backward: Passage dual of the stepping maps
Cofree Carrier (Gs(X),δX)(G_s(X), \delta_X) Canonical one-step-ahead Carrier over XX; universal target for Carriers observing XX
CoKleisli category coKl(Gs)\mathrm{coKl}(G_s) Free category of ss-mediated transitions
Terminal Carrier νGs\nu G_s Universe of all behavioral trajectories under iterated ss-stepping; see below

Terminal Carrier and behavioral equivalence

By Adamek’s theorem (Adamek 1974; Aczel–Mendler 1989): if GsG_s preserves limits of ωop\omega^{\mathrm{op}}-chains in RR (equivalently: the limit of Gs2(1)Gs(1)1\cdots \to G_s^2(\mathbf{1}) \to G_s(\mathbf{1}) \to \mathbf{1} exists and is preserved by GsG_s), then the terminal GsG_s-coalgebra νGs\nu G_s exists in RR. By Lambek’s lemma it satisfies Gs(νGs)νGsG_s(\nu G_s) \cong \nu G_s — it is a fixed point of GsG_s. Semantically: νGs\nu G_s is the sheaf of all infinite behavioral trajectories under iterated ss-stepping.

Behavioral equivalence (Rutten 2000 TCS 249:3–80): every Carrier (X,γ)(X, \gamma) has a unique coalgebra morphism behX:XνGs\mathrm{beh}_X : X \to \nu G_s — the behavior map — sending each state xX(t)x \in X(t) to its infinite behavioral trajectory. Two states xX(t)x \in X(t) and yY(t)y \in Y(t) are behaviorally equivalent iff behX(x)=behY(y)\mathrm{beh}_X(x) = \mathrm{beh}_Y(y) in the terminal Carrier.

Bisimulation (Rutten 2000; Joyal–Nielsen–Winskel 1996 Info. & Computation 127:164–185): a bisimulation between Carriers (X,γX)(X, \gamma_X) and (Y,γY)(Y, \gamma_Y) is a third Carrier (R,γR)(R, \gamma_R) with coalgebra morphisms RXR \to X and RYR \to Y — a span in GsG_s-Coalg. States xx and yy are bisimilar iff there is such a span containing the pair (x,y)(x, y). Bisimilarity = behavioral equivalence when GsG_s weakly preserves pullbacks internally in RR (Rutten 2000, Theorem 4.4). In Sh(T,J)\mathbf{Sh}(T,J): a bisimulation must hold locally (over a covering sieve in JJ) and glue globally, by the sheaf condition.

The three levels of Carrier identity, coarsest to finest:

Level Formal condition
Behavioral equivalence Same image in νGs\nu G_s: same infinite trajectory under all iterated steppings
Coalgebra isomorphism Sheaf isomorphism f:XYf : X \xrightarrow{\sim} Y commuting with stepping — isomorphic as objects of GsG_s-Coalg
Strict identity Literally the same coalgebra: same sheaf XX and same stepping maps γ\gamma

Isomorphic Carriers are behaviorally equivalent; behaviorally equivalent Carriers need not be isomorphic (they may have different state spaces with the same behavioral image). For deterministic Carriers — where each state has a unique successor — bisimilarity and isomorphism coincide when νGs\nu G_s separates states (each trajectory names a unique state up to iso).

The Chu duality: Carrier and doctrine

A Carrier XX and the fiber doctrine H:TopHAnuclH : T^{\mathrm{op}} \to \mathbf{HA_{nucl}} stand in duality. At each history tt, the fiber Heyting algebra HtH_t is the observation side (propositions that can be evaluated at tt) and X(t)X(t) is the state side (concrete states that propositions evaluate against). The natural pairing is:

rt:Ht×X(t)Ωtr_t : H_t \times X(t) \to \Omega_t

assigning to each proposition aHta \in H_t and state xX(t)x \in X(t) the truth value of aa at xx. Together (H,r,X)(H, r, X) is a Chu space in Sh(T,J)\mathbf{Sh}(T, J) (Pratt 1999; Barr 1991 MSCS 1(2):159–178): a sheaf-valued triple with the pairing rr playing the role of the evaluation map.

The Passage duality is the dynamic expression of this Chu pairing: restriction maps on HH go backward (observation flows backward along histories); stepping maps on XX go forward (state advances along histories). The counit law εtγt=id\varepsilon_t \circ \gamma_t = \mathrm{id} is the convergence condition — carrying state forward then restricting observation back returns to the original, maintaining the pairing across the step.

In the RelationalMachine: the DataStore carries the fiber doctrine HH (the observation side); the Carrier XX is instantiated as the entity files of a locale (the state side). The stepping maps γt\gamma_t are enacted by the improvement skill advancing the locale from history tt to sts \star t.

Open questions

  • Terminal Carrier existence: Whether νGs\nu G_s exists in Sh(T,J)\mathbf{Sh}(T, J) depends on GsG_s preserving ωop\omega^{\mathrm{op}}-limits internally. Gs(F)(t)=F(st)G_s(F)(t) = F(s \star t) is a base-change functor along the action of ss on TT; whether base change preserves the relevant limit chains in a Grothendieck topos over a non-trivial site (T,J)(T, J) is not yet derived. The existence of a behavioral universe νGs\nu G_s for each atom sΣs \in \Sigma is required for behavioral equivalence to be well-defined, and is an open condition on the site.

  • Interaction of coKleisli categories across independent atoms: The free sequential act file notes that the relationship between coKl(Gs)\mathrm{coKl}(G_s) and coKl(Gs)\mathrm{coKl}(G_{s'}) for independent atoms sss \perp s' is unresolved. The commutativity condition σtΔt=Δtσt\sigma_t \circ \Delta_t = \Delta_t \circ \sigma_t on the nucleus side has an analog here: whether GsGsGsGsG_s \circ G_{s'} \cong G_{s'} \circ G_s as functors (and hence as comonads) when sss \perp s' is the Carrier-level form of the same question. A double-coKleisli structure or tensor product of coKleisli categories may be the correct answer, but neither is formally derived.

  • *Chu -autonomy and the nuclei: Whether the Chu triple (H,r,X)(H, r, X) in Sh(T,J)\mathbf{Sh}(T, J) generates a *-autonomous structure in the sense of Barr (1991) is not yet derived. The *-autonomous structure would give a dualizing object for the monoidal category of Carriers, making the duality between observation and state into a formal categorical involution. Whether the saturation nucleus σt\sigma_t and transfer nucleus Δt\Delta_t arise as the counit and comultiplication of a comonad induced by the Chu pairing — connecting the doctrinal and coalgebraic layers into a single structure — is a central open question.

Relations

Ast
Date created
Date modified
Defines
Carrier
Grounding
Relational machine
Minimum math
Relational universe directed step comonad shift functor sequential composition
Output
Relational universe morphism
Sheaf
Relational universe
Stepping map
Relational universe comonad coalgebra structure map counit coassociativity