﻿ Analysis of the Caratheodory's Theorem on Dynamical System Trajectories Under Numerical Uncertainty
 IEEE/CAA Journal of Automatica Sinica 2018, Vol. 5 Issue(4): 787-793  PDF
Analysis of the Caratheodory's Theorem on Dynamical System Trajectories Under Numerical Uncertainty
Pavel Osinenko  , Grigory Devadze , Stefan Streif Automatic Control and System Dynamics Laboratory, Technische Universität Chemnitz, 09107 Chemnitz, Germany
Abstract: The current work proposes a new and constructive proof for the Caratheodory's theorem on existence and uniqueness of trajectories of dynamical systems. The key concern is the numerical uncertainty, i.e., the discrepancy between mathematical proofs, algorithms, and their implementations, which may affect the correct functioning of a control system. Due to growing demands on security and compliance with specifications, correctness of the control system functioning is becoming ever more important. Since in both dynamical systems and many control design approaches, one of the central notions is the system trajectory, it is important to address existence and uniqueness of system trajectories in a way which incorporates numerical uncertainty. Constructive analysis is a particular approach to formalizing numerical uncertainty and is used as the basis of the current work. The major difficulties of guaranteeing existence and uniqueness of system trajectories arise in the case of systems and controllers which possess discontinuities in time, since classical solutions to initial value problems do not exist. This issue is addressed in Caratheodory's theorem. A particular constructive variant of the theorem is proven which covers a large class of problems found in practice.
Key words: Constructive analysis     Caratheodory's theorem     dynamical systems
Ⅰ. INTRODUCTION

Many analyses of controllers and associated proofs rely on existence and uniqueness of system trajectories in continuous time. A large class of control systems possess discontinuities in time which oftentimes complicates the analysis. Particular examples include step response, event-triggered systems and optimal control where time-discontinuous control laws are typical. For some of the recent applications, where the discussed phenomenon arises -. Consider, for instance, the problem of optimal control of a vibrating spring with an attached unit mass described by the differential equation

 $\ddot{x} + \dot{x} = u$

where $x$ is the vertical displacement and $u$ is an external applied force. By Pontryagin's maximum principle , it can be shown that an optimal force control, that brings the spring to a rest in minimum time, has the form

 $u^*(t) = {\rm sgn} ( \sin(t + \delta) )$

for a certain parameter $\delta$. This is a time-discontinuous signal with switching each $\pi$ units of time.

Consider now the problem of maximizing the number of queens in an ant colony. The dynamics can be described as follows:

 \begin{align*} \dot{w}&= a w u - b w \\ \dot{q}&= (1 - u)w \end{align*}

where $w, q$ are the number of workers and queens respectively, $a, b > 0$ are parameters, and $u$ describes the proportion of the workers' effort between producing more workers or queens. It can be shown that an optimal strategy has the form

 $u^*(t) = \begin{cases} 0, \quad t \le \frac{1}{b} \ln \left(\frac{a}{a-b}\right) \\ 1, \quad \text{otherwise.} \end{cases}$

In such examples, the right-hand side of the system dynamics becomes discontinuous in time and classical system trajectories do not exist (they may, however, exist in the so called extended sense, or Caratheodory sense, which will be discussed further). In practice, the optimal controller $u^*$ is usually implemented in a digital computational device which has a finite precision and computation speed. It may also happen that $u^*$ needs to be discontinuous in time, e. g. needs to switch between some fixed values, to achieve optimality. In a computational device, such switchings in general may not take place arbitrarily fast, i.e., be arbitrarily close to each other. Furthermore, the switching times are in general described by some real numbers. In a computational device, they are usually approximated by rational numbers. Such a discrepancy between the idealistic $u^*$ and its representation in a computational device may be indicated as numerical uncertainty. The current work is motivated by the presence of numerical uncertainty in implementations and to investigate under which conditions, Caratheodory solutions may be effectively constructed, i.e., with discontinuities in time and up to any prescribed precision. The proof of the major result in the current work entails a constructive methodology, which, given a dynamical system with time discontinuities represented by rational numbers (or, equivalently, time discontinuities with a given minimal gap), yields a Caratheodory solution, which is also unique.

The classical theorem on the existence of solutions in the extended sense is due to Caratheodory -. Recent studies in this field include topics such as well-posedness of Caratheodory solutions for bimodal piecewise affine systems , existence and uniqueness results for monotone non-increasing right-hand sides , and extended Caratheodory solutions for hybrid systems . Further, when the right-hand side of the system dynamics is discontinuous in the state variable, the situation becomes more complicated, than only with time discontinuities, and such notions as Filippov solutions may come into place , . The foundation of such solutions extensively utilizes the theory of differential inclusions which are also used in partial differential equations . Particular applications range from discontinuous stabilization , sliding-mode control ,  and optimal control . An overview of Filippov and other generalized solutions may be found in . The proofs of these classical results rely on compactness arguments, such as Arzela-Ascoli theorem , and certain fixed-point theorems, such as Schauder fixed-point theorem  and Kakutani fixed-point theorem , which are, unfortunately, not constructive and do not, generally, provide explicit computational procedures . The current work suggests to address the existence and uniqueness of the trajectories of discontinuous systems in a constructive framework. Currently, only the case of time discontinuities is covered. However, the result can be extended onto the case of discontinuous feedback control provided that the controller implementation is considered in the sample-and-hold manner (see details in Section Ⅳ).

The main contribution of this work is thus a constructive theorem on existence and uniqueness of system trajectories in the extended sense. Schwichtenberg , and Ye  addressed the case of initial value problems where the right-hand side of the differential equation satisfies the Lipschitz condition (the corresponding classical theorem is originally due to Picard and Lindelöf, and the corresponding description may be found in ). The new theorem derived in this work is a constructive counterpart of the Caratheodory's existence and uniqueness theorem. Constructive analysis , which is done in intuitionistic logic , offers a suitable framework for the purposes of the current work. A related example application of constructive analysis to control theory was recently provided for the Lyapunov stability theory .

The remainder of the work is structured as follows: Section Ⅱ is concerned with the key aspects of constructive analysis needed for the constructive proof of the theorem which is given in Section Ⅲ.

Ⅱ. PRELIMINARIES

In this section, some key notions and theorems of constructive analysis, needed for the current work, are discussed. This section mostly follows  since it addresses differential equations and measure theory together which will be required in the next section. First, a function $f: \mathbb{R} \rightarrow \mathbb{R}$ is a pair consisting of a map computing rational approximations to $f(x)$ for any $x$, and a map $\omega: \mathbb{Q}_{ > 0} \times \mathbb{Q} \times \mathbb{Q}_{ > 0} \rightarrow \mathbb{Q}$, called modulus of continuity satisfying the formula:

 \begin{align*} & \forall \varepsilon \in \mathbb{Q}_{>0}, c \in \mathbb{Q}, r \in \mathbb{Q}_{>0} , \forall x, y \in \{ z : |z - c| \le r \} \\ & | x - y | \le \omega(\varepsilon, c, r) \implies | f(x) - f(y) | \le \varepsilon. \end{align*}

A modulus of continuity is an important certificate that every function in constructive analysis must have inside its definition. It allows computing bounds on the change of the argument that leads to a change of the function values within a prescribed bound. A function that possesses a modulus of continuity is clearly uniformly continuous. In case of $\forall x, y. |f(x) - f(y)| \le L |x-y|$, the function is called Lipschitz continuous. Clearly, Lipschitz continuous functions are also uniformly continuous. By default, constructive analysis is only concerned with continuous functions which are provided with continuity moduli and there is no way to define a discontinuous function directly. However, an analog of classical discontinuous functions can be defined within constructive measure theory. Further details will be given in this section. But first, the derivative and Riemann integral are defined as in the classical case [24, Chapter 3]. Basic results from classical calculus are available constructively with minor modifications. In particular, Schwichtenberg  and Ye  proved Picard-Lindelöf Theorem on existence and uniqueness of solutions to initial value problems, where the right-hand side is continuous, constructively. Now, integrable and measurable functions are considered. They are required to address the Caratheodory theorem which is classically stated as follows -:

Theorem 1: Let $f(x, t)$ be a function on the rectangle $D : [x_0-b, x_0+b] \times [t_0, t_0+a]$; continuous in $x$ and measurable in $t$. Suppose that there exists an integrable function $F: [t_0, a] \rightarrow \mathbb{R}$ such that $\forall (x, t) \in D |f(x, t)| \le F(t)$. Then, there exists an absolutely continuous function $\varphi$ on the interval $I = [t_0, t_0 + \alpha]$ such that $\varphi (t_0) = x_0$ and $\dot{\varphi} = f(\varphi(t), t)$ for almost all $t \in I$. That is, $\varphi$ is a solution to the initial value problem $x(t_0)=x_0, \dot{x}=f(t, x(t))$ in the extended sense.

Here, absolutely continuous means that for any $\varepsilon > 0$, there exists $\delta > 0$ such that for any finite sequence of disjoint intervals $\{[t_k, \tau_{k}]\}_k$ on $I$ with a total length not greater than $\delta$, the function values at the endpoints satisfy $\sum_k | \varphi(t_{k}) - \varphi(\tau_k)| \le \varepsilon$.

Now, constructive integrable functions are introduced. An integrable function is a pair $\left(\{f_n\}_n, f \right)$ such that each $f_n: \mathbb{R} \rightarrow \mathbb{R}$ has a compact support, $\{f_n\}_n$ has the property that

 $\sum\limits_{n=0}^{\infty} \int \limits_{\mathbb{R}} |f_n(t)| dt < \infty$

and

 $f(t) = \sum\limits_{n=0}^{\infty} f_n(t)$

on the set

 $\text{dom}(f) = \left\{ t: \sum\limits_{n=0}^{\infty} |f_n(t)| < \infty \right\}$

called domain of $f$. It is said that $\left\{ \sum_{k=0}^{n} f_k(t)\right\}_n$ converges pointwise to $f$ on dom $(f)$. The sequence $\{f_n\}_n$ is called a representation of $f$ and is invoked whenever required, but usually omitted. The Lebesgue integral is in turn defined as

 $\int_{\mathbb{R}} f(t) dt = \sum\limits_{n=0}^{\infty} \int_{\mathbb{R}} f_n(t) dt.$

Basic properties of the Lebesgue integral can be proven constructively. Integrable functions allow introducing characteristic functions of finite intervals. For example, the characteristic function $\chi_{[0, 1]}$ of the unit interval is constructed via $g_0(t) \equiv 0, g_1(t) \equiv 0$ and, for $n > 1$,

 $g_n(t):=\begin{cases} 0, &t \in (-\infty, 0] \cup [1, \infty) \\ nt, &t \in \left[0, \frac{1}{n} \right] \\ 1, &t \in \left[ \frac{1}{n}, 1 - \frac{1}{n} \right] \\ n(1-t), &t \in \left[ 1 - \frac{1}{n}, 1 \right] \end{cases}$

by the representation $f_n:=g_{n+1}-g_n$. Due to undecidability of equality on $\mathbb{R}$, the set $A:=(-\infty, 0] \cup (0, 1) \cup [1, \infty)$ does not coincide with $\mathbb{R}$ constructively. This reflects the classical idea that the Lebesgue integral is not concerned with the values of a function on sets of measure zero. It can be shown that $\left\{ f_n \right\}_n$ converges to $\chi_{[0, 1]}$ pointwise on $A$.

Further, measurable functions are introduced (for details, please refer to [28, Chapter. 6] or [24, Chapter. 6]). First, a measure of a finite interval $I=[a, b]$ is defined as $\mu(I)=|a-b|$. A generalized interval $J$ is a formal union of a sequence of finite intervals $\left\{ \cup_n I_n \right\}_n$, possibly overlapping. Its measure is defined as $\mu(J) = \sum_n \mu(I_n)$ whenever it converges. In this case, $J$ is called finite. A function $f: \mathbb{R} \rightarrow \mathbb{R}$ is called measurable if for any $\varepsilon > 0$ and any finite interval $I$, there exists a generalized interval $J$ with $\mu(J) \le \varepsilon$ and a continuous function $g$ with a compact support such that $|f -g| \le \varepsilon$ on $I \setminus J$. Clearly, all functions of the type

 $\begin{equation} \sum\limits_{j=1}^K \chi_{[t_j, \tau_j]}(t) f_j(t) \label{eqn:simple-fncs} \end{equation}$ (1)

where each $f_j$ is continuous and $\forall j \tau_j > t_j$, are measurable. Integrable functions are also measurable.

Now, consider convergence of measurable functions. The key type of convergence used in the next section is convergence almost uniformly: a sequence $\left\{f_n\right\}_n$ of measurable functions converges to a measurable function $f$ almost uniformly if for any finite interval $I$ and $\varepsilon > 0$, there exists a generalized interval $J$ with $\mu(J) \le \varepsilon$ such that $\left\{f_n\right\}_n$ converges to $f$ uniformly on $I \setminus J$. Here, the ordinary uniform convergence implies that for any $\varepsilon > 0$, there exists $N$ such that $\forall t \forall n \ge N |f_n(t) - f| \le \varepsilon$ on the respective set. Further, a sequence $\left\{f_n\right\}_n$ of measurable functions is called Cauchy almost everywhere if for any finite interval $I$ and $\varepsilon > 0$, there exists $N$ and a generalized interval $J$ with $\mu(J) \le \varepsilon$ such that $\forall m, n \ge N |f_n(t) - f_m(t)| \le \varepsilon$ on $I \setminus J$. An important result of constructive measure theory states that an almost everywhere Cauchy sequence converges to a measurable function:

Lemma 1: [24, pp. 165] For any almost uniformly Cauchy sequence of measurable functions $\left\{f_n\right\}_n$ there exists a measurable function $f$ such that $\left\{f_n\right\}_n$ converges to $f$ almost uniformly, and also pointwise on the respective domain.

In the next section, a constructive variant of Theorem 1 is addressed.

Ⅲ. RESULTS AND DISCUSSION

The goal of this section is to obtain a constructive counterpart of Theorem 1 which addresses numerical uncertainty. The following theorem is suggested as a particular substitute and uses assumptions which can be justified from the practical standpoint. That is, the theorem requires that the right-hand side of the differential equation have a finite number of separable discontinuities. It is easy to show that in case of indistinguishable discontinuities, the proof would imply decidability of equality over real numbers which is not true constructively. The details are given below.

Theorem 2: Consider the initial value problem

 $\begin{equation} \dot{x} = f(x, t), \quad x(0)=x_0 \label{eqn:general-sys} \end{equation}$ (2)

on the rectangle $D = [x_0- \bar{x}, x_0 + \bar{x}] \times [0, T]$. Suppose that

 $\begin{equation} f(x, t) = \sum\limits_{j=1}^{K} \chi_{[\tau_j, \tau_{j+1}]}(t) f_{j}(x, t) \label{eqn:rhs} \end{equation}$ (3)

such that $\forall ~j. ~\tau_j ~\in ~\mathbb{Q}$ and $\exists ~L~ > ~0 ~\forall ~(x_1, ~t), ~(x_2, ~t) ~\in ~D$ $|f_j(x_1, t)\, -\, f_j(x_2, t)| \, \le\, L|x_1\, -\, x_2|$. Further, assume $\exists ~F~$ $> \!\!0 |f(x, t)| \!\!\le\!\! F$ on dom $(f) = [x_0- \bar{x}, x_0 + \bar{x}] \times \left([0, T] \setminus \{\tau_j\}_j\right)$. Then, there exists a unique solution in the extended sense on a subinterval of $[0, T]$ which depends on the initial condition uniformly continuously.

Proof: Denote dom$_t(f) := [0, T] \setminus \{\tau_j\}_j$. The condition $\tau_j \in \mathbb{Q}$ is needed precisely to isolate discontinuities. Let $\alpha := \min \left\{ T, \frac{\bar{x}}{F} \right\}$.Assume that $\omega_f$ is a common modulus of continuity for $f_j, j \in \{1, \dots, K\}$ on $D$. Consider partitions $P_N$ of $[0, \alpha]$ into $N$ subintervals of length less than $\delta = \frac{1}{N} \alpha$ such that

1) $t_i:= \frac{i}{N} \alpha, i=0, \dots, N;$

2) $\forall i = 1, \dots, N, \forall j = 1, \dots, K+1, t_i \ne \tau_j;$

3) each subinterval may contain at most one $\tau_j, j = 1, \dots, K+1$.

Condition 3 is not inevitable; it is only used to simplify the proof as will be shown below. Fix some arbitrary $n \in \mathbb{N}$. The number $N$ is chosen so that the conditions 1 and 2 are satisfied and

 $\begin{equation} \cfrac{1}{N} \le \cfrac{\min \left\{ \frac{1}{\alpha} \omega_f \left( \frac{1}{n} \right), \frac{1}{F \alpha} \omega_f \left( \frac{1}{n} \right), \frac{2}{n} \right\}}{2}. \label{eqn:N-ineq} \end{equation}$ (4)

Inequality (4) is used in (5) to guarantee that (6), characterizing the precision of the solution, holds. That is, the constructed solution will satisfy the differential equation up to the precision of $\frac 1 n$. Now, construct a function $\varphi_n$ on $[0, \alpha] \cap {\rm dom}_t(f)$ as follows:

 \begin{align*} & \varphi_{n}(0) := x_0 \\ & \varphi_n(t) := \varphi_n(t_i) + f(\varphi_n(t_i), t_i)(t - t_i) \\&\forall t \in [t_i, t_{i+1}] \cap {\rm dom}_t(f). \end{align*}

It follows that

 $\begin{equation} |\varphi_n(t) - \varphi_n(t_i)| \le \frac{F \alpha}{N} \le \cfrac{\omega_f \left( \frac{1}{n} \right) }{2} \end{equation}$ (5)

whence $(t, \varphi_n(t))$ is admissible, i. e., $(t, \varphi_n(t))$ is within $D$. Now, let $I_N$ be the generalized interval $\bigcup_{\sigma(i)} [t_{\sigma(i)}, t_{\sigma(i)+1}]$ such that each $[t_{\sigma(i)}, t_{\sigma(i)+1}]$ contains exactly one $\tau_j, ~ j$ $= 1, \dots, K+1$. Let $I_N := [0, \alpha] \setminus J_N$. It follows that the one-sided derivatives satisfy

 $\dot{\varphi}(t) = f(\varphi_n(t_i), t_i), \quad t \in I_N.$

Notice that $J_N$ satisfies

 $\mu (J_N) = \sum\limits_{\sigma(i)} |t_{\sigma(i)+1}-t_{\sigma(i)}| \le K \frac{\alpha}{N}.$

Further, for each $t \in [t_i, t_{i+1}] \subset I_N$, it follows that

 $\begin{equation} |\dot{\varphi}_n(t) - f(\varphi_n(t), t)| = |f(\varphi_n(t_i), t_i) - f(\varphi_n(t), t)| \le \frac{1}{n}. \label{eqn:bound} \end{equation}$ (6)

from which it follows that

 $\int _{t_1}^{t} |\dot{\varphi}_n(\tau) - f(\varphi_n(\tau), \tau)| d \tau \le \int _{t_1}^{t} \frac{1}{n} d \tau = \frac{t - t_i}{n}.$

But

 \begin{align*} & \left|\int _{t_1}^{t} \dot{\varphi}_n(\tau)-f(\varphi_n(\tau), \tau)d\tau \right| \\ &~~~~\le \int _{t_1}^{t} |\dot{\varphi}_n(\tau)-f(\varphi_n(\tau), \tau)| d\tau \le \frac{t-t_i}{n}. \end{align*}

Furthermore, for each $t \in [t_i, t_{i+1}] \subset J_N$, the condition

 \begin{align*} & \left|\int _{t_1}^{t} \dot{\varphi}_n(\tau)-f(\varphi_n(\tau), \tau) d\tau \right| \\ &~~~~\le \int _{t_1}^{t} |\dot{\varphi}_n(\tau)-f(\varphi_n(\tau), \tau)| d\tau \le 2 F \frac{\alpha}{N} \end{align*}

holds since $f$ is integrable on $J_N$. Therefore, for any $t \in I_N$,

 \begin{align*} &\left| \varphi_n(t) - x_0 - \int _{0}^{t} f( \varphi_n (\tau) , \tau ) d \tau \right| \le \frac{\alpha}{n} + 2KF \frac{\alpha}{n} \\ &~~~~~~~~~~=\alpha ( 1 + 2KF ) \frac{1}{n}. \end{align*}

Let $\varphi_m$ and the associated intervals $I_M, J_M$ be another approximate solution. Suppose $\frac{1}{m} \le \frac{1}{n}$, $I_N \subseteq I_M$ and $J_M \subseteq J_N$ which can be satisfied by an appropriate choice of partition points. Therefore, for $t \in I_N$,

 \begin{align*} &|\varphi_m(t) - \varphi_n(t)| \le \int _{0}^{t} | f(\varphi_m(\tau), \tau) - f(\varphi_n(\tau), \tau) | d \tau \\ &~~~~~~~~~~~+\alpha ( 1 + 2KF )\left(\frac{1}{m} + \frac{1}{n}\right) \\ &~~~~~~~~~\le\! L\! \int _0^{t} | \varphi_m(\tau)\!\! -\!\! \varphi_n(\tau) | d \tau\!\! +\!\! \alpha ( 1\!\! +\!\! 2KF )\left(\frac{1}{m}\!\! +\!\! \frac{1}{n}\right). \end{align*}

Let

 $g(t) := \int _{0}^{t} \left| \varphi_m(\tau) - \varphi_n(\tau) \right|d \tau$

and

 $\varepsilon := ( 1 + 2KF )\left(\frac{1}{m} + \frac{1}{n}\right).$

It follows that:

 $\dot{g}(t) \le L g(t) + \varepsilon\alpha.$

Therefore,

 $\int_{0}^{t} \left( \dot{g}(\tau)e^{-L\tau} - Lg(\tau)e^{-L\tau} \right) d\tau \le \int_{0}^{t} \varepsilon \alpha e^{-L \tau} d \tau.$

Further,

 $|\varphi_m(t)-\varphi_n(t)| \le Lg(t) + \varepsilon \alpha \le \varepsilon\alpha e^{Lt} \le \varepsilon \alpha e^{L \alpha}$

since, as from the integral above

 $g(t) \le \frac{\varepsilon\alpha}{L} \left( e^{Lt}-1\right).$

At this point, the condition holds that for any $\varepsilon > 0$, there is $p \in \mathbb{N}$ and a corresponding generalized interval $J_{N(p)}$ with $\mu(J_{N(p)}) \le \varepsilon$ such that $\forall m, ~n \ge p~|~\varphi_m ~- ~\varphi_n~| ~\le ~\varepsilon$ on $[0, \alpha] \setminus J_{N(p)}$ by an appropriate choice of $N(p)$. It follows that $\{ \varphi_n\}_n$ is Cauchy almost everywhere. Therefore, by Lemma 1, there exists a measurable function $\varphi$ which is the limit of $\{ \varphi_n\}_n$. It is obvious that as $n \rightarrow \infty, [0, \alpha] \setminus J_{N(n)} \rightarrow [0, \alpha]$ which means that $\varphi$ is defined on $[0, \alpha]$ almost everywhere. Moreover, for any subinterval $[t_{\sigma(i)}, t_{\sigma(i)+1}]$, containing some $\tau_j$, it follows that

 $\lim \limits_{n \rightarrow \infty} (\varphi_n(t_i)+f(\varphi_n(t_i), t_i)(\tau_j-t_i)) = \lim\limits_{n \rightarrow \infty} \varphi_n(t_{i+1}).$

Since $t_i \rightarrow \tau_j, t_{i+1} \rightarrow \tau_j$ and $f(\varphi(t_i), t_i)(\tau_j-t_i) \rightarrow 0$, it follows that $\varphi$ can be defined on the whole $[0, \alpha]$ [28, Lemma 3.7]. By construction, $\varphi$ is absolutely continuous. Further, $\dot{\varphi}(t)$ exists on $[0, \alpha] \setminus \{\tau_1, \dots, \tau_{K+1}\}$ and is equal to $f(\varphi(t), t)$. Finally, the solution is unique since

 $|\psi(t) - \varphi_n(t)| \le L \int _{0}^{t} |\psi(t) - \varphi_n(t)| d \tau + \frac{\alpha}{n}( 1 + 2KF )$

where $\psi(t)$ is a candidate solution, i.e.,

 $\psi(t) = x_0 + \int_{0}^{t} f(\psi(\tau), \tau)d\tau.$

Therefore

 $|\psi(t) - \varphi_n(t)| \le \frac{1}{n} \alpha ( 1 + 2KF ) e^{L \alpha}.$

That means that $\{ \varphi_n\}_n$ converges to $\psi$ almost uniformly. It also follows that $\{\varphi_n\}_n$ converges to $\psi$ pointwise on $[0, \alpha] \setminus \{\tau_1, \dots, \tau_{K+1}\}$.

Remark 1: It follows that the Picard-iteration

 \begin{align*} & \varphi_0(t) := x_0\\ & \varphi_{n+1}(t) := x_0 + \int_{0}^{t} f(\varphi_n(\tau), \tau) d \tau \end{align*}

is constructively well-behaved for the presented special case of $f$. The generalization for systems of differential equations can be done similarly to [24, pp. 107].

Remark 2: Uniform continuity of the solutions depending on the initial condition can be shown as in the standard case [24, pp. 106].

Remark 3: The assumption that the time discontinuities be rational numbers can be relaxed if there is a minimal gap between them which is known beforehand.

Remark 4: Theorem 2, unlike Theorem 1, requires the time discontinuities $\tau_j$ to be either rational numbers or to have a distinguished gap, known beforehand. For each predefined natural number $n$, the proof determines another natural number $N$ according to (4), and constructs a function which satisfies the differential equation up to the precision $1/n$ as stated in equation (6). The key difference of the statements thus lies in the special representation of the right-hand side (see equation 3), instead of simply requiring that $f$ be measurable in $t$. This is an important aspect that allows the constructive theory of integrable and measurable functions, briefly discussed in Section Ⅱ, to be used to yield a unique solution.

One may see how a failure to meet the assumption in the last remark leads to malfunctioning of the algorithm in Theorem 2. Consider, for example, sliding-mode control where an ideal trajectory is supposed to come onto a sliding surface, but, in implementation, a phenomenon called "chattering" occurs when the numerically computed trajectory jumps back and forth around the sliding surface. This chattering may well depend on the chosen sample time. It can be seen how such a case would become problematic in the method of proof in Theorem 2. Classically, one considers other types of solutions such as, for example, in the sense of Filippov . Constructive treatment of such cases might be a challenging task. However, there exist notions of trajectories of differential equations with discontinuous right-hand side which are based on the Caratheodory's solutions, such as sample-and-hold . Theorem 2 is considered as a particular constructive counterpart of Caratheodory's Theorem 1. It covers a large class of functions in the right-hand side of initial value problems which have a finite number of separable discontinuities. It can be seen that the method used in the proof is not constructively applicable to the case if discontinuities are arbitrary real numbers since it would lead to decidability of equality over reals. However, it is suggested that all practical problems satisfy the conditions stated. The result can also be generalized to the case where $f$ has locally finite number of separable discontinuities.

Ⅳ. EXAMPLES

In this section, some types of dynamical systems for which Theorem 2 applies are discussed. First, the simplest case is the one in which the right-hand side of (2) possesses only one discontinuity in time. For example, consider the problem of optimal consumption in simple economy. The economy can be given by the following dynamics:

 \begin{align*} &\dot{x} = u(t)x(t), \quad t \in [0, T], \quad T > 0 \\ &x(0) = x_0 \end{align*}

where $x(t)$ describes the output of the economy and $u(t)$ is the fraction of output reinvested at time $t$ respectively. The goal is to maximize the total consumption

 $P(u(\cdot)):= \int _{0}^{T} (1-u(t))x(t) dt.$

According to the Pontryagin's Maximum Principle, the optimal control equals

 $u^*(t)=\begin{cases} 1, \quad \text{ if } 0\le t \le t^* \\ 0, \quad \text{ if } t^* \le t \le T \end{cases}$

where $t^*=T-1$ is the optimal switching time. Since $u$ possesses only one time discontinuity at $t^*$, the conditions of Theorem 2 are satisfied. The next category of control systems where Theorem 2 may be applied arises in some scheduling problems . For example, consider a problem of multi-processor task scheduling in the following form:

 \begin{align*} &\min\limits_{\tau_{ijk, l_{ijk}}, u_{ijk}} \int_{0}^{T} \sum\limits_{i, j, k} u_{ijk}(t) P(s_k) dt \\ &{\text s.t.} \dot{x}_i = - \sum\limits_{j, k} s_k u_{ijk}, \forall i \\ &u_{ijk}(t) \in \{0, 1\}, \forall t \in [\tau_{ijk, l_{ijk}}, \tau_{ijk, l_{ijk}+1}], \forall i, j, k, l_{ijk} \\ &\tau_{ijk, l_{ijk}+1} - \tau_{ijk, l_{ijk}} \ge d, \forall i, j, k, l_{ijk} \\ &\tau_{ijk, l_{ijk}} - \tau_{i'j'k', l_{i'j'k'}} \ge d, \forall i, i', j, j', k, k', l_{ijk}, l_{i'j'k'} \end{align*}

where $P(s_k)$ is the instantaneous power consumption of executing a task at speed $s_k$, $x_i$ is the remaining estimated minimum execution time of the corresponding task $i$, $u_{ijk}(t)$ indicates that the processor $j$ executes the task $i$ at the speed $s_k$ at time $t$ and $\tau_{ijk, l_{ijk}}, \tau_{ijk, l_{ijk}+1}$ is the task beginning and deadline, respectively, which must last a time amount $d$, minimal time slot duration, at least. Each event $\tau_{ijk, l_{ijk}}$ is separated from another event $\tau_{i'j'k', l_{i'j'k'}}$ by $d$ as well. The scheduling dynamics are described by the state variables $x_i$ and controls $u_{ijk}$. It follows that for each state variable $x_i$, the right-hand side $- \sum_{j, k} s_k u_{ijk}$ has the form (1) precisely due to the presence of the minimal time slots $d$. Theorem 2 addresses the case of dynamical systems whose right-hand side is discontinuous in time and continuous in the state variable. As discussed in the introduction, further generalized notions of system trajectories have to be considered in the case where the right-hand side is also discontinuous in the state variable, such as Filippov solutions. However, the problem of state discontinuities may be overcome by a special technique called "sample-and-hold" . This is a method of system analysis where the control variable is given by a feedback law which may itself by discontinuous in time, but is being "sampled" at certain time moments in the zero-and-hold manner. Such a setup is common in case when the controller is implemented in a digital form. This technique can be summarized as follows. Consider a partition of the interval $[0, T]$ as a strictly increasing sequence $\pi=\{0=\tau_0 < \tau_1 < \cdots < \tau_N=T\}$. Given a feedback law $\kappa$ and a partition $\pi$ of $[0, T]$, a sample-and-hold $\pi$-trajectory of a control system $\dot x = f(x, \kappa(x, t))$ is defined as the solution in the extended sense of the following initial value problem:

 \begin{align*} &\dot x = f(x(t), \kappa(x(\tau_i), \tau_i), t \in [\tau_i, \tau_{i+1}] \\ &x(0) = x_0. \end{align*}

In this case, the right-hand side takes the form:

 $\sum\limits_{i=1}^{N-1} \chi_{[\tau_i, \tau_{i+1}]}(t) f_i(x, t)$

where $f_i(x, t) \equiv f(x(t), \kappa(x(\tau_i), \tau_i)$. If $f$ satisfies the Lipschitz condition in the sense $\forall u \forall x, y \|f(x, u) - f(y, u)\| \le L \| x - y \|$ and $f(x, \kappa(x, t))$ is bounded on dom$(f)$, Theorem 2 applies if there exists a minimal gap between each subsequent $\tau_i$ and $\tau_{i+1}$. Finally, Theorem 2 can be applied to some switched systems . Consider the following simple example:

 $\dot x = A_{\sigma(t)} x(t).$

Here, a piecewise constant function $\sigma:[0, \infty) \rightarrow S$ is the so-called switching signal where $S = \{1, 2, \dots, m\}$ is a finite index set. If each $A_j, j \in S$ is a Hurwitz matrix, the above switched system is asymptotically stable provided that there exists a sufficiently large dwell time $\tau_d > 0$ . The dwell time $\tau_d$ characterizes slow switching, and stability in turn can be proven by the multiple Lyapunov function criterion  if $\forall i \tau_{i+1}-\tau_i \ge \tau_d$ holds. Since arbitrary fast switching is forbidden in the described scenario, Theorem 2 may be applied.

Ⅴ. CONCLUSION AND OUTLOOK

This works was concerned with analysis of the Caratheodory's theorem on existence and uniqueness of solutions to discontinuous initial value problems within constructive mathematics. A particular variant of the theorem was formulated and proven that covers a large class of practical problems. One of the future important topics is a constructive framework for other generalized solutions, such as in the Filippov sense. However, even though the case of systems discontinuous in the state variable is not addressed by the Caratheodory's theorem, if the trajectories are to be considered in the sample-and-hold framework, the new result may be applied. In this regard, it is worthwhile to investigate constructive content of system stability under sample-and-hold control.

REFERENCES
  P. Jia, P. Hao, and H. Yu, "Function observer based event-triggered control for linear systems with guaranteed L∞-gain, " IEEE/CAA J. of Autom. Sinica, vol. 2, no. 4, pp. 394-402, Oct. 2015. http://www.en.cnki.com.cn/Article_en/CJFDTotal-ZDHB201504007.htm  X. X. Mi and S. Y. Li, "Event-triggered MPC design for distributed systems with network communications, " IEEE/CAA J. of Autom. Sinica, vol. 5, no. 1, pp. 240-250, Jan. 2018. http://kns.cnki.net/KCMS/detail/detail.aspx?filename=zdhb201801024&dbname=CJFD&dbcode=CJFQ  D. R. Liu, Y. C. Xu, Q. L. Wei, and X. L. Liu, "Residential energy scheduling for variable weather solar energy based on adaptive dynamic programming, " IEEE/CAA J. of Autom. Sinica, vol. 5, no. 1, pp. 36-46, Jan. 2018. http://ieeexplore.ieee.org/document/8232588/  L. S. Pontryagin, Mathematical Theory of Optimal Processes. London: CRC Press, 1987.  E. A. Coddington and N. Levinson, Theory of Ordinary Differential Equations. New York: McGraw-Hill, 1984.  J. K. Hale, Ordinary Differential Equations. New York: Wiley, 1969.  W. Rudin, Real and Complex Analysis (3rd Edition). New York: McGraw-Hill Inc, 1986.  L. Q. Thuan and M. K. Camlibel, "On the existence, uniqueness and nature of caratheodory and filippov solutions for bimodal piecewise affine dynamical systems". Syst. Contr. Lett. , vol.68, pp.76–85, 2014. DOI:10.1016/j.sysconle.2014.02.009  J.A Cid, S. Heikkila, and R. Pouso, "Uniqueness and existence results for ordinary differential equations". J. Math. Anal. Appl. , vol.316, no.1, pp.178–188, 2006. DOI:10.1016/j.jmaa.2005.04.035  W. P. M. H. Heemels, M. K. Camlibel, A. J. Van der Schaft, and J. M. Schumacher, "On the existence and uniqueness of solution trajectories to hybrid dynamical systems, " in Nonlinear and Hybrid Control in Automotive Applications, R. Johannson and A. Rantzer, Eds. London: Springer, 2002, pp. 391-422. http://www.researchgate.net/publication/228580842_On_the_existence_and_uniqueness_of_solution_trajectories_to_hybrid_dynamical_systems  T. Ito, "A filippov solution of a system of differential equations with discontinuous right-hand sides". Econom. Lett. , vol.4, no.4, pp.349–354, 1979. DOI:10.1016/0165-1765(79)90183-6  A. F. Filippov, Differential Equations with Discontinuous Righthand Sides: Control Systems. Netherlands: Springer, 2013.  S. C. Hu, "Differential equations with discontinuous right-hand sides". J. Math. Anal. Appl. , vol.154, no.2, pp.377–390, 1991. DOI:10.1016/0022-247X(91)90044-Z  F. H. Clarke, Y. S. Ledyaev, E. D. Sontag, and A. I. Subbotin, "Asymptotic controllability implies feedback stabilization". IEEE Trans. Autom. Contr. , vol.42, no.10, pp.1394–1407, 1997. DOI:10.1109/9.633828  L. Fridland and A. Levant, "Higher Order Sliding Modes, " in Sliding Mode in Automatic Control, J. Barbot and W. Perruguetti, Eds. Ecole Central de Lille, 1999. http://onlinelibrary.wiley.com/doi/10.1002/rnc.1229/full  K. D. Young, V. I. Utkin, and U. Ozguner, "A control engineer guide to sliding mode control, " IEEE Trans. Contr. Syst. Technol., vol. 7, no. 3, pp. 328-342, May 1999. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=761053  F. Fontes, "Discontinuous feedbacks, discontinuous optimal controls, and continuous-time model predictive control". Int. J. Robust Nonlin. Contr., vol. 13, no. 3-4, :191-209 , vol.13, no.3-4, pp.191–2019, 2003. DOI:10.1002/(ISSN)1099-1239  J. Cortes, "Discontinuous dynamical systems, " IEEE Contr. Syst., vol. 28, no. 3, pp. Article No. 10010348, Jun. 2008.  N. Dunford, J. T. Schwartz, W. G. Bade, and R. G. Bartle, Linear Operators. New York: Wiley-interscience, 1971.  J. Schauder, "der Fixpunktsatz in Funktionalraumen". Stud. Math. , vol.2, no.1, pp.171–180, 1930. DOI:10.4064/sm-2-1-171-180  A. V. Surkov, "On functional-differential equations with discontinuous right-hand side". Diff. Equat. , vol.44, no.2, pp.278–281, 2008. DOI:10.1134/S001226610802016X  M. J. Beeson, Foundations of Constructive Mathematics: Metamathematical Studies. Berlin Heidelberg: Springer Science & Business Media, 1980.  H. Schwichtenberg, Constructive Analysis with Witnesses. Munich: Mathernatisches Institut der LMU, 2016.  F. Ye, Strict Finitism and the Logic of Mathematical Applications. Netherlands: Springer, 2011. http://link.springer.com/978-94-007-1347-5  E. Bishop, Foundations of Constructive Analysis. New York: McGraw-Hill, 1967.  L. E. J. Brouwer and D. van Dalen, Brouwer Cambridge Lectures on Intuitionism. Cambridge: Cambridge University Press, 2011.  P. Osinenko, G. Devadze, and S. Steif, "Constructive analysis of control system stability, " in Proc. 20th IFAC Congr., Quebec, Canada, 2016, pp. 7467-7474. http://www.researchgate.net/publication/320498922_Constructive_analysis_of_control_system_stability  E. Bishop and D. S. Bridges, Constructive Analysis. Berlin Heidelberg: Springer Science & Business Media, 1985.  A. F. Filippov, "Differential equations with discontinuous right-hand side". Matematicheskii Sbornik , vol.93, no.1, pp.99–128, 1960.  M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems. Boston, MA: Springer, 2012.  F. Clarke, "Nonsmooth Analysis in Systems and Control Theory, " in Encyclopedia of Complexity and Systems Science, R. Meyers, Ed. New York, NY: Springer, 2009, pp. 6271-6285. http://link.springer.com/10.1007/978-1-4614-1806-1_69  D. Liberzon, Switching in Systems and Control, ser. Systems & Control: Foundations & Applications. Birkhauser Boston, 2012.