Example 8.1.8 — occupation times of half-lines
ProvedDurrettProbability.donsker_occupationUnder the hypotheses of Durrett's Theorem 8.1.2, with a Brownian motion all of whose paths are continuous, and for any real level ,
where , the left-hand cardinality counts integer times, and the right-hand is Lebesgue measure.
At the limit law is the arcsine law, which is how Durrett's Theorem 4.9.6 for simple random walk becomes a statement about every mean-zero, finite-variance walk. This is the invariance principle of Erdős and Kac.
Formalization Note The count is written as a sum of indicator functions of evaluated at the partial sums, which equals the cardinality above and keeps a decidability side condition out of the statement. The index runs over , so is included; it contributes exactly when .
The limit is the Lebesgue measure of , converted from an extended non-negative real to a real number. The conversion is harmless: the set sits inside , so its measure is at most and in particular finite. Times are matched to the process by taking the non-negative part of , which on is itself.
The strict inequality is the book's; the level set has measure zero almost surely, which is exactly why the functional is almost surely continuous, so the strict and non-strict versions have the same limit — but only the strict one is asserted here.
import Mathlib import Definitions.Def_DurrettProbability_Brownian import Definitions.Def_DurrettProbability_Donsker open Filter MeasureTheory ProbabilityTheory open scoped NNReal Topology
namespace DurrettProbability
theorem donsker_occupation
{Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
{X : ℕ → Ω → ℝ} (hmeas : ∀ k, Measurable (X k)) (hindep : iIndepFun X P)
(hident : ∀ k, IdentDistrib (X k) (X 0) P P) (hint : Integrable (fun ω => X 0 ω ^ 2) P)
(hmean : ∫ ω, X 0 ω ∂P = 0) (hvar : ∫ ω, X 0 ω ^ 2 ∂P = 1)
{Ω' : Type*} [MeasurableSpace Ω'] {P' : Measure Ω'} [IsProbabilityMeasure P']
{B : ℝ≥0 → Ω' → ℝ} (hB : IsBrownianReal B P') (hBc : ∀ ω, Continuous fun t => B t ω)
(a : ℝ) :
TendstoInDistribution
(fun n : ℕ => fun ω => (n : ℝ)⁻¹ * ∑ m ∈ Finset.range (n + 1),
Set.indicator (Set.Ioi (a * Real.sqrt n)) (fun _ => (1 : ℝ))
(∑ k ∈ Finset.range m, X k ω))
atTop
(fun ω => (volume {t : ℝ | t ∈ Set.Icc (0 : ℝ) 1 ∧ a < B t.toNNReal ω}).toReal)
(fun _ => P) P' := by sorry
end DurrettProbabilityConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.