Comparison of tests for embeddings

It is possible to compare results for the classical tests for embeddings of chaotic data with the results of a recently proposed test. The classical tests, which depend on real numbers (fractal dimensions, Lyapunov exponents) averaged over an attractor, are compared with a topological test that depends on integers. The comparison can only be done for mappings into three dimensions. We find that the classical tests fail to predict when a mapping is an embedding and when it is not. We point out the reasons for this failure, which are not restricted to three dimensions.