Table of contents
Carrier
What it is
A Carrier is a G_s-coalgebra in : a sheaf equipped with a family of stepping maps
where is the directed step comonad on . The stepping maps are the components of a coalgebra structure map .
Two laws must hold (Eilenberg–Moore 1965; Mac Lane CWM §VI):
Counit law. , where is the restriction map along the prefix inclusion . Stepping forward one step then restricting back is the identity. The stepping map is a section of the counit — occupancy is faithful.
Coassociativity. , i.e., where is the comultiplication. Two sequential applications of cohere with the comonad’s own comultiplication. Sequential service composes without ambiguity.
The carrier is the forward pole of the Passage duality: restriction maps go backward along histories; stepping maps go forward. These are the two directions a structure over can face (Uustalu & Vene 2005; Orchard 2012).
The category of Carriers
The category of -coalgebras, -Coalg (the co-Eilenberg–Moore category, Eilenberg–Moore 1965), has:
- Objects: Carriers as above
- Morphisms: sheaf maps commuting with stepping — . A morphism is a simulation: it sends each state of to a state of in a way that respects how both advance under .
- Cofree Carrier over : the object , where is the comultiplication. Universal property: every Carrier with a sheaf map factors uniquely through the cofree Carrier via (proof: requires comonad laws and naturality of ; stated as a claim in cofree coalgebra).
- CoKleisli category : same objects as ; morphisms are sheaf maps (reading one step ahead, producing now); composition ; identity on is the counit . This is the free category of -mediated transitions — every -mediated process factors through it.
| Math object | Role |
|---|---|
| — -coalgebra | Carrier (this spec) |
| Sheaf | State space: what the Carrier holds at each history |
| Stepping maps | Forward transition: how state advances when step is received |
| Restriction maps | Backward: Passage dual of the stepping maps |
| Cofree Carrier | Canonical one-step-ahead Carrier over ; universal target for Carriers observing |
| CoKleisli category | Free category of -mediated transitions |
| Terminal Carrier | Universe of all behavioral trajectories under iterated -stepping; see below |
Terminal Carrier and behavioral equivalence
By Adamek’s theorem (Adamek 1974; Aczel–Mendler 1989): if preserves limits of -chains in (equivalently: the limit of exists and is preserved by ), then the terminal -coalgebra exists in . By Lambek’s lemma it satisfies — it is a fixed point of . Semantically: is the sheaf of all infinite behavioral trajectories under iterated -stepping.
Behavioral equivalence (Rutten 2000 TCS 249:3–80): every Carrier has a unique coalgebra morphism — the behavior map — sending each state to its infinite behavioral trajectory. Two states and are behaviorally equivalent iff in the terminal Carrier.
Bisimulation (Rutten 2000; Joyal–Nielsen–Winskel 1996 Info. & Computation 127:164–185): a bisimulation between Carriers and is a third Carrier with coalgebra morphisms and — a span in -Coalg. States and are bisimilar iff there is such a span containing the pair . Bisimilarity = behavioral equivalence when weakly preserves pullbacks internally in (Rutten 2000, Theorem 4.4). In : a bisimulation must hold locally (over a covering sieve in ) and glue globally, by the sheaf condition.
The three levels of Carrier identity, coarsest to finest:
| Level | Formal condition |
|---|---|
| Behavioral equivalence | Same image in : same infinite trajectory under all iterated steppings |
| Coalgebra isomorphism | Sheaf isomorphism commuting with stepping — isomorphic as objects of -Coalg |
| Strict identity | Literally the same coalgebra: same sheaf and same stepping maps |
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 separates states (each trajectory names a unique state up to iso).
The Chu duality: Carrier and doctrine
A Carrier and the fiber doctrine stand in duality. At each history , the fiber Heyting algebra is the observation side (propositions that can be evaluated at ) and is the state side (concrete states that propositions evaluate against). The natural pairing is:
assigning to each proposition and state the truth value of at . Together is a Chu space in (Pratt 1999; Barr 1991 MSCS 1(2):159–178): a sheaf-valued triple with the pairing playing the role of the evaluation map.
The Passage duality is the dynamic expression of this Chu pairing: restriction maps on go backward (observation flows backward along histories); stepping maps on go forward (state advances along histories). The counit law 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 (the observation side); the Carrier is instantiated as the entity files of a locale (the state side). The stepping maps are enacted by the improvement skill advancing the locale from history to .
Open questions
-
Terminal Carrier existence: Whether exists in depends on preserving -limits internally. is a base-change functor along the action of on ; whether base change preserves the relevant limit chains in a Grothendieck topos over a non-trivial site is not yet derived. The existence of a behavioral universe for each atom 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 and for independent atoms is unresolved. The commutativity condition on the nucleus side has an analog here: whether as functors (and hence as comonads) when 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 in 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 and transfer nucleus 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.