R maps to C(R(R)): A Kernel for Stability Under Recursive Self-Application

Self-maintaining systems persist through recursive self-application constrained by coherence. The kernel form is \( R \mapsto C(R(R)) \) where \(R\) denotes self-application and \(C\) denotes a coherence-preserving constraint. A system persists by transforming under constraint rather than by remaining unchanged. This note proposes the kernel as a working hypothesis and sketches a minimal dynamical instantiation. Additional Links: OSF Project Page: 10.17605/OSF.IO/Z4YN2 See follow up paper: Su, A. (2026). Constraint Generativity in Recursive Self-Application: A relation-on-relation assay for semantic attractor geometry in language models. Zenodo. 10.5281/zenodo.20151337