Lower and upper estimates of solutions to systems of delay dynamic equations on time scales

• 968 Accesses

• 3 Citations

Abstract

In this paper we study a system of delay dynamic equations on the time scale $T$ of the form

$y Δ (t)=f ( t , y τ ( t ) ) ,$

where $f:T× R n → R n$, $y τ (t)=( y 1 ( τ 1 (t)),…, y n ( τ n (t)))$ and $τ i :T→T$, $i=1,…,n$, are the delay functions. We are interested in the asymptotic behavior of solutions of the mentioned system. More precisely, we formulate conditions on a function f, which guarantee that the graph of at least one solution of the above-mentioned system stays in the prescribed domain. This result generalizes some previous results concerning the asymptotic behavior of solutions of non-delay systems of dynamic equations or of delay dynamic equations. A relevant example is considered.

MSC:34N05, 39A10.

1 Introduction

1.1 Time scale calculus

Time scale calculus, first introduced by Stefan Hilger in his PhD thesis in 1988 (see ) is nowadays well-known calculus and often studied in applications. Recall that a time scale $T$ is an arbitrary nonempty closed subset of reals. Note that $[ a , b ] T :=[a,b]∩T$ (resp. $( a , b ) T :=(a,b)∩T$ etc., we define any combination of right and left open or closed intervals), $[ a , ∞ ) T :=[a,∞)∩T$, σ, ρ, μ and $f Δ$ stand for the finite time scale interval, infinite time scale interval, forward jump operator, backward jump operator, graininess and Δ-derivative of f. Further, we use the symbols $C rd (T)$ and $C rd 1 (T)$ to stand for the class of rd-continuous and rd-continuous Δ-differentiable functions defined on the time scale $T$. Finally, we work with all types of points on the time scale $T$, i.e., with right-dense points or right-scattered points, respectively with left-dense points or left-scattered points. See , which is the initiating paper of the time scale theory, and  containing a lot of information on time scale calculus.

Now we remind further aspects of time scales calculus, which will be needed later (see, e.g., ). We use the standard symbol $∥⋅∥$ for an arbitrary vector norm. Note that (in this paper) a type of a norm is not important.

Definition 1 Let $T$ be a time scale. A function $f:T× R n → R n$ is called

1. (i)

rd-continuous if g defined by $g(t):=f(t,y(t))$ is rd-continuous for any rd-continuous function $y:T→ R n$;

2. (ii)

bounded on a set $S⊂T× R n$ if there exists a constant $M>0$ such that

3. (iii)

Lipschitz continuous on a set $S⊂T× R n$ if there exists a constant $L>0$ such that

1.2 System of delay dynamic equations on time scales

Let $τ i :T→T$, $i=1,…,n$, $n∈N$, be increasing rd-continuous functions satisfying $τ i (t)≤t$ for all $t∈T$, and let $y τ (t)=( y 1 ( τ 1 (t)),…, y n ( τ n (t)))$ be a vector, where its every component $y i$ is with an own delay $τ i$. Let the function $f:T× R n → R n$ be rd-continuous. We consider the system of n delay dynamic equations

$y Δ (t)=f ( t , y τ ( t ) ) ,$
(1)

i.e.,

$y 1 Δ ( t ) = f 1 ( t , y 1 ( τ 1 ( t ) ) , y 2 ( τ 2 ( t ) ) , … , y n ( τ n ( t ) ) ) , y 2 Δ ( t ) = f 2 ( t , y 1 ( τ 1 ( t ) ) , y 2 ( τ 2 ( t ) ) , … , y n ( τ n ( t ) ) ) , ⋮ y n Δ ( t ) = f n ( t , y 1 ( τ 1 ( t ) ) , y 2 ( τ 2 ( t ) ) , … , y n ( τ n ( t ) ) )$

on the time scale $T$.

For given $t 0 ∈T$ and $α 0 :=min { τ i ( t 0 ) } i = 1 n$, a function $y: [ α 0 , ∞ ) T → R n$ is said to be a solution of (1) on $[ α 0 , ∞ ) T$ provided $y∈ C rd ( [ α 0 , ∞ ) T )$, $y∈ C rd 1 ( [ t 0 , ∞ ) T )$ and y satisfies (1) for all $t∈ [ t 0 , ∞ ) T$. If, moreover, we are given an initial function $φ: [ α 0 , t 0 ] T → R n$, $φ∈ C rd ( [ α 0 , t 0 ] T )$ such that

$y(t)=φ(t),t∈ [ α 0 , t 0 ] T ,$
(2)

then we say that y is a solution of initial problem (IP) (1), (2).

1.3 Existence and uniqueness of solutions of delay dynamic equations

For the next study, it is important to known whether a solution of IP (1) and (2) exists and if it is uniquely defined. However, the following theorem (in a more general form) can be found in [, Theorem 2.1].

Theorem 1 (Picard-Lindelöf theorem)

Let $t 1 ∈T$, $t 1 > t 0$, $m>0$. Let

where the properties of φ and the definition of $α 0$ are described in previous Section  1.2. Assume that $f∈ C rd ( [ t 0 , t 1 ] T × Y m )$ is on $[ t 0 , t 1 ] T × Y m$ bounded with bound $M>0$ andLipschitz continuous. Then initial problem (1) and (2) has a unique solution y on the interval $[ α 0 , σ ( ξ ) ] T ⊂ [ α 0 , t 1 ] T$, where

$ξ:=max [ t 0 , t 0 + δ ] T$

and

$δ:=min{ t 1 − t 0 ,m/M}.$

Carefully tracing the proof of Theorem 1 in , it is easy to verify that if Theorem 1 holds, then the solution of IP (1), (2) depends continuously on the initial data.

2 Problem under consideration

Throughout this paper, we assume that the time scale $T$ is unbounded above with $t 0 ∈T$. Furthermore (throughout this paper), $α 0 ∈T$ has the same meaning as in the previous section. Let

$b i , c i :T→R,i=1,…,n,$

be Δ-differentiable functions such that $b i (t)< c i (t)$ for each $t∈ [ α 0 , ∞ ) T$, $i=1,…,n$, and

(3)

where $φ i (t)$ are coordinates of an initial function $φ(t)$ used in (2). We define a set $Ω⊂T× R n$ as

$Ω:= { ( t , y ) : t ∈ [ α 0 , ∞ ) T , y ∈ ω ( t ) } ,$

where

$ω(t):= { y ∈ R n : b i ( t ) < y i < c i ( t ) , i = 1 , … , n } .$

Then the closure $Ω ¯$ equals

$Ω ¯ := { ( t , y ) : t ∈ [ α 0 , ∞ ) T , y ∈ ω ¯ ( t ) }$

with

$ω ¯ (t)= { y ∈ R n : b i ( t ) ≤ y i ≤ c i ( t ) , i = 1 , … , n } .$

Moreover, we define the y-boundary $∂ y Ω$ of Ω as

$∂ y Ω:= { ( t , y ) : t ∈ [ α 0 , ∞ ) T , y ∈ ∂ ω ( t ) }$

with

Consider delay system (1) and initial problem (2). Let $t 1 ∈T$, where $t 1 > t 0$. Let a function f be bounded and Lipschitz continuous on an open set $S=S(t,y)⊂T× R n$ and

${ ( t , y ) : t ∈ [ α 0 , t 1 ] T , y ∈ R n } ∩ Ω ¯ ⊂S.$

This condition says that, by Theorem 1, every initial problem (1) and (2) with φ satisfying (3) has exactly one solution on an interval $[ α 0 , σ ( ξ ) ] T$ where $σ(ξ)> t 0$. It is also easy to show that this solution depends continuously on the initial function φ.

Throughout the paper, we assume that the function f is bounded and Lipschitz continuous on an open set S and $Ω ¯ ⊂S$, which implies that every initial problem (1) and (2) has exactly one solution on an interval $[ α 0 , ∞ ) T$.

The aim of this paper is to establish sufficient conditions on the function f of equation (1) such that there exists at least one solution $y(t)$ of (1) defined on $[ α 0 , ∞ ) T$ such that $(t,y(t))∈Ω$ for each $t∈ [ α 0 , ∞ ) T$. The main result generalizes some previous results of the first author (and his co-authors) concerning the asymptotic behavior of solutions of discrete and dynamic equations (see, e.g., ).

In papers [5, 6], to our best knowledge, the retract principle is for the first time extended to discrete equations. In  delayed discrete equations are considered by retract technique, and in  the retract principle is given for discrete time scales. Paper  is devoted to extension of the retract principle to dynamic equations. In  the retract principle is extended (under different conditions) to a system of dynamic equations in the plane. In  we extended the retract principle to scalar delayed dynamic equations. In the present paper we give an attempt to enlarge the retract principle to systems of delayed dynamic equations.

2.1 Points of strict egress

We define auxiliary sets which are subsets of y-boundary $∂ y Ω$:

$Ω B i : = { ( t , y ) ∈ Ω ¯ : y i ( t ) = b i ( t ) } , Ω C i : = { ( t , y ) ∈ Ω ¯ : y i ( t ) = c i ( t ) } ,$

where $i=1,2,…,n$. Obviously, $∂ y Ω= ⋃ i = 1 n ( Ω B i ∪ Ω C i )$.

Definition 2 Let $α t :=min { τ i ( t ) } i = 1 n$. A point

$M i B = ( t , y 1 , … , y i − 1 , b i ( t ) , y i + 1 , … , y n ) ∈ Ω B i ,i∈{1,2,…,n},t≥ t 0$

is called the point of strict egress for the set Ω with respect to system (1) if

$f i ( t , u 1 ( τ 1 ( t ) ) , u 2 ( τ 2 ( t ) ) , … , u n ( τ n ( t ) ) ) < b i Δ (t),$
(4)

where $u=( u 1 ,…, u n ): [ α t , t ] T → R n$ is an arbitrary rd-continuous function such that for every $j=1,…,n$,

and $u i (t)= b i (t)$.

A point

$M i C = ( t , y 1 , … , y i − 1 , c i ( t ) , y i + 1 , … , y n ) ∈ Ω C i ,i∈{1,2,…,n},t≥ t 0$

is called the point of strict egress for the set Ω with respect to system (1) if

$f i ( t , u 1 ( τ 1 ( t ) ) , u 2 ( τ 2 ( t ) ) , … , u n ( τ n ( t ) ) ) > c i Δ (t),$
(5)

where $u=( u 1 ,…, u n ): [ α t , t ] T → R n$ is an arbitrary rd-continuous function such that for every $j=1,…,n$,

and $u i (t)= c i (t)$.

Remark 1 We will explain the geometrical meaning of the point of strict egress. If a point

$M i B ∗ = ( t ∗ , y 1 , … , y i − 1 , b i ( t ∗ ) , y i + 1 , … , y n ) ∈ Ω B i ,i∈{1,2,…,n}$

is a point of strict egress for the set Ω with respect to (1) and $y(t)=( y 1 (t),…, y n (t))$ is a (unique) solution of (1) satisfying $( t ∗ ,y( t ∗ ))= M i B ∗$, then, due to (4),

$( y i ( t ∗ ) − b i ( t ∗ ) ) Δ = f i ( t ∗ , u 1 ( τ 1 ( t ∗ ) ) , u 2 ( τ 2 ( t ∗ ) ) , … , u n ( τ n ( t ∗ ) ) ) − b i Δ ( t ∗ ) <0.$

From the definition of Δ-derivative and the property $y i ( t ∗ )− b i ( t ∗ )=0$, we get $y i (t)− b i (t)<0$ (or $(t,y(t))∉ Ω ¯$) for $t∈ ( t ∗ , t ∗ + δ ) T$ with a small positive δ if $t ∗$ is a right-dense point and for $t=σ( t ∗ )$ if $t ∗$ is right-scattered.

By analogy, if

$M i C ∗ = ( t ∗ , y 1 , … , y i − 1 , c i ( t ∗ ) , y i + 1 , … , y n ) ∈ Ω C i ,i∈{1,2,…,n}$

is a point of strict egress for the set Ω with respect to (1) and $y(t)=( y 1 (t),…, y n (t))$ is a (unique) solution of (1) satisfying $( t ∗ ,y( t ∗ ))= M i C ∗$, then, due to (5), $y i (t)− c i (t)>0$ (or $(t,y(t))∉ Ω ¯$) for $t∈ ( t ∗ , t ∗ + δ ) T$ with a small positive δ if $t ∗$ is a right-dense point and for $t=σ( t ∗ )$ if $t ∗$ is right-scattered.

We see that in all the cases considered, the solution $y=y(t)$ of (1) with the initial condition $y(t)=φ(t)$, $t∈ [ α t ∗ , t ∗ ] T$, and $( t ∗ ,y( t ∗ ))∈ ∂ y Ω$ satisfies $(t,y(t))∉ Ω ¯$ for $t∈ ( t ∗ , t ∗ + δ ) T$ with a small positive δ if $t ∗$ is a right-dense point and for $t=σ( t ∗ )$ if $t ∗$ is right-scattered.

Definition 3 

If $A⊂B$ are subsets of a topological space and $π:B→A$ is a continuous mapping from B onto A such that $π(p)=p$ for every $p∈A$, then π is said to be a retraction of B onto A. When a retraction of B onto A exists, A is called a retract of B.

3 Existence theorem

The following theorem is proved by utilizing the idea of a retract method, which is well known for ordinary differential equations and goes back to Ważewski . In the next theorem, we assume that the function f, except for the indicated conditions, satisfies all the assumptions given in Section 2. Namely, we assume that the function f is bounded and Lipschitz continuous on an open set S and $Ω ¯ ⊂S$.

Theorem 2 Let $f:T× R n → R n$. Let $b i , c i :T→R$, $i∈{1,…,n}$ be Δ-differentiable functions on $T$ such that $b i (t)< c i (t)$ for each $t∈ [ α 0 , ∞ ) T$. If, moreover, every point $M∈ ∂ y Ω$ is the point of strict egress for the set Ω with respect to system (1), then there exists an rd-continuous initial function $φ ∗ : [ α 0 , t 0 ] T → R n$ satisfying

(6)

such that the initial problem

$y(t)= φ ∗ (t),t∈ [ α 0 , t 0 ] T$
(7)

defines a solution y of (1) on the interval $[ α 0 , ∞ ) T$ satisfying

(8)

Proof The idea of the proof is the following. By contrary, we assume that a solution y satisfying (8) does not exist. Then we are able to prove (by a construction of a chain of auxiliary mappings) an existence of a retraction of an n-dimensional ball into its boundary. However, it is well known that the boundary of an n-dimensional ball cannot be its retract (see, e.g., ) and we get a contradiction.

Without any special comment, throughout the proof, we use the fact that the initial value problem has a unique solution and this solution depends continuously on the initial data (this is guaranteed by Theorem 1). Suppose now that the initial function $φ ∗$ satisfying (6) generates the solution $y=y(t)$ which does not satisfy (8) for at least one $t∈ ( t 0 , ∞ ) T$. This means, in general, that for any rd-continuous initial function $φ 0$ satisfying the inequality

(9)

there exists $t 0 ∈T$, $t 0 > t 0$ such that, for a corresponding solution $y= y 0 (t)$ of the initial problem

$y 0 (t)= φ 0 (t),t∈ [ α 0 , t 0 ] T ,$

we have

$( t 0 , y 0 ( t 0 ) ) ∉Ω$

and

Let us define auxiliary mappings $P 1$, $P 2$ and $P 3$. Note that in this part of the proof, without loss of generality, we admit the eventuality that the function $φ 0 (t)$ instead of (9) satisfies weaker restrictions

and $φ 0 ( t 0 )∈ ω ¯ ( t 0 )$.

First, define a mapping $P 1$. For $( t 0 , φ 0 ( t 0 ))$ with $φ 0 ( t 0 )∈ ω ¯ ( t 0 )$,

with $t 0$ having the value defined above except for the case $φ 0 ( t 0 )∈∂ω( t 0 )$. In the latter case, we put $t 0 = t 0$.

Second, we define a mapping $P 2$ for every $( t 0 , y 0 ( t 0 ))$. For this we will need a set

$Ω R := { ( t , y ) : t ∈ [ α 0 , ∞ ) , y ∈ ω R ( t ) }$

with $ω R (t)≡ω(t)$ if $t∈T$ and

$ω R ( t ) : = { y ∈ R n : b i ( t a ) + [ b i ( t b ) − b i ( t a ) ] ⋅ t − t a t b − t a < y i < c i ( t a ) + [ c i ( t b ) − c i ( t a ) ] ⋅ t − t a t b − t a , i = 1 , … , n }$

if $t∉T$ and $t a ∈T$, $t b ∈T$ are such that $t a < t b$, $t∈( t a , t b )$ and $( t a , t b )∩T=∅$. It is clear that $Ω⊆ Ω R$. Further,

$V( t a , t b ):= { ( t , y ) : t a ≤ t ≤ t b , y ∈ ω ¯ R ( t ) }$

is obviously convex. We define, moreover, the y-part of the boundary of $Ω R$ as

$∂ y Ω R := { ( t , y ) : t ∈ [ α 0 , ∞ ) , y ∈ ∂ ω R ( t ) } ,$

where $∂ ω R (t)≡∂ω(t)$ if $t∈T$ and

$∂ ω R ( t ) : = { y ∈ ω ¯ R ( t ) : ∏ i = 1 n ( b i ( t a ) + [ b i ( t b ) − b i ( t a ) ] ⋅ t − t a t b − t a − y i ) × ( y i − c i ( t a ) − [ c i ( t b ) − c i ( t a ) ] ⋅ t − t a t b − t a ) = 0 }$

if $t∉T$, where $t a ∈T$ and $t b ∈T$ are as above.

Now we are ready to consider an auxiliary mapping $P 2$. Let $( t 0 , y 0 ( t 0 ))∉Ω$. Then, due to the convexity of $V( t a , t b )$, there exists a unique intersection of the segment connecting the points $(ρ( t 0 ), y 0 (ρ( t 0 )))$ and $( t 0 , y 0 ( t 0 ))$ with $∂ y Ω R$. We denote this point as $M 0$ and define

$P 2 ( t 0 , y 0 ( t 0 ) ) := M 0 .$

Note that if $( t 0 , y 0 ( t 0 ))∈ ∂ y Ω$, we get the particular case $M 0 =( t 0 , y 0 ( t 0 ))$ and $P 2 ( t 0 , y 0 ( t 0 ))=( t 0 , y 0 ( t 0 ))$.

Third, we define a mapping $P 3$. For this we need a subset of the y-boundary $∂ y Ω$. For $s∈T$, let

$∂ y Ω | t = s := ∂ y Ω∩ { ( s , y ) : y ∈ R n } .$

Now we are ready to consider an auxiliary continuous mapping $P 3$,

$P 3 : ∂ y Ω R → ∂ y Ω | t = t 0 ,$

defined for $M 0 =(t,y)∈ ∂ y Ω R$ as a point $M ∗ =( t 0 , y ∗ )$, where $y ∗ ∈∂ω( t 0 )$ with

$y i ∗ = b i ( t 0 )+ c i ( t 0 ) − b i ( t 0 ) c i ( t ) − b i ( t ) ⋅ ( y i − b i ( t ) ) ,i=1,…,n.$
(10)

It is easy to see that the $∂ y Ω | t = t 0$ is a retract of $∂ y Ω R$ and satisfies all the assumptions from Definition 3 (with $A:= ∂ y Ω | t = t 0$ and $B:= ∂ y Ω R$).

We show that the composite mapping

$P 3 ∘ P 2 ∘ P 1 : { ( t 0 , y ) : y ∈ ω ¯ ( t 0 ) } → ∂ y Ω | t = t 0$

is continuous due to the continuous dependence of the solutions on the initial data, the convexity of sets of the type $V( t a , t b )$ defined above and the continuity of the mapping $P 3$. Let $δ>0$ be sufficiently small and $φ 0 , φ 0 , δ : [ α 0 , t 0 ] T → R n$ be the initial functions such that

and

$lim δ → 0 φ 0 , δ = φ 0 .$
(11)

Further, let

$P 1 ( t 0 , φ 0 ( t 0 ) ) = ( t 0 , y 0 ( t 0 ) ) ,$
(12)
$P 1 ( t 0 , φ 0 , δ ( t 0 ) ) = ( t 0 , δ , y 0 , δ ( t 0 , δ ) ) .$
(13)

Suppose now that $φ 0 ( t 0 ), φ 0 , δ ( t 0 )∈ω( t 0 )$ (which is equivalent to $t 0 > t 0$). We consider all the possible settings of $( t 0 , y 0 ( t 0 ))$ and characters of $t 0$.

(I)Point $( t 0 , y 0 ( t 0 ))∈ ∂ y Ω$.

First, assume that the point $t 0$ is dense, i.e., $ρ( t 0 )= t 0 =σ( t 0 )$. Then, due to the solutions depending continuously on initial data, we have $lim δ → 0 t 0 , δ = t 0$ and, consequently,

$lim δ → 0 P 1 ( t 0 , φ 0 , δ ( t 0 ) ) = P 1 ( t 0 , φ 0 ( t 0 ) ) = ( t 0 , y 0 ( t 0 ) ) .$

In this case the mapping $P 1$ is continuous and the composite mapping $P 2 ∘ P 1$ is continuous as well because

$( P 2 ∘ P 1 ) ( t 0 , φ 0 ( t 0 ) ) = ( t 0 , y 0 ( t 0 ) )$

and

$lim δ → 0 ( P 2 ∘ P 1 ) ( t 0 , φ 0 , δ ( t 0 ) ) = lim δ → 0 P 2 ( t 0 , δ , y 0 , δ ( t 0 , δ ) ) = ( t 0 , y 0 ( t 0 ) ) .$

Further, $P 3 ∘ P 2 ∘ P 1$ is also continuous because of the continuity of mappings $P 3$ and $P 2 ∘ P 1$.

Second, if the point $t 0$ is left-scattered and right-dense, i.e., $ρ( t 0 )< t 0 =σ( t 0 )$, we can proceed analogously as in the case before. In this case, for fixed δ, either $t 0 , δ = t 0$ (if $y 0 , δ ( t 0 )∉ω( t 0 )$) or $t 0 , δ > t 0$ (if $y 0 , δ ( t 0 )∈ω( t 0 )$). In the alternative $t 0 , δ = t 0$, it is obvious that

$lim δ → 0 y 0 , δ ( t 0 , δ ) = y 0 ( t 0 )$

and thus

$lim δ → 0 ( P 2 ∘ P 1 ) ( t 0 , φ 0 , δ ( t 0 ) ) = lim δ → 0 P 2 ( t 0 , δ , y 0 , δ ( t 0 , δ ) ) = ( t 0 , y 0 ( t 0 ) ) .$

Hence the composite mapping $P 2 ∘ P 1$ is continuous. Further, $P 3 ∘ P 2 ∘ P 1$ is also continuous because of the continuity of mappings $P 3$ and $P 2 ∘ P 1$. The alternative $t 0 , δ > t 0$ with $lim δ → 0 t 0 , δ = t 0$ can be proved by the same limit process as in the first case, where the point $t 0$ is dense.

Third, let the point $t 0$ be left-dense and right-scattered, i.e., $ρ( t 0 )= t 0 <σ( t 0 )$. Then the approach used in previous cases can be modified as follows. Let, as before, (11), (12) and (13) hold. Then, for fixed δ, either $t 0 , δ ≤ t 0$ (if $y 0 , δ ( t 0 )∉ω( t 0 )$) or $t 0 , δ =σ( t 0 )$ (if $y 0 , δ ( t 0 )∈ω( t 0 )$). The alternative $t 0 , δ ≤ t 0$ with $lim δ → 0 t 0 , δ = t 0$ can be proved by the same limit process as in the first case, where the point $t 0$ is dense. However, the alternative $t 0 , δ =σ( t 0 )$ takes into account a possibility that the mapping $P 1$ cannot be continuous. If $t 0 , δ =σ( t 0 )$ is valid for $δ→0$, then, due to the convexity of $V( t 0 ,σ( t 0 ))$, there exists a unique intersection of the segment connecting the points $( t 0 , y 0 , δ ( t 0 ))$ and $(σ( t 0 ), y 0 , δ (σ( t 0 )))$ with $∂ y Ω R$. We denote this point as $M 0 , δ$ and, in accordance with the above definition, $P 2 (σ( t 0 ), y 0 , δ (σ( t 0 )))= M 0 , δ$. We wish to show that $M 0 , δ → M 0 =( t 0 , y 0 ( t 0 ))$ if $δ→0$. However, in view of the definition of the mapping $P 2$ and its geometric meaning,

$lim δ → 0 P 2 ( σ ( t 0 ) , y 0 , δ ( σ ( t 0 ) ) ) = lim δ → 0 M 0 , δ = ( t 0 , y 0 ( t 0 ) )$

and

$lim δ → 0 ( P 2 ∘ P 1 ) ( t 0 , φ 0 , δ ( t 0 ) ) = ( t 0 , y 0 ( t 0 ) ) .$

Hence the continuity of $P 2 ∘ P 1$ is proved. Further, $P 3 ∘ P 2 ∘ P 1$ is also continuous (for the same reason as before).

Fourth, suppose now that $t 0$ is an isolated point, i.e., $ρ( t 0 )< t 0 <σ( t 0 )$. Let, as before, (11), (12) and (13) hold. Then, for sufficiently small δ, we have either $t 0 , δ = t 0$ (if $y 0 , δ ( t 0 )∉ω( t 0 )$) or $t 0 , δ =σ( t 0 )$ (if $y 0 , δ ( t 0 )∈ω( t 0 )$). Without any special comment, in the alternative $t 0 , δ = t 0$, we proceed in the same way as in the second case, where $t 0$ is left-scattered and right-dense. Furthermore, in the alternative $t 0 , δ =σ( t 0 )$, we proceed in the same way as in the third case, where $t 0$ is left-dense and right-scattered.

(II)Point $( t 0 , y 0 ( t 0 ))∉ ∂ y Ω$. Then the point $t 0$ is left-scattered and only two cases are possible (either $t 0$ is left-scattered and right-dense or $t 0$ is isolated). In both mentioned cases, we can proceed in the same way. Let, as before, $φ 0 ( t 0 ), φ 0 , δ ( t 0 )∈ω( t 0 )$ and (11), (12) and (13) hold. Then, for sufficiently small δ, we have only $t 0 , δ = t 0$ and, of course, $y 0 , δ ( t 0 )∉ ω ¯ ( t 0 )$. Further,

$lim δ → 0 P 1 ( t 0 , φ 0 , δ ( t 0 ) ) = lim δ → 0 ( t 0 , δ , y 0 , δ ( t 0 , δ ) ) = ( t 0 , y 0 ( t 0 ) ) ∉ Ω ¯ .$

Due to the convexity of $V(ρ( t 0 ), t 0 )$, there exists a unique intersection of the segment connecting the points $(ρ( t 0 ), y 0 , δ (ρ( t 0 )))$ and $( t 0 , y 0 , δ ( t 0 ))$ with $∂ y Ω R$. We denote this point by $M 0 , δ$. In view of the definition of the mapping $P 2$ and its geometric meaning, we can observe that

$lim δ → 0 ( P 2 ∘ P 1 ) ( t 0 , φ 0 , δ ( t 0 ) ) = lim δ → 0 P 2 ( t 0 , y 0 , δ ( t 0 ) ) = lim δ → 0 M 0 , δ = M 0 .$

Hence the composite mapping $P 2 ∘ P 1$ is continuous. Moreover, $P 3 ∘ P 2 ∘ P 1$ is also continuous because of the continuity of mappings $P 3$ and $P 2 ∘ P 1$.

We proved that the composite mapping $P 3 ∘ P 2 ∘ P 1$ is continuous. Note that we omitted the special case $φ 0 ( t 0 )∈∂ω( t 0 )$ (which is equivalent to $t 0 = t 0$). However, this part can be shown in an analogous and simpler way to the one used above.

Now we are able to finish the proof. We proved that

$P:= P 3 ∘ P 2 ∘ P 1 :B→A,$

where $A:= ∂ y Ω | t = t 0$, $B:={( t 0 ,y):y∈ ω ¯ ( t 0 )}$ is continuous. Moreover,

$P:A→A$

is an identity mapping. In this situation, we have proved that there exists a retraction of the set B onto the set A (see Definition 3). In view of the above-mentioned fact, this is impossible. Our assumption is false and there exists initial problem (7) such that the corresponding solution $y= y ∗ (t)$ satisfies (8) for every $t∈ [ α 0 , ∞ ) T$. The theorem is proved. □

4 Example

Let us consider a dynamic system of type (1)

$y 1 Δ ( t ) = f 1 ( t , y 1 ( τ 1 ( t ) ) , y 2 ( τ 2 ( t ) ) ) y 1 Δ ( t ) = y 1 4 ( τ 1 ( t ) ) + cos ( t y 2 ( τ 2 ( t ) ) ) t 3 + y 2 ( τ 2 ( t ) ) t 2 + 1 ,$
(14)
$y 2 Δ ( t ) = f 2 ( t , y 1 ( τ 1 ( t ) ) , y 2 ( τ 2 ( t ) ) ) y 2 Δ ( t ) = y 1 ( τ 1 ( t ) ) t 2 + y 2 6 ( τ 2 ( t ) ) + sin ( y 2 ( τ 2 ( t ) ) ) t 3 + 2$
(15)

defined for each $t∈ [ 1 , ∞ ) T$ with $T= { 2 n } n = 0 ∞$. Note that in this case $μ(t)=t$. Let delays be defined as follows:

$τ 1 (t)= t 2 , τ 2 (t)= t 4 .$

Let, moreover, $t 0 ≥16$, $t 0 ∈T$ and $α 0 =min{ τ 1 ( t 0 ), τ 2 ( t 0 )}= τ 2 ( t 0 )= t 0 /4$.

With the aid of Theorem 2, we will show that there exists an initial function $φ ∗$,

$φ i ∗ (t)∈ ( − t − 1 , t − 1 ) ,t∈ [ α 0 , t 0 ] T ,i=1,2,$
(16)

which defines a solution y for all $t∈ [ α 0 , ∞ ) T$ of dynamic system (14), (15) satisfying

$| y i ( t ) | < t − 1 ,i=1,2.$
(17)

We define Δ-differentiable functions $b i , c i :T→R$, $i=1,2$, satisfying $b i (t)< c i (t)$ for each $t∈ [ α 0 , ∞ ) T$ as

$b i (t):=− t − 1 , c i (t):= t − 1$

and

$Ω:= { ( t , y ) : t ∈ [ α 0 , ∞ ) T , − t − 1 < y i < t − 1 , i = 1 , 2 } .$

We will verify that every point $M∈ ⋃ i = 1 2 ( Ω B i ∪ Ω C i )$, where

$Ω B i : = { ( t , y ) ∈ ∂ y Ω : y i = − t − 1 , i = 1 , 2 } , Ω C i : = { ( t , y ) ∈ ∂ y Ω : y i = t − 1 , i = 1 , 2 } ,$

is a point of strict egress for the set Ω with respect to the dynamic system (14), (15).

(1a) Let $(t, b 1 (t), y 2 )∈ Ω B 1$. For arbitrary functions $u 1 , u 2 : [ α t , t ] T →R$, $t∈ [ t 0 , ∞ ) T$ such that (for $j=1,2$) $b j (s)< u j (s)< c j (s)$, $s∈ [ α t , t ) T$ and $u 1 (t)= b 1 (t)$, $b 2 (t)≤ u 2 (t)≤ c 2 (t)$, we need (see (4))

$u 1 4 ( τ 1 ( t ) ) + cos ( t u 2 ( τ 2 ( t ) ) ) t 3 + u 2 ( τ 2 ( t ) ) t 2 + 1 < ( − 1 t ) Δ .$
(18)

(1b) Let $(t, c 1 (t), y 2 )∈ Ω C 1$. For arbitrary functions $u 1 , u 2 : [ α t , t ] T →R$, $t∈ [ t 0 , ∞ ) T$ such that (for $j=1,2$) $b j (s)< u j (s)< c j (s)$, $s∈ [ α t , t ) T$ and $u 1 (t)= c 1 (t)$, $b 2 (t)≤ u 2 (t)≤ c 2 (t)$, we need (see (5))

$u 1 4 ( τ 1 ( t ) ) + cos ( t u 2 ( τ 2 ( t ) ) ) t 3 + u 2 ( τ 2 ( t ) ) t 2 + 1 > ( 1 t ) Δ .$
(19)

Inequalities (18) and (19) are valid if the inequality

$| u 1 4 ( τ 1 ( t ) ) + cos ( t u 2 ( τ 2 ( t ) ) ) t 3 + u 2 ( τ 2 ( t ) ) t 2 + 1 |< ( − 1 t ) Δ$

holds for arbitrary $u j$ such that $− t − 1 ≤ u j (t)≤ t − 1$, $t∈ [ t 0 , ∞ ) T$, $j=1,2$ ($t 0 ≥16$). Indeed,

$| u 1 4 ( τ 1 ( t ) ) + cos ( t u 2 ( τ 2 ( t ) ) ) t 3 + u 2 ( τ 2 ( t ) ) t 2 + 1 | ≤ 1 ( t / 2 ) 4 + 1 t 3 + 1 ( t / 4 ) ( t 2 + 1 ) < 1 2 t 2 = 1 t ( t + μ ( t ) ) = ( − 1 t ) Δ .$

(2a) Let $(t, y 1 (t), b 2 (t))∈ Ω B 2$. For arbitrary functions $u 1 , u 2 : [ α t , t ] T →R$, $t∈ [ t 0 , ∞ ) T$ such that (for $j=1,2$) $b j (s)< u j (s)< c j (s)$, $s∈ [ α t , t ) T$ and $u 2 (t)= b 2 (t)$, $b 1 (t)≤ u 1 (t)≤ c 1 (t)$, we need (see (4))

$u 1 ( τ 1 ( t ) ) t 2 + u 2 6 ( τ 2 ( t ) ) + sin ( u 2 ( τ 2 ( t ) ) ) t 3 + 2 < ( − 1 t ) Δ .$
(20)

(2b) Let $(t, y 1 (t), c 2 (t))∈ Ω C 2$. For arbitrary functions $u 1 , u 2 : [ α t , t ] T →R$, $t∈ [ t 0 , ∞ ) T$ such that (for $j=1,2$) $b j (s)< u j (s)< c j (s)$, $s∈ [ α t , t ) T$ and $u 2 (t)= c 2 (t)$, $b 1 (t)≤ u 1 (t)≤ c 1 (t)$, we need (see (5))

$u 1 ( τ 1 ( t ) ) t 2 + u 2 6 ( τ 2 ( t ) ) + sin ( u 2 ( τ 2 ( t ) ) ) t 3 + 2 > ( 1 t ) Δ .$
(21)

Inequalities (20) and (21) are valid if the inequality

$| u 1 ( τ 1 ( t ) ) t 2 + u 2 6 ( τ 2 ( t ) ) + sin ( u 2 ( τ 2 ( t ) ) ) t 3 + 2 |< ( − 1 t ) Δ$

holds for arbitrary $u j$ such that $− t − 1 ≤ u j (t)≤ t − 1$, $t∈ [ t 0 , ∞ ) T$, $j=1,2$ ($t 0 ≥16$). Indeed,

$| u 1 ( τ 1 ( t ) ) t 2 + u 2 6 ( τ 2 ( t ) ) + sin ( u 2 ( τ 2 ( t ) ) ) t 3 + 2 | ≤ 1 t 2 ( t / 2 ) + 1 ( t / 4 ) 6 + 1 t 3 + 2 < 1 2 t 2 = 1 t ( t + μ ( t ) ) = ( − 1 t ) Δ .$

In view of Definition 2, every point $M∈ ⋃ i = 1 2 ( Ω B i ∪ Ω C i )$ is a point of strict egress for the set Ω. Therefore, all the assumptions of Theorem 2 hold and there exists an initial value function $φ ∗$ with property (16) such that the initial problem $y(t)= φ ∗ (t)$ defines a solution y on the interval $[ α 0 , ∞ ) T$ of dynamic system (14), (15) satisfying inequalities (17) for every $t∈ [ α 0 , ∞ ) T$. This solution (due to (17)) tends to zero as $t→∞$.

Remark 2 Note that the choice $T= { 2 n } n = 0 ∞$ in the previous example is not important, and system (14), (15) can be considered on an arbitrary time scale $T$ with $μ(t)=O(t)$ (it means that there exists $q>1$ such that $μ(t)≤(q−1)t$ for each $t∈T$). Indeed, let us slightly modify the previous example. Consider system (14), (15) on an arbitrary time scale with $μ(t)=O(t)$. (For example, $T= { q n } n = 0 ∞$ with $q>1$ satisfies this condition.) Let, moreover, $τ 1 =t/q$, $τ 2 =t/ q k$ with $q>1$, $k∈N$. Then one can show that all calculations used in the previous example are true for sufficiently large $t 0 ∈T$.

5 Concluding remarks

The difference between delay dynamic equations and non-delay dynamic equations (resp. a system of delay dynamic equations and a system of non-delay dynamic equations) with respect to controlling their solutions is as follows. The conditions on the function f to get a bounded solution in a ‘delay’ case are a little bit harder than in a ‘non-delay’ case. More precisely, the bigger the delays $τ i$ are, the harder it is to construct a set Ω of considered equations to get a bounded solution $y∈Ω$. The reason is that in a delay case the history of solutions plays an important role and influences conditions for points, which are strict egress with respect to the investigated equation. It corresponds to the form of Definition 2, where functions $u i (t)$ have to satisfy some conditions before they touch or pass the boundary of the set Ω.

A further possible complication in dynamic equations (resp. a system of dynamic equations) - the graininess of the time scale $T$ - was discussed in . Moreover, it is obvious that the bigger the graininess is, the bigger the delays are. This fact also implies a problem to control the solution to stay in domain Ω.

Finally, let us consider initial problem (1), (2) with $τ i (t)=t$ for every $i=1,…,n$. In this case, we get a non-delay dynamic system and the initial function φ defined in (2) can be replaced by the initial condition $y( t 0 )= y 0$. Moreover, in this case, carefully tracing the proof of Theorem 2, we can observe that it does not need any change. Hence we can say that Theorem 2 generalizes a result given in  as well.

References

1. 1.

Hilger, S: Ein Masskettenkalkül mit Anwendung auf Zentrumsmannigfaltigkeiten. PhD thesis, Universität Würzburg (1988)

2. 2.

Hilger S: Analysis on measure chains - a unified approach to continuous and discrete calculus. Results Math. 1990, 18: 18-56. 10.1007/BF03323153

3. 3.

Bohner M, Peterson A: Dynamic Equations on Time Scales. Birkhäuser, Basel; 2001.

4. 4.

Karpuz B: Existence and uniqueness of solutions to systems of delay dynamic equations on time scales. Int. J. Math. Comput. 2011, 10(M11):48-58. (Special volume)

5. 5.

Diblík J: Discrete retract principle for systems of discrete equations. Comput. Math. Appl. 2001, 42: 515-528. 10.1016/S0898-1221(01)00174-2

6. 6.

Diblík J: Retract principle for difference equations. In Communications in Difference Equations: Proceedings of the Fourth International Conference on Difference Equations. Edited by: Elaydi S, Ladas G, Popenda J, Rakowski J. Gordon & Breach, New York; 2000:107-114. Poznan, Poland, 27-31 August 1998

7. 7.

Diblík J, Růžičková M, Šmarda Z: Ważewski’s method for systems of dynamic equations on time scales. Nonlinear Anal. 2009, 71: e1124-e1131. 10.1016/j.na.2009.01.098

8. 8.

Diblík J, Růžičková M, Václavíková B: A retract principle on discrete time scales. Opusc. Math. 2006, 26(3):445-455.

9. 9.

Diblík J, Vítovec J: Bounded solutions of delay dynamic equations on time scales. Adv. Differ. Equ. 2012., 2012: Article ID 183 10.1186/1687-1847-2012-183

10. 10.

Baštinec J, Diblík J, Zhang B: Existence of bounded solutions of discrete delayed equations. In Proceedings of the Sixth International Conference on Difference Equations. CRC Press, Boca Raton; 2004:359-366.

11. 11.

Gabor G, Ruszkowski S: Ważewski theorem on time scales with a set of egress points that is not the whole boundary. Nonlinear Anal. 2012, 75: 6541-6549. 10.1016/j.na.2012.07.033

12. 12.

Borsuk K: Theory of Retracts. PWN, Warsaw; 1967.

13. 13.

Ważewski T: Sur un principe topologique de l’examen de l’allure asymptotique des intégrales des équations différentielles ordinaires. Ann. Soc. Pol. Math. 1947, 20: 279-313.

Acknowledgements

The first author was supported by Grant No. P201/10/1032 of Czech Grant Agency (Prague). The second author was supported by the project CZ.1.07/2.3.00/30.0039 of Brno University of Technology. The work of the first author was partially realized in CEITEC - Central European Institute of Technology with research infrastructure supported by the project CZ.1.05/1.1.00/02.0068 financed from European Regional Development Fund.

Author information

Correspondence to Josef Diblík.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

Both authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions 