Operational Mathematics of Categorical Operations: Extending the Iteration Count to the Complex Domain and the Unification of Forward and Inverse Operations

This paper systematically transplants the complete methodology of Operational Mathematics onto the domain of categorical operations. We treat morphisms, functors, and natural transformations uniformly as categorical operations at different levels of granularity. For each level, we define a forward operation and an inverse operation that are mutually inverse, and extend the repetition count of these operations stepwise from natural numbers to integers, rational numbers, real numbers, and ultimately to complex numbers. The defining features of categorical operations --- partial domains of definition, non-commutativity, non-idempotence, and the partial existence of inverses only for isomorphisms --- prevent a direct transplantation of the exponential-map method used in group operational mathematics. We overcome this by linearising locally small categories into morphism algebras, embedding them into Banach algebras, and employing holomorphic functional calculus to define complex powers of morphisms, thereby achieving continuous iteration. A complete axiomatic system of seven independent axioms is established; integer-order, fractional-order, real-order, and complex-order iterations are rigorously constructed, and the existence and uniqueness of iterative roots at each level are proved. The singularity structure of complex-order categorical iterations is analysed in depth, revealing a novel phenomenon of mixed algebraic-logarithmic branch points determined by the torsion properties and spectral structure of the morphism, together with the possible formation of natural boundaries when logarithmic spectra are rationally independent. A fundamental structural theorem is proved: the categorical hyperoperation hierarchy collapses completely for all levels \ (n 2\) when the same base operation and initial seed are used. A necessary and sufficient condition for breaking this collapse is established via weighted parameterisation, giving rise to a strictly increasing hierarchy whose structure is governed by a difference Galois group. Fractional calculus and the calculus of variations with a categorical kernel are developed and proved to satisfy the semigroup property, a fractional integration by parts formula, and fractional Euler--Lagrange and Noether theorems. A categorical duality between the additive group of complex numbers and the group of iteration translations is established, yielding a field isomorphism between the categorical hyperfield and the complex numbers. The theory is further extended to infinite categories via \ (A_\) -algebras, to quantum categories at roots of unity with mixed branch points, to \ (p\) -adic categorical operations, and to the arithmetic geometry of functor iteration in the Langlands programme. The paper is self-contained, and every essential statement is accompanied by a detailed proof with at least four steps; major theorems include proofs of eight or more steps.