Dyadic scalar Brownian quadratic variation converges in mean square
AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.BrownianQuadraticVariationL2.tendsto_integral_dyadic_quadraticVariationError_sq · theorem · Teaching coverage
Mathematical statement
Let B be a real pre-Brownian process and T≥0. On the regular partition of [0,T] into 2^m equal cells, the expected square of the sum of squared increments minus their cell lengths tends to zero as m tends to infinity.
Lean statement · tendsto_integral_dyadic_quadraticVariationError_sq
The theorem quantifies over every nonnegative horizon and uses the canonical regular grid with 2^level cells, keeping IsPreBrownianReal explicit.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
theorem tendsto_integral_dyadic_quadraticVariationError_sq
(hB : IsPreBrownianReal B mu) (T : ℝ≥0) :
Tendsto
(fun level =>
∫ omega,
(quadraticVariationError B
(regularGridTimes (dyadicMesh T level) (2 ^ level)) omega) ^ 2 ∂mu)
atTop (nhds 0)Proof roadmap
- 1Specialize the finite-grid identity
Apply the exact finite-grid L² theorem to the regular grid with 2^m cells and mesh δ_m=T/2^m.
- 2Evaluate equal cell lengths
Every adjacent difference in the regular grid is exactly δ_m. The sum of 2^m equal squared lengths simplifies to Tδ_m.
- 3Let the dyadic mesh vanish
The canonical dyadic mesh tends to zero. Multiplication by the fixed nonnegative scalar 2T preserves the limit, so the exact error moment tends to zero.
Full assumptions and notation
All objects and hypotheses
- B satisfies Samplinglib's real pre-Brownian contract under μ.
- T is an arbitrary nonnegative real horizon; the theorem includes T=0.
- The grids are canonical deterministic dyadic regular grids. No filtration, adaptedness, usual conditions, or positive-horizon assumption is required.
Mathematical proof
1. Specialize the finite-grid identity
Apply the exact finite-grid L² theorem to the regular grid with 2^m cells and mesh δ_m=T/2^m.
Corresponding Lean step
Use integral_quadraticVariationError_sq with regularGridTimes_monotone.
2. Evaluate equal cell lengths
Every adjacent difference in the regular grid is exactly δ_m. The sum of 2^m equal squared lengths simplifies to Tδ_m.
Corresponding Lean step
Use regularGridTimes_cellLength and sum_dyadic_cellLengths_sq.
3. Let the dyadic mesh vanish
The canonical dyadic mesh tends to zero. Multiplication by the fixed nonnegative scalar 2T preserves the limit, so the exact error moment tends to zero.
Corresponding Lean step
Apply FiniteTimeGrid.dyadicMesh_tendsto_zero T and Tendsto.const_mul.
Lean verification
The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.
Lean proof · tendsto_integral_dyadic_quadraticVariationError_sq
The proof rewrites the exact finite-grid second moment as 2T times the dyadic mesh and passes to the known zero-mesh limit.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
theorem tendsto_integral_dyadic_quadraticVariationError_sq
(hB : IsPreBrownianReal B mu) (T : ℝ≥0) :
Tendsto
(fun level =>
∫ omega,
(quadraticVariationError B
(regularGridTimes (dyadicMesh T level) (2 ^ level)) omega) ^ 2 ∂mu)
atTop (nhds 0) := by
have hexact : ∀ level : ℕ,
(∫ omega,
(quadraticVariationError B
(regularGridTimes (dyadicMesh T level) (2 ^ level)) omega) ^ 2 ∂mu) =
2 * (T : ℝ) * ((dyadicMesh T level : ℝ≥0) : ℝ) := by
intro level
rw [integral_quadraticVariationError_sq hB
(regularGridTimes_monotone
(dyadicMesh T level) (2 ^ level))]
rw [sum_dyadic_cellLengths_sq]
ring
have hlimit := (FiniteTimeGrid.dyadicMesh_tendsto_zero T).const_mul (2 * (T : ℝ))
have hfun :
(fun level =>
∫ omega,
(quadraticVariationError B
(regularGridTimes (dyadicMesh T level) (2 ^ level)) omega) ^ 2 ∂mu) =
fun level => 2 * (T : ℝ) * ((dyadicMesh T level : ℝ≥0) : ℝ) := by
funext level
exact hexact level
rw [hfun]
simpa using hlimit
end BrownianQuadraticVariationL2
end StochasticProcesses
end TechnicalLemmas
end AutoSamplingTheoryScope and omitted-condition boundaries
- This is scalar mean-square convergence on deterministic dyadic grids only. Almost-sure or ucp convergence, predictable weights, vector cross-variation, stochastic integration, Taylor localization, and a complete Ito formula remain separate obligations.
Sources, dependencies, and reuse
Source and reuse
Samplinglib parents called
AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.BrownianQuadraticVariationL2.integral_quadraticVariationError_sqAutoSamplingTheory.TechnicalLemmas.StochasticProcesses.FiniteTimeGrid.dyadicMesh_tendsto_zeroAutoSamplingTheory.TechnicalLemmas.StochasticProcesses.SampledElementaryApproximation.regularGridTimes
Mathlib API called (external library)
- Filter.Tendsto
- Finset.sum_const
- NNReal.coe_div
Mathematical sources
- Sinho Chewi, Log-Concave Sampling, 2026-08-09, Section 3.1 — Quadratic variation along dyadic partitions.
- Samplinglib compiled dyadic L² theorem — Exact assumptions, finite-level reduction, and the Tendsto conclusion.
Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.