• Keine Ergebnisse gefunden

5. From Uniform Stability to Instability 79

5.3. Transition - Stability Comes to an End

5.3.2. The End of Stability

xR R

xR R

xR R

F(x, νt)

G(x, tν)

νt= 0 νt(0,1) νt >1

(F+G)(x, νt)

Figure 10: Illustration of Example 5.32 part a). For the replacement system, a symmetric pitchfork bifurcation manifests attν= 2. Here,ε >0is some positive constant to illustrate the principle shape change of the potentialF+G.

The rest of the Assumption 5.30 is mostly a comfort of notation

• As we have seen in (5.2.12), using aν-adiabatic solution as reference provides a cor-rection term at most of order ν in the dierential law, see (5.2.13), (5.2.14). An additional term of that size can be dealt with similar to the treatment of 2σh√

t

within the proof of Theorem 5.35. This would lead to a modication of the family of successive upper bounds(βi?)i∈I at most of order|logν|. Setting xadν =x? ofν oblit-erates this minor inaccuracy. In other words, theν-adiabatic solution, which is dened with respect to the replacement system, from now on satises the delay dierential law when neglecting nonlinear terms.

• Moreover, the inaccuracy in the denition of time points, see e.g. Remark 5.3, comes to an end.

Example 5.32. The following two examples serve as paragons for our study concerning the transition phase.

a) An instance of a delayed symmetric pitchfork bifurcation that satises all requirements of Assumption 5.30 except for c2), and also uniformly vanishing quadratic nonlinearity, that we will consider in Subsection 5.3.4, is given by

F(x, tν) :=

Z x 0

f(y, tν)dy=x4+ 2x2, G(x, tν) :=

Z x 0

g(y, tν)dy=−(1 +νt)x2





forx∈R, t∈[0, T].

Here, xadν(·) = 0 is an adiabatic solution that follows the equilibrium branch x?(·) = 0 over the whole time interval. The equilibrium branch x? is uniformly stable up to any timet∈(0,1) and becomes unstable atνt= 1. See Figure 10 for an illustration.

b) Another example is given by the linear nonautonomous journey through the stability boundary which we have seen in Figure 4. Consider

dx(t) =−a(t)x(t)dt+b(t)x(t−r)dt+σdW(t) for all t∈[0, T /ν], x0= Υ,

where (a(t), b(t))[0,T /ν] leaves the area S˜ := {x, y ∈ R : x < −|y|} at t = T2/ν. See Figure 11.

−ar br

(r−1,−r−1)

S ˜

S

−4

−4

−3

−3

−2

−2

−1

−1

1 1

2 2

(a(t), b(t))

Figure 11: Illustration for Example 5.32 b). The arrow-headed lines represent possible shapes of the coecient-combination paths((a(t)r, b(t)r)t∈[0,T /ν] through the boundary of S˜. The pale yellow area and the labels have been taken over from Figure 4 for comparability. The parameter-combination journey, that corresponds to the dotted double-arrow headed line, is covered by our results, while the actual analytic area of stabilityS is not left in the case of the dotted line, when the combination escapes fromS.˜

We introduce a time-dependent noise amplier

F : [T1/ν, T2/ν]→[0,1]adapted and bounded by1.

The reason for this slight extension is that it simplies the work on the upcoming time interval, when the system turns slowly increasingly unstable. The Gaussian nature of lin-earizations stays untouched by this. Further, as a notational update, for this subsection we will denote

a+:= sup

t∈[T1/ν,T2/ν]

a(t)≥ sup

t∈[T1/ν,T2/ν]

b(t) =:b+.

Starting fromT1/ν, we keep denoting the deviation process asy, given as the unique solution of









dy(t) = −a(t)y(t) +b(t)y(t−r) +Rf(y(t), νt) +Rg(y(t−r), νt)

dt+σF(t)dW(t) fort≥T1/ν, yT1= Υ,

for some appropriateΥ∈ C(J,R). And we keep thinking of yas the deviation process of a solution of (5.1.3) from the ν-adiabatic solutionxadν = 0. Due to the previous subsection we conveniently assume thatkΥk ∈ O(√

ν). For somen∈N, let (θi :i∈ {0,1, . . . , n−1}) withT1/ν=θ0< θ1< . . . < θn=T2/νdenote the equidistant partition of[T1/ν, T2/ν]into n pieces with step width t = T2−T1, where n is chosen big enough such that t < r at least. Informally speaking, in timeT1/ν, there are T2−Tν 1 time units left before the stability

is lost and the system has completed the transition to a possibly critical or unstable regime, i.e., |b(s)|a(s) ≥1. To be precise at that point, criticality or instability of the linearized system frozen in T2/ν is only reached in case of positive delayed feedbacka(T2/ν) =b(T2/ν)>0, represented through the pale yellow overhang in Figure 11. But the deduced estimates apply just as well for the case b(T2/ν) =−a(T2/ν)<0. For a nondecreasing family of constants 0< β0≤β1≤. . .≤βn, let

τβ(x) = inf (

t∈[T1/ν, T2/ν] :|y(t)|>

n−1

X

i=0

βi1ii+1](t) )

. (5.3.4)

We continue to denoteI:={0, . . . , n−1}. For an appropriate choice of(βi)i∈I we are going to show that

|y(t)| ≤βi for allt∈[θi, θi+1] andi∈I with high probability.

For alli∈Iwe dene the linear nonautonomous piecewise approximation(Y(i)(t))t∈[θi−r,θi+1] as the unique solutions of

dY(i)(t) =−a(t)Y(i)(t) +b(t)Y(i)(t−r)dt+σF(t)dW(t) fort∈[θi, θi+1], Yθ(i)

i =yθi, (5.3.5)

each of which admits a representation through the variation-of-constants formula, see The-orem 3.5. To that end, let ( ˇY(t, u) : u ∈ [T1/ν−r, T2/ν], t ∈ [u−r, T2/ν]) denote the fundamental solution corresponding to the dierential law of (5.3.5) initiated at some u, and evaluated at t. Within a regime with a(·) > |b(·)|, through a simple contradiction argument as in Lemma 4.1, we may deduce that

|Yˇ(t, u)| ≤1 for allu∈[T1/ν−r, T2/ν], t∈[u−r, T2/ν]. (5.3.6) Let further denote(Tdet(t, u) :u∈[T1/ν, T2/ν], u−r≤t)denote the solution semi group, that maps from J to R, of the deterministic counterpart of system (5.3.5), initiated atu and evaluated in t. Then, we may rewrite the approximation for eachi∈I as

Y(i)(t) =Tdet(t, θi)yθi+σξ(i)(t) with ξ(i)(t) :=

Z t θi

Yˇ(t, u)F(u)dW(u) for allt∈[θi, θi+1].

(5.3.7)

The rst summand is the solution of the deterministic version of (5.3.5) and as long as a(·)>|b(·)|, analogue to (5.3.6), it is easy to check that

|Tdet(t, θi)yθi| ≤ kyθik= sup

u∈[−r,0]

|y(θi+u)| ≤ sup

u∈[T1/ν−r,θi]

|y(u)| for allt∈[θi, θi+1].

The second summand(ξ(i)(t))t∈[θii+1] solves

(i)(t) = −a(t)ξ(i)(t) +b(t)ξ(i)(t−r)

dt+σF(t)dW(t) fort∈[θi, θi+1], ξ(i)θ

i = 0,

and actually forms a Gaussian process for everyi∈I. Then, an application of the Fernique

inequality provides the following lemma.

Lemma 5.33. For h >p

1 + 4 logp where p∈N with √

p logp≥4(a+t+ 1), (5.3.8) we have that

P (

sup

t∈[θii+1]

(i)(t)|> h2√ t

)

≤ 5p2 2 eh

2

2 for alli∈I.

Proof. We x i∈I, writeY(i) =Y, and focus on ( ˇY(t, u) :u∈[θi, θi+1], t≥u−r). The Fernique parametersQ=Qξ(i) andΓ = Γξ(i) are easily obtained. We nd that

kΓk= sup

s∈[0,t]

E

ξ(i)i+s)2

= sup

s∈[0,t]

Z s 0

2i+s, θi+u)F2i+u)du

≤ Z t

0

F2i+u)du≤t.

Further, rewriting s=s−θi, t=t−θi and formally substitutingv =u−θi, it is easy to see that

E

"

Z t θi

Yˇ(t, u)F(u)dW(u)− Z s

θi

Yˇ(s, u)F(u)dW(u) 2#

= Z s

θi

Yˇ(t, u)−Yˇ(s, u)2

F2(u)du+ Z t

s

2(t, u)F2(u)du

≤ Z s

0

Yˇ(θi+t, θi+v)−Yˇ(θi+s, θi+v)2 dv+

Z t s

2i+t, θi+v)dv for alls, t,∈[θi, θi+1], i.e., s, t∈[0, t].

Then, with (5.3.6) we nd that Z s

0

Yˇ(θi+t, θi+v)−Yˇ(θi+s, θi+v)2 dv

= Z s

0

Z t−s 0

−a(θi+s+u) ˇY(θi+s+u, θi+v) +b(θi+s+u) ˇY(θi+s+u−r, θi+v)du

2

dv

≤(a++b+)2t(t−s)2≤4a2+t(t−s)2 for alls, t∈[0, t], s≤t.

And it is easy to see that Z t

s

2i+t, θi+v)dv≤t−s for alls, t∈[0, t], s≤t.

Therefore, with a glimpse at the previously used notation in (3.4.10) and (3.4.11), and the formulas from the Appendix A.2, we obtain that

Q1≤2a+

√t

Z 1

tp−u2du≤ 2a+t3/2

2plogp and Q2≤ Z

1

√tpu

2 2 du≤

√t

√plogp.

Finally, we may deduce from the condition on the minimal size of p, which we stated in (5.3.8), that

pkΓk +Q(t)≤√

t + 2 +√ 2

√t

√plogp+ a+t

3 2

plogp

!

=√ t

1 + (2 +√ 2 )

1

√plogp+ a+t plogp

≤2√ t. And the claim follows through an application of the Fernique inequality.

Let us denote τ2h(i)t

:= infn

t∈[θi, θi+1] :|ξ(i)(t)|>2h√ t

o for alli∈I, h >0, τ2ht

(ξ) := minn τ(i)

2h

t :i∈Io

for allh >0. (5.3.9) Then obviously, forhandpsatisfying (5.3.8), we have that

P

τ2ht(ξ)< T2/ν ≤n5p2 2 exp

−h2 2

, (5.3.10)

which makes the below Corollary is just as obvious. It states the result if we plug in the previous corollary into representation (5.3.7).

Corollary 5.34. For h >0 andp∈N satisfying (5.3.8), we have that

|Y(i)(t)| ≤ sup

u∈[T1/ν−r,θi]

|y(u)|+h2σ√ t

for allt∈[θi, θi+1], t≤τ2ht(ξ), i∈I.

AndP{τ2ht(ξ)< T /ν} ≤3np2exp(−h2/2). Further, for alli∈Iwe dene

Z(i)(t) :=y(t)−Y(i)(t) for allt∈[θi, θi+1]. (5.3.11) whichP-almost surely solves

dZ(i)(t)

dt =−a(t)Z(i)(t) +b(t)Z(i)(t−r) +Rf(y(t), νt) +Rg(y(t−r), νt)fort∈[θi, θi+1), Zθ(i)

i = 0.

By Theorem 3.5 the pieces(Z(i)(t))t∈[θii+1] also admit respective representations through the variation-of-constants formula in terms of the previously dened fundamental solution Zˇ(t, u) = ˇY(t, u), u∈ [θi, T /ν], t ∈ [u−r, T /ν], characterized through its dierential law (5.3.5). Namely,(Z(i)(t))t∈[θii+1] may be written as

Z(i)(t) = Z t

θi

Z(t, u)ˇ

Rf(y(u), νu) +Rg(y(u−r), νu)

du for allu∈[θi, θi+1), i∈I.

Here, the fact thatf andg are supposed to be odd functions atT2/ν comes into play and

serves through (5.3.3) that

Z(i)(t)<

Z t θi

√ν|logν|N˜fy2(u) +√

ν|logν|N˜gy2(u−r) +Mfy3(u) +Mgy3(u−r)du

≤t

ν|logν| sup

u∈[T1/ν−r,θi+1]

|y(u)|

!2

+tM sup

u∈[T1/ν−r,θi+1]

|y(u)|

!3

for allt∈[θi, θi+1], t≤τ2ht

(ξ), i∈I.

And therefore,

|y(t)|< sup

u∈[T1/ν−r,θi]

|y(u)|+ 2hσ√ t +√

ν|logν|N˜ sup

u∈[T1/ν−r,θi+1]

|y(u)|

!2

t

+M sup

u∈[T1/ν−r,θi+1]

|y(u)|

!3 t

for allt∈[θi, θi+1], t≤τ2ht(ξ), i∈I.

(5.3.12) Theorem 5.35. In the situation of Assumption 5.30 let (θi : i ∈ {0, . . . , n−1}) denote the equidistant partition of [T1/ν, T2/ν] with step widtht= n1,2ν|logν|< r. Assume that there isk >0such thatkyT1k< k√

ν. Assume further forh=O log

1,2

ν |logν| that ν andσ < |logνν|2 are small enough such that there is K > k, independent ofν, with

e16νtK( ˜N|logν|+M K)

∆1,2 t

ν|logν|

k+2σh√ t

√ν

1,2 t

√ν |logν|

< K. (5.3.13)

Dene the family of increasing constants(β?i)i∈{−1,0,1,...,n−1} inductively through

β−1? :=k√ ν ,

βi?:=β?i−1 1 + 16νtK( ˜N|logν|+M K)

+ 2σh√

t fori∈I, (5.3.14) and suppose thatσ andν are small enough such that

4( ˜N|logν|+M K)√

ν ti−1? + 2hσ√

t)<1 for alli∈I, (5.3.15) K√

ν < 1

2( ˜N|logν|+M K)√ ν t

, (5.3.16)

2hσ√

t ≤k√

ν . (5.3.17)

Then, the following assertions hold true:

a) We have that βn−1? ≤K√ ν.

b) For all i∈I we have thatβi?≥βi−1? + 2hσ√

t + ˜N√

ν|logν|(βi?)2+M(βi?)3.

c) The family (βi?)i∈{−1,0,1,...,n−1} constitutes an upper bound for y, i.e.|y(t)| ≤βi? for all t∈[θi, θi+1] and{−1, . . . , n−1} as long ast < τ2hσt and (5.3.10) holds true.

Proof. a) The simple recursion formula for(βi?)i∈I can be explicitly solved and serves βi?−1?

1 + 16νtK( ˜N|logν|+M K)i+1 + 2hσ√

t i

X

j=0

(1 + 16νtK( ˜N|logν|+M K))j for alli∈I.

Using that(1+x)≤ex, we receive an upper boundary forβn−1? forn= t1,2

ν|logν|through βi?≤βn−1? ≤β−1? e16νtK( ˜N|logν|+M K)

∆1,2 t

ν|logν|

+ ∆1,2 t

√ν |logν|2hσ√

te16νtK( ˜N|logν|+M K)

∆1,2 t

ν|logν|

. And therefore,

β?n−1<√

ν e16νtK( ˜N|logν|+M K)

∆1,2 t

ν|logν|

k+2σh√ t

√ν

1,2

t

√ν |logν|

. Note that this was assumed to be less or equal to K√

ν in (5.3.13).

b) In a rst step, we show thatβ?i ≥βi−1? + 2hσ√

t + ( ˜N|logν|+M K)√

ν(β?i)2t. For i∈Irewriting the desired inequality with the notation R:= ( ˜N|logν|+M K)yields

βi?≥βi−1? + 2hσ√

t +R√

ν(βi?)2t

⇔(βi?)2− 1 R√

ν t

β?i + 1 R√

ν t

βi−1? + 2hσ√ t

≤0. (5.3.18) Then through inequality (5.3.15) on the size of σ, inequality (5.3.18) is true for βi? ∈ [βi(?1), βi(?2)], where

β(?1)i = 1 2R√

ν t

− s 1

4R2νt2 − 1 R√

ν t

βi−1? + 2hσ√ t

= 1

2R√ ν t

− 1

2R√ ν t

s

1− 4R2νt2 R√

ν t

βi−1? + 2hσ√ t

, and

βi(?2)= 1 2R√

ν t + s 1

4R2νt2 − 1 R√

ν t βi−1? + 2hσ√ t

=O 1

√ν t

.

We use the fact that√

1−x >1−x2x22 forx∈(0,1) and obtain that β(?1)i < 1

2R√ ν t

− 1

2R√ ν t

1−2R√

ν ti−1? + 2hσ√ t)

−8R2νt2i−1? + 2hσ√ t)2

i−1? + 2hσ√

t + 4R√

ν ti−1? + 2hσ√ t)2.

Then, through (5.3.17) we know thatσis small enough such that 2hσ√

t ≤β−1? ≤β?i−1 for alli∈I.

Hence, the squared-parentheses term satises (βi−1? + 2σh√

t)2≤4(βi−1? )2≤4K√ ν βi−1? . Then, we receive that

βi(?1)< βi−1? + 2hσ√

t + 16KRνtβ?i−1

i−1? (1 + 16K( ˜N|logν|+M K)νt) + 2hσ√

ti?. And by assumption (5.3.16), we have that

βi?≤βn−1? ≤K√

ν < 1 2R√

ν t

≤β(?2)i for alli∈I.

Therefore,βi? satises the desired inequality (5.3.18).

c) Letτβ?(y)be dened as in (5.3.4). From (5.3.12) we know that

|y(t)|< βi−1? + 2hσ√

t + ˜N|logν|√

ν(βi?)2t+M(β?i)3t

for allt < τβ?

i(y), t∈[θi, θi+1], t≤τ2ht

(ξ), i∈I, while

βi−1? + 2hσ√

t + ˜N|logν|√

ν(βi?)2+M(βi?)3t≤β?i fort∈[θi, θi+1], t≤τ2ht(ξ), i∈I, which actually shows thatτβ?(y)> τ2ht(ξ)providing that

|y(t)| ≤β?i for allt∈[θi, θi+1], t≤τ2ht(ξ), i∈I.

The three assumptions (5.3.15), (5.3.16), (5.3.17) do not raise any further issue. The rst one is in principle justied through a) sinceνis considered to be small. Assumption (5.3.16) is also naturally fullled for suciently smallν, and so is Assumption (5.3.17), because we assumed thatσ < ν.

Remark 5.36. In particular, |y(t)| will not exceed a size of order √

ν before stability is ultimately lost (with high probability) if σ≤ |logνν|2.