Topological Classification of Admissible Reconstruction Operations
Abstract
We develop a topological classification of admissible reconstruction operations in generative systems where extended structure is built through repeated local extension subject to compatibility constraints. Reconstruction is formalized as a feasibility--governed process rather than a dynamical or metric one, with admissibility determined by the accumulation of obstruction under composition. Using loop diagnostics, we identify global incompatibilities that are invisible to local extension rules but become unavoidable under closed composition. Under mild and realization--independent assumptions, including indefinite continuation and finite interface capacity, we show that persistent nontrivial obstruction is possible only when it is supported on codimension--2 subsets of the reconstructed domain. This result induces a small number of topological universality classes distinguished by the existence and stability of loop--detectable obstruction. The framework is model--agnostic and applies equally to discrete, combinatorial, and continuum reconstructions, providing a topological explanation for the ubiquity of codimension—2 defects in generative systems.
Fields of Study & Subjects
Formal Methods in Verification
Cellular Automata and Applications
Logic
programming
and type systems
Publication details
- Journal / source
- Preprints.org
- Publisher
- MDPI AG
- Publication date
- 4 February 2026
- Document type
- Preprint