Invariant ideals and its applications to the turnpike theory
Abstract.
In this paper the turnpike property is established for a non-convex optimal control problem in discrete time. The functional is defined by the notion of the ideal convergence and can be considered as an analogue of the terminal functional defined over infinite time horizon. The turnpike property states that every optimal solution converges to some unique optimal stationary point in the sense of ideal convergence if the ideal is invariant under translations. This kind of convergence generalizes, for example, statistical convergence and convergence with respect to logarithmic density zero sets.
Key words and phrases:
-convergence, -cluster set, statistical convergence, turnpike property, optimal control, discrete systems2020 Mathematics Subject Classification:
Primary 40A35; Secondary 49J99, 54A201. Introduction
The turnpike theory investigates an important property of dynamical systems. It can be considered as a theory that justifies the importance of some equilibrium/stationary states. For example, in macroeconomic models the turnpike property states that, regardless of initial conditions, all optimal trajectories spend most of the time within a small neighborhood of some optimal stationary point when the planning period is long enough. Obviously, in the absence of such a property, using some of optimal stationary points as a criteria for “good” policy formulation might be misleading. Correspondingly, the turnpike property is in the core of many important theories in economics.
Many real-life processes are happening in an optimal way and have the tendency to stabilize; that is, the turnpike property is expected to hold for a broad class of problems. It provides valuable insights into the nature of these processes by investigating underlying principles of evolution that lead to stability. It can also be used to assess the “quality” of mathematical modeling and to develop more adequate equations describing system dynamics as well as optimality criteria.
The first result in this area is obtained by John von Neumann ([30]) for discrete time systems. The phenomenon is called the turnpike property after Chapter 12, [9] by Dorfman, Samuelson and Solow. For a classification of different definitions for this property, see [2, 22, 28, 36], as well as [6] for the so-called exponential turnpike property. Possible applications in Markov Games can be found in a recent study [16].
The approaches suggested for the study of the turnpike property involve continuous and discrete time systems. Some convexity assumptions are sufficient for discrete time systems [22, 28]; however, rather restrictive assumptions are usually required for continuous time systems. The majority of them deal with the (discounted and undiscounted) integral functionals. We mention here the approaches developed by Rockafellar [33, 34], Scheinkman, Brock and collaborators (see, for example, [21, 35]), Cass and Shell [4], Leizarowitz [18], Mamedov [24], Montrucchio [29], Zaslavski [37, 38, 39] (we refer to [2, 36] for more references).
In this paper we consider an optimal control problem in discrete time. It extends the results obtained in [23] where a special class of terminal functionals is introduced as a lower limit at infinity of utility functions. This approach allowed to establish the turnpike property for a much broader class of optimal control problems than those involving integral functionals (discounted and undiscounted).
Later, this class of terminal functionals was used to establish a connection between the turnpike theory and the notion of statistical convergence [25, 32]; as a result, the convergence of optimal trajectories is proved in terms of the statistical (“almost”) convergence. These terminal functionals also allowed the extension of the turnpike theory to time delay systems; the first results in this area have been established in several recent papers [13, 26]. Moreover, some generalizations based on the notion of the -statistical cluster points have been obtained in [7].
The main purpose of this paper is to formulate the optimality criteria by using the notion of ideal convergence. As detailed in the next section, the ideal convergence is a more general concept than the statistical convergence as well as the -statistical convergence. In this way the turnpike property is established for a broad class of non-convex optimal control problems where the asymptotical stability of optimal trajectories is formulated in terms of the ideal convergence.
Recently (and independently) Leonetti and Caprio in [19] considered turnpike property for ideals invariant under translation in the context of normed vector spaces. We discuss our approaches in Section 4.
The rest of this article is organized as follows. In the next section the definition of the ideal, its properties and some particular cases, including the statistical convergence, are provided. In Section 3 we formulate the optimal control problem and main assumptions. The main results of the paper — the turnpike theorems are provided in Section 4. The proof of the main theorem is in Section 5.
2. Convergence with respect to ideal vs statistical convergence
Let be a sequence of elements of . For the sake of simplicity, we will consider the Euclidean norm The classical definition of convergence of to says that for every the set of all with is finite, i.e. it is “small” in some sense. If we understand the word “small” as “of asymptotic density zero” then we obtain the definition of statistical convergence (Def. 6). The same method can be used to formulate the definition of statistical cluster point. The classical one says that is a cluster point of if for every the set of all with is infinite, i.e. it has “many” elements. If “many” means “not of asymptotic density zero” then we obtain the definition of statistical cluster point (see e.g. [12]).
One of the possible generalizations of this kind of being “small” (having “many” elements) is “belonging to the ideal” (“be an element of co-ideal”).
The cardinality of a set is denoted by . denotes the power set of .
Definition 1.
An ideal on is a family which is non-empty, hereditary and closed under taking finite unions, i.e. it fulfills the following three conditions:
-
(1)
;
-
(2)
if and ;
-
(3)
if .
Example 2.
By Fin we denote the ideal of all finite subsets of . There are many examples of ideals considered in the literature, e.g.
-
the ideal of sets of asymptotic density zero
where is given by the formula
is the well-known definition of upper asymptotic density of the set ;
-
the ideal of sets of logarithmic density zero
-
the ideal
-
the ideal of arithmetic progressions free sets
Ideals and belongs to the wider class of Erdős-Ulam ideal’s (defined by submeasures of special kind, see [14]). Ideal is an representant of the class of summable ideals (see [27]). The fact that is an ideal follows from the non-trivial theorem of van der Waerden (this ideal was considered by Kojman in [15]). One can also consider trivial ideals , , or principal ideals , however they are not interesting from our point of view. If not explicitly said we assume that all considered ideals are proper (i.e. ) and contain all finite sets (i.e. ). The inclusions between abovementioned families are shown on Figure 1. The only non-trivial inclusions are: (a folklore application of Cauchy condensation test), (the famous theorem of Szemerédi), and (by well-known inequalities between upper logarithmic density and upper asymptotic density). It is easy to observe that , but the status of the inclusion is unknown (“Erdős conjecture on arithmetic progressions” says that the van der Waerden ideal is contained in the ideal .)
2.1. -convergence and -cluster points
The notion of the ideal convergence is dual (equivalent) to the notion of the filter convergence introduced by Cartan in 1937 ([3]). The notion of the filter convergence has been an important tool in general topology and functional analysis since 1940 (when Bourbaki’s book [1] appeared). Nowadays many authors prefer to use an equivalent dual notion of the ideal convergence (see e.g. frequently quoted work [17]).
Definition 3.
A sequence of elements of is said to be -convergent to (, or , in short) if and only if for each
The sequence is convergent to if and only if it is Fin-convergent to .
It is also easy to see that for any sequence and two ideals , , if then implies that (see Figure 1).
Definition 4.
The is an -cluster point of a sequence of elements of if for each
By -cluster set of we understand the set
Recall that is a set of classical cluster (limit) points of .
Proposition 5.
Part follows from the folklore argument: is the unique -cluster point of , iff for every , iff .
2.2. -convergence vs statistical convergence
The notion of the ideal convergence is a common generalization of the classical notion of convergence and statistical convergence. The concept of statistical convergence was introduced by Fast [10] and then it was studied by many authors.
Definition 6 ([10]).
A sequence of elements of is said to be statistically convergent to an if for each the set of all indices such that has upper asymptotic density zero, i.e.
Obviously, is statistically convergent to if and only if . Following the concept of a statistically convergent sequence Fridy in [12] introduced the notion of a statistical cluster point, which—using our notation—is equal to the notion of -cluster point. Proposition 5 in case of statistical convergence was proved in [12]. Since statistical convergence is a particular case of -convergence, each theorem which has an ideal variant is also true in its statistical version. However, in the sequel we will use some lemmas which were formulated in the literature for the case of statistical convergence and statistical cluster points.
An open -neighbourhood of a given set will be denoted by
For each we do not distinguish between and .
Lemma 7 ([32]).
Let be a bounded sequence. Then for any
The ideal version of the above lemma can be proved using the same method as in [32], but we give a short proof using [5, Le. 3.1].
Lemma 8 ([5]).
Suppose that is an ideal, is a sequence and is compact. If then .
Lemma 9 (Ideal version of Lemma 7).
Let be a bounded sequence. Then for any ideal and
Proof. Since is bounded, there exists a compact set such that for all . If we assume that , then the set is compact and . By Lemma 8, , a contradiction.
2.3. Ideals invariant under translations
By we denote the set of all integers.
Definition 10.
We say that an ideal is invariant under translations if for each and ,
All ideals considered in Example 2 are invariant under translations. For the proof of this fact and other examples see [11].
Our main results from Section 4 are valid for ideals invariant under translations. The key argument for this fact is the following property of -cluster sets for such ideals.
Lemma 11.
Suppose that is invariant under translations, is a sequence in . Then for any non-empty , and :
In particular, this set is non-empty.
Proof. Let and . Since and , . By Lemma 9, . Consider the set . is invariant under translations, so . Let . Since is an intersection of two sets, one from the coideal (i.e. not from the ideal) and second from the dual filter (i.e. its complement belongs to the ideal), . Consider the set . Again, since is invariant under translations, . For each , .
If is invariant under translations then either is a trivial ideal , or contains all finite sets (i.e. ). Indeed, if there is a non-empty set , then for each . From the invariance of it follows that for every . Since is closed on finite unions, each finite set belongs to .
3. Optimal control problem and main assumptions
Consider the problem
Here is a fixed initial point, function is continuous, is a compact set, is a continuous function, and for any sequence of reals
The pair is called a process if the sequences and satisfy for all ( is called a trajectory and is called a control).
In the sequel we will use the following characterization of the functional ([7, Le. 4.1]) that is a generalization of Lemma 3.1 in [32] established for the statistical convergence, as well as the corresponding result from [20] established for classical convergence (see also [19, Cor. 3.3]).
Lemma 12.
For any bounded trajectory the following representation is true
We assume that there is a compact (bounded and closed) set such that for all trajectories; that is, we assume that trajectories are uniformly bounded.
is called a stationary point if there exists such that . We denote the set of stationary points by . It is clear that is a closed set. is called an optimal stationary point if
We will assume that the set of all optimal stationary points is non-empty. This is not a restrictive assumption since function is continuous and the set is closed; for example, it is satisfied if is in addition bounded.
Define the set
and
We assume that the set is large enough to accommodate that is, . Then clearly, .
Consider the following three conditions.
-
:
optimal stationary point is unique, i.e. ;
-
:
there exists a process such that ;
-
:
there exists a continuous function such that
and
One can also consider condition :
-
:
there exists a process such that any limit point of the sequence is in .
Note that if the (unique) optimal stationary point belongs to the interior of , then proof of turnpike property is not difficult and can be regarded as a “trivial” case where condition ensures the existence of some Lyapunov function, with derivative defined on a small neighborhood of
The most interesting case is when an optimal stationary point belongs to a boundary of ; that is, the both sets and have nonempty intersection with any small neighborhood of . In this case the inequality may hold for some ; that is, condition does not guarantee the existence of Lyapunov functions.
Note also that condition can be formulated equivalently “there exists a process such that ” (see [19, ]), or stronger “there exists a process such that ” (see [23, 25, 32]),
Recall that if then -convergence is stronger than -convergence, thus by Proposition 5, is stronger than for each non-trivial which is invariant under translations. Example 13 shows that these two conditions are really different, i.e. there exists a system for which , , hold, but does not hold (see also [19, Ex. 2.5]).
Example 13.
Consider the middle-third Cantor set . It is homeomorphic to the space with the product (Tychonoff) topology; for example, the formula
(1) |
gives us a homeomorphism between with Tychonoff topology and middle-third Cantor set. In this example we will not distinguish between and with appropriate topologies.
For any consider the shift map given by the formula ([8]):
Since is a closed subspace of , by Tietze’s extension theorem it can be extended to some continuous function .
Let
that is, it is the set of centers of most left intervals removed from during the classical construction of the middle-third Cantor set. Since and is continuous, we can assume also that for each (we can multiply original by the continuous function which is equal to identity on and equals 0 on ).
Let , , . Define by the formula
Additionally, let be given by the formula
(the sequence of zeros and one, followed by zeros and one, and so on). In terms of mapping ,
Let for each , and be a continuous function such that for , and otherwise.
Note that for the problem defined in Section 3:
-
•
and ;
-
•
, ;
-
•
.
Thus
-
the condition holds: the optimal stationary point is unique, i.e. ;
-
the condition holds: for every and ,
Observe, that for any path for the system :
-
•
; in terms of mapping , .
-
•
.
Therefore, the condition holds (take ), but does not hold.
4. Main results
The main result of this paper is presented next. The proof of this theorem is provided in Section 5.
Theorem 14.
Suppose that is invariant under translations, , , hold and is an optimal process in the problem . Then , where is the unique optimal stationary point from .
Note that from part of Proposition 5 the assertion “” is equivalent to “”.
It is also easy to see that the assertion of Theorem 14 is true if is a singleton (i.e. ). However, the following example shows that if is an isolated point of (if we assume only the first part of condition ) then Theorem 14 may not be true.
Example 15.
Let , , , and for each :
where (for example, on Figure 2, ). Define by the affine formula
Additionally, let and for each . For the definition of and visualization of see Figure 2.
Note that for the problem defined in Section 3:
-
•
;
-
•
, , ;
-
•
.
Thus
-
optimal stationary point is unique;
-
the condition also holds, for example for , ;
-
the first part of condition holds: for every and ,
In this example, the process where and is an optimal process, however does not converge to in the sense of -convergence (which is equivalent to Fin-convergence).
Example 15 works for classical convergence, statistical convergence, and for general ideal convergence. It shows that additional assumption about “density” of in (i.e. the second part of condition ) is necessary in [7], as well as in [25].
Recently Leonetti and Caprio in [19] proposed another way to bypass the problem indicated in the Example 15:
-
:
there exists a linear (and therefore continuous) function such that
where is an optimal stationary point. It follows from the above condition that is the unique optimal stationary point, and it is easy to see that imply . However, we do not have any example of the system with and without .
4.1. Special cases
In this section, we consider two special cases of the ideal convergence; that is, classical convergence and statistical convergence.
Classical convergence
Consider the classical convergence in the problem , . In this case
is the set of -limit points. Condition is in the form and functional is represented in the form
-
:
.
Corollary 16.
Let , , hold and is an optimal process in the problem . Then converges to
Statistical convergence
Now consider the statistical convergence instead of ideal convergence in the problem . Functional in this case can be defined as follows
-
:
where stands for the minimal element in the set of statistical cluster points. Recall also that according to Example 13, condition is stronger than .
Corollary 17.
Let , , hold and is an optimal process in the problem . Then statistically converges to
5. Proof of Theorem 14
For every define the set
Clearly, . For any continuous function let
and
It is clear that . If is compact then
Analogously we define operator .
Lemma 18.
Assume that is invariant under translations, and is a process in the problem with . If is a continuous function then
Proof. As , by Lemma 12, . Thus , and so .
Let
It is clear that is continuous, and
(2) |
Since functions and are continuous and is a compact set, there exists such that
(3) |
(4) |
(5) |
If then , i.e. for each and in particular for that leads to Moreover, from (4) we have and therefore
On the other hand (5) implies
Thus . By the above considerations we get
(6) |
This contradicts with Lemma 11.
Lemma 19.
Assume that is invariant under translations, and is a process in the problem with . If is a continuous function and then
Proof. As in the proof of Lemma 18 observe that , , and define
Again, is continuous, and
(7) |
(8) |
(9) |
The last equality follows from the previous ones and the fact that is continuous.
Denote
and assume (contrary to the lemma assertion) that . Note that are compact and, from the assumption that it follows that (in fact, is constant and equal to the maximum value of on ; if it is equal to then it follows from the definition of that ). Since (by the assumption of the lemma) , gives us .
Denote also
Let
(10) |
1. Since functions are continuous and , there exists such that
(11) |
(12) |
(13) |
From these inequalities we have
From (10) it follows and then
According to (13) this means that . Therefore we conclude that
(14) |
2. We fix the number and consider the set
(15) |
From (10), (12) and (13) and the fact that it follows that . Moreover, , and implies that for all . Denote
Take any number satisfying
(16) |
Since functions are continuous there exists a sufficiently small number such that
(17) |
(18) |
(19) |
We show by contradiction that there is no such that
(20) |
Suppose that fulfills . From (17) we have
or
Then, from (18) it follows
and by (16)
On the other hand (19) yields
The last two inequalities lead to a contradiction. This proves that the relations and cannot be satisfied at the same time. Therefore the following is true:
(21) |
3. Now since , it is not difficult to observe that the relation
holds. Then (14) and (21) implies that
(22) |
The above implication contradicts with Lemma 11.
Proof of Theorem 14. Let . Then . By for the process , .
Fix the function like in . Then
Since , the maximal value of the functional is not less than . As is an optimal process, . Thus, by Lemma 18,
where is the unique optimal stationary point from . Then, by Lemma 19,
Thus for all . It follows that
From part of Proposition 5 we obtain .
Acknowledgment.
The authors are indebted to Paolo Leonetti for his critical reading of the manuscript.
References
- [1] Nicolas Bourbaki. Éléments de mathématique. Part I. Les structures fondamentales de l’analyse. Livre III. Topologie générale. Chapitres I et II. Actual. Sci. Ind., no. 858. Hermann & Cie., Paris, 1940.
- [2] D.A. Carlson, A.B. Haurie, and A. Leizarowitz. Infinite Horizon Optimal Control: Deterministic and Stochastic Systems. Springer-Verlag, Berlin, 1991, 2nd edition.
- [3] Henri Cartan. Filtres et ultrafiltres. C. R. Acad. Sci. Paris, 205:777–779, 1937.
- [4] D. Cass and K. Shell. The structure and stability of completitive dynamical systems. J. Econ. Theory, 12:31–70, 1976.
- [5] Juraj Činčura, Tibor Šalát, Martin Sleziak, and Vladimír Toma. Sets of statistical cluster points and -cluster points. Real Anal. Exchange, 30(2):565–580, 2004/05.
- [6] T. Damm, L. Grüne, M. Stieler, and K. Worthmann. An exponential turnpike theorem for averaged optimal control. to appear in: SIAM Journal on Control and Optimization.
- [7] Pratulananda Das, Sudipta Dutta, S. A. Mohiuddine, and Abdullah Alotaibi. -Statistical Cluster Points in Finite Dimensional Spaces and Application to Turnpike Theorem. Abstr. Appl. Anal., pages Art. ID 354846, 7, 2014.
- [8] R.L. Devaney. An introduction to chaotic dynamical systems. Benjamin-Cummings, Menlo Park, 1986.
- [9] R. Dorfman, P.A. Samuelson, and R.M. Solow. Linear programming and economic analysis. New York: McGraw-Hill, 1958.
- [10] H. Fast. Sur la convergence statistique. Colloquium Math., 2:241–244 (1952), 1951.
- [11] Rafał Filipów and Piotr Szuca. Density versions of Schur’s theorem for ideals generated by submeasures. J. Combin. Theory Ser. A, 117(7):943–956, 2010.
- [12] J. A. Fridy. Statistical limit points. Proc. Amer. Math. Soc., 118(4):1187–1192, 1993.
- [13] A.F. Ivanov, M.A. Mammadov, and S.I. Trofimchuk. Global stabilization in nonlinear discrete systems with time-delay. Journal of Global Optimization, 56(2):251–263, 2013.
- [14] Winfried Just and Adam Krawczyk. On certain Boolean algebras . Trans. Amer. Math. Soc., 285(1):411–429, 1984.
- [15] Menachem Kojman. van der Waerden spaces. Proc. Amer. Math. Soc., 130(3):631–635 (electronic), 2002.
- [16] V. Kolokoltsov and W. Yang. Turnpike theorems for Markov games. Dynamic Games and Applications, 2(3):294–312, 2012.
- [17] Pavel Kostyrko, Tibor Šalát, and Władysław Wilczyński. -convergence. Real Anal. Exchange, 26(2):669–685, 2000/01.
- [18] A. Leizarowitz. Optimal trajectories on infinite horizon deterministic control systems. Appl. Math. and Opt., 19:11–32, 1989.
- [19] Paolo Leonetti and Michele Caprio. Turnpike in infinite dimension. Canad. Math. Bull., 65(2):416–430, 2022.
- [20] A. N. Lyapunov. Asymptotical optimal paths for convex mappings. Optimal Models in System Analysis, Moskow, VNIISI, (9):74–80, 1983.
- [21] M.J.P. Magill and J.A. Scheinkman. Stability of regular equilibria and the correspondence principle for symmetric variational problems. International Economic Review, pages 297–315, 1979.
- [22] V.L. Makarov and A.M. Rubinov. Mathematical theory of economic dynamics and equilibria. Springer-Verlag, New York, 1977.
- [23] M.A. Mamedov. Asymptotical optimal paths in models with environment pollution being taken into account. Optimization (Novosibirsk), 36(53):101–112, (in Russian), 1985.
- [24] M.A. Mamedov. Turnpike theorems in continuous systems with integral functionals. English transl. In: Russian Acad. Sci. Dokl. Math., 45(2):432–435, 1992.
- [25] M.A. Mamedov and S. Pehlivan. Statistical cluster points and turnpike theorem in nonconvex problems. Journal of mathematical analysis and applications, 256(2):686–693, 2001.
- [26] M.A. Mammadov. Turnpike theorem for an infinite horizon optimal control problem with time delay. SIAM Journal on Control and Optimization, 52(1):420–438, 2014.
- [27] Krzysztof Mazur. -ideals and -gaps in the Boolean algebras . Fund. Math., 138(2):103–111, 1991.
- [28] L.W. McKenzie. Turnpike theory. Econometrica: Journal of the Econometric Society, pages 841–865, 1976.
- [29] L. Montrucchio. A turnpike theorem for continuous-time optimal-control models. Journal of Economic Dynamics and Control, 19(3):599–619, 1995.
- [30] J.V. Neumann. A model of general economic equilibrium. Review of Economic Studies, 13:1–9, 1945-46.
- [31] Fatih Nuray and William H. Ruckle. Generalized statistical convergence and convergence free spaces. J. Math. Anal. Appl., 245(2):513–527, 2000.
- [32] S. Pehlivan and M.A. Mamedov. Statistical cluster points and turnpike. Optimization, 48(1):91–106, 2000.
- [33] R.T Rockafellar. Saddle points of hamiltonian systems in convex problems of lagrange. Journal of Optimization Theory and Applications, 12(4):367–390, 1973.
- [34] R.T Rockafellar. Saddle points of hamiltonian systems in convex lagrange problems having a nonzero discount rate. Journal of Economic Theory, 12(1):71–113, 1976.
- [35] J.A. Scheinkman. On optimal steady states of -sector growth models when utility is discounted. IJ. Econ. Theory, 12:11–30, 1976.
- [36] A.J. Zaslavski. Turnpike properties in the calculus of variations and optimal control. Springer, 2006.
- [37] A.J. Zaslavski. A turnpike property of approximate solutions of an optimal control problem arising in economic dynamics. Dynamic Systems and Applications, 20(2-3):395–422, 2011.
- [38] A.J. Zaslavski. Necessary and sufficient conditions for turnpike properties of solutions of optimal control systems arising in economic dynamics. Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms, 20(4):391–420, 2013.
- [39] A.J. Zaslavski. Turnpike properties of approximate solutions in the calculus of variations without convexity assumptions. Communications on Applied Nonlinear Analysis, 20(1):97–108, 2013.