Generative Category Theory A; Foundational Correspondence Between Generative Systems and Categories

Read full text Summarise with VIRAT
Authors: changzheng zhou, ZIQING zhou
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper constructs a generative category corresponding to the recursive structure of generative systems, establishing a rigorous correspondence between generative processes and categorical structures. First, a generative system is formalizedas a quadruple G = (G,P,E,M), where generators G define the basic transformation primitives, production rules P specify the boundaries of legitimate generativehistories, equivalence relations E identify semantic equivalences between generative histories, and M is the state space. On this basis, the generative categoryCG is defined, with objects as points in M and morphisms as equivalence classesof generative histories, where composition is given by the concatenation of generative histories. This paper proves that the equivalence relation E establishes aone-to-one correspondence with commutative diagrams in the generative category(Theorem 4.1), and characterizes the existence conditions for initial objects in thegenerative category (Proposition 5.1). Furthermore, Hutchinson’s classical theoremon the uniqueness of attractors in iterated function systems is translated into thelanguage of category theory, providing a necessary and sufficient condition for anattractor to become a terminal object (Theorem 5.1). Lawvere’s fixed point theorem obtains a rigorous categorical formulation within the generative framework,with self-referential structures formalized as a surjection from the set of morphismsto an exponential object (Theorem 6.1). The verifiability and universality of thetheoretical framework are validated through explicit constructions on the Cantorset, Sierpiński triangle, L-system fractal tree, and Julia set.

Fields of Study & Subjects

Mathematical Dynamics and Fractals Logic programming and type systems semigroups and automata theory

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
26 March 2026
Language
EN
Document type
Preprint