Streams and Graphs of Dynamical Systems

TL;DR

This paper develops a unified theory of streams and graphs for dynamical systems, generalizing classical concepts like non-wandering sets and recurrence, and introduces a new framework for qualitative analysis of both discrete and continuous flows.

Contribution

It introduces the concept of streams as closed transitive relations encompassing orbits, unifying various recurrence notions, and provides a method to encode their qualitative properties into graphs.

Findings

Streams generalize non-wandering sets and recurrence concepts.

A graph encoding the qualitative properties of streams is constructed.

The framework applies to both discrete and continuous dynamical systems.

Abstract

While studying gradient dynamical systems (DSs), Morse introduced the idea of encoding the qualitative behavior of a DS into a graph. Smale later refined Morse's idea and extended it to Axiom-A diffeomorphisms on manifolds. In Smale's vision, nodes are indecomposable closed invariant subsets of the non-wandering set with a dense orbit and there is an edge from node N to node M if the unstable manifold of N intersects the stable manifold of M. Since then, the decomposition of the non-wandering set was studied in many other settings, while the edges component of Smale's construction has been often overlooked. In the same years, more sophisticated generalizations of the non-wandering set were elaborated first by Auslander in 60s, by Conley in 70s and later by Easton and other authors. In our language, each of these generalizations involves the introduction of a closed and transitive extension of the non-wandering relation, that is closed but not transitive. In the present article, we develop a theory that generalizes at the same time both these lines of research. We study the general properties of closed transitive relations ("streams") containing the space of orbits of a discrete- or continuous-time semi-flow and we argue that these relations play a central role in the qualitative study of DSs. All most studied concepts of recurrence currently in literature can be defined in terms of our streams. Finally, we show how to associate to each stream a graph encoding its qualitative properties. The current revision fixes some proof, adds some missing one and adds some example and clarification.