This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Invariant ideals and its applications to the turnpike theory

Musa Mammadov School of Information Technology, Deakin University, VIC 3125, Australia [email protected]  and  Piotr Szuca Institute of Mathematics, University of Gdańsk, ul. Wita Stwosza 57, 80-952 Gdańsk, Poland [email protected]
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:
\mathcal{I}-convergence, \mathcal{I}-cluster set, statistical convergence, turnpike property, optimal control, discrete systems
2020 Mathematics Subject Classification:
Primary 40A35; Secondary 49J99, 54A20

1. 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 AA-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 AA-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 x=(xn)nx=(x_{n})_{n\in\mathbb{N}} be a sequence of elements of m\mathbb{R}^{m}. For the sake of simplicity, we will consider the Euclidean norm .\left\|\cdot\right\|. The classical definition of convergence of xx to aa says that for every ε>0\varepsilon>0 the set of all nn\in\mathbb{N} with xnaε\left\|x_{n}-a\right\|\geq\varepsilon 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 aa is a cluster point of xx if for every ε>0\varepsilon>0 the set of all nn\in\mathbb{N} with xna<ε\left\|x_{n}-a\right\|<\varepsilon 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 XX is denoted by #X{\#{}X}. 𝒫()\mathcal{P}(\mathbb{N}) denotes the power set of \mathbb{N}.

Definition 1.

An ideal on 𝒫()\mathcal{P}(\mathbb{N}) is a family 𝒫()\mathcal{I}\subset\mathcal{P}(\mathbb{N}) which is non-empty, hereditary and closed under taking finite unions, i.e. it fulfills the following three conditions:

  1. (1)

    \emptyset\in\mathcal{I};

  2. (2)

    AA\in\mathcal{I} if ABA\subset B and BB\in\mathcal{I};

  3. (3)

    ABA\cup B\in\mathcal{I} if A,BA,B\in\mathcal{I}.

Example 2.

By Fin we denote the ideal of all finite subsets of ={1,2,}\mathbb{N}=\{1,2,\ldots\}. There are many examples of ideals considered in the literature, e.g.

  1. (1)(1)

    the ideal of sets of asymptotic density zero

    d={A:d¯(A)=0},\mathcal{I}_{d}=\left\{A\subset\mathbb{N}\ :\ \overline{d}(A)=0\right\},

    where d¯:𝒫()[0,1]\overline{d}\colon\mathcal{P}(\mathbb{N})\to[0,1] is given by the formula

    d¯(A)=lim supn#(A{1,2,,n})n\overline{d}(A)=\limsup_{n\to\infty}\frac{{\#{}(A\cap\{1,2,\ldots,n\})}}{n}

    is the well-known definition of upper asymptotic density of the set AA;

  2. (2)(2)

    the ideal of sets of logarithmic density zero

    log={A:lim supnkA{1,2,,n}1kkn1k=0};\mathcal{I}_{log}=\left\{A\subset\mathbb{N}\ :\ \limsup_{n\to\infty}\frac{\sum_{k\in A\cap\{1,2,\ldots,n\}}\frac{1}{k}}{\sum_{k\leq n}\frac{1}{k}}=0\right\};
  3. (3)(3)

    the ideal

    1/n={A:nA1n<};\mathcal{I}_{1/n}=\left\{A\subset\mathbb{N}:\sum_{n\in A}\frac{1}{n}<\infty\right\};
  4. (4)(4)

    the ideal of arithmetic progressions free sets

    𝒲={W:W does not contain arithmetic progressions of all lengths}.\mathcal{W}=\left\{W\subset\mathbb{N}\ :\ \textup{$W$ does not contain arithmetic progressions of all lengths}\right\}.

Ideals d\mathcal{I}_{d} and log\mathcal{I}_{log} belongs to the wider class of Erdős-Ulam ideal’s (defined by submeasures of special kind, see [14]). Ideal 1/n\mathcal{I}_{1/n} is an representant of the class of summable ideals (see [27]). The fact that 𝒲\mathcal{W} 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 =𝒫()\mathcal{I}=\mathcal{P}(\mathbb{N}), ={}\mathcal{I}=\{\emptyset\}, or principal ideals n={A:nA}\mathcal{I}_{n}=\{A\subset\mathbb{N}\colon n\notin A\}, however they are not interesting from our point of view. If not explicitly said we assume that all considered ideals are proper (i.e. 𝒫()\mathcal{I}\not=\mathcal{P}(\mathbb{N})) and contain all finite sets (i.e. Fin\textrm{Fin}\subset\mathcal{I}). The inclusions between abovementioned families are shown on Figure 1. The only non-trivial inclusions are: 1/nd\mathcal{I}_{1/n}\subset\mathcal{I}_{d} (a folklore application of Cauchy condensation test), 𝒲d\mathcal{W}\subset\mathcal{I}_{d} (the famous theorem of Szemerédi), and dlog\mathcal{I}_{d}\subset\mathcal{I}_{log} (by well-known inequalities between upper logarithmic density and upper asymptotic density). It is easy to observe that 1/n𝒲\mathcal{I}_{1/n}\not\subset\mathcal{W}, but the status of the inclusion 𝒲1/n\mathcal{W}\subset\mathcal{I}_{1/n} is unknown (“Erdős conjecture on arithmetic progressions” says that the van der Waerden ideal 𝒲\mathcal{W} is contained in the ideal 1/n\mathcal{I}_{1/n}.)

Fin𝒲\mathcal{W}1/n\mathcal{I}_{1/n}d\mathcal{I}_{d}log\mathcal{I}_{log}
Figure 1. Inclusions of ideals, implications between \mathcal{I}-convergence, and inclusions of sets of \mathcal{I}-cluster points for ideals from Example 2. Arrow “𝒥\mathcal{I}\longrightarrow\mathcal{J}” means that “𝒥\mathcal{I}\subset\mathcal{J}”, and for every sequence xx, “xax𝒥ax\to_{\mathcal{I}}a\Rightarrow x\to_{\mathcal{J}}a”, “Γ(x)Γ𝒥(x)\Gamma_{\mathcal{I}}(x)\supset\Gamma_{\mathcal{J}}(x)”.

2.1. \mathcal{I}-convergence and \mathcal{I}-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 (xn)n(x_{n})_{n\in\mathbb{N}} of elements of m\mathbb{R}^{m} is said to be \mathcal{I}-convergent to ama\in\mathbb{R}^{m} (a=limxna=\mathcal{I}-\lim x_{n}, or xnax_{n}\to_{\mathcal{I}}a, in short) if and only if for each ε>0\varepsilon>0

{n:xnaε}.\left\{n\in\mathbb{N}\ :\ \left\|x_{n}-a\right\|\geq\varepsilon\right\}\in\mathcal{I}.

The sequence (xn)(x_{n}) is convergent to aa if and only if it is Fin-convergent to aa.

It is also easy to see that for any sequence x=(xn)x=(x_{n}) and two ideals \mathcal{I}, 𝒥\mathcal{J}, if 𝒥\mathcal{I}\subset\mathcal{J} then xax\to_{\mathcal{I}}a implies that x𝒥ax\to_{\mathcal{J}}a (see Figure 1).

Definition 4.

The ama\in\mathbb{R}^{m} is an \mathcal{I}-cluster point of a sequence x=(xn)nx=(x_{n})_{n\in\mathbb{N}} of elements of m\mathbb{R}^{m} if for each ε>0\varepsilon>0

{n:xna<ε}.\{n\in\mathbb{N}\colon\left\|x_{n}-a\right\|<\varepsilon\}\notin\mathcal{I}.

By \mathcal{I}-cluster set of xx we understand the set

Γ(x)={am:a is an -cluster point of x}.\Gamma_{\mathcal{I}}(x)=\left\{a\in\mathbb{R}^{m}\colon a\textup{\ is an\ }\mathcal{I}\textup{-cluster point of\ }x\right\}.

Recall that Γ(x)=ΓFin(x)\Gamma(x)=\Gamma_{\textrm{Fin}}(x) is a set of classical cluster (limit) points of xx.

Proposition 5.

For any bounded sequence x=(xn)x=(x_{n}),

  1. (1)(1)

    Γ(x)\Gamma_{\mathcal{I}}(x)\not=\emptyset ([31]), and

  2. (2)(2)

    Γ(x)\Gamma_{\mathcal{I}}(x) is closed ([17]), and

  3. (3)(3)

    Γ(x)={a}\Gamma_{\mathcal{I}}(x)=\{a\} if and only if xax\to_{\mathcal{I}}a.

Moreover, if 𝒥\mathcal{I}\subset\mathcal{J} then Γ𝒥(x)Γ(x)\Gamma_{\mathcal{J}}(x)\subset\Gamma_{\mathcal{I}}(x) ([31], see Figure 1).

Part (3)(3) follows from the folklore argument: aa is the unique \mathcal{I}-cluster point of xx, iff {n:xnaε}\{n\colon||x_{n}-a||\geq\varepsilon\}\in\mathcal{I} for every ε>0\varepsilon>0, iff xnax_{n}\to_{\mathcal{I}}a.

2.2. \mathcal{I}-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 x=(xn)nx=(x_{n})_{n\in\mathbb{N}} of elements of m\mathbb{R}^{m} is said to be statistically convergent to an ama\in\mathbb{R}^{m} if for each ε>0\varepsilon>0 the set of all indices nn such that {n:xnaε}\{n\in\mathbb{N}\colon\left\|x_{n}-a\right\|\geq\varepsilon\} has upper asymptotic density zero, i.e.

d¯({n:xnaε})=0, for all ε>0.\overline{d}(\{n\in\mathbb{N}\colon\left\|x_{n}-a\right\|\geq\varepsilon\})=0,\textup{\ for all\ }\varepsilon>0.

Obviously, xx is statistically convergent to aa if and only if xdax\to_{\mathcal{I}_{d}}a. 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 d\mathcal{I}_{d}-cluster point. Proposition 5 in case of statistical convergence was proved in [12]. Since statistical convergence is a particular case of \mathcal{I}-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 ε\varepsilon-neighbourhood of a given set AmA\subset\mathbb{R}^{m} will be denoted by

B(A,ε)={ym:aAay<ε}.B(A,\varepsilon)=\{y\in\mathbb{R}^{m}\colon\exists_{a\in A}\left\|a-y\right\|<\varepsilon\}.

For each ama\in\mathbb{R}^{m} we do not distinguish between B({a},ε)B(\{a\},\varepsilon) and B(a,ε)B(a,\varepsilon).

Lemma 7 ([32]).

Let x=(xk)kx=(x_{k})_{k\in\mathbb{N}} be a bounded sequence. Then for any ε>0\varepsilon>0

d¯({k:xkB(Γd(x),ε)})=0.\overline{d}(\left\{k\in\mathbb{N}\colon x_{k}\notin B(\Gamma_{\mathcal{I}_{d}}(x),\varepsilon)\right\})=0.

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 \mathcal{I} is an ideal, (xn)(x_{n}) is a sequence and KmK\subset\mathbb{R}^{m} is compact. If {n:xnK}\{n\in\mathbb{N}\colon x_{n}\in K\}\notin\mathcal{I} then KΓ(x)K\cap\Gamma_{\mathcal{I}}(x)\not=\emptyset.

Lemma 9 (Ideal version of Lemma 7).

Let x=(xk)kx=(x_{k})_{k\in\mathbb{N}} be a bounded sequence. Then for any ideal \mathcal{I} and ε>0\varepsilon>0

{k:xkB(Γ(x),ε)}.\left\{k\in\mathbb{N}\colon x_{k}\notin B(\Gamma_{\mathcal{I}}(x),\varepsilon)\right\}\in\mathcal{I}.

Proof.  Since xx is bounded, there exists a compact set CC such that xnCx_{n}\in C for all nn. If we assume that {k:xkB(Γ(x),ε)}\left\{k\in\mathbb{N}\colon x_{k}\notin B(\Gamma_{\mathcal{I}}(x),\varepsilon)\right\}\notin\mathcal{I}, then the set K=CB(Γ(x),ε)K=C\setminus B(\Gamma_{\mathcal{I}}(x),\varepsilon) is compact and {n:xnK}\{n\in\mathbb{N}\colon x_{n}\in K\}\notin\mathcal{I}. By Lemma 8, KΓ(x)K\cap\Gamma_{\mathcal{I}}(x)\not=\emptyset, a contradiction. \Box

2.3. Ideals invariant under translations

By \mathbb{Z} we denote the set of all integers.

Definition 10.

We say that an ideal \mathcal{I} is invariant under translations if for each AA\in\mathcal{I} and ii\in\mathbb{Z},

A+i, where A+i={a+i:aA}.A+i\in\mathcal{I},\textup{\ where\ }A+i=\left\{a+i\ :\ a\in A\right\}\cap\mathbb{N}.

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 \mathcal{I}-cluster sets for such ideals.

Lemma 11.

Suppose that \mathcal{I} is invariant under translations, x=(xk)kx=(x_{k})_{k\in\mathbb{N}} is a sequence in m\mathbb{R}^{m}. Then for any non-empty GΓ(x)G\subset\Gamma_{\mathcal{I}}(x), ii\in\mathbb{Z} and δ1,δ2>0\delta_{1},\delta_{2}>0:

{k:xkB(G,δ1) and xk+iB(Γ(x),δ2)}.\left\{k\in\mathbb{N}\colon x_{k}\in B\left(G,\delta_{1}\right)\textup{\ and\ }x_{k+i}\in B\left(\Gamma_{\mathcal{I}}(x),\delta_{2}\right)\right\}\notin\mathcal{I}.

In particular, this set is non-empty.

Proof.  Let Kδ11={k:xkB(G,δ1)}K^{1}_{\delta_{1}}=\{k\in\mathbb{N}\colon x_{k}\in B(G,\delta_{1})\} and Kδ22={k:xkB(Γ(x),δ2)}K^{2}_{\delta_{2}}=\{k\in\mathbb{N}\colon x_{k}\in B(\Gamma_{\mathcal{I}}(x),\delta_{2})\}. Since GΓ(x)G\subset\Gamma_{\mathcal{I}}(x) and GG\not=\emptyset, Kδ11K^{1}_{\delta_{1}}\notin\mathcal{I}. By Lemma 9, Kδ22\mathbb{N}\setminus K^{2}_{\delta_{2}}\in\mathcal{I}. Consider the set Kδ11+i={k+i:kKδ11}K^{1}_{\delta_{1}}+i=\{k+i\colon k\in K^{1}_{\delta_{1}}\}. \mathcal{I} is invariant under translations, so Kδ11+iK^{1}_{\delta_{1}}+i\notin\mathcal{I}. Let K=(Kδ11+i)Kδ22K=(K^{1}_{\delta_{1}}+i)\cap K^{2}_{\delta_{2}}. Since KK 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), KK\notin\mathcal{I}. Consider the set Ki={ki:kK}K-i=\{k-i\colon k\in K\}. Again, since \mathcal{I} is invariant under translations, KiK-i\notin\mathcal{I}. For each kKik\in K-i, xkB(G,δ1) and xk+iB(Γ(x),δ2)x_{k}\in B\left(G,\delta_{1}\right)\textup{\ and\ }x_{k+i}\in B\left(\Gamma_{\mathcal{I}}(x),\delta_{2}\right). \Box

If \mathcal{I} is invariant under translations then either \mathcal{I} is a trivial ideal {}\{\emptyset\}, or \mathcal{I} contains all finite sets (i.e. Fin\textrm{Fin}\subset\mathcal{I}). Indeed, if there is a non-empty set FF\in\mathcal{I}, then {n}\{n\}\in\mathcal{I} for each nFn\in F. From the invariance of \mathcal{I} it follows that {k}\{k\}\in\mathcal{I} for every kk\in\mathbb{N}. Since \mathcal{I} is closed on finite unions, each finite set belongs to \mathcal{I}.

3. Optimal control problem and main assumptions

Consider the problem

() xn+1=f(xn,un),x1=ζ0,unU,x_{n+1}=f(x_{n},u_{n}),x_{1}=\zeta^{0},u_{n}\in U,
(/) J(x)=lim infϕ(xn)max.J_{\mathcal{I}}(x)=\mathcal{I}{\rm-}\liminf\phi(x_{n})\rightarrow\max.

Here ζ0\zeta^{0} is a fixed initial point, function f:m×tmf\colon\mathbb{R}^{m}\times\mathbb{R}^{t}\to\mathbb{R}^{m} is continuous, UtU\subset\mathbb{R}^{t} is a compact set, ϕ:m\phi\colon\mathbb{R}^{m}\to\mathbb{R} is a continuous function, and for any sequence of reals y=(yn)y=(y_{n})

lim infy=sup{y0:{n:yn<y0}}.\mathcal{I}{\rm-}\liminf y=\sup\left\{y_{0}\in\mathbb{R}\colon\left\{n\in\mathbb{N}\colon y_{n}<y_{0}\right\}\in\mathcal{I}\right\}.

The pair u,x\langle u,x\rangle is called a process if the sequences x=(xn)x=(x_{n}) and u=(un)u=(u_{n}) satisfy ()(*) for all nn\in\mathbb{N} (xx is called a trajectory and uu is called a control).

In the sequel we will use the following characterization of the functional JJ_{\mathcal{I}} ([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 x=(xn)nx=(x_{n})_{n\in\mathbb{N}} the following representation is true

J(x)=minΓ(ϕ(x))=minζΓ(x)ϕ(ζ).J_{\mathcal{I}}(x)=\min\Gamma_{\mathcal{I}}(\phi(x))=\min_{\zeta\in\Gamma_{\mathcal{I}}(x)}\phi(\zeta).

We assume that there is a compact (bounded and closed) set CmC\subset\mathbb{R}^{m} such that xnCx_{n}\in C for all trajectories; that is, we assume that trajectories are uniformly bounded.

ζm\zeta\in\mathbb{R}^{m} is called a stationary point if there exists u0Uu_{0}\in U such that f(ζ,u0)=ζf(\zeta,u_{0})=\zeta. We denote the set of stationary points by MM. It is clear that MM is a closed set. ζM\zeta^{\star}\in M is called an optimal stationary point if

ϕ(ζ)=ϕ=˙maxζMϕ(ζ).\phi(\zeta^{\star})=\phi^{\star}~{}\dot{=}~{}\max_{\zeta\in M}\phi(\zeta).

We will assume that the set of all optimal stationary points is non-empty. This is not a restrictive assumption since function ϕ\phi is continuous and the set MM is closed; for example, it is satisfied if MM is in addition bounded.

Define the set

M={ζM:ζ is an optimal stationary point},M^{\star}=\left\{\zeta^{\star}\in M\colon~{}\zeta^{\star}\textup{\ is an optimal stationary point}\right\},

and

D={ζC:ϕ(ζ)ϕ}.D^{\star}=\left\{\zeta\in C\colon~{}\phi(\zeta)\geq\phi^{\star}\right\}.

We assume that the set CC is large enough to accommodate M;M^{\star}; that is, MCM^{\star}\subset C. Then clearly, M=MDM^{\star}=M\cap D^{\star}.

Consider the following three conditions.

  • (C1)(C1):

    optimal stationary point ζ\zeta^{\star} is unique, i.e. M={ζ}M^{\star}=\{\zeta^{\star}\};

  • (/C2)(\mathcal{I}{\rm/}C2):

    there exists a process u,x\langle u^{\star},x^{\star}\rangle such that Γ(x)D\Gamma_{\mathcal{I}}(x^{\star})\subset D^{\star};

  • (C3)(C3):

    there exists a continuous function P:mP\colon\mathbb{R}^{m}\to\mathbb{R} such that

    P(f(x0,u0))<P(x0)forallx0DM,u0U,P(f(x_{0},u_{0}))<P(x_{0})~{}~{}~{}~{}~{}{\rm for~{}all}~{}~{}x_{0}\in D^{\star}\setminus M^{\star},u_{0}\in U,

    and

    P(f(x0,u0))P(x0)forallx0D,u0U.P(f(x_{0},u_{0}))\leq P(x_{0})~{}~{}~{}~{}~{}{\rm for~{}all}~{}~{}x_{0}\in D^{\star},u_{0}\in U.

One can also consider condition (C2)=(Fin/C2)(C2)=(\textrm{Fin}{\rm/}C2):

  • (C2)(C2):

    there exists a process u,x\langle u^{\star},x^{\star}\rangle such that any limit point of the sequence xx^{\star} is in DD^{\star}.

Note that if the (unique) optimal stationary point ζ\zeta^{\star} belongs to the interior of DD^{\star}, then proof of turnpike property is not difficult and can be regarded as a “trivial” case where condition (C3)(C3) ensures the existence of some Lyapunov function, with derivative P,P, defined on a small neighborhood of ζ.\zeta^{\star}.

The most interesting case is when an optimal stationary point ζ\zeta^{\star} belongs to a boundary of DD^{\star}; that is, the both sets DD^{\star} and D={ζC:ϕ(ζ)<ϕ}D^{\star-}=\left\{\zeta\in C\colon~{}\phi(\zeta)<\phi^{\star}\right\} have nonempty intersection with any small neighborhood of ζ\zeta^{\star}. In this case the inequality P(f(x0,u0))>P(x0)P(f(x_{0},u_{0}))>P(x_{0}) may hold for some x0Dx_{0}\in D^{\star-}; that is, condition (C3)(C3) does not guarantee the existence of Lyapunov functions.

Note also that condition (/C2)/(C2)(\mathcal{I}{\rm/}C2)/(C2) can be formulated equivalently “there exists a process u,x\langle u^{\star},x^{\star}\rangle such that J(x)ϕJ_{\mathcal{I}}(x^{\star})\geq\phi^{\star}” (see [19, (A6)(A6)]), or stronger “there exists a process u,x\langle u^{\star},x^{\star}\rangle such that xζx^{\star}\to_{\mathcal{I}}\zeta^{\star}” (see [23, 25, 32]),

Recall that if 𝒥\mathcal{I}\subset\mathcal{J} then \mathcal{I}-convergence is stronger than 𝒥\mathcal{J}-convergence, thus by Proposition 5, (C2)(C2) is stronger than (/C2)(\mathcal{I}{\rm/}C2) for each non-trivial \mathcal{I} which is invariant under translations. Example 13 shows that these two conditions are really different, i.e. there exists a system for which (C1)(C1), (d/C2)(\mathcal{I}_{d}{\rm/}C2), (C3)(C3) hold, but (C2)(C2) does not hold (see also [19, Ex. 2.5]).

Example 13.

Consider the middle-third Cantor set TT. It is homeomorphic to the space {0,1}\{0,1\}^{\mathbb{N}} with the product (Tychonoff) topology; for example, the formula

(1) i=12ai3i for any a=a1,a2,{0,1}\sum_{i=1}^{\infty}\frac{2\cdot a_{i}}{3^{i}}\textup{\ for any\ }a=\langle a_{1},a_{2},\ldots\rangle\in\{0,1\}^{\mathbb{N}}

gives us a homeomorphism between {0,1}\{0,1\}^{\mathbb{N}} with Tychonoff topology and middle-third Cantor set. In this example we will not distinguish between TT and {0,1}\{0,1\}^{\mathbb{N}} with appropriate topologies.

For any a=a1,a2,{0,1}=Ta=\langle a_{1},a_{2},\ldots\rangle\in\{0,1\}^{\mathbb{N}}=T consider the shift map σ\sigma given by the formula ([8]):

σ(a)=a2,a3,.\sigma(a)=\langle a_{2},a_{3},\ldots\rangle.

Since TT is a closed subspace of [0,1][0,1], by Tietze’s extension theorem it can be extended to some continuous function f0:[0,1][0,1]f_{0}\colon[0,1]\to[0,1].

Let

S={121,1213,1219,};S=\left\{\frac{1}{2}\cdot 1,\frac{1}{2}\cdot\frac{1}{3},\frac{1}{2}\cdot\frac{1}{9},\ldots\right\};

that is, it is the set of centers of most left intervals removed from [0,1][0,1] during the classical construction of the middle-third Cantor set. Since σ(0)=0\sigma(0)=0 and σ\sigma is continuous, we can assume also that f0(s)=0f_{0}(s)=0 for each sSs\in S (we can multiply original f0f_{0} by the continuous function which is equal to identity on TT and equals 0 on SS).

Let m=t=1m=t=1, C=[0,1]C=[0,1], U={0}U=\{0\}. Define f:C×U𝑈𝑁𝐾𝑁𝑂𝑊𝑁f\colon C\times U\to C by the formula

f(x0,u0)=f0(x0).f(x_{0},u_{0})=f_{0}(x_{0}).

Additionally, let ζ0{0,1}=TC\zeta^{0}\in\{0,1\}^{\mathbb{N}}=T\subset C be given by the formula

ζ0=1,0,1,0,0,1,0,0,0,1,0,0,0,0,\zeta^{0}=\langle 1,0,1,0,0,1,0,0,0,1,0,0,0,0,\ldots\rangle

(the sequence of nn zeros and one, followed by n+1n+1 zeros and one, and so on). In terms of mapping (1)(\ref{ex:def-of-homeomorphism}),

ζ0=2i=2(13)i(i1)2[0,1].\zeta^{0}=2\cdot\sum_{i=2}^{\infty}\left(\frac{1}{3}\right)^{\frac{i\cdot(i-1)}{2}}\in[0,1].

Let P(x0)=x0P(x_{0})=x_{0} for each x0[0,1]x_{0}\in[0,1], and ϕ:[0,1][0,1]\phi\colon[0,1]\to[0,1] be a continuous function such that ϕ(x0)=1\phi(x_{0})=1 for x0S{0}x_{0}\in S\cup\{0\}, and ϕ(x0)<1\phi(x_{0})<1 otherwise.

Note that for the problem defined in Section 3:

  • 0M0\in M and SM=S\cap M=\emptyset;

  • ζ=0\zeta^{\star}=0, M={ζ}M^{\star}=\{\zeta^{\star}\};

  • D=S{0}D^{\star}=S\cup\{0\}.

Thus

  1. (1)(1)

    the condition (C1)(C1) holds: the optimal stationary point ζ\zeta^{\star} is unique, i.e. M={ζ}M^{\star}=\{\zeta^{\star}\};

  2. (2)(2)

    the condition (C3)(C3) holds: for every ζS\zeta\in S and uUu\in U,

    P(f(ζ,u))=f(ζ,u)=0<ζ=P(ζ) and P(f(ζ,u))=f(ζ,u)=0=ζ=P(ζ).P(f(\zeta,u))=f(\zeta,u)=0<\zeta=P(\zeta)\textup{\ and\ }P(f(\zeta^{\star},u))=f(\zeta^{\star},u)=0=\zeta^{\star}=P(\zeta^{\star}).

Observe, that for any path xx for the system ()(*):

  • Γ(x)={0,1,0,0,0,,0,1,0,0,0,,0,0,1,0,0,0,,}\Gamma(x)=\{0,\langle 1,0,0,0,\ldots\rangle,\langle 0,1,0,0,0,\ldots\rangle,\langle 0,0,1,0,0,0,\ldots\rangle,\ldots\}; in terms of mapping (1)(\ref{ex:def-of-homeomorphism}), Γ(x)={0,2/3,2/9,2/27,}\Gamma(x)=\{0,2/3,2/9,2/27,\ldots\}.

  • Γd(x)={0}=dlimx\Gamma_{\mathcal{I}_{d}}(x)=\{0\}=\mathcal{I}_{d}{\rm-}\lim x.

Therefore, the condition (d/C2)(\mathcal{I}_{d}{\rm/}C2) holds (take x=ζ,σ(ζ),σ(σ(ζ)),x^{\star}=\langle\zeta^{\star},\sigma(\zeta^{\star}),\sigma(\sigma(\zeta^{\star})),\ldots\rangle), but (C2)=(Fin/C2)(C2)=(\textrm{Fin}{\rm/}C2) does not hold. \Box

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 \mathcal{I} is invariant under translations, (C1)(C1), (/C2)(\mathcal{I}{\rm/}C2), (C3)(C3) hold and uopt,xopt\langle u^{opt},x^{opt}\rangle is an optimal process in the problem (),(/)(*),(\mathcal{I}{\rm/}\!**). Then xoptζx^{opt}\to_{\mathcal{I}}\zeta^{\star}, where ζ\zeta^{\star} is the unique optimal stationary point from (C1)(C1).

Note that from part (3)(3) of Proposition 5 the assertion “xoptζx^{opt}\to_{\mathcal{I}}\zeta^{\star}” is equivalent to “Γ(x)={ζ}\Gamma_{\mathcal{I}}(x)=\{\zeta^{\star}\}”.

It is also easy to see that the assertion of Theorem 14 is true if DD^{\star} is a singleton (i.e. D={ζ}D^{\star}=\{\zeta^{\star}\}). However, the following example shows that if ζ\zeta^{\star} is an isolated point of DD^{\star} (if we assume only the first part of condition (C3)(C3)) then Theorem 14 may not be true.

Example 15.

Let =Fin\mathcal{I}=\textrm{Fin}, m=1m=1, C=U=[0,1]C=U=[0,1], and for each xCx\in C:

f0(x)={xfor 0x12+δ;(0(12+δ))(x(12+δ))1(12+δ)+(12+δ)for 12+δ<x1,f_{0}(x)=\left\{\begin{array}[]{ll}x&\textup{for\ }0\leq x\leq\frac{1}{2}+\delta;\\ \frac{\left(0-\left(\frac{1}{2}+\delta\right)\right)\cdot\left(x-\left(\frac{1}{2}+\delta\right)\right)}{1-\left(\frac{1}{2}+\delta\right)}+\left(\frac{1}{2}+\delta\right)&\textup{for\ }\frac{1}{2}+\delta<x\leq 1,\\ \end{array}\right.
f1(x)={1for 0x13;((23δ)1)(x13)(23δ)13+1for 13<x23δ;(13(23δ))(x(23δ))1(23δ)+(23δ)for 23δ<x1,f_{1}(x)=\left\{\begin{array}[]{ll}1&\textup{for\ }0\leq x\leq\frac{1}{3};\\ \frac{\left(\left(\frac{2}{3}-\delta\right)-1\right)\cdot\left(x-\frac{1}{3}\right)}{\left(\frac{2}{3}-\delta\right)-\frac{1}{3}}+1&\textup{for\ }\frac{1}{3}<x\leq\frac{2}{3}-\delta;\\ \frac{\left(\frac{1}{3}-\left(\frac{2}{3}-\delta\right)\right)\cdot\left(x-\left(\frac{2}{3}-\delta\right)\right)}{1-\left(\frac{2}{3}-\delta\right)}+\left(\frac{2}{3}-\delta\right)&\textup{for\ }\frac{2}{3}-\delta<x\leq 1,\\ \end{array}\right.

where δ<112\delta<\frac{1}{12} (for example, on Figure 2, δ=0.05\delta=0.05). Define f:C×UCf\colon C\times U\to C by the affine formula

f(x,u)=f0(x)(1u)+f1(x)u.f(x,u)=f_{0}(x)\cdot(1-u)+f_{1}(x)\cdot u.

Additionally, let ζ0=13\zeta^{0}=\frac{1}{3} and P(x)=xP(x)=x for each xCx\in C. For the definition of ϕ\phi and visualization of f0,f1f_{0},f_{1} see Figure 2.

13\frac{1}{3}12\frac{1}{2}23\frac{2}{3}1113\frac{1}{3}23\frac{2}{3}11δ\deltaδ\deltaf0f_{0}f1f_{1}ϕ\phi
Figure 2. Graph of the quantity ϕ\phi and f0,f1f_{0},f_{1} for Example 15.

Note that for the problem defined in Section 3:

  • M=[0,23δ]M=[0,\frac{2}{3}-\delta];

  • ζ=ζ0=13\zeta^{\star}=\zeta^{0}=\frac{1}{3}, ϕ=13\phi^{\star}=\frac{1}{3}, M={13}M^{\star}=\{\frac{1}{3}\};

  • D={13}[23,1]D^{\star}=\{\frac{1}{3}\}\cup[\frac{2}{3},1].

Thus

  1. (1)(1)

    optimal stationary point ζ\zeta^{\star} is unique;

  2. (2)(2)

    the condition (C2)(C2) also holds, for example for x=(ζ0,ζ0,ζ0,)x^{\star}=(\zeta^{0},\zeta^{0},\zeta^{0},\ldots), u=(0,0,0,)u^{\star}=(0,0,0,\ldots);

  3. (3)(3)

    the first part of condition (C3)(C3) holds: for every ζ[23,1]\zeta\in[\frac{2}{3},1] and uUu\in U,

    P(f(ζ,u))=f(ζ,u)f1(ζ)<ζ=P(ζ).P(f(\zeta,u))=f(\zeta,u)\leq f_{1}(\zeta)<\zeta=P(\zeta).

In this example, the process uopt,xopt,\langle u^{opt},x^{opt}\rangle, where xopt=(13,1,13,1,13,1,)x^{opt}=(\frac{1}{3},1,\frac{1}{3},1,\frac{1}{3},1,\ldots) and uopt=(0,1,0,1,0,1,),u^{opt}=(0,1,0,1,0,1,\ldots), is an optimal process, however xoptx^{opt} does not converge to ζ\zeta^{\star} in the sense of \mathcal{I}-convergence (which is equivalent to Fin-convergence). \Box

Example 15 works for classical convergence, statistical convergence, and for general ideal convergence. It shows that additional assumption about “density” of DD^{\star} in ζ\zeta^{\star} (i.e. the second part of condition (C3)(C3)) 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:

  • (C3-LC)(C3{\textrm{-LC}}):

    there exists a linear (and therefore continuous) function P:mP\colon\mathbb{R}^{m}\to\mathbb{R} such that

    P(f(x0,u0))<P(x0)forallx0D,u0U,x0,f(x0,u0)ζ,ζ,P(f(x_{0},u_{0}))<P(x_{0})~{}~{}~{}~{}~{}{\rm for~{}all}~{}~{}x_{0}\in D^{\star},u_{0}\in U,\langle x_{0},f(x_{0},u_{0})\rangle\not=\langle\zeta^{\star},\zeta^{\star}\rangle,

where ζ\zeta^{\star} is an optimal stationary point. It follows from the above condition that ζ\zeta^{\star} is the unique optimal stationary point, and it is easy to see that (C3-LC)(C3{\textrm{-LC}}) imply (C3)(C3). However, we do not have any example of the system with (C1)+(C3)(C1)+(C3) and without (C3-LC)(C3{\textrm{-LC}}).

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 ()(*), (/)(\mathcal{I}{\rm/}\!**). In this case

Γ(x)=ΓFin(x)={am:(xnk)kafor some subsequence (xnk) of x}\Gamma(x)=\Gamma_{\textrm{Fin}}(x)=\left\{a\in\mathbb{R}^{m}\colon(x_{n_{k}})_{k\in\mathbb{N}}\to a\ \textup{for some subsequence\ }(x_{n_{k}})\textup{\ of\ }x\right\}

is the set of ω\omega-limit points. Condition (/C2)(\mathcal{I}{\rm/}C2) is in the form (C2)(C2) and functional (/)(\mathcal{I}{\rm/}\!**) is represented in the form

  • ()(**):

    J(x)=JFin(x)=lim infkϕ(xk)maxJ(x)=J_{\textrm{Fin}}(x)=\liminf_{k\to\infty}\phi(x_{k})\rightarrow\max.

Corollary 16.

Let (C1)(C1), (C2)(C2), (C3)(C3) hold and uopt,xopt\langle u^{opt},x^{opt}\rangle is an optimal process in the problem (),()=(Fin/)(*),(**)=(\textrm{Fin}{\rm/}\!**). Then xoptx^{opt} converges to ζ.\zeta^{\star}.

Statistical convergence

Now consider the statistical convergence instead of ideal convergence in the problem (),(/)(*),(\mathcal{I}{\rm/}\!**). Functional (/)=(d/)(\mathcal{I}{\rm/}\!**)=(\mathcal{I}_{d}{\rm/}\!**) in this case can be defined as follows

  • (d/)(\mathcal{I}_{d}{\rm/}\!**):

    Jd(x)=𝒞lim infkϕ(xk)max,J_{\mathcal{I}_{d}}(x)=\mathcal{C}-\liminf_{k\to\infty}\phi(x_{k})\rightarrow\max,

where 𝒞lim infkϕ(xk)=dlim infx\mathcal{C}-\liminf_{k\to\infty}\phi(x_{k})=\mathcal{I}_{d}-\liminf x stands for the minimal element in the set of statistical cluster points. Recall also that according to Example 13, condition (C2)(C2) is stronger than (d/C2)(\mathcal{I}_{d}{\rm/}C2).

Corollary 17.

Let (C1)(C1), (d/C2)(\mathcal{I}_{d}{\rm/}C2), (C3)(C3) hold and uopt,xopt\langle u^{opt},x^{opt}\rangle is an optimal process in the problem (),(d/)(*),(\mathcal{I}_{d}{\rm/}\!**). Then xoptx^{opt} statistically converges to ζ.\zeta^{\star}.

5. Proof of Theorem 14

For every rr\in\mathbb{R} define the set

Dr={ζC:ϕ(ζ)r}.D_{r}=\left\{\zeta\in C\colon~{}\phi(\zeta)\geq r\right\}.

Clearly, D=DϕD^{\star}=D_{\phi^{\star}}. For any continuous function P:mP\colon\mathbb{R}^{m}\to\mathbb{R} let

EP={ζm:P(f(ζ,u0))<P(ζ) for all u0U},E_{P}=\left\{\zeta\in\mathbb{R}^{m}\colon P(f(\zeta,u_{0}))<P(\zeta)\textup{\ for all\ }u_{0}\in U\right\},

and

E¯P={ζm:P(f(ζ,u0))P(ζ) for all u0U}.\overline{E}_{P}=\left\{\zeta\in\mathbb{R}^{m}\colon P(f(\zeta,u_{0}))\leq P(\zeta)\textup{\ for all\ }u_{0}\in U\right\}.

It is clear that MEP=M\cap E_{P}=\emptyset. If AmA\subset\mathbb{R}^{m} is compact then

argminζAP(ζ)=˙{ζ1A:P(ζ1)=minζAP(ζ)}.\arg\min_{\zeta\in A}P(\zeta)\dot{=}\left\{\zeta_{1}\in A\colon P(\zeta_{1})=\min_{\zeta\in A}P(\zeta)\right\}.

Analogously we define operator argmax\arg\max.

Lemma 18.

Assume that \mathcal{I} is invariant under translations, rr\in\mathbb{R} and u,x\langle u,x\rangle is a process in the problem (),(/)(*),(\mathcal{I}{\rm/}\!**) with J(x)rJ_{\mathcal{I}}(x)\geq r. If P:mP\colon\mathbb{R}^{m}\to\mathbb{R} is a continuous function then

argminζΓ(x)P(ζ)DrEP.\arg\min_{\zeta\in\Gamma_{\mathcal{I}}(x)}P(\zeta)\subset D_{r}\setminus E_{P}.

Proof.  As J(x)rJ_{\mathcal{I}}(x)\geq r, by Lemma 12, J(x)=minζΓ(x)ϕ(ζ)rJ_{\mathcal{I}}(x)=\min_{\zeta\in\Gamma_{\mathcal{I}}(x)}\phi(\zeta)\geq r. Thus Γ(x)Dr\Gamma_{\mathcal{I}}(x)\subset D_{r}, and so argminζΓ(x)P(ζ)Dr\arg\min_{\zeta\in\Gamma_{\mathcal{I}}(x)}P(\zeta)\subset D_{r}.

Let

F(ζ)=maxu0UP(f(ζ,u0))P(ζ).F(\zeta)=\max_{u_{0}\in U}P(f(\zeta,u_{0}))-P(\zeta).

It is clear that F:mF\colon\mathbb{R}^{m}\to\mathbb{R} is continuous, and

(2) F(ζ)<0forallζEP.F(\zeta)<0~{}~{}~{}~{}{\rm for~{}all}~{}~{}\zeta\in E_{P}.

Suppose that there exists ζ1Γ(x)\zeta_{1}\in\Gamma_{\mathcal{I}}(x) such that ζ1EP\zeta_{1}\in E_{P} and

minζΓ(x)P(ζ)=P(ζ1).\min_{\zeta\in\Gamma_{\mathcal{I}}(x)}P(\zeta)=P(\zeta_{1}).

Denote δ=F(ζ1)/8.\delta=-F(\zeta_{1})/8. Clearly δ>0\delta>0 thanks to (2).

Since functions FF and PP are continuous and Γ(x)\Gamma_{\mathcal{I}}(x) is a compact set, there exists γ>0\gamma>0 such that

(3) ζB(ζ1,γ)F(ζ)4δ, and \forall_{\zeta\in B(\zeta_{1},\gamma)}F(\zeta)\leq-4\delta,\textup{\ and }
(4) ζB(ζ1,γ)P(ζ)P(ζ1)+δ, and \forall_{\zeta\in B(\zeta_{1},\gamma)}P(\zeta)\leq P(\zeta_{1})+\delta,\textup{\ and }
(5) ζB(Γ(x),γ)P(ζ)minyΓ(x)P(y)δ.\forall_{\zeta\in B(\Gamma_{\mathcal{I}}(x),\gamma)}P(\zeta)\geq\min_{y\in\Gamma_{\mathcal{I}}(x)}P(y)-\delta.

If xkB(ζ1,γ)x_{k}\in B(\zeta_{1},\gamma) then F(xk)4δF(x_{k})\leq-4\delta, i.e. P(f(xk,u0))P(xk)4δP(f(x_{k},u_{0}))\leq P(x_{k})-4\delta for each u0Uu_{0}\in U and in particular for ukUu_{k}\in U that leads to P(xk+1)P(xk)4δ.P(x_{k+1})\leq P(x_{k})-4\delta. Moreover, from (4) we have P(xk)P(ζ1)+δP(x_{k})\leq P(\zeta_{1})+\delta and therefore

P(xk+1)P(ζ1)3δ.P(x_{k+1})\leq P(\zeta_{1})-3\delta.

On the other hand (5) implies

ζB(Γ(x),γ)P(ζ)minyΓ(x)P(y)δ=P(ζ1)δ>P(ζ1)3δ.\forall_{\zeta\in B(\Gamma_{\mathcal{I}}(x),\gamma)}P(\zeta)\geq\min_{y\in\Gamma_{\mathcal{I}}(x)}P(y)-\delta=P(\zeta_{1})-\delta>P(\zeta_{1})-3\delta.

Thus xk+1B(Γ(x),γ)x_{k+1}\notin B(\Gamma_{\mathcal{I}}(x),\gamma). By the above considerations we get

(6) xkB(ζ1,γ)xk+1B(Γ(x),γ).x_{k}\in B(\zeta_{1},\gamma)\Longrightarrow x_{k+1}\notin B(\Gamma_{\mathcal{I}}(x),\gamma).

This contradicts with Lemma 11. \Box

Lemma 19.

Assume that \mathcal{I} is invariant under translations, rr\in\mathbb{R} and u,x\langle u,x\rangle is a process in the problem (),(/)(*),(\mathcal{I}{\rm/}\!**) with J(x)rJ_{\mathcal{I}}(x)\geq r. If P:mP\colon\mathbb{R}^{m}\to\mathbb{R} is a continuous function and DrEPE¯PD_{r}\setminus E_{P}\subset\overline{E}_{P} then

argmaxζΓ(x)P(ζ)(DrEP).\arg\max_{\zeta\in\Gamma_{\mathcal{I}}(x)}P(\zeta)\cap\left(D_{r}\setminus E_{P}\right)\not=\emptyset.

Proof.  As in the proof of Lemma 18 observe that Γ(x)Dr\Gamma_{\mathcal{I}}(x)\subset D_{r}, argmaxζΓ(x)P(ζ)Dr\arg\max_{\zeta\in\Gamma_{\mathcal{I}}(x)}P(\zeta)\subset D_{r}, and define

F(ζ)=maxu0UP(f(ζ,u0))P(ζ).F(\zeta)=\max_{u_{0}\in U}P(f(\zeta,u_{0}))-P(\zeta).

Again, F:mF\colon\mathbb{R}^{m}\to\mathbb{R} is continuous, and

(7) F(ζ)<0forallζEP;F(\zeta)<0~{}~{}{\rm for~{}all}~{}~{}\zeta\in E_{P};
(8) F(ζ)0forallζEP;F(\zeta)\geq 0~{}~{}{\rm for~{}all}~{}~{}\zeta\notin E_{P};
(9) F(ζ)=0forallζE¯PEP.F(\zeta)=0~{}~{}{\rm for~{}all}~{}~{}\zeta\in\overline{E}_{P}\setminus E_{P}.

The last equality follows from the previous ones and the fact that FF is continuous.

Denote

Z1=Γ(x)EPDrEP,Z2=argmaxζΓ(x)P(ζ),Z_{1}=\Gamma_{\mathcal{I}}(x)\setminus E_{P}\subset D_{r}\setminus E_{P},~{}~{}Z_{2}=\arg\max_{\zeta\in\Gamma_{\mathcal{I}}(x)}P(\zeta),

and assume (contrary to the lemma assertion) that Z1Z2=Z_{1}\cap Z_{2}=\emptyset. Note that Z1,Z2Z_{1},Z_{2} are compact and, from the assumption that Z1Z2=Z_{1}\cap Z_{2}=\emptyset it follows that maxζZ1P(ζ)<minζZ2P(ζ)\max_{\zeta\in Z_{1}}P(\zeta)<\min_{\zeta\in Z_{2}}P(\zeta) (in fact, PZ2P\restriction Z_{2} is constant and equal to the maximum value of PP on Γ(x)\Gamma_{\mathcal{I}}(x); if it is equal to maxζZ1P(ζ)\max_{\zeta\in Z_{1}}P(\zeta) then it follows from the definition of Z2Z_{2} that Z1Z2Z_{1}\cap Z_{2}\not=\emptyset). Since (by the assumption of the lemma) DrEPE¯PD_{r}\setminus E_{P}\subset\overline{E}_{P}, (9)(\ref{claim2:02:03}) gives us FZ1=0F\restriction Z_{1}=0.

Denote also

p1=maxζZ1P(ζ),p2=minζZ2P(ζ).p_{1}=\max_{\zeta\in Z_{1}}P(\zeta),~{}~{}p_{2}=\min_{\zeta\in Z_{2}}P(\zeta).

Let

(10) a=p2p18>0.a=\frac{p_{2}-p_{1}}{8}>0.

1.  Since functions F,F, PP are continuous and FZ1=0F\restriction Z_{1}=0, there exists γ>0\gamma>0 such that

(11) ζB(Z1,γ)F(ζ)4a, and \forall_{\zeta\in B(Z_{1},\gamma)}F(\zeta)\leq 4a,\textup{\ and }
(12) ζB(Z1,γ)P(ζ)p1+a, and \forall_{\zeta\in B(Z_{1},\gamma)}P(\zeta)\leq p_{1}+a,\textup{\ and }
(13) ζB(Z2,γ)P(ζ)p2a.\forall_{\zeta\in B(Z_{2},\gamma)}P(\zeta)\geq p_{2}-a.

Let xk1B(Z1,γ)x_{k-1}\in B(Z_{1},\gamma). Then from (11), (12) the following two relations hold

P(xk)P(xk1)=P(f(xk1,uk1))P(xk1)F(xk1)4a;P(x_{k})-P(x_{k-1})=P(f(x_{k-1},u_{k-1}))-P(x_{k-1})\leq F(x_{k-1})\leq 4a;
P(xk1)p1+a.P(x_{k-1})\leq p_{1}+a.

From these inequalities we have

P(xk)p1+5a.P(x_{k})\leq p_{1}+5a.

From (10) it follows p1=p28ap_{1}=p_{2}-8a and then

P(xk)p28a+5a<p2a.P(x_{k})\leq p_{2}-8a+5a<p_{2}-a.

According to (13) this means that xkB(Z2,γ)x_{k}\notin B(Z_{2},\gamma). Therefore we conclude that

(14) xkB(Z2,γ)xk1B(Z1,γ).x_{k}\in B(Z_{2},\gamma)\Longrightarrow x_{k-1}\notin B(Z_{1},\gamma).

2.  We fix the number γ\gamma and consider the set

(15) Γ=Γ(x)B(Z1,γ).\Gamma~{}=~{}\Gamma_{\mathcal{I}}(x)\setminus B(Z_{1},\gamma).

From (10), (12) and (13) and the fact that Z2Γ(x)Z_{2}\subset\Gamma_{\mathcal{I}}(x) it follows that Z2ΓZ_{2}\subset\Gamma. Moreover, ΓDrEP\Gamma\subset D_{r}\cap E_{P}, and (7)(\ref{claim2:02:01}) implies that F(ζ)<0F(\zeta)<0 for all ζΓ\zeta\in\Gamma. Denote

δ=maxζΓF(ζ)>0.\delta=-\max_{\zeta\in\Gamma}F(\zeta)>0.

Take any number ε>0\varepsilon>0 satisfying

(16) 4ε<δ.4\varepsilon<\delta.

Since functions F,F, PP are continuous there exists a sufficiently small number η(0,γ)\eta\in(0,\gamma) such that

(17) ζB(Γ,η)F(ζ)δ+ε, and \forall_{\zeta\in B(\Gamma,\eta)}F(\zeta)\leq-\delta+\varepsilon,\textup{\ and }
(18) ζB(Z2,η)P(ζ)p2ε, and \forall_{\zeta\in B(Z_{2},\eta)}P(\zeta)\geq p_{2}-\varepsilon,\textup{\ and }
(19) ζB(Γ(x),η)P(ζ)p2+ε.\forall_{\zeta\in B(\Gamma_{\mathcal{I}}(x),\eta)}P(\zeta)\leq p_{2}+\varepsilon.

We show by contradiction that there is no kk such that

(20) xkB(Z2,η) and xk1B(Γ,η).x_{k}\in B(Z_{2},\eta)\textup{\ and\ }x_{k-1}\in B(\Gamma,\eta).

Suppose that kk fulfills (20)(\ref{k-contradiction}). From (17) we have

P(xk)P(xk1)F(xk1)δ+εP(x_{k})-P(x_{k-1})\leq F(x_{k-1})\leq-\delta+\varepsilon

or

P(xk1)P(xk)+δε.P(x_{k-1})\geq P(x_{k})+\delta-\varepsilon.

Then, from (18) it follows

P(xk1)(p2ε)+δε=p2+δ2ε,P(x_{k-1})\geq(p_{2}-\varepsilon)+\delta-\varepsilon=p_{2}+\delta-2\varepsilon,

and by (16)

P(xk1)>p2+2ε.P(x_{k-1})>p_{2}+2\varepsilon.

On the other hand (19) yields

P(xk1)p2+ε.P(x_{k-1})\leq p_{2}+\varepsilon.

The last two inequalities lead to a contradiction. This proves that the relations xkB(Z2,η)x_{k}\in B(Z_{2},\eta) and xk1B(Γ,η)x_{k-1}\in B(\Gamma,\eta) cannot be satisfied at the same time. Therefore the following is true:

(21) xkB(Z2,η)xk1B(Γ,η).x_{k}\in B(Z_{2},\eta)\Longrightarrow x_{k-1}\notin B(\Gamma,\eta).

3.  Now since η<γ\eta<\gamma, it is not difficult to observe that the relation

B(Γ(x),η)B(Γ,η)B(Z1,γ)B(\Gamma_{\mathcal{I}}(x),\eta)\subset B(\Gamma,\eta)\cup B(Z_{1},\gamma)

holds. Then (14) and (21) implies that

(22) xkB(Z2,η)xk1B(Γ(x),η).x_{k}\in B(Z_{2},\eta)\Longrightarrow x_{k-1}\notin B(\Gamma_{\mathcal{I}}(x),\eta).

The above implication contradicts with Lemma 11. \Box

Proof of Theorem 14.   Let r=ϕr=\phi^{\star}. Then Dr=Dϕ=DD_{r}=D_{\phi^{\star}}=D^{\star}. By (/C2)(\mathcal{I}{\rm/}C2) for the process u,x\langle u^{\star},x^{\star}\rangle, J(x)rJ_{\mathcal{I}}(x^{\star})\geq r.

Fix the function PP like in (C3)(C3). Then

DrEP=DEPME¯PEP.D_{r}\setminus E_{P}=D^{\star}\setminus E_{P}\subset M^{\star}\subset\overline{E}_{P}\setminus E_{P}.

Since J(x)=rJ_{\mathcal{I}}(x^{\star})=r, the maximal value of the functional (/)(\mathcal{I}{\rm/}\!**) is not less than rr. As uopt,xopt\langle u^{opt},x^{opt}\rangle is an optimal process, J(xopt)rJ_{\mathcal{I}}(x^{opt})\geq r. Thus, by Lemma 18,

argminζΓ(xopt)P(ζ)DEPM={ζ},\arg\min_{\zeta\in\Gamma_{\mathcal{I}}(x^{opt})}P(\zeta)\subset D^{\star}\setminus E_{P}\subset M^{\star}=\{\zeta^{\star}\},

where ζ\zeta^{\star} is the unique optimal stationary point from (C1)(C1). Then, by Lemma 19,

ζargmaxζΓ(xopt)P(ζ)M.\zeta^{\star}\in\arg\max_{\zeta\in\Gamma_{\mathcal{I}}(x^{opt})}P(\zeta)\cap M^{\star}.

Thus P(ζ)=P(ζ)P(\zeta)=P(\zeta^{\star}) for all ζΓ(xopt)\zeta\in\Gamma_{\mathcal{I}}(x^{opt}). It follows that

Γ(xopt)=argminζΓ(xopt)P(ζ)M={ζ}.\Gamma_{\mathcal{I}}(x^{opt})=\arg\min_{\zeta\in\Gamma_{\mathcal{I}}(x^{opt})}P(\zeta)\subset M^{\star}=\{\zeta^{\star}\}.

From part (3)(3) of Proposition 5 we obtain xoptζx^{opt}\to_{\mathcal{I}}\zeta^{\star}. \Box

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 \mathcal{I}-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. AA-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 𝒫(ω)/I{\mathcal{P}}(\omega)/I. 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. \mathcal{I}-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. FσF_{\sigma}-ideals and ω1ω1\omega_{1}\omega_{1}^{*}-gaps in the Boolean algebras P(ω)/IP(\omega)/I. 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 nn-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.