Prevalence of Delay Embeddings with a Fixed Observation Function
Abstract
Let xj+1=φ(xj), xj∈Rd, be a dynamical system with φ being a diffeomorphism. Although the state vector xj is often unobservable, the dynamics can be recovered from the delay vector (o(x1),…,o(xD)), where o is the scalar-valued observation function and D is the embedding dimension. The delay map is an embedding for generic o, and more strongly, the embedding property is prevalent. We consider the situation where the observation function is fixed at o=π1, with π1 being the projection to the first coordinate. However, we allow polynomial perturbations to be applied directly to the diffeomorphism φ, thus mimicking the way dynamical systems are parametrized. We prove that the delay map is an embedding with probability one with respect to the perturbations. Our proof introduces a new technique for proving prevalence using the concept of Lebesgue points.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.