Relational Presheaf Realization

• Relational presheaf realization is a categorical construction that extends classical presheaves by using relational morphisms to capture nondeterminism and concurrency.
• It systematically realizes relational presheaves into concrete objects via colimits and Kan extensions, bridging abstract logic with operational semantics.
• Its applications span concurrency theory, temporal logic, and quantum contextuality, offering actionable insights into modeling stochastic and higher-dimensional computations.

Relational presheaf realization is a categorical construction that generalizes classical presheaves by relaxing the requirement of functional morphisms to relations, enabling the encoding of nondeterministic, concurrent, or stochastic behavior within a unified functorial framework. The realization process systematically assigns concrete mathematical objects—often in a cocomplete category or as standard presheaves—to relational presheaves, providing a bridge between abstract categorical logic and geometric or operational semantics, with broad applications in concurrency theory, temporal logic, and the semantics of computation (Chamoun et al., 9 Dec 2025, Kishida, 2014, Garraway, 2016).

1. Definition and Fundamental Properties

A relational presheaf on a small category $C$ is a (typically lax) functor $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$, where $\mathrm{Rel}$ denotes the category of sets and binary relations. Explicitly, this means:

• For each $c\in\mathrm{Ob}(C)$, $P(c)$ is a set.
• For each $f: d\to c$, $P(f)\subseteq P(c)\times P(d)$ is a binary relation.
• The axioms:
  • Reflexivity: $\mathrm{id}_{P(c)}\subseteq P(\mathrm{id}_c)$ for all $c$.
  • Lax composition: $P(g)\circ P(f)\subseteq P(g\circ f)$ for composable $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$0.

Morphisms between relational presheaves are oplax natural transformations, expressed as families of functions preserving the relations (Chamoun et al., 9 Dec 2025). In the classical setting, presheaves $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$1 embed as those relational presheaves where each relation is the graph of a function (Kishida, 2014).

2. Logical Presentation and Categorical Structure

Relational presheaves correspond exactly to the set-based models of a cartesian (finitely-limit) theory whose signature consists of sorts for objects of $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$2 and relation symbols $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$3 for each morphism $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$4 in $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$5. The theory is characterized by the sequents:

• Identity: $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$6.
• Composition: $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$7.

This equivalence ensures that the category of relational presheaves is locally finitely presentable—complete and cocomplete—with colimits computed pointwise in $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$8 (Chamoun et al., 9 Dec 2025). Consequently, relational presheaves admit filtered colimits, and any cocontinuous realization functor is controlled via left exact models in the dual category.

3. Realization Functors and Kan Extensions

Given a cocomplete target category $P\colon C^{\mathrm{op}}\rightarrow \mathrm{Rel}$9, a realization of $\mathrm{Rel}$0 in $\mathrm{Rel}$1 is a cocontinuous functor $\mathrm{Rel}$2. By general categorical logic arguments, such a functor corresponds to a left exact functor from the syntactic category of the relation theory into $\mathrm{Rel}$3. This associates:

• For each $\mathrm{Rel}$4, an object $\mathrm{Rel}$5.
• For each $\mathrm{Rel}$6, a relation object $\mathrm{Rel}$7 satisfying dual versions of reflexivity and transitivity.

The realization $\mathrm{Rel}$8 of a relational presheaf $\mathrm{Rel}$9 is canonically the colimit $c\in\mathrm{Ob}(C)$0, where $c\in\mathrm{Ob}(C)$1 is the category of elements of $c\in\mathrm{Ob}(C)$2 (Chamoun et al., 9 Dec 2025).

4. Applications: Concurrency, Topology, and Logic

4.1. Labelled Transition Systems and Concurrency

Relational presheaves systematically model non-deterministic and concurrent computations. For example, presheaves on cube categories (relational precubical sets) furnish combinatorial models of higher-dimensional automata. Realization in the category of directed topological spaces recovers geometric models for concurrency, supporting operations such as blowup that desingularize corners in spaces, yielding manifold-like directed spaces. This construction allows for syntactic and geometric analyses of interleaving and true concurrency (Chamoun et al., 9 Dec 2025).

4.2. Temporal Logic and Counterpart Models

Relational presheaf semantics underpin quantified temporal logics: a relational presheaf $c\in\mathrm{Ob}(C)$3 encodes the possible evolutions of systems across "worlds" or states, with the relation component modeling counterpart or identity relations between individuals across transitions. This provides a categorical foundation for Kripke-style and counterpart semantics, extending to multi-sorted logics and supporting soundness and completeness (Gadducci et al., 2021).

4.3. Sheaf-Theoretic Contextuality and Stochasticity

Stochastic relational presheaves (functors into the Kleisli category of $c\in\mathrm{Ob}(C)$4-valued subdistributions) model stochastic labelled transition systems, as encountered in quantum contextuality. The framework seamlessly integrates internal and external choices, parallel composition (fibered products), and change of base (stage-forgetting) operations, enabling structural analysis of contextuality, non-locality, and hidden-variable models. Presheaf–fibration equivalences guarantee existence and uniqueness of realization up to isomorphism (Kishida, 2014).

5. Comparison with Ordinary Presheaves and Sheaves

Relational presheaves on a Heyting algebra $c\in\mathrm{Ob}(C)$5 are idempotent symmetric order-preserving lax-semifunctors $c\in\mathrm{Ob}(C)$6. Realization functors $c\in\mathrm{Ob}(C)$7 send each relational presheaf to an ordinary set-valued presheaf by extracting the presheaf of its singleton morphisms. Restriction to infima-preserving (sheaf-like) objects yields an equivalence between relational sheaves and ordinary sheaves:

$c\in\mathrm{Ob}(C)$8

as established by adjoint pairs of realization and comparison functors (Garraway, 2016).

6. Advanced Perspectives: Bifibrations and Linear Logic

Monoidal-closed bifibrational frameworks extend the classical Lawvere hyperdoctrine by embedding presheaf semantics into bifibrations over the bicategory of profunctors (distributors). This perspective illuminates dualities between existential and universal quantification, treats presheaf pushforwards and pullbacks as specializations of bifibrational push and pull, and links string diagrammatic calculi to the manipulation of relational presheaves. These reconstructions reveal that the intuitionistic presheaf doctrine supports a linear logic structure when viewed through relational and bifibrational lenses (Melliès et al., 2016).

7. Perspectives and Outlook

Relational presheaf realization subsumes several categorical, logical, and geometric constructions: from modeling operational behavior in computation and encoding modalities and quantification in logic, to supporting directed topological techniques in concurrency theory. The left Kan extension and cartesian logical presentations enable systematic transfer of syntactic relational structures into geometric or algebraic realizations, while categorical equivalences with classical (pre)sheaf and bundle-theoretic models provide bridges to established mathematical frameworks. Ongoing developments exploit this flexibility for new models of nondeterminism, stochasticity, and higher-dimensional computation, with continued interplay between abstract categorical logic and concrete applications in semantics and topology (Chamoun et al., 9 Dec 2025, Kishida, 2014, Garraway, 2016, Melliès et al., 2016).