MathIsimple

Stochastic Processes – Problem 2: Prove that with probability 1 there exist sequences with , such that and

Question

Let BtB_t be standard Brownian motion and let τ=sup{0t1:Bt=0}\tau = \sup\{0\le t\le1:B_t=0\}. Prove that with probability 1 there exist sequences tn<snt_n < s_n with tnτt_n \uparrow \tau, such that Btn<0B_{t_n} < 0 and Bsn>0B_{s_n} > 0.

Step-by-step solution

Step 1. Let τ=sup{t1:Bt=0}\tau = \sup\{t\le1:B_t=0\}. By continuity of Brownian paths, Bτ=0B_\tau = 0 almost surely.

Step 2. Brownian motion is symmetric: BtB_t and Bt-B_t have the same law. So it is enough to rule out one-sided behavior near τ\tau.

Step 3. Suppose, for contradiction, that with positive probability there exists δ>0\delta > 0 such that Bt0B_t \ge 0 for all t(τδ,τ)t \in (\tau-\delta, \tau). Then the path has no sign changes in that left neighborhood of τ\tau.

Step 4. This contradicts the local oscillation property of Brownian motion: in every nontrivial interval, almost surely the path attains both positive and negative values infinitely often. Therefore in every left neighborhood of τ\tau, there are times with negative and positive values.

Step 5. Hence we can choose sequences tn<sn<τt_n < s_n < \tau with tnτt_n \uparrow \tau, Btn<0B_{t_n} < 0, and Bsn>0B_{s_n} > 0 almost surely.

Final answer

QED.

Marking scheme

Checkpoints (max 7 points)

  • Definition and path continuity (1 pt): Correctly use τ=sup{t1:Bt=0}\tau=\sup\{t\le1:B_t=0\} and conclude Bτ=0B_\tau=0 a.s.
  • Symmetry reduction (2 pts): Use Brownian symmetry to reduce to one side and explain why that is sufficient.
  • Contradiction setup (1 pt): Assume one-sided sign behavior on a left neighborhood of τ\tau.
  • Core Brownian property (2 pts): Invoke the correct local oscillation/sign-change property of Brownian paths.
  • Sequence extraction (1 pt): Explicitly construct or state existence of sequences tn<snt_n < s_n, tnτt_n \uparrow \tau, with opposite signs.

Common deductions

  • Missing symmetry argument: deduct 2 points.
  • No rigorous contradiction step: deduct 2 points.
  • No final sequence statement: deduct 1 point.
Ask AI ✨