Chaos on Set-Valued Dynamics and Control Sets

The aim of this chapter is threefold. First, we show some advances in complexity dynamics of set-valued discrete systems in connection with the Devaney’s notion of chaos. Secondly, we start to explore some relationships between control sets for the class of linear control systems on Lie groups with chaotic sets. Finally, through several open problems, we invite the readers to give a contribution to this beauty theory.


Introduction
Relevant classes of real problems are modelled by a discrete dynamical system where X; d ð Þ is a metric space and f : X ! X is a continuous function. The basic goal of this theory is to understand the nature of the orbit O x; f ð Þ ¼ f n x ð Þ= n ¼ 0; 1; 2; … f g for any state x ∈ X, as n becomes large and, in general this is a hard task. The study of orbits says us how the initial states are moving in the base space X and, in many cases, these orbits present a chaotic structure. In 1989 in [1], Devaney isolates three main conditions which determine the essential features of chaos.
Definition 1 Let X be a metric space and f : X ! X a continuous map. Hence, f . a. is transitive if for any couple of non-empty open subsets U and V of X there exists a natural number k such that f k U ð Þ∩ V 6 ¼ ∅.
b. is periodically dense if the set of periodic points of f is a dense subset of X. 1 Partially supported by Conicyt, Chile through Regular Fondecyt Projects no. 1151159 and no. 1150292 respectively.
c. has sensitive dependence on initial conditions if there is a positive number δ (a sensitivity constant) such that for every point x ∈ X and every neighbourhood N of x there exists a point y ∈ N and a non-negative integer number n such that d f n x ð Þ; f n y ð Þ ð Þ ≥ δ.
Next, we mention a remarkable characterisation of transitive maps. In fact, as a consequence of the Birkhoff Transitivity Theorem (see [2] for details), it is possible to prove.
Proposition 2 Let X be a complete metric space which is also perfect (closed and without isolated points). If f : X ! X is continuous, then f is transitive if and only if there exists at least one orbit O x; f ð Þ dense in X.
Remark 3 Also, other concepts very useful in this work are the following: i) f is weakly mixing iff for any non-empty open subsets U and V of X there exists a natural number k such that f k U ð Þ∩ V 6 ¼ ∅ and ii) f is mixing iff given two non-empty open subsets U and V of X there exists a natural number k such that f n U ð Þ∩ V 6 ¼ ∅ for all n ≥ k. iii) f is exact iff given a non-empty open subsets U there exists a natural number k such that f k U ð Þ ¼ X. It is clear that f exact ) f mixing ) f weakly mixing ) f transitive.
It is worth to point out that sensitivity dependence on initial conditions was widely understood as being the central idea in chaos for many years. However, in a surprising way, Banks et al. has proved that transitivity and periodically density imply sensitivity dependence (for details see [3]). Furthermore, for continuous functions on real intervals, Vellekoop and Berglund in [4] show that transitivity by itself is sufficient to get chaos. This last result is not necessarily true in other type of metric spaces (see Example 4.1 in [5]).
However, sometimes we need to know information about the collective dynamics, i.e. how are moved subsets of X via iteration or dynamics induced by f. For example, if X denotes an ecosystem and x ∈ X, then, by using radio telemetry elements, we can obtain information about the movement of x in the ecosystem X. In this form, it is possible to build an individual displacement function f : X ! X. Of course, this function could be chaotic or not. Eventually, we could also be interested to get information about the collective dynamics induced by f, means, to follow the dynamics of a group of individuals. Thus, in a natural way the following question appears: what is the relationship between individual and collective dynamics? This is the main topic of this chapter.
Given the system (1), consider the set-valued discrete system associated to f defined by where f is the natural extension of f to the metric space K X ð Þ; H ð Þof the non-empty compact subsets of X endowed with the Hausdorff metric H induced by the original distance d of X.
In a more general set up, this work is strictly related with the following fundamental question: what is the relationship between individual and collective chaos?
As a partial response to this question, in this chapter we search the transitivity of a continuous function f on X in relation to the transitivity of its extension f to K X ð Þ: Our main result here establishes that f transitive implies f transitive. That is to say, collective chaos implies individual chaos under the dynamics of f .
On the other hand, we propose a new approach to this problem: to study the dynamics induced by f on the subextension K c X ð Þ of K X ð Þ: Precisely, on the class of non-empty compact-convex subsets of X. We prove that the induced dynamics is less chaotic than the original one! Finally, we mention that some relevant problems in the theory of control systems can be also approached by the theory of set-valuated map. In fact, to any initial state x of the system, one can associate its reachable set A x ð Þ. In other words, A x ð Þ contains all the possible states of the manifold that starting from x you can reach in non-negative time by using the admissible control functions U of the system. The aim of this section is twofold. First of all, to apply to the class of linear control systems on Lie groups, the existent relationship between control sets of an affine control system Σ on a Riemannian manifold M with chaotic sets of the shift flow induced by Σ on M Â U, [6]. In particular, we are looking for the consequences of this relation on the controllability property. At the very end, we propose a challenge to the readers to motivate the research on this topic through some open problem relatives to the mentioned relationship.

Preliminaries
In this section, we mention some notions and fundamental results we use through the chapter.

Extensions
If X; d ð Þis a metric space and f : X ! X continuous, then we can consider the space K X ð Þ; H ð Þ of all non-empty and compact subsets of X endowed with the Hausdorff metric induced by d  [3,7,8]).

Baire spaces
In this section, we review some properties of Baire spaces.
Definition 4 A topological space X is a Baire space if for any given countable family of closed sets A n : n ∈ N f gcovering X, then int A n ð Þ 6 ¼ ∅ for at least one n.

Definition 5
In any Baire space X, 2. Any countable union of nowhere dense sets is called a set of first category.
3. Any set not of first category is said to be of second category.

4.
The complement of a set of first category is called a residual set.

Remark 6
It is important to note that: a. Any complete metric space is a Baire space.
b. Every residual set is of second category in X.
c. Every residual set is dense in X.
d. The complement of a residual set is of first category.
e. If B is of first category and A⊆B, then Ais of first category.
(For details, see [8][9][10]) In particular, if X ¼ I is an interval, then C X ð Þ and C X; R ð Þ, endowed with the respective supremum metrics, are Baire spaces.
In a Baire space X, we say that "most elements of X" verify the property (P) if the set of all x ∈ X that do not verify property (P) is of first category in X. In this form, sets of second category can be regarded as "big" sets. A relevant area of the real analysis is to estimate the "size" of some sets associated to a continuous interval function f such as the set P f ð Þ of periodic points of f , or the set F f ð Þ of fixed points of f . Typically, continuous interval functions have a first category set of periodic points (see [11]) and, in particular, a first category set of fixed points. It has also been recently proved that a typical continuously differentiable interval function has a finite set of fixed points and a countable set of periodic points (see [12] and references therein). It is also wellknown that the class of nowhere differentiable functions ND I ð Þ is a residual set in C I ð Þ (see [13,14]). Also, a special class of functions in C I ð Þ is the class CN L I ð Þ of all continuous functions whose graphs "cross no lines" defined in a negative way as follows (see [10]): ½ a continuous map and L : R ! R a function whose graph is a straight line. We say that L crosses f (or f crosses L) if there exists x 0 ∈ a; b ½ and δ > 0 such that The following result can be found in [10]: The set CN L I ð Þ will play an important role in the next sections.

The dynamics of control theory
In Section 7, we propose some challenges through the relationship between the notion of chaotic sets in the Devaney sense and control sets for the class of Linear Control Systems on Lie Groups, [15]. In particular, we explicitly show some results concerning the controllability property in terms of chaotic dynamics.
In the sequel, we follow the relevant book The Dynamics of Control by Colonius and Kliemann, [6]. Let M be a d dimensional smooth manifold. By an affine control system Σ in M, we understand the family of ordinary differential equations: Þis the class of restricted admissible control functions where Ω ⊂ R m with 0 ∈ intΩ, is a compact and convex set.
Assume Σ satisfy the Lie algebra rank condition, i.e.
for any Of course, LA means the Lie algebra generated by the vector fields through the usual notion of Lie bracket. Furthermore, the ad -rank condition for Σ is defined as follows: For each u ∈ U and each initial value x ∈ M, there exists an unique solution w t; x; u ð Þdefined on an open interval containing t ¼ 0, satisfying w 0; x; u ð Þ¼x. Since we are concerned with dynamics on Lie Groups, without loss of generality we assume that the vector fields X, Y 1 , …, Y m are completes. Then, we obtain a mapping Φ satisfying the cocycle property for all t, s ∈ R, x ∈ M, u ∈ U: Where, for any t ∈ R, the map Θ t is the shift flow on U defined by Θ s u ð Þ t ð Þ≔u t þ s ð Þ: Hence, Φ is a skew-product flow. The topology here is given by the product topology between the topology of the manifold and the weak* topology on U: It turns out the following results.

Lemma 9 [6]
Consider the set U equipped with the weak* topology associated to L ∞ R; R m ð Þ¼ as a dual vector space. Therefore, Þis a compact, complete and separable metric space with the distance given by Here, v n : n ∈ N f g⊂ L 1 R; R m ð Þis a dense set of Lebesgue integrable functions.
2. The map Θ : R Â U ! U defines a continuous dynamical systems on U. Its periodic points are dense and the shift is topologically mixing (and then topologically transitive).

The map Φ defines a continuous dynamical system on M Â U:
On the other hand, the completely controllable property of Σ, i.e. the possibility to connect any two arbitrary points of M through a Σ-trajectory in positive time, is one of the most relevant issue for any control system. But, few systems have this property. A more realistic approach comes from a Kliemann notion introduced in [16].
iii. C is maximal with respect to the properties i ð Þ and ii ð Þ: A x ð Þ denotes the states that can be reached from x by Σ in positive time and cl its closure Moreover, for an element x ∈ M, the set of points that can be steered to x through a Σ-trajectory in positive time is denoted by Finally, we mention that the Lie algebra rank condition warranty that the system is locally accessible, which means that for every τ > 0, are non empty, for any x ∈ M: 3. f transitive implies f transitive As we explain, in terms of the original dynamics and its extensions a natural question arises: what are the relations between individual and collective chaos? As a partial response to this question, in the sequel, we show that the transitivity of the extension f implies the transitivity of f : For that, we need to describe some previous results.
Lemma 11 [5] Let A be a non-empty open subset of X. If K ∈ K X ð Þ and K ⊂ A, then there exists e > 0 such that N K; e ð Þ⊂ A:.

Two examples
Now we show that, in general, the converse of Theorem 15 is not true.
Example 4.1 (Translations of the circle). If λ ∈ R is an irrational number and we define , then it was shown by Devaney [1] that each orbit is dense in S 1 and, due Proposition 2, T λ is transitive. Nevertheless, T λ has no periodic points and, because T λ is isometric, it does not exhibit sensitive dependence on initial conditions either.
Now, let K ∈ K S 1 À Á such that diam K ð Þ ¼ 1, and let e > 0 sufficiently small. Then It is not difficult to show that f is an exact function on [0,1]. In fact, intuitively we can see that, after each iteration, the number of tent in the graphics is increasing, whereas the base of each tent is decreasing and they are uniformly distributed over the interval 0; 1 ½ .
Thus, if U is an arbitrary non-empty open subset of 0; 1 ½ , then U contains an open interval J and, after certain number of iterations, there exists a tent, with height equal to one, whose base is contained in J, which implies that f U ð Þ ¼ 0; 1 ½ and, according to Remark 3, f is an exact mapping and, consequently, f is a mixing function.
The conclusions in Examples 4.1 and 4.2 come from the next result, Banks [17] in 2005.
Theorem 17 If f : X ! X is continuous, then the following conditions are equivalent: Hitherto, we have used the strong topology induced by the H-metric on K X ð Þ. However, considering the w e -topology on K X ð Þ generated by the sets e A ð Þ with A an open set in X, we obtain the following complementary result, see [5]: Theorem 18 For a continuous map f : X ! X the following conditions are equivalent:

Sensitivity and periodic density of f
Let f : X ! X be a continuous function and let f be its corresponding extension to the hyperspace K X ð Þ. Then, the study of sensitivity of f in the base space in relation to the sensitivity of f on K X ð Þ has been very exhaustively analysed in the last years. Román and Chalco published the first result in this direction [18] in 2005, where the authors prove Theorem 19 f sensitively dependent implies f sensitively dependent.
Proof: If f has sensitive dependence, then there exists a constant δ > 0 such that for every K ∈ K X ð Þ and every e > 0 there exists G ∈ B K; e ð Þand n ∈ N such that H f n K ð Þ; f n G ð Þ ð Þ ≥ δ.
Now, let x ∈ X be and e > 0. Then, taking Thus, H f n x ð Þ; f n G ð Þ ð Þ¼sup y ∈ G d f n x ð Þ; f n y ð Þ ð Þ ≥ δ and, due to the compactness of G and the But, G ∈ B x; e ð Þ implies G ⊂ B x; e ð Þ and, consequently, y 0 ∈ B x; e ð Þ. This proves that f is sensitively dependent (with constant δ).
The reverse of this theorem is not true. In fact, recently Sharma and Nagar [19] show an example where X; d ð Þ is sensitive but K X ð Þ; H ð Þis not. Now, in order to overcome that shortcoming, the authors in [19] introduce the following notion of sensitivity: Definition 20 (Stronger sensitivity [19]). Let f : X ! X be a continuous function. Then f is strongly sensitive if there exists δ > 0 such that for each x ∈ X and each e > 0, there exists n 0 ∈ N such that for every n ≥ n 0 , there is a y ∈ X with d x; y ð Þ < e and d f n x ð Þ; f n y ð Þ ð Þ> δ.
Obviously, the notion of stronger sensitivity is more restrictive than sensitivity, and the authors in [19] obtain the following results: Theorem 21 If f : X ! X is a continuous function and K X ð Þ; H; f À Á is strongly sensitive then X; d; f ð Þis strongly sensitive.
In the compact case, it is possible to obtain a characterization as follows. We finish this section assuming the existence of a dense set of periodic points for f , we have Theorem 24 Let X; d ð Þbe a compact metric space and f : X ! X a continuous function. If f : X ! X has a dense set of periodic points then f : K X ð Þ ! K X ð Þ has the same property.
Proof: Let K ∈ K X ð Þ and e > 0. Then there exists a e=2-net covering K, That is to say, there are x 1 , …, x p in K such that K ⊂ B x 1 ; e=2 ð Þ ∪…∪B x p ; e=2 À Á : Because f has periodic density, there are y i ∈ X and n i ∈ N such that: Now, take G ¼ y 1 ; …; y p n o : By construction, we have H K; G ð Þ< e and, moreover, f n1n2…np y i À Á ¼ y i , for all i ¼ 1, …, p. Therefore, f n1n2…np G ð Þ ¼ G, which implies that f has periodic density.
The converse of this theorem is no longer true (for a counterexample, see Banks [17]). However, to find conditions on f warranting the existence of a dense set of periodic points for f is a very hard problem which still remains open.

The dynamics on the K c I ð Þ; H ð Þextension
In the previous sections, we have studied the diagram Chaos on Set-Valued Dynamics and Control Sets http://dx.doi.org/10.5772/intechopen.72232 and the chaotic relationships between f and f . However, in the setting of mathematical modelling of many real-world applications, it is necessary to take into account additional considerations such as vagueness or uncertainty on the variables. This implies the use of interval parameters and, consequently, to deal with interval systems. That is, it is necessary to consider an interval X ¼ I and to study the following new diagram: along with the analysis of the connection between their respective dynamical relationships.
Here f c denotes the restriction of f to K c I ð Þ, the class of all compact subintervals of I. For the Hausdorff metric can be explicitly computed as The aim of this section is to show that the Devaney complexity of the extension f c on K c I ð Þ is less or equal than the complexity of f on the base space I. More precisely, f c is never transitive for any continuous function f ∈ C I ð Þ. Also, we will show that f c has no dense set of periodic points for most functions f ∈ C I ð Þ: Finally, we prove that f c has no sensitive dependence for most functions f ∈ C I ð Þ.
As a motivation, we present the following examples.
Example 6.1 Consider the "tent" function f : 0; 1 Then it is well known that f is D-chaotic on 0; 1 ½ (see [1]). Moreover, because f is a mixing function on 0; 1 ½ , then f is transitive on K 0; 1 ½ ð Þ(see [17]). Also, we observe that x ¼ 2 3 is a fixed point of f . On the other hand, it is clear that if K is a compact and convex subset of X ¼ 0; 1 ½ , then f K ð Þ is also a compact and convex subset of X. Consequently, if we let K c 0; 1 ½ ð Þdenote the class of all closed subintervals of 0; 1 ½ , then we can consider f c as a mapping Þ is a closed subspace of K 0; 1 ½ ð Þ (see [21] Thus, f c is not transitive on K c 0; 1 ½ ð Þ.
Example 6.1 shows a function f which is transitive on the base space X ¼ 0; 1 ½ and f is also transitive on the total extension K 0; 1 ½ ð Þ, but f c is not transitive on the subextension K c 0; 1 ½ ð Þ.
The following example shows a function f : 0; 1 ½ ! 0, 1 with a dense set of periodic points, and where the total extension of f to K 0; 1 ½ ð Þalso has a dense set of periodic points, whereas f c does not have a dense set of periodic points on K c 0; 1 ½ ð Þ.
Example 6.2. Let X ¼ 0; 1 ½ and consider the "logistic" function f : 0; 1 It is well known that f is D-chaotic on 0; 1 ½ (see [1]). Moreover, f is a mixing function. Thus, in particular, f has a dense set of periodic points and, therefore, f also has a dense set of periodic points on the total extension K 0; 1 ½ ð Þ) (see Theorem 24).
However, f c has no a dense set of periodic points on K c X ð Þ.
In order to see this, we claim that the open ball B Thus, we obtain that 1 4 On the other hand, and, consequently, f c has no periodic points in the ball B It is well-known that if X ¼ I is an interval, then most functions f ∈ C I ð Þ has no dense orbits, that is to say, there exists a residual set D ⊂ C I ð Þ such that every function f ∈ D has no point whose orbit is dense in I (see [22]) and, consequently, most functions f ∈ C I ð Þ are not transitive.
From Lemma 24, we can conclude that f c is not transitive for most functions f ∈ C I ð Þ.
The next theorem provides a stronger result.
Theorem 26 Let f : a; b ½ ! a; b ½ be continuous. Then f c is not transitive on K c a; b ½ ð Þ.
Proof. By Schauder Theorem, f has at least one fixed point p ∈ a; b ½ .
Case 1. Suppose that p ∈ a; b ð Þ and let r ¼ max p À a; b À p f g . Without loss of generality, we can suppose that r ¼ p À a and, because a < b, it is clear that r > 0.
On the other hand, Because r 0 < r we get Þ , F ∈ B a; e ð Þ and for any n ∈ N. Thus, Consequently, f is not transitive on K c a; b ½ ð Þ.
Case 2. Suppose that f has no fixed points in a; b ð Þ. From the continuity of f , we have that f x ð Þ > x for all x ∈ a; b ð Þor f x ð Þ < x for all x ∈ a; b ð Þ. This clearly implies that f is not a transitive function, and consequently, due to Lemma 24, f c is not transitive on K c a; b ½ ð Þ.
An important question to answer is what about the size of the set of periodic points of f c . It is clear that there are some functions f ∈ C I ð Þ with a dense set of periodic points on I, and such that their extensions f c also has a dense set of periodic points on K c I ð Þ (for instance, f x ð Þ ¼ x).
Therefore, an analogous result to Theorem 26, but for periodic density of f c , cannot be obtained. However, as we will see, most functions f ∈ C I ð Þ do not have an extension f c with a dense set of periodic points on K c I ð Þ. To prove it, we need the following lemma.
Lemma 27 Let I be a compact interval in R, and f : I ! I be a continuous function. If we suppose that f c has periodic density on K c I ð Þ, then f has periodic density on I.
Proof. If x 0 ∈ I and e > 0 then x 0 f g∈ K c I ð Þ and, consequently, there exists K ∈ K c I ð Þ and n ∈ N such that Combining a. and b. we get Þ< e, for all x ∈ K: Because f n K ð Þ ¼ f n K ð Þ ¼ f n K ð Þ ¼ K and f n is continuous on K then, by the Schauder's Fixed Point Theorem, there exists x p ∈ K such that f n x p À Á ¼ x p . Thus, x p is a periodic point of f and, due to (7), we obtain d x 0 ; x p À Á < e. Hence, f has periodic density on I. □ ½ be a compact interval in R. Then f c does not have a dense set of periodic points in K c I ð Þ, for most functions f ∈ C I ð Þ.
Proof. The proof is based on an exhaustive analysis of the behaviour of the fixed points of f . We connect this analysis with an adequate residual set in C I ð Þ. The analysis of each fixed point of f is fundamental to decide whether the function f allows or not an extension f c that has a dense set of periodic points. More precisely, the behaviour of each fixed point will imply only two (mutually exclusive) options: A. f c does not have a dense set of periodic points, or.
which is a set of first category in C I ð Þ.
Towards this end, let f : a; b ½ ! a; b ½ be a continuous function. By the Schauder's Fixed Point Theorem, f has at least one fixed point p ∈ a; b ½ . The proof is divided in.
Case 1: f has no fixed points in a; b ð Þ.
In this case, we have the following three subcases: 1iÞ p ¼ a is the unique fixed point of f .
We have, either In both cases it follows that f has no periodic points in a; b ð Þ.
This case is analogous to the case 1iÞ. f n z ð Þ < p , ∀z ∈ K, ∀n ∈ N, (13) which implies that f n K ð Þ 6 ¼ K, ∀n ∈ N and, consequently, f c has no periodic points in the ball In other words, f c does not have a dense set of periodic points in K c I ð Þ.
2iibÞ f crosses the line y ¼ p.
It is clear that, in this case, f ∈ CN L I ð Þ ½ c which, due to Theorem 8 and Remark 6, is a set of first category in C a; b ½ ð Þ.
This case is analogous to case 2iiÞ and, consequently, if f does not cross the line y ¼ p then f c does not have a dense set of periodic points in K c I ð Þ, whereas if f crosses the line y ¼ p, then f ∈ CN L I ð Þ ½ c .
2ivÞ q 1 ¼ a and q 2 ¼ b, q 1 , q 2 6 ¼ p, are the unique points such that f a ð Þ ¼ f b ð Þ ¼ p.
In this case, we have the following subcases: This case is analogous to the case 2iia 1 Þ and the same is true for 2iva 2 Þ when f does not cross the line y ¼ p and f x ð Þ < p for all x ∈ a; b ð Þ p f g which is analogous to the case 2iia 2 Þ Finally, there only remains two subcases: Theorem 30 For most functions f ∈ C I ð Þ, the extension f c ∈ C K c I ð Þ ð Þis not sensitive.
Proof. This is a direct consequence of Theorem 28 and Theorem 29.

Control sets of linear systems and chaotic dynamics
The aim of this section is twofold. First of all, to start to apply to the class of linear control systems on Lie groups, the existent relationship between control sets of an affine control system Σ on a Riemannian manifold M with chaotic sets of the shift flow induced by Σ on M Â U, [6]. In particular, we are looking for the consequences of this relation on the controllability property The second part is intended to motivate the research on this topic to writing down some open problems relatives to this relationship.

Linear control systems on lie groups
Let G be a connected d dimensional Lie group with Lie algebra g. A linear control system Σ L on G is an affine system determined by where X is linear, that is, its flow X t ð Þ t ∈ R is a one-parameter group of G-automorphism, the control vectors Y j , j ¼ 1, …, m are invariant vector fields, as elements of g. The restricted class of admissible control U is the same as before.
Certainly, the drift vector field X is complete and the same is true for every invariant vector field Y j , j ¼ 1, …, m. As usual, we assume that Σ L satisfy the Lie algebra rank condition, i.e.
for any x ∈ M ) Span LA X ; Y 1 ; …; Y m È É x ð Þ ¼ d: The system is said to be controllable if A e ð Þ ¼ A is G: The class of systems Σ L is huge and contains many relevant algebraic systems as the classical linear and bilinear systems on Euclidean spaces [6], and the class of invariant systems on Lie groups, [24]. Furthermore, according to the Jouan Equivalence Theorem [25], Σ L is also relevant in applications. It approaches globally any affine non-linear control system Σ on a Riemannian manifold when the Lie algebra of the dynamics of Σ is finite dimensional.
One can associate to X a derivation D of g defined by DY ¼ À X ; Y ½ e ð Þ, Y ∈ g:Indeed, the Jacobi identity shows D X; The relation between w t and D is given by the formula Consider the generalised eigenspaces of D defined by where α ∈ Spec D ð Þ. Then, g α ; g β h i ⊂ g αþβ when α þ β is an eigenvalue of D and zero otherwise.
Therefore, it is possible to decompose g as g ¼ g þ ⊕ g 0 ⊕ g À , where Actually, g þ , g 0 , g À are Lie algebras and g þ , g À are nilpotent. Denote by G þ , G À and G 0 the connected and closed Lie subgroups of G with Lie algebras g þ , g À and g 0 respectively.
Despite the fact that for an invariant system the global controllability property is local, this class has been studied for more than 50 years, see [24] and the references there in. The important point to note here is: for an invariant system the reachable set from the identity is a semigroup. However, in [26] the authors show that this is not the case for a linear system which turns the problem more complicated. Therefore, we would like to explore the mentioned connection between control sets and the Devaney and Colonius-Kliemann ideas. This section is the starting point for the Σ L class. We begin with a fundamental result.
Theorem 31 Assume the system Σ L satisfy the Lie algebra rank condition. Therefore, there exists a control set which contains the identity element e in its interior. Here, A * e ð Þ is the set of states of G that can be sent by Σ L to e in positive time.
For a proof in a more general set up, see [6].
Recently, we were able to establish some algebraic, topological, and dynamical conditions on Σ L to study uniqueness and boundness of control sets and it consequences on controllability : But, the state of arts is really far from being complete. In order to approach this problem for Σ L , as in [27] we assume here that G has finite semisimple centre, i.e. all semisimple Lie subgroups of G have finite center. We notice that any nilpotent and solvable Lie group, and any semisimple Lie group with finite centre has the finite semisimple centre property. But also, the product between groups with finite semisimple centre have the same property. We also assume that A is open. This is true if for example, the system satisfy the ad -rank condition. About the uniqueness and boundness of control sets of a linear systems, we know few things [27].
Theorem 32 Let Σ L a linear control system on the Lie group G: 1. If G ¼ G À G 0 G þ is decomposable, C e is the only control set with non-empty interior. In particular, this is true for any solvable Lie group.
2. Suppose that G is semisimple or nilpotent, it turns out that if cl A G À ð Þ, cl A * G þ À Á and G 0 are compact sets C is bounded: 3. If G is a nilpotent simply connected Lie group, it follows that C is bounded ⇔ cl A G À ð Þand cl A * G þ À Á are compact sets and D is hyperbolic: Furthermore, it is possible to determine algebraic sufficient conditions to decide when C is bounded. Actually, in a forthcoming paper we show that about two groups of dimension three: the simply connected nilpotent Heisenberg Lie group H and the special linear group SL 2; R ð Þ. We finish by computing an example on H.
1. The nilpotent Lie algebra h ¼ R 3 ; þ; ; À Á , has the basis E 12 ; E 23 ; E 13 f gwith E 12 ; E 23 ½ ¼E 13 : Here, E ij denotes the real matrix of order 3 with zero everywhere except 1 in the position ij: The associated Heisenberg Lie group has the matrix representation G ¼ g ¼ As invariant vector fields, the basis elements of g has the following description The canonical form of any g-derivation is given by Any linear vector field X reads as ∂z : 2. The vector space g ¼ sl 2; R ð Þ of all real matrices of order three and trace zero is the Lie algebra of the Lie group G ¼ SL 2; R ð Þ¼det À1 1 ð Þ. Let us consider the following generators of g: : The Lie group G is semisimple, then any g derivation is inner which means that there exists an invariant vector field Y such that ad Y ð Þ represents : Thus, a general form of a derivation reads as Example 7.1 On the Heisenberg Lie group, consider the system where X is determined by the derivation D ¼ ad E 12 ð Þ ¼ E 32 : Since the group is nilpotent, it has the semisimple finite centre property. The Lyapunov spectrum of D reduces to zero. Finally, the reachable set from the identity A is open. In fact, the ad-rank condition is obviously true because D E 12 ð Þ ¼ E 13 . It turns out that the skew flow Φ is chaotic in H Â U: