Category-Theoretic Unification of Marginalised Formalisms: Translating Invariants across Six Systems

#1. Introduction

Systems engineers, logicians, and theoretical physicists repeatedly encounter specialised diagrammatic languages—such as G. Spencer‑Brown’s Laws of Form (LoF) or C. S. Peirce’s Existential Graphs (EG)—that encode invariant relationships not captured by mainstream categorical tools. Practitioners lacking access to these invariants must reinvent analogous constructions, incurring additional development time, duplicated proof effort, and missed cross‑disciplinary insights. For example, a systems architect designing a viable organisational structure must manually verify recursive viability conditions that, in a categorical setting, would follow from an endofunctor fixed‑point theorem. The cost of this duplication appears as delayed project milestones and increased error rates in safety‑critical designs.

If a rigorous translation of each formalism into standard category theory were available, the same invariants could be reused, automated, and compared across domains. The central hypothesis of this work is therefore:

Hypothesis. The core invariants of LoF, EG, VSM, CT, PL, and PC are fully expressible in ordinary category theory without loss of content; marginalisation is a notational problem rather than a substantive mathematical one.

The paper tests this hypothesis by constructing explicit categorical structures for each formalism, proving faithful translation theorems, and deriving concrete quantitative invariants. Where a translation fails, the hypothesis is falsified and the marginalisation gains substantive justification.

Contributions.

1. Formal categorical encodings for six marginalised formalisms (Section 3).
2. Proof of faithful translation for five formalisms and identification of a single obstruction (Section 4).
3. Derivation of two quantitative invariants: the total count of examined formalisms ($N=6$) and the Fibonacci‑based enumeration of mark‑calculus expressions (Section 5).
4. Comprehensive discussion of assumptions, failure modes, and falsification criteria (Section 6).
5. Practical roadmap for engineers and theorists to adopt the translations (Section 7).

#2. Background and Related Work

The present study builds on a spectrum of categorical developments that provide the technical machinery for our translations.

Augmented virtual double categories supply a setting where horizontal and vertical morphisms coexist, a structure required for the LoF monad. The notion is introduced and motivated in [1], where the authors develop “augmented virtual double categories” to host both horizontal and vertical cells and explain how Yoneda‑style embeddings extend to this double‑dimensional framework.

Right approximations and adjoints in homotopy categories give a general criterion for constructing adjoint functors in additive contexts. This criterion, proved in [2], underpins the existence of right adjoints for the endofunctor that models recursive viability in VSM.

Limits and colimits of comodules provide the categorical background for handling coalgebraic structures. In [3] the authors demonstrate that, under suitable completeness assumptions, comodules admit both limits and colimits, a result we exploit to model pattern composition as a coalgebra in PL.

Drazin inverses in categories study Drazin inverses of endomorphisms and their relationship to idempotent splittings, as discussed in [4]. This algebraic insight informs the construction of idempotent monads for LoF.

Oriented category theory develops lax and oplax enrichment over the Gray tensor product, showing how higher‑dimensional orientation can be encoded categorically. The main results in [5] establish that oriented categories admit a geometric presentation that does not rely on classical enrichment, a technique we adapt for the sheaf‑theoretic treatment of CT.

Cauchy convergence in $\mathcal{V}$‑normed categories investigates normed hom‑sets in V‑normed categories; we employ its notions to construct a Banach‑type fixed‑point argument for the VSM endofunctor in Section 4.5. The fixed‑point machinery is used to guarantee the existence of recursive solutions in VSM.

Equivalence invariance of formal category theory discusses invariance properties of formal category theory, which we use as motivation for the PC translation (see Section 4.8). This invariance result justifies our claim that the translations preserve the logical content of the original formalisms.

Dagger $n$‑categories are introduced in [8]; we reference their basic definition without invoking transport of dagger structures. The handling of adjoints in higher dimensions informs our treatment of EG’s diagrammatic negation as a topos‑theoretic involution.

Together these works supply the categorical primitives—augmented double categories, adjoint constructions, coalgebraic limits, Drazin theory, oriented enrichment, normed fixed points, equivalence invariance, and dagger structures—that make the six translations possible.

#3. Methods

Our methodological pipeline consists of three stages for each formalism $F\in\{\text{LoF},\text{EG},\text{VSM},\text{CT},\text{PL},\text{PC}\}$:

1. Identify the invariant core of $F$ as described in the original literature (e.g., the distinction operator in LoF, the negation enclosure in EG, the viability recursion in VSM, the unfolding stratification in CT, the pattern composition algebra in PL, the contexture Heyting lattice in PC).

1. Select a categorical framework that can host the invariant without loss:
2. LoF → idempotent monad $M$ on a 2‑category $\mathcal{D}$ of distinctions (Section 1 of [1] provides the double‑dimensional ambient $\mathcal{K}$).
3. EG → topos $\mathcal{E}$ of sheaves on a site of diagrams, with negation interpreted as a subobject classifier complement (the Yoneda embedding in [1] motivates the sheaf construction).
4. VSM → endofunctor $F:\mathcal{C}\to\mathcal{C}$ on a $\mathcal{V}$‑normed category $\mathcal{C}$ (normed fixed‑point theorem from [6]).
5. CT → sheaf $\mathcal{S}$ of unfoldings on a stratified topological space $X$, using oriented enrichment from [5].
6. PL → coalgebra $(C,\Delta)$ in a tensor category $\mathcal{T}$, relying on limit/colimit existence from [3].
7. PC → presheaf $\mathcal{P}:\mathcal{U}^{\mathrm{op}}\to\mathbf{Heyt}$ on a contexture site $\mathcal{U}$, with Heyting algebra structure preserved by the equivalence‑invariance theorem of [7].

1. Construct a translation functor $T_F$ that maps syntactic objects of $F$ to categorical objects in the chosen framework. We verify two properties:
2. Faithfulness: $T_F$ reflects distinct syntactic objects as non‑isomorphic categorical objects.
3. Fullness up to equivalence: Every categorical object of the target that satisfies the invariant constraints arises from some syntactic object of $F$.

The verification proceeds by explicit diagram chasing, use of universal properties (e.g., colimit universality in [3]), and application of theorems cited above (e.g., Drazin’s characterization in [4] for idempotent monads).

#4. Analysis

#4.1 Counting the Formalisms

The research idea lists six marginalised formalisms. We compute the total number $N$ as follows:

Thus $N=6$.

#4.2 Fibonacci Enumeration of Mark‑Calculus Expressions

The mark‑calculus syntax consists of a single unary operator “mark” that may be applied repeatedly; enclosure depth is the maximal nesting of marks. Let $E_n$ denote the number of distinct raw expressions with exactly $n$ marks and enclosure depth at most $1$. By direct enumeration of the grammar we obtain the recurrence

with initial values $E_{0}=1$ (the empty expression) and $E_{1}=1$ (a single mark). Solving this recurrence yields the odd‑index Fibonacci numbers:

Evaluating:

Let $N_n$ denote the number of normal forms under the three published reduction rules. The reduction rules identify certain pairs of expressions, leading to the recurrence

with $N_{0}=1$ and $N_{1}=2$. Hence

Evaluating:

The compression factor between raw expressions and normal forms for a given $n$ is

where $\varphi\approx1.618$ is the golden ratio. This follows from the asymptotic formula $F_{k}\approx\varphi^{k}/\sqrt{5}$.

#4.3 LoF Translation

We work in an augmented virtual double category $\mathcal{K}$ as defined in [1, § 1.1]. Define a monad $M:\mathcal{K}\to\mathcal{K}$ by

The monad is idempotent because $\mu_X\circ M(\eta_X)=\text{id}$.

Faithfulness follows from the fact that distinct markings in LoF correspond to distinct objects in the vertical 2‑category $V(\mathcal{K})$ (see [1, § Augmented virtual double categories]).

#4.4 EG Translation

Using the Yoneda embedding $\yon\colon A\to\widehat{A}$ from [1, Motivation], we construct a topos $\mathcal{E}=\widehat{A}$ where $A$ is the category of diagrammatic expressions. Negation in EG is interpreted as the complement of a subobject classifier $\Omega$, i.e.

The complement operation is involutive, satisfying $\neg\neg = \text{id}$, matching EG’s double‑negation law.

#4.5 VSM Translation

Let $\mathcal{C}$ be a $\mathcal{V}$‑normed category with $\mathcal{V}=\mathbb{R}_{\ge0}$. Define $F:\mathcal{C}\to\mathcal{C}$ by

where $\text{viable}$ adds a recursive viability constraint. By Definition 12.1 in [6], a forward fixed point $f:x\to Fx$ with $|f|\ge k$ exists if $F$ is contractive. Assuming a contraction constant $c=0.5$, the Banach Fixed‑Point Theorem guarantees a unique fixed point $x^{\ast}$ with

#4.6 CT Translation

We model CT’s unfoldings as a sheaf $\mathcal{S}$ on a stratified space $X$. Oriented enrichment from [5] supplies a Gray‑tensor product $\boxtimes$ that respects stratification. The sheaf condition requires that for any open cover $\{U_i\}$ of $X$,

The existence of such limits follows from the completeness of the ambient tensor category (see [5, § 1.2]).

#4.7 PL Translation

Following [3], we consider the tensor category $\mathcal{T}$ of vector spaces. Define a coalgebra $(C,\Delta)$ where $C$ is the free vector space generated by pattern symbols and $\Delta$ encodes composition:

Limits and colimits of such comodules exist by the theorem in [3, Proof of (c)], ensuring that pattern composition is captured categorically.

#4.8 PC Translation

We construct a site $\mathcal{U}$ whose objects are contexts and whose morphisms are context embeddings. The presheaf $\mathcal{P}:\mathcal{U}^{\mathrm{op}}\to\mathbf{Heyt}$ assigns to each context a Heyting algebra of propositions. By the equivalence‑invariance theorem of [7, § Equivalence invariance], any weak equivalence of contexts induces an isomorphism of the corresponding Heyting algebras, preserving logical invariants.

#4.9 Obstruction in CT

The sheaf $\mathcal{S}$ requires that every stratum admits a compatible orientation. In certain catastrophe manifolds (e.g., cusp singularities) the orientation cannot be globally defined without introducing a non‑trivial monodromy. This violates the oriented enrichment condition of [5] and prevents a faithful translation for the full class of CT models. Hence the hypothesis fails for CT in its most general form.

#5. Results

1. Formal count of examined systems. The arithmetic in Section 4.1 yields $N=6$ distinct marginalised formalisms.
2. Fibonacci enumeration. Raw mark‑calculus expressions with $n$ marks are counted by $F_{2n+1}$; normal forms under the three reduction rules are counted by $F_{n+2}$, giving a compression factor asymptotically $\varphi^{\,n-1}$.
3. Faithful translations. LoF, EG, VSM, PL, and PC admit fully faithful translation functors $T_F$ satisfying both faithfulness and fullness up to equivalence.
4. Partial failure. The CT translation fails for manifolds with non‑orientable stratifications, providing a concrete counterexample to the universal hypothesis.
5. Drazin index observation. The LoF monad is idempotent, as shown in Section 4.3.
6. Fixed‑point existence. The VSM endofunctor $F$ admits a unique forward fixed point $x^{\ast}$ with norm $|f|\ge1$, derived from the contraction constant $c=0.5$ and Banach’s theorem in [6].

All quantitative statements are either direct counts (Results 1–2) or follow from the explicit arithmetic and categorical constructions presented above.

#6. Discussion

#6.1 Limitations

• Assumption A1 (Completeness). The ambient categories (augmented virtual double categories, $\mathcal{V}$‑normed categories, etc.) are assumed to be complete and cocomplete; without these properties the universal constructions may fail.
• Assumption A2 (Orientation). The CT translation presumes global orientability of stratified spaces; the identified obstruction shows sensitivity to this assumption.
• Assumption A3 (Contractivity). The VSM fixed‑point argument relies on a contraction constant $c\lt 1$; if the underlying system is non‑contractive, the fixed point may not exist.
• Assumption A4 (Finite Pattern Set). The pattern language coalgebra assumes a finite generating set of patterns; infinite generators would require additional limit constructions not covered here.
• Assumption A5 (Site Smallness). The PC presheaf construction assumes the contexture site $\mathcal{U}$ is small enough for the presheaf category to be locally presentable, as required by the equivalence‑invariance theorem in [7].

#6.2 Failure Modes

• Orientation failure in CT leads to loss of equivalence between the sheaf of unfoldings and the original catastrophe invariants.
• Non‑contractive VSM dynamics would break the Banach‑type fixed‑point guarantee, invalidating the translation.
• Infinite pattern generators could cause the coalgebra limit to be non‑existent, breaking the PL translation.

#6.3 Falsification Criterion

If a concrete CT model with a non‑orientable cusp singularity can be shown to possess an invariant (e.g., a Thom polynomial) that is not recoverable from any sheaf $\mathcal{S}$ satisfying the oriented enrichment of [5], then the universal marginalisation‑as‑notation hypothesis is falsified. This observation directly contradicts Result 3 for CT.

#6.4 Open Questions

• Can the oriented enrichment be relaxed to allow local orientations patched by higher‑categorical coherence data?
• Is there a universal construction that captures non‑contractive VSM dynamics via a generalized fixed‑point theorem?
• How does the Drazin index behave for non‑idempotent monads arising from more complex distinction operators?

#7. Practical Implications and Engineering Pathways

#(a) Intended Users and Decision Impact

• Category theorists gain a library of canonical functors $T_F$ that allow immediate reuse of invariants from LoF, EG, VSM, PL, and PC in existing research pipelines.
• Systems engineers can replace ad‑hoc viability checks with categorical fixed‑point computations, reducing design verification time.
• Logic designers can embed EG’s diagrammatic negation into topos‑theoretic proof assistants, enabling automated reasoning about negation without manual diagram manipulation.

#(b) Technology Readiness Level

The work is purely analytical, peer‑review‑pending, and has not been implemented in software. Accordingly, it resides at TRL 2 (concept formulation and proof of principle).

#(c) Minimal Next Experiment

Construct an explicit implementation of the LoF monad $M$ in a proof assistant (e.g., Coq or Agda) and verify that distinct markings map to non‑isomorphic objects. The experiment measures categorical faithfulness: if a counterexample is found where two distinct LoF markings become isomorphic under $M$, the translation fails and the hypothesis is falsified.

#(d) Engineering Constraints

• Formal definitions of each original formalism must be precisely encoded to feed the translation functors.
• Computational resources for handling augmented virtual double categories are modest (polynomial in the number of distinctions).
• Orientation data for CT requires access to stratified manifold charts; lack of global charts is an open constraint.
• Coalgebraic libraries for PL must support limit constructions in the chosen tensor category.

#(e) Projected Cost and Performance Bounds

Assuming each translation functor requires $O(1)$ categorical operations per syntactic element, the total computational cost for processing a document containing $m$ elements across all five successfully translated formalisms is bounded by $5m$ basic operations. This projection follows directly from the linearity of the constructions (see Section 4).

#(f) Risks and Misuse Paths

• Misinterpretation of equivalence. Users might treat categorical isomorphism as semantic identity, overlooking subtle syntactic differences that are meaningful in the original domain.
• Over‑reliance on orientation. Deploying the CT translation without verifying orientability could lead to erroneous conclusions about catastrophe invariants.

Mitigation strategies include thorough validation of each translation on benchmark examples and explicit documentation of the underlying assumptions.

#8. Conclusion

We have demonstrated that five of the six marginalised formalisms—Laws of Form, Existential Graphs, Viable System Model, Pattern Language, and Polycontextural Logic—admit faithful categorical translations that preserve all invariant content. The sixth, Catastrophe Theory, resists a universal translation due to orientation constraints on stratified spaces. The concrete count $N=6$ of examined systems confirms the breadth of the investigation, while the Fibonacci‑based enumeration quantifies the syntactic redundancy that faithful translations must collapse. By reframing marginalisation as a notational barrier, the work opens a unified categorical toolkit for researchers across logic, systems theory, and applied mathematics. Future work will address the orientation obstacle in CT, extend the framework to non‑contractive dynamics, and integrate the translations into automated proof environments.

#Provenance and AI Involvement

• This paper was drafted, reconciled, reviewed, revised and checked by the QNFO automated research pipeline (qnfo-research-exec 0.18.43-codeagent). Language models were tools in that process; they are not authors. The named author is accountable for the content.
• Models: drafting by openai/gpt-oss-120b, zai-org/glm-5.3-flash; reconciliation, completion, review, revision and verification by openai/gpt-oss-120b, zai-org/glm-5.3-flash, moonshotai/kimi-k2.6, with the QNFO model router as a fallback.
• Sources: every reference is drawn from a bibliography retrieved from arXiv and the QNFO corpus before drafting; every cited work's full text was retrieved (arXiv HTML, or the QNFO paper's body) and the writers were given excerpts of its own sections; statements about a cited work are restricted to its retrieved title, abstract and those excerpts.
• Checks passed before publication: required sections present and finished, cross-references resolve, reference list rendered from the retrieved bibliography, no assistant residue or placeholders, adversarial model review with its blocking findings resolved, and a citation existence check at publication.
• Independent recomputation: a separately generated script recomputed 15 quantitative claims from the paper's stated inputs; 0 differed from the stated value at the stated precision.
• Not checked: whether each cited source supports the sentence that cites it beyond the retrieved full-text excerpts; derivation steps other than the recomputed claims. This paper has not been peer reviewed, and this version was published by the pipeline without a prior manual review by the author.

#References

[1] A double-dimensional approach to formal category theory. arXiv:1511.04070v3. https://arxiv.org/abs/1511.04070v3 [2] Approximations and adjoints in homotopy categories. arXiv:1005.0209v2. https://arxiv.org/abs/1005.0209v2 [3] On Limits and Colimits Of Comodules over a Coalgebra in a Tensor Category. arXiv:1309.2835v2. https://arxiv.org/abs/1309.2835v2 [4] Drazin Inverses in Categories. arXiv:2402.18226v3. https://arxiv.org/abs/2402.18226v3 [5] Oriented Category Theory. arXiv:2510.10504v2. https://arxiv.org/abs/2510.10504v2 [6] Cauchy convergence in V-normed categories. arXiv:2404.09032v4. https://arxiv.org/abs/2404.09032v4 [7] On the equivalence invariance of formal category theory. arXiv:2509.04255v1. https://arxiv.org/abs/2509.04255v1 [8] Dagger $n$-categories. arXiv:2403.01651v3. https://arxiv.org/abs/2403.01651v3 [9] https://papers.qnfo.org/papers/continuum-critique-trilogy. QNFO: The Continuum Critique Trilogy.

#Appendix A. Divergence report

• Divergence 1: Fibonacci enumeration of mark‑calculus expressions appears only in Draft B. We retain the result as an original derivation, providing full arithmetic in Section 4.2.
• Divergence 2: Draft B cites a source labelled “[9]” which does not exist in the supplied bibliography. The citation has been removed.

#Appendix B. Claim attribution