MathIsimple

Stochastic Processes – Problem 41: Prove that, with probability one, the set of local extrema of a standard Brownian path is…

Question

Prove that, with probability one, the set of local extrema of a standard Brownian path is dense. (Note: A point t is a local extremum if and only if there exists an open neighborhood containing that point such that the maximum of the Brownian path in that neighborhood is attained at t.)

Step-by-step solution

Step 1. Let DD denote the collection of all open intervals in [0,)[0, \infty) with rational endpoints. Since the rationals are countable, DD is also countable; write D={In}n=1D = \{I_n\}_{n=1}^{\infty}, where In=(an,bn)I_n = (a_n, b_n) with 0an<bn0 \le a_n < b_n. For any fixed interval [a,b][a, b], because the sample paths of standard Brownian motion BtB_t are almost surely continuous on [0,)[0, \infty), by the Weierstrass theorem a continuous function on the closed interval [a,b][a, b] must attain its maximum. Denote the time at which this maximum is attained by TmaxT_{max}, i.e., BTmax=supt[a,b]BtB_{T_{max}} = \sup_{t \in [a, b]} B_t.

Step 2. Use properties of Brownian motion to show that the maximum is almost surely not attained at an endpoint. For any fixed time t0t \ge 0, by the law of the iterated logarithm or local properties of Brownian motion, for any ϵ>0\epsilon > 0 we almost surely have sups(t,t+ϵ)Bs>Bt\sup_{s \in (t, t+\epsilon)} B_s > B_t. This means that for the fixed left endpoint aa, there almost surely exists s(a,b)s \in (a, b) with Bs>BaB_s > B_a, so TmaxaT_{max} \neq a. Similarly, for the fixed right endpoint bb, there almost surely exists s(a,b)s \in (a, b) with Bs>BbB_s > B_b, so TmaxbT_{max} \neq b. In summary, for any given nn, the maximum point τn\tau_n on [an,bn][a_n, b_n] almost surely lies in (an,bn)(a_n, b_n).

Step 3. Since τn(an,bn)\tau_n \in (a_n, b_n) and τn\tau_n is the point at which BtB_t attains its maximum on [an,bn][a_n, b_n], there exists an open neighborhood (an,bn)(a_n, b_n) in which the maximum of BtB_t is attained at τn\tau_n. By the definition given in the problem, τn\tau_n is a local extremum (local maximum). Define the event EnE_n as "the Brownian path has a local extremum in the interval InI_n." By the above analysis, P(En)=1P(E_n) = 1.

Step 4. Let EE denote the event "the set of local extrema is dense in [0,)[0, \infty)." This event is equivalent to every open interval InI_n containing at least one local extremum, i.e., E=n=1EnE = \bigcap_{n=1}^{\infty} E_n. Since P(En)=1P(E_n) = 1 and {En}\{E_n\} is a countable collection, by properties of probability measures the intersection of countably many probability-one events still has probability one. Therefore P(E)=P(n=1En)=1P(E) = P(\bigcap_{n=1}^{\infty} E_n) = 1. That is, with probability 1, the set of local extrema of a standard Brownian path is dense.

Final answer

QED.

Marking scheme

The following is a detailed rubric based on the official solution.


1. Checkpoints (max 7 pts total)

Group 1: Measure-theoretic framework and topological reduction (1 pt)

  • Introduce a countable basis [1 pt]: Explicitly define a countable collection of open intervals (e.g., intervals with rational endpoints {In}\{I_n\}), and state that proving density is equivalent to showing the Brownian path has an extremum in each InI_n.
  • *If "countable" or "rational endpoints" is not mentioned, this point is not awarded, and a deduction applies.*

Group 2: Extremum analysis within a single interval (5 pts)

  • Continuity implies attainment of maximum [1 pt]: State that since BtB_t has continuous sample paths, the global maximum on [a,b][a, b] is attained.
  • Excluding endpoints (Core) [3 pts]: Prove the maximum is almost surely not at endpoints aa or bb.
  • 3 pts: Rigorous argument citing LIL, local oscillation, strong Markov property, or continuity of running maximum distribution.
  • 1 pt: Only asserts without specific theorem.
  • 0 pts: Assumes Brownian motion is differentiable.
  • Local extremum established [1 pt]: If the maximum on [a,b][a,b] lies in (a,b)(a,b), it is a local extremum by definition.

Group 3: Global conclusion (1 pt)

  • Countable intersection property [1 pt]: Use P(En)=1P(\bigcap E_n) = 1 to obtain the final conclusion.

Total (max 7)


2. Zero-credit items

  • Merely restating the problem or claiming by intuition.
  • Attempting to prove Brownian motion is differentiable.
  • Merely listing E[Bt]=0E[B_t]=0 or Var(Bt)=tVar(B_t)=t without reasoning about extrema.

3. Deductions

  • Uncountable intersection error [Flat -2]: Not introducing countable intervals.
  • Missing probability qualifier [Cap at 5/7]: Treating the process as deterministic throughout.
  • Incorrect endpoint exclusion reasoning [Flat -1].
Ask AI ✨