Ordinative Category Theory (OCT)

Integral Foundation of the Royal Composition

Foundational manuscript to accompany the OST.Version: v1.0-preprint-candidateDate: 2026-04-19Status: Preprint candidate ready for technical publication (Volumes I-V + baseline freeze OCT v1.0 candidate) Preprint editorial note:- this version is a candidate for foundational publication;- theorematic claims in scope remain in revise state until extended validation;- the axiomatic structure and formal grammar are frozen in baseline v1.0 candidates.

Abstract

This work proposes a systematic extension of classical category theory.The central thesis is that good syntactic formation is not a sufficient condition of realitytheoretical: a structure is orderly valid when it maintains relational coherence andgenerates non-zero emergent function. OCT preserves classical grammar and adds an explicit level of ontological validitythrough three operators:Coh (coherence), Phi (emergence), Delta (degeneration). Scientific objective:enter the grammar of contemporary human science with a falsifiable framework,conservative on the syntactic level and innovative on the semantic-ontological level. Formal baseline adopted:OCT_TYPED_FORMAL_SPEC_v0_1.md. Decision baseline adopted (2026-04-19):OCT_Theory_and_Theorems/validation/DECISION_MATRIX_FINAL_UNIFIED_v0_1.md. Editorial Notational Policy v1.0-preprint-candidate:- use Coh_Omega, Phi_Omega, Delta_Omega as canonical forms;- use coh_Omega^1 only for local morphism consistency;- always explain the observational context Omega in the operational definitions. Current status of theoretical claims (baseline 2026-04-19):- unified decision in scope (F03,F08,F10,D02,D03,D04,A01,A02,A03): revise;- no claim and marked reject in the current baseline;- no claim and still marked validated in definitive multi-benchmark form.

Prologue: Why an OCT

OST establishes the ontological structure of set/field/function.OCT establishes the universal compositional structure of processes. In summary formula: Category Theory Classica + Ordinative Validity Layer = OCT The point is not to replace classical category theory, but to expand it where the classicalit remains formally powerful but ontologically indifferent.

Volume I - Foundation

Chapter 1. Crisis of extensional ontology

Classical extensional ontology precisely describes membership, equivalencestructural and formal universality. However, when the observed domain is alive,historical or dynamic, limits emerge:

1. formally correct structures can be sterile on a functional level;2. formal equivalences can hide crucial operational differences;3. the syntactically legal composition does not guarantee a coherent real outcome. OCT takes these limits as a structural theoretical problem.

Chapter 2. From thing to singularity

The OCT object is a functional singularity.Its identity is not exhausted by relations of mere substitutability. Consequence:- isomorphism remains a fundamental category;- isomorphism does not automatically imply full ordinal equivalence.

Chapter 3. Relational field and emergent function

The relationship is not the outline of the object, but a generative mechanism.A diagram has full organizational validity when:1. maintains internal consistency (Coh);2. produces emergent function (Phi);3. avoids degenerative collapse (Delta).

Chapter 4. Canonical definition

Is: OrdCat = (O, tensor, I, Coh, Phi) Where:- O and category;- (O, tensor, I) and monoidal structure (symmetry possibly conditioned by the domain);- Coh_Omega(D) measures coherence of the D diagram in the observational context Omega;- Phi_Omega(D) evaluates emergency of the diagram. Definition of orderly reality: D e OCT-reale se e solo se Coh_Omega(D) >= tau e Phi_Omega(D) != 0 In v0.4, these signatures are to be understood according to the unified typed schemedefined in OCT_TYPED_FORMAL_SPEC_v0_1.md.

Chapter 5. Axioms O1-O7

• O1 Singularity- O2 Generative relationship- O3 Compositional coherence- O4 Monoidal of the field- O5 Emergency- O6 Non-degeneration- O7 Internal observer

Chapter 6. Reality, coherence, degeneration, observer

OCT distinguishes:- syntactic validity (classical),- ontological validity (ordinative). Operational definition:Delta_Omega(D) = 1 - Coh_Omega(D).

Volume II - Integral expansion of classical categorical theory (M01-M30)

Standard format for each module:Definizione classica -> Limite classico -> Estensione OCT -> Criterio/teorema -> Validazione

Block A - Categorical foundations (M01-M10)

M01 ObjectsClassic: elements of Ob(C).Limit: excessive neutrality of the object.OCT: objects as functional singularities.Criterion: isomorphy does not imply ordinal equivalence.Validation: isomorphic pairs with divergent Phi.

M02 MorphismsClassic: typified arrows.Limit: typification does not imply generativity.OCT: OCT-morphisms valid only if generative in the field.Criterion: separation between syntactic and ordinal admissibility.Validation: classification of preservative/neutral/degenerative morphisms.

M03 CompositionClassic: associative composition always defined when typed.Limit: blindness to the coherence of the compound.OCT: composition with coherence filter.Criterion: F03 (coherent compositional closure).Validation: multistage pipeline and order drift measurement.

M04 IdentityClassic: id_A neutral for o.Limit: purely syntactic neutrality.OCT: neutrality conditional on functional preservation.Criterion: F04 (ordinative neutrality of identity).Validation: identity iterations on dynamic systems.

M05 IsomorphismsClassic: structural invertibility.Limit: tendency to semantic collapse.OCT: structural isomorphy distinct from ordinal equivalence.Criterion: F01 (non-collapse of the singularity).Validation: constructive counterexamples.

M06 Category equivalenceClassic: full, faithful, essentially surjective.Limit: formal equivalence can hide ontological loss.OCT: equivalence constrained by ordering invariants.Criterion: F07 (bound order equivalence).Validation: classically-equivalent but not OCT-equivalent pairs.

M07 SubcategoriesClassic: selection of objects and arrows.Limitation: does not distinguish live from degenerative substructures.OCT: live/degenerate taxonomy via Phi.Criterion: F08 (minimal non-degeneration).Validation: local maps of structural vitality.

M08 LimitsClassic: universality for cones.Limit: universality does not guarantee emergency.OCT: order limit with Coh+Phi constraint.Criterion: F05 (selective universality of limits).Validation: classical limits with zero emergency.

M09 ColimitiClassic: co-universality.Limit: formally correct but sterile aggregations.OCT: ordinal colimit valid only if non-degenerative.Criterion: F06 (selective universality of colimits).Validation: modular mergers with pre/post comparison.

M10 Equalizers and co-equalizersClassic: Universal resolution of parallel arrows.Limit: formal termination without functional guarantee.OCT: Singular function coherent equalization.Policy: Ordinative equalization policy (v0.2+).Validation: narrative vs structural conflicts.

Block B - Transport and high composition (M11-M20)

M11 Products and co-productsClassic: universal combinations.Limit: combination does not imply real productivity.OCT: combination valid only with non-zero emergency.Criterion: ordering productivity theorem.Validation: comparison of structures with the same and different universality Phi.

M12 FunctorsClassic: identity/composition preservation.Limit: formal preservation does not imply ordinal preservation.OCT: ordering functors with Coh/Phi invariants.Criterion: criterion of ordinal functionality.Validation: cross-domain invariant tracking.

M13 Forgetting functorsClassic: projection with loss of structure.Limit: loss not ontologically qualified.OCT: preservative loss vs degenerative loss.Criterion: D03 (ontological loss of forgetting functors).Validation: Delta analysis on projection chains.

M14 Natural transformationsClassic: natural commutativity between functors.Limit: only diagrammatic naturalness.OCT: ordinative naturalness with emergent constraint.Criterion: ordering naturalness criterion.Validation: commutative squares with outcome Phi.

M15 2-categoryClassical: higher order morphisms.Limitation: No explicit distinction between living and degenerative dynamics at meta-levels.OCT: 2-category with ordinal propagation.Criterion: 2-order stability theorem.Validation: multi-level simulations.

M16 AdditionsClassic: F ⊣ U bridge structure/observable.Limit: unqualified reconstruction.OCT: reconstruction valid only if it preserves/re-establishes function.Criterion: ordering reconstruction theorem.Validation: inversion from projection to structure.

M17 MonadsClassic: closed contextual composition.Limit: Formally consistent loops can degrade function.OCT: monads with anti-degenerative constraint.Criterion: non-degenerative closure criterion.Validation: decision cycles and accumulation Delta.

M18 ComonadesClassic: extraction with context.Limit: context treated without ordering quality metrics.OCT: contextual comonads with Omega evaluation.Criterion: coherent context theorem.Validation: multi-context test on the same data.

M19 Monoidal categoriesClassic: tensor, unity, coherence.Limit: tensor can remain a pure syntactic operator.OCT: tensor as a relational field operator.Criterion: O4 (field monoidal).Validation: parallel compositions with different emerging outcomes.

M20 Braided/symmetric monoidalClassic: controlled exchange structures.Limit: symmetry unduly extended to asymmetric domains.OCT: domain-conditioned symmetry.Criterion: D04 (conditional symmetry).Validation: formally legal but semantically distorting exchange.

Block C - Logic, context, dynamics (M21-M30)

M21 Closed monoidal categoriesClassic: interior objects of om.Limit: internal-external passage not qualified by order.OCT: internal closure valid only if emergency does not collapse.Criterion: emergent closure theorem.Validation: comparison between formally equivalent internal constructions.

M22 Enriched categoriesClassic: om-set in monoidal base.Limitation: enrichment does not automatically discriminate real functionality.OCT: enrichment with Coh/Phi/Delta vectors.Criterion: ordinal enrichment theorem.Validation: classic vs ordinal enrichment benchmark.

M23 FibrationsClassic: dependency and reindexing.Limitation: context without explicit ontological metric.OCT: Observational bundles with contextual assessments.Criterion: structural axis of F09.Validation: comparison of strength on different fibres.

M24 Indexed categoriesClassic: categorical families on an indexed basis.Limit: index as a purely formal parameter.OCT: index as epistemic-operational context.Criterion: cross-context consistency.Validation: transport results between indexes with Phi control.

M25 ToposClassic: Powerful internal logic.Limit: formal truth does not imply orderly vitality.OCT: ordinal topos with local ontological validity.Criterion: local ordinative truth theorem.Validation: internal truth correct but not productive.

M26 Categorical logicClassical: inference formalized categorically.Limit: inferential correctness without evolutionary criterion.OCT: ordinative truth = correctness + emergent function.Criterion: criterion of ordering truth.Validation: correct but sterile inferences vs coherent and generative.

M27 Diagrams and commutativityClassic: commutativity as structural coherence.Limit: commutative diagrams can be ordinally zero.OCT: productive commutativity (commute + emerge).Criterion: D02 (non-productive commutativity).Validation: diagram catalog with classification for Phi.

M28 Categorical dynamicsClassical: compositional processes over time.Limit: stability/collapse not central to the basic grammar.OCT: trajectories, thresholds, attractors, coherence breaks.Criterion: dynamic ordering stability theorem.Validation: Coh/Phi/Delta time series + Lyapunov comparison.

M29 DualityClassic: opposite category and dual principles.Limit: syntactic dualization does not always preserve ordinal validity.OCT: conditioned duality.Criterion: D05 (conditional duality).Validation: pre/post dualization property check.

M30 Universality and classical limiting caseClassic: universality as a theoretical axis.Limit: universality does not always distinguish living structures from zombies.OCT: selective universality with sorting filter.Criterion: F10 (classic recovery).Validation: Full classic recovery by turning off order layer.

Closing Volume II

With M01-M30, Volume II reaches full coverage of classical categorical grammar in an OCT key.

Volume III - Theorems and validity criteria

In this version the priority theorems F03/F08/F10 are rewritten in formquasi-publishable with explicit formal notation.

Local notation for Volume III

We fully adopt the typified specification:OCT_TYPED_FORMAL_SPEC_v0_1.md (TS1-TS8). In particular:- coh_Omega^1 : Mor(O) -> [0,1]- Coh_Omega : Diag_fin(O) -> [0,1]- Phi_Omega : Diag_fin(O) -> E_Omega- tau_Omega in (0,1]- Real_Omega(D) := Coh_Omega(D) >= tau_Omega and Phi_Omega(D) != 0_E

F03 - Consistent compositional closure theorem

Formal statement:Let Omega be fixed. Suppose the stability property TS4: (SC) for each modular pair f: A->B, g: B->C,if coh_Omega^1(f) >= tau_Omega and coh_Omega^1(g) >= tau_Omega, thencoh_Omega^1(g o f) >= tau_Omega. Then the set of OCT-valid morphisms is closed by composition. Demonstration (skeleton):1. from the classic category, g o f exists for modular arrows;2. validity hypothesis: coh_Omega^1(f) >= tau_Omega and coh_Omega^1(g) >= tau_Omega;3. applying (SC) gives coh_Omega^1(g o f) >= tau_Omega;4. by definition, g o f is OCT-valid. Conclusion:the classic composition remains intact and the ordinal validity is a stable filter.

F08 - Minimal non-degeneration theorem

Formal statement:For each non-empty diagram D in O, if Phi_Omega(D)=0_E, thenD is not OCT-real. Demonstration (skeleton):1. by definition (Real_Omega), real-OCT requires Phi_Omega(D) != 0_E;2. hypothesis: Phi_Omega(D)=0_E;3. the ordering reality condition fails;4. therefore D is not OCT-real. Observation:F08 does not deny the syntactic consistency of the diagram; denies its ontological fullness.

F10 - Classical recovery theorem

Formal statement:Consider an OCT instance where:1. coh_Omega^1(f)=1 for each morphism f;2. Coh_Omega(D)=1 for each diagram D;3. the emergent filter is deactivated (equivalently, not used to decide admissibility). Then the notion of OCT validity coincides with classical categorical validity. Demonstration (skeleton):1. conditions (1)-(2) make all morphisms and diagrams automatically above threshold;2. the composition remains the classic one of O;3. no further constraints eliminate classic arrows or diagrams;4. therefore the classical theory is recovered as a limiting case. Methodological consequence:OCT is a conservative extension, not a syntactic break.

D02 - Non-productive commutativity theorem

Formal statement:there is a category O, a context Omega and a finite commutative diagramD in Diag_fin(O) such that:1. D switches in the classical sense;2. Phi_Omega(D) = 0_E;3. therefore D is not OCT-real. Demonstration (construction diagram):1. choose a domain in which two compositional paths produce the same observable output;2. construct the associated classical commutative square;3. define Phi_Omega as a functional that measures net emergent increase;4. in a regime of pure compositional redundancy, the emergent increase is zero;5. therefore Phi_Omega(D)=0_E, while maintaining classical commutativity. Consequence:classical commutativity is a condition of syntactic consistency, not of orderly productivity.

D03 - Ontological loss theorem of forgetting functors

Formal statement:let C, D categories and U: C -> D be a forgetting functor.There are X, Y in Diag_fin(C) diagrams such that:1. U(X) and U(Y) are comparable in D at the observable level;2. the ordering loss induced by U distinguishes two regimes:- condom: Phi_Omega(U(X)) != 0_E;- degenerative: Phi_Omega(U(Y)) = 0_E. Therefore the structural loss is not monolithic: it must be classified. Demonstration scheme:1. define a loss measure Loss_U(Diag) as the difference between pre/post projection invariants;2. show that there are classes of diagrams in which Loss_U does not cancel emergency (useful reduction);3. show a class in which Loss_U collapses Phi to 0_E (degenerative reduction);4. conclude the theoretical distinction between condom forgetting and pathological forgetting. Consequence:the theory of forgetting functors in OCT requires qualitative loss taxonomy,not just syntactic description of the removed structure.

D04 - Conditional symmetry theorem

Formal statement:there are monoidal categories (O, tensor, I) and contexts Omega in which:1. classical monoidal symmetry sigma_{A,B}: A tensor B -> B tensor A is well defined;2. indiscriminate application of sigma degrades ordering invariants in a non-empty class of diagrams;3. therefore the ordinal symmetry is not global, but domain-dependent. In summary form:the ordinal validity of the exchange requires an admissibility predicateSym_Omega(A,B) not automatically true for every couple. Demonstration scheme:1. establishes a domain with real functional asymmetry (e.g. order, causality, information dependence);2. show that swapping preserves the shape but alters the value of Phi_Omega on some diagrams;3. identifies a subclass in which sigma is ordinally neutral;4. conclude that symmetry should be treated as a contextual condition, not a universal axiom of orderly validity. Consequence:OCT preserves the classical braided/symmetric structure as a syntactic option,but it introduces a semantic selection of its real applicability.

Volume IV - Scientific methodology

4.1 Principle of falsifiability

Each OCT extension must produce:1. formalizable statement;2. clear failure condition;3. replicable protocol.

4.2 Basic metrics

• Coh_Omega(D): local/global consistency- Phi_Omega(D): emergency- Delta_Omega(D): degeneracy

4.3 Minimum protocol

1. define observation domain and context Omega;2. construct candidate diagrams;3. measure Coh, Phi, Delta;4. compare with classic baseline;5. verify additional predictive power.

4.4 Validation status on cycles 1-4

Operational summary:1. D02 and A01 show repeated passes on independent benchmarks (cycle 2 and cycle 3);2. D03 requires structural revision in cycle 3 and recovery in cycle 4 with fixed scheme;3. cycle 4 reproducibility audit in PASS state;4. final unified decision: profile revise for the theoretical core in scope. Methodological consequence:OCT in v0.9 is presented as a strong pre-validated framework, not as a finished theoryin definitive validated state.

4.5 Roadmap from revise to validated

1. extend independent benchmarks with at least one additional non-linguistic domain;2. set pre-registration thresholds before each new cycle;3. replicate the protocols on at least two independent runtime implementations;4. publish raw metrics, scripts and manifests in public replicable package.

Volume V - Strong Applications

5.1 AI

Formally correct pipelines can lose function across multiple compositions.OCT distinguishes real stability from structural simulation.

A01 - Order stability theorem in AI pipeline

Operational statement:given two families of compositional pipelines on the same task:1. P_ord: pipelines that respect the ordering threshold (Coh_Omega(D_t) >= tau_Omega) at each step t;2. P_cls: pipeline with only classical formal correctness (no explicit ordering constraints); then, given the same domain and context Omega, we observe on average:- lower Delta_Omega cumulated in P_ord;- minor final semantic drift in P_ord. Test scheme (experimental program):1. define multi-step semantic transformation tasks with gold reference;2. instantiate P_ord and P_cls on the same input set;3. trace by step: Coh_Omega(D_t), Phi_Omega(D_t), Delta_Omega(D_t);4. measure final semantic error with respect to gold;5. compare distributions (P_ord vs P_cls) with predefined statistical test. Confirmation criterion:- E[Delta_cum(P_ord)] < E[Delta_cum(P_cls)]- E[Err_sem(P_ord)] < E[Err_sem(P_cls)] Forgery criterion:if the two inequalities do not hold robustly across multiple benchmarks,the current wording of A01 needs to be revised.

5.2 Language

Syntactically coherent sentences can be orderly degenerative.Semantic validity is tested on emergence and relational coherence.

A02 - Structural reconstruction theorem from linguistic projections

Operational statement:in the presence of an orderly controlled added pair F ⊣ U,where U projects structure into observable linguistic output and F attempts reconstruction,there is a regime in which OCT reconstruction exceeds a classical baselinein structural fidelity and inter-observer consistency. Formally (on average on benchmark):- E[Err_struct(F_OCT(U(x)))] < E[Err_struct(F_cls(U(x)))]- E[Var_Omega(F_OCT(U(x)))] < E[Var_Omega(F_cls(U(x)))] Where:- Err_struct measures distance between reconstructed structure and target structure;- Var_Omega measurement unstable between observational contexts. Test scheme (experimental program):1. build datasets with pairs (source structure, linguistic projection);2. define classic baseline (F_cls) and ordinal reconstructor (F_OCT);3. reconstruct on the same set of projections;4. measure Err_struct and Var_Omega;5. test statistical significance of the difference. Confirmation criterion:F_OCT's robust lead on both metrics. Forgery criterion:absence of stable advantage or high pathological sensitivity to context.

5.3 Social systems

Commutative narrative diagrams can produce Phi=0.OCT identifies functional collapse masked by rhetorical coherence.

A03 - Degeneration theorem in narrative social systems

Operational statement:in social discursive networks, there are regimes in which:1. local rhetorical coherence remains high;2. the emergent system function tends towards zero;3. the system enters a state of control/degradation while maintaining a stable form of communication. Formally (on time window T):- mean_t(Coh_Omega(D_t)) >= tau_Omega- mean_t(Phi_Omega(D_t)) -> 0_E with an increase in field rigidity/closure indicators. Test scheme (empirical program):1. build time series of discursive interactions (nodes/acts/responses);2. extract D_t diagrams for homogeneous time windows;3. estimate Coh_Omega(D_t), Phi_Omega(D_t), Delta_Omega(D_t);4. support external social metrics (polarization, semantic redundancy, flow concentration);5. test whether the "high rhetorical coherence + low emergency" regime anticipates systemic degradation. Confirmation criterion:robust correlation between Phi collapse and signals of social degradation. Forgery criterion:absence of stable association between the ordering quantities and the degradation indicators.

5.4 Scientific epistemology

It is not enough for a theory to be well formed:must show emerging capacity and contextual stability.

Appendix A - Notation and minimal conventions

This appendix is ​​a working extract.The regulatory source is OCT_TYPED_FORMAL_SPEC_v0_1.md.

1. O: base category.2. Omega: internal observation context (explicit parameter).3. tau: minimum consistency threshold.4. coh_Omega^1(f): local consistency of morphism.5. Coh_Omega(D): global diagram consistency.6. Phi_Omega(D): diagram emergence.7. Delta_Omega(D) = 1 - Coh_Omega(D).8. 0_E: null element in the emergent space E. Convention:- "categorically exists" = valid in the classical sense;- "e OCT-valid" = classical valid + ordering constraints satisfied.

Appendix B - Formal disambiguations (sanity check integration)

1. O1 does not deny isomorphisms:distinguishes structural isomorphy from full ordinal equivalence.2. O3 does not deny classical closure:adds an orderly eligibility filter.3. O5 and now baselined:Phi_Omega : Diag_fin(O) -> E_Omega.4. O7 does not imply arbitrary relativism:Omega and formal parameter, not subjective opinion.5. F10 guarantees recovery of the classic:the OCT extension is conservative.

Closing Preprint Candidate v1.0

This v1.0-preprint-candidate release states:1. complete architecture of the work;2. founding core consistent with OST;3. Volume II extended with full coverage M01-M30;4. theorematic block F03/F08/F10 in quasi-publishable form;5. unified typed scheme (Coh, Phi, Delta, Omega) adopted;6. block D02/D03/D04/A01/A02/A03 formalized and inserted in the manuscript;7. explicit integration of the cycle 1-4 validation state;8. alignment with unified decision matrix and freeze candidate v1.0. Next step:- prepare publication package with GitHub checklist + replicable datasets/scripts;- start the program of further cycles to migrate the claims from revise to validated.