Abstract

We present a unified categorical theory of paracosms*—formal models of narrative and ludic worlds—grounded in the coexistence of modal structure (possibility, necessity, knowledge, play) and reproducibility (coherence under reconstruction).
By defining internal modal endofunctors within a reflective localization of the model category of a world sketch, we prove two main results:
(1) the *Modal Encoding Theorem
, which establishes a fibred category of modal objects forming a complete and cocomplete extension of the world; and
(2) the Reproducibility Theorem, which shows that gluing, normalization, and bisimulation yield an institutionally invariant quotient.
Together these results characterize a *Reproducible Paracosmic Modal Model*—a world that can be re-narrated, replayed, or re-simulated without loss of truth or potentiality.

1. Introduction — From Narrative Theory to Category Theory

In narrative theory, a storyworld (Genette; Ryan) is an abstract structure reconstructed by readers from textual or experiential evidence.
In ludic theory (Juul; Aarseth), a game world is a coherent rule-space realized through play.
Both describe paracosms: systematic worlds that must remain internally consistent across tellings or enactments.

A paracosm’s central challenge is reproducibility: different interpretations or playthroughs must correspond to the same world.
Narratively, this appears as canon or continuity; mechanically, as state coherence.
Formally, it is the invariance of world structure under permissible transformations.

We approach this through category theory:

  • functorial semantics (Lawvere) defines the algebraic skeleton of the world;
  • gluing and descent (Ehresmann, Grothendieck) model narrative locality;
  • normalization (Newman) models temporal determinacy;
  • bisimulation (Hennessy–Milner) captures observational equivalence; and
  • institutions (Goguen–Burstall) guarantee logic independence.

The result is a single categorical system capturing both narrative modality and reproducibility.

2. Formalization — The Paracosmic Sketch and Its Modal Structure

A paracosmic sketch \( S \) consists of:

  1. a small category \( \mathcal{C}_S \) of entities, events, and relations (the diegetic [[Ontology|ontology]]);
  2. designated (co)limit cones encoding compositional constraints (causal, spatial, temporal);
  3. a finite family of modal endofunctors \[ \Box_i : \mathcal{C}_S \to \mathcal{C}_S,\quad i\in I, \] representing modes of accessibility (knowledge, memory, speculation, agency).

A model of is a functor preserving the specified (co)limits.
The category of models is denoted .

In narratology, \( \mathcal{C}_S \) represents the fabula (story logic), \( M \) a specific sjužet (discourse realization), and \(\Box_i\) modalities of viewpoint or epistemic framing.

Assumption: is locally presentable, hence complete and cocomplete (Adámek–Rosický).

We now internalize modalities as structure-preserving endofunctors on :

A paracosmic modality is an endofunctor \[ \Box_i : \mathbf{Mod}(S) \to \mathbf{Mod}(S) \] such that:

  1. it preserves finite limits and colimits;
  2. it commutes with canonical transformations expressing normalization and observation (to be defined below);
  3. it admits a right adjoint \(\Diamond_i\) (possibility) with unit \(\eta_i\) and counit \(\varepsilon_i\).

These conditions ensure that modal transformations respect the internal logic and observational structure of the world.

3. Theorem I — The Modal Encoding Theorem

We define the fibred category of modal objects.

A modal object in \(\mathbf{Mod}(S)\) is a pair \((M,\mu_i)\) with \(M\in\mathbf{Mod}(S)\) and a structure map \[ \mu_i : \Box_i M \to M \] satisfying the coherence relations \[ \mu_i \circ \Box_i(\mu_i) = \mu_i \circ \varepsilon_i,\qquad \text{and} \qquad \mu_i \text{ preserves all equations in } S. \] Morphisms \(f:(M,\mu_i)\to(N,\nu_i)\) satisfy \(f\circ\mu_i = \nu_i\circ\Box_i(f)\).

For each , let denote the category of -coalgebras.
The assignment defines a pseudo-functor ; its Grothendieck construction

collects all modal layers of the world.

(Modal Encoding Theorem) If each \(\Box_i\) is left exact, preserves colimits of connected diagrams, and admits an adjoint \(\Diamond_i\), then:

  1. the projection \(p:\int_I\mathcal{M}\to\mathbf{Mod}(S)\) is a fibration;
  2. each fibre \(\mathsf{Mod}_{\Box_i}(S)\) is reflective in \(\mathbf{Mod}(S)\);
  3. there exists a left adjoint modal encoding functor \[ \mathsf{Encode}_\Box : \mathbf{Mod}(S)\to\int_I\mathcal{M}, \quad M\mapsto\{(\Box_i M,\varepsilon_i)\}_{i\in I}, \] exhibiting \(\int_I\mathcal{M}\) as a reflective localization of \(\mathbf{Mod}(S)\).

Hence every model \(M\) canonically embeds into its modal closure—its internally coherent space of potentiality.

Interpretation:
The Modal Encoding Theorem defines the complete modal universe of a paracosm.
All narrative possibilities consistent with the world’s structure are encoded within .

4. Theorem II — The Reproducibility Theorem

To model retelling, evolution, and observation, we impose three equivalences on :

  1. Gluing (J): local models agreeing on overlaps glue to a unique global model (descent).
  2. Normalization (N): rewrite rules forming a terminating, locally confluent system induce a normalization functor with .
  3. Bisimulation (O): an observation functor preserves modal truth; bisimilar models are observationally equivalent.

Quotienting by these yields the reproducible paracosm:

(Reproducibility Theorem) If \(S\) admits effective gluing, terminating confluent rewriting, and modal-preserving observation, then:

  1. \(\mathsf{RP}(S)\) is complete, cocomplete, and institutionally invariant;
  2. the modal encoding functor \(\mathsf{Encode}_\Box\) factors through the quotient: \[ \mathsf{Encode}_\Box : \mathsf{RP}(S) \to \int_I\mathsf{RP}_{\Box_i}(S), \] where each \(\mathsf{RP}_{\Box_i}(S)\) is the image of \(\mathsf{Mod}_{\Box_i}(S)\) under the quotient functor;
  3. this factorization is an equivalence up to natural [[Isomorphism|isomorphism]].

Therefore, the reproducible world is precisely the canonical modal closure of the paracosmic sketch \(S\).

Proof Sketch.
Completeness and cocompleteness follow from local presentability and closure of reflective subcategories under localization.
Institutional invariance follows from Goguen–Burstall’s result that satisfaction commutes with signature morphisms.
Factorization of holds because commutes with the three equivalence-generating functors (preserving gluing, normalization, and observation).
Uniqueness up to natural isomorphism arises from the universal property of reflective localizations.

5. Interpretation and Consequences

Narrative interpretation.
The paracosm’s modal closure represents all possible tellings that remain the same story.

  • Gluing = coherence of lore across authors or regions.
  • Normalization = convergence of retellings to a canonical storyline.
  • Bisimulation = equivalence of perspective or presentation.
  • Modal encoding = internal handling of “what could happen,” “what must happen,” “what is known.”

Ludic interpretation.
Modal objects correspond to consistent player or system states under rules that preserve world integrity.
Normalization guarantees deterministic resolution; gluing guarantees distributed synchronization; bisimulation guarantees identical gameplay experience; modal encoding guarantees the consistency of potential actions.

Philosophical interpretation.
The theorem formalizes the intuition that truth in a fictional or simulated world is modal but reproducible.
Possibility and actuality coexist as categorical levels within a single invariant structure.

6. Conclusion

The Theorem of Reproducible Paracosmic Modal Models provides a unified categorical foundation for world-building across narrative and ludic media.
By embedding modal semantics directly within the reproducible model category, we obtain a world that is both open to potentiality and closed under reconstruction.
This establishes a formal standard for representing, sharing, and extending coherent paracosmic systems—analogous to how functorial semantics standardizes mathematical theories.

References

  • Lawvere, F.W. (1963). Functorial Semantics of Algebraic Theories.
  • Ehresmann, C. (1966). Sketches of Algebraic Structures.
  • Adámek, J. & Rosický, J. (1994). Locally Presentable and Accessible Categories.
  • Goguen, J.A. & Burstall, R.M. (1984). Institutions: Abstract Model Theory for Specification and Programming.
  • Hennessy, M. & Milner, R. (1985). Algebraic Laws for Nondeterminism and Concurrency.
  • Mac Lane, S. (1963). Natural Associativity and Commutativity.
  • Lurie, J. (2009). Higher Topos Theory.
  • Ryan, M.-L. (1991). Possible Worlds, Artificial Intelligence, and Narrative Theory.
  • Juul, J. (2005). Half-Real: Video Games Between Real Rules and Fictional Worlds.
  • Genette, G. (1972). Figures III.
  • Rutten, J. (2000). Universal Coalgebra: A Theory of Systems.

Backlinks