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 denote the collection of all open intervals in with rational endpoints. Since the rationals are countable, is also countable; write , where with . For any fixed interval , because the sample paths of standard Brownian motion are almost surely continuous on , by the Weierstrass theorem a continuous function on the closed interval must attain its maximum. Denote the time at which this maximum is attained by , i.e., .
Step 2. Use properties of Brownian motion to show that the maximum is almost surely not attained at an endpoint. For any fixed time , by the law of the iterated logarithm or local properties of Brownian motion, for any we almost surely have . This means that for the fixed left endpoint , there almost surely exists with , so . Similarly, for the fixed right endpoint , there almost surely exists with , so . In summary, for any given , the maximum point on almost surely lies in .
Step 3. Since and is the point at which attains its maximum on , there exists an open neighborhood in which the maximum of is attained at . By the definition given in the problem, is a local extremum (local maximum). Define the event as "the Brownian path has a local extremum in the interval ." By the above analysis, .
Step 4. Let denote the event "the set of local extrema is dense in ." This event is equivalent to every open interval containing at least one local extremum, i.e., . Since and is a countable collection, by properties of probability measures the intersection of countably many probability-one events still has probability one. Therefore . 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 ), and state that proving density is equivalent to showing the Brownian path has an extremum in each .
- *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 has continuous sample paths, the global maximum on is attained.
- Excluding endpoints (Core) [3 pts]: Prove the maximum is almost surely not at endpoints or .
- 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 lies in , it is a local extremum by definition.
Group 3: Global conclusion (1 pt)
- Countable intersection property [1 pt]: Use 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 or 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].