Math 2.0

Dynamical systems and ergodic theory Definition

Random dynamical system

Builds on Probability spaceMeasure-preserving transformationDynamical system

Definition

Let 𝕋\mathbb{T} be ℤ\Z, ℕ\N, ℝ\R or [0,∞)[0, \infty), and let (Ω,ℱ,P)(\Omega, \mathcal{F}, P) be a probability space. Let (θt)t∈𝕋(\theta_t)_{t \in \mathbb{T}} be a family of measure-preserving maps θt ⁣:Ω→Ω\theta_t \colon \Omega \to \Omega such that (t,ω)↦θtω(t, \omega) \mapsto \theta_t \omega is measurable, θ0=id⁡\theta_0 = \id and θs+t=θs∘θt\theta_{s + t} = \theta_s \circ \theta_t for all s,t∈𝕋s, t \in \mathbb{T}. Let XX be a measurable space. A random dynamical system on XX over θ\theta is a measurable map φ ⁣:𝕋×Ω×X→X\varphi \colon \mathbb{T} \times \Omega \times X \to X, written φ(t,ω)=φ(t,ω,⋅)\varphi(t, \omega) = \varphi(t, \omega, \cdot), such that for all ω∈Ω\omega \in \Omega:

  1. φ(0,ω)=id⁡X\varphi(0, \omega) = \id_X;
  2. φ(s+t,ω)=φ(t,θsω)∘φ(s,ω)\varphi(s + t, \omega) = \varphi(t, \theta_s \omega) \circ \varphi(s, \omega) for all s,t∈𝕋s, t \in \mathbb{T}.

Remarks

Clause 2 is the cocycle property. When Ω\Omega has one point, φ\varphi is an ordinary dynamical system. Often XX is a topological space and each φ(t,ω)\varphi(t, \omega) is required to be continuous.

Example: let f0,f1 ⁣:X→Xf_0, f_1 \colon X \to X be measurable maps. Let Ω={0,1}ℤ\Omega = \set{0, 1}^{\Z} with the product of the measures giving weight 12\frac{1}{2} to 00 and to 11, and let θt\theta_t be the tt-th power of the left shift, for t∈ℕt \in \N. Put φ(0,ω)=id⁡X\varphi(0, \omega) = \id_X and φ(n,ω)=fωn−1∘⋯∘fω1∘fω0\varphi(n, \omega) = f_{\omega_{n-1}} \circ \cdots \circ f_{\omega_1} \circ f_{\omega_0} for n≥1n \ge 1. Then φ(m+n,ω)\varphi(m + n, \omega) applies fω0,…,fωm−1f_{\omega_0}, \ldots, f_{\omega_{m-1}} and then fωm,…,fωm+n−1f_{\omega_m}, \ldots, f_{\omega_{m+n-1}}, and the second block is φ(n,θmω)\varphi(n, \theta_m \omega), so clause 2 holds.

Non-example: with the same data, ψ(n,ω)=fω0 n\psi(n, \omega) = f_{\omega_0}^{\,n} fails clause 2 when f0 2≠f1∘f0f_0^{\,2} \ne f_1 \circ f_0. Indeed, for ω0=0\omega_0 = 0 and ω1=1\omega_1 = 1, ψ(2,ω)=f0∘f0\psi(2, \omega) = f_0 \circ f_0, while ψ(1,θ1ω)∘ψ(1,ω)=f1∘f0\psi(1, \theta_1 \omega) \circ \psi(1, \omega) = f_1 \circ f_0.

Stochastic differential equations with suitable coefficients generate random dynamical systems with Ω\Omega the space of Brownian paths and θt\theta_t the shift of paths.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Dynamical system concept
  2. Measure-preserving transformation concept
  3. Probability space concept
  4. Random dynamical system definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Random_dynamical_system
About this page
TagYEFR2GGGJN
URIm2://YEFR2GGGJN
Kinddefinition
WritingW0 stub
MSC37H05, 37H10
DefinesRandom dynamical system
UsesProbability space, Measure-preserving transformation, Dynamical system

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.