On the regularity of time-delayed embeddings with self-intersections
Adam Śpiewak
TL;DR
This work extends Takens-type embedding theory into a probabilistic framework that permits self-intersections on a zero-measure set. By combining prevalence-based perturbations with Hausdorff-dimension thresholds, the authors prove that time-delayed embeddings $\phi_{h,k}$ exhibit strong regularity properties—injectivity on a full-measure set with a pointwise Lipschitz inverse, and, when $k>\dim M$, local diffeomorphism almost everywhere. These regularity results yield practical consequences: almost-sure, pointwise control of prediction errors and the ability to approximate the original system’s Lyapunov exponents from the embedded dynamics. The paper also provides a non-dynamical probabilistic Whitney-type embedding result, reinforcing the broader relevance to geometric embedding problems. Overall, the approach links fractal dimension criteria, random perturbations, and dynamical features to advance rigorous guarantees for time-delayed modeling of complex systems.
Abstract
We study regularity of the time-delayed coordinate maps \[φ_{h,k}(x) = (h(x), h(Tx), \ldots, h(T^{k-1}x))\] for a diffeomorphism $T$ of a compact manifold $M$ and smooth observables $h$ on $M$. Takens' embedding theorem shows that if $k > 2\dim M$, then $φ_{h,k}$ is an embedding for typical $h$. We consider the probabilistic case, where for a given probability measure $μ$ on $M$ one allows self-intersections in the time-delayed embedding to occur along a zero-measure set. We show that if $k \geq \dim M$ and $k > \dim_H(\text{supp} μ)$, then for a typical observable, $φ_{h,k}$ is injective on a full-measure set with a pointwise Lipschitz inverse. If moreover $k > \dim M$, then $φ_{h,k}$ is a local diffeomorphism at almost every point. As an application, we show that if $k > \dim M$, then the Lyapunov exponents of the original system can be approximated with arbitrary precision by almost every orbit in the time-delayed model of the system. We also give almost sure pointwise bounds on the prediction error and provide a non-dynamical analogue of the main result, which can be seen as a probabilistic version of Whitney's embedding theorem.
