# Attractor reconstruction for very short time series

Takens's theorem gives the conditions under which a chaotic dynamical system can be reconstructed from a sequence $\{s_j\}_{j=1}^N$ of observations of the state of a dynamical system. In order to obtain a correct attractor reconstruction, is there any bound on the length $N$ of that sequence? I think there is. Actually, the vector sequence $$\left(s_i,s_{i+\tau},s_{i+2\tau},\dots,s_{i+(m-1)\tau}\right)$$ describes the reconstructed attractor, where $\tau$ is an appropriate time delay and $m$ is the embedding dimension, and if $N=10$, $m=4$ and $\tau=3$ previous equation makes sense only for $i=1$.

• Suppose you already know what the system’s reconstructed attractor looks like, e.g., from another time series recorded from the same system. Further suppose, you want to know what state the system is currently in, e.g., for purposes of predicting or controlling the dynamics. Finally suppose that noise is negligible. In that case, a single point in your reconstructed phase space suffices to do what you want to do, and further points do not add any value. So, all you need is $m$ recordings with a distance of $τ$. (Arguably this is not a literal attractor reconstruction, but the idea should become clear.)
• In case of an unknown dynamics, you already need a lot of data points to make a reasonable choice of $m$ and $τ$. Also, any further analysis you perform on the attractor, e.g., calculating Lyapunov exponents may require a considerable amount of data points. Finally, consider dynamical systems exhibiting rare excursions (extreme events), which can be arbitrarily rare; here you need to capture at least one excursion before your attractor reconstruction becomes useful with respect to this aspect of the dynamics. However, all these limitations are not imposed by the reconstruction process itself – they come from other steps in the pipeline surrounding it.