Pullback attractor

From testwiki
Jump to navigation Jump to search

Template:More footnotes In mathematics, the attractor of a random dynamical system may be loosely thought of as a set to which the system evolves after a long enough time. The basic idea is the same as for a deterministic dynamical system, but requires careful treatment because random dynamical systems are necessarily non-autonomous. This requires one to consider the notion of a pullback attractor or attractor in the pullback sense.

Set-up and motivation

Consider a random dynamical system φ on a complete separable metric space (X,d), where the noise is chosen from a probability space (Ω,β„±,β„™) with base flow ϑ:ℝ×ΩΩ.

A naΓ―ve definition of an attractor π’œ for this random dynamical system would be to require that for any initial condition x0X, φ(t,ω)x0π’œ as t+. This definition is far too limited, especially in dimensions higher than one. A more plausible definition, modelled on the idea of an omega-limit set, would be to say that a point aX lies in the attractor π’œ if and only if there exists an initial condition, x0X, and there is a sequence of times tn+ such that

d(φ(tn,ω)x0,a)0 as n.

This is not too far from a working definition. However, we have not yet considered the effect of the noise ω, which makes the system non-autonomous (i.e. it depends explicitly on time). For technical reasons, it becomes necessary to do the following: instead of looking t seconds into the "future", and considering the limit as t+, one "rewinds" the noise t seconds into the "past", and evolves the system through t seconds using the same initial condition. That is, one is interested in the pullback limit

limt+φ(t,ϑtω).

So, for example, in the pullback sense, the omega-limit set for a (possibly random) set B(ω)X is the random set

ΩB(ω):={xX|tn+,bnB(ϑtnω)s.t.φ(tn,ϑtnω)bnxasn}.

Equivalently, this may be written as

ΩB(ω)=t0stφ(s,ϑsω)B(ϑsω).

Importantly, in the case of a deterministic dynamical system (one without noise), the pullback limit coincides with the deterministic forward limit, so it is meaningful to compare deterministic and random omega-limit sets, attractors, and so forth.

Several examples of pullback attractors of non-autonomous dynamical systems are presented analytically and numerically.[1]

Definition

The pullback attractor (or random global attractor) π’œ(ω) for a random dynamical system is a β„™-almost surely unique random set such that

  1. π’œ(ω) is a random compact set: π’œ(ω)X is almost surely compact and ωdist(x,π’œ(ω)) is a (β„±,ℬ(X))-measurable function for every xX;
  2. π’œ(ω) is invariant: for all φ(t,ω)(π’œ(ω))=π’œ(ϑtω) almost surely;
  3. π’œ(ω) is attractive: for any deterministic bounded set BX,
limt+dist(φ(t,ϑtω)(B),π’œ(ω))=0 almost surely.

There is a slight abuse of notation in the above: the first use of "dist" refers to the Hausdorff semi-distance from a point to a set,

dist(x,A):=infaAd(x,a),

whereas the second use of "dist" refers to the Hausdorff semi-distance between two sets,

dist(B,A):=supbBinfaAd(b,a).

As noted in the previous section, in the absence of noise, this definition of attractor coincides with the deterministic definition of the attractor as the minimal compact invariant set that attracts all bounded deterministic sets.

Theorems relating omega-limit sets to attractors

The attractor as a union of omega-limit sets

If a random dynamical system has a compact random absorbing set K, then the random global attractor is given by

π’œ(ω)=BΩB(ω),

where the union is taken over all bounded sets BX.

Bounding the attractor within a deterministic set

Crauel (1999) proved that if the base flow ϑ is ergodic and DX is a deterministic compact set with

β„™(π’œ()D)>0,

then π’œ(ω)=ΩD(ω) β„™-almost surely.

References

Template:Reflist

Further reading

Template:Authority control