Rational Interpreters for Discrete Dynamics: Existence, Exactness, and Decomposition over $p$-adic Fields
Abstract
We address an inverse problem in non-Archimedean dynamics: given a finite discrete dynamical system (equivalently, a functional graph on states), construct a continuous -adic dynamical system whose residue-level behavior reproduces the prescribed transitions. Using the cylinder partition of (viewed as \emph{Witt cylinders} for unramified ), we encode states by pairwise disjoint closed balls and formalize an \textbf{interpreter} as a map sending each state ball into its target ball. Our main existence result constructs rational interpreters that are analytic (hence pole-free) on the prescribed state cylinders, combining rigid-analytic Runge approximation with finite interpolation constraints. Under a linear-dominance condition on each cylinder, ball images are explicit and locally affine, leading to a robust classification of discrete behavior into contractive, indifferent, and expansive regimes. Good reduction provides a selection principle for natural interpreters; effective degree and height bounds for general rational interpreters remain open. For composite alphabets we prove a \textbf{Dynamic Chinese Remainder Theorem} for congruence-preserving systems: the CRT isomorphism (for ) yields a factorization of the \emph{dynamics} (equivalently, the functional graph) on into dynamics on the prime-power components, compatible with reduction. Finally, we discuss an inverse-limit (profinite) extension: compatible towers define a -Lipschitz map on , while selecting compatible analytic/rational interpreters across levels becomes a separate problem.
Cite
@article{arxiv.2602.05433,
title = {Rational Interpreters for Discrete Dynamics: Existence, Exactness, and Decomposition over $p$-adic Fields},
author = {J. Rogelio Pérez-Buendía},
journal= {arXiv preprint arXiv:2602.05433},
year = {2026}
}
Comments
49 pages, 5 figures