 Roughly, given the points in a neighborhood \(N\) around \(\bx(0)\) less than \(\varepsilon\) away from each other, after \(n\) iterates of \(f\) the trajectories initiating from the points in \(N\) will differ by \(\varepsilon\) or greater, where more and more trajectories will differ by at least \(\varepsilon\) as \(n\) increases. In the case of one-dimensional maps, however, it can be shown that Chaos\(_{h}\) implies Chaos\(_{te}\). So this does not look to be a basic definition, though it is often more useful for proving theorems relative to the other definitions. 