Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Quadratic variation of an Ito integral

Statement

Assume the Axiom of Choice and the standing hypothesis (H) of Elementary predictable Brownian integrands. Fix T>0, let H be a locally square-integrable predictable process Locally square-integrable predictable Brownian integrands with localized integral M=HB in the progressive version of Localized Ito integral, under the usual conditions and almost-sure local-energy convention of the cited local-integrability definition, and let (πn) be a deterministic partition sequence of [0,T] with mesh tending to 0 Quadratic variation along a partition sequence. Write Qn(t) for the step-convention partial sum j:sj+1(n)t(Msj+1(n)Msj(n))2. Then sup0tTQn(t)0tHs2ds0in probability, and the partial-increment convention of Quadratic variation along a partition sequence has the same limit. Thus along every deterministic vanishing-mesh partition sequence the quadratic variation of the path of M is the random function t0tHs2ds, uniformly in probability. All full-path suprema use measurable versions: replace each process by zero outside a common measurable event of continuity before taking such a supremum. In all energy expressions, use the continuous representative equal to 0tHs2ds on G=r1{0rHs2ds<} and zero on Gc. The local-integrability definition proves that Gc is an F0-measurable null event. This normalization preserves all almost-sure identities and makes the energy finite and continuous everywhere. The step sums minus this energy are right-continuous, so their supremum equals that over a countable dense set including T.

Facts & Assumptions

Given: AC, the standing hypothesis (H), a locally square-integrable predictable H with energy At=0tH2ds, its canonical times τm, m1 and localized integral M, a horizon T>0, and a deterministic partition sequence πn of [0,T] with mesh δn0.

[F1]

For every 0u<v the increment of the localized integral is the localized Ito integral of the predictable restriction, MvMu=(1(u,v]H)B evaluated after time v. If H has finite energy on the horizon under consideration, this localized integral is the finite-energy integral 0T1(u,v]HdB, and the isometry gives E(MvMu)2=EuvH2ds. Ito integral for square-integrable predictable processes Ito isometry and linearity in predictable L2 Localized Ito integral

[F2]

On a deterministic partition 0=s0<<sJ=T, put Yk=(Bsk+1Bsk)2(sk+1sk) for 0k<J and Nj=0k<jYk for 0jJ, so N0=0. The independent Gaussian increments have second and fourth moments h and 3h2, so EYk=0 and EYk2=2(sk+1sk)2. Relative to the finite-grid filtration Nj is a martingale by (H); cross terms have zero expectation by conditioning. Extend it constantly after J to apply discrete Doob with p=2. For nonnegative Z, the elementary inequality ε1{Z>ε}Z gives P(Z>ε)EZ/ε; applied to Z2 this also converts an L2 bound to a probability bound. Gaussian even moments for Brownian increments Brownian motion Doob Lp maximal inequality Tower property of conditional expectation

[F4]

For a finite-energy predictable G and a stopping time ρ, (GB)ρ is the finite-energy integral of G1(0,ρ]; for the canonical times of H, Mτm is the finite-energy integral of H1(0,τm] and Atτm=0tH21(0,τm]ds. Localized Ito integral Stopping an Ito integral Locally square-integrable predictable Brownian integrands

[F5]

For finite-energy G the maximal bound EsuptT(GB)t24E0TG2ds holds, and for elementary G the defining sums reduce to the explicit finite combinations of Brownian increments. Doob maximal bound for the Ito integral Ito integral of an elementary predictable process Elementary predictable Brownian integrands

[F6]

The two quadratic-sum conventions differ by the last partial increment squared. Probability continuity for increasing events follows by monotone convergence of indicators; decreasing continuity follows by complements. In particular almost-sure convergence of nonnegative random errors implies convergence in probability, by applying decreasing continuity to the tail-supremum events. Quadratic variation along a partition sequence Monotone convergence for the integral

[F7]

AC supplies the declared ambient interfaces and the countably chosen elementary approximations and versions; partition and localization times are given or canonical. The Axiom of Choice AC supplies countable selections and prescribed serial paths

[F8]

For real numbers and for random variables one has jajbj(jaj2)1/2(jbj2)1/2 and E[XY]X2Y2; these Cauchy--Schwarz inequalities control the polarization of the squared-increment sums and the expected products of the block sums. Cauchy-Schwarz for random variables

[F9]

Every predictable integrand of finite expected energy on [0,T] admits bounded elementary predictable approximations in L2(dtP). Density of elementary predictable processes in predictable L2

Proof

technique · direct
1.1

Brownian estimate: for a deterministic partition π of [0,T] with mesh δ and Nj as in [F2], independence of the Brownian increments gives ENJ2=k2(sk+1sk)22δT, and Doob's L2 inequality gives EmaxjNj28δT; since [B]tπ,stept=Nk(t)+sk(t)t where k(t)=max{j:0jJ, sjt} and sk(t)tδ, one has EsuptT[B]tπ,stept216δT+2δ2, which tends to 0; [F2]'s elementary probability bound turns this into uniform convergence in probability.

F2
1.2

For elementary H with partition 0=t0<<tm=T and a sub-interval (u,v], the increment MvMu=0T1(u,v]HdB is the elementary sum of the elementary integrand 1(u,v]H, whose coefficients are ξk on (utk,vtk+1], measurable at the left endpoints utktk; consequently MvMu=kξk(Bvtk+1Butk) over the at most two blocks meeting (u,v] when vu<mink(tk+1tk), and equals ξk(BvBu) when (u,v] is contained in a single block (tk,tk+1].

F1F5
2.1

Elementary refinement: fix a bounded elementary H with blocks (tk,tk+1], 0k<m, and a deterministic bound K for its coefficients on a common probability-one event. For sufficiently large n, δn<mink(tk+1tk), so each interval of πn crosses at most one elementary boundary. Refine by all these boundaries, and write Rk for the induced partition of [tk,tk+1]. Let Sk(n)(t) be the Brownian step sum on Rk, extended by zero before tk and its terminal value after tk+1. The refined integral sum is kξk2Sk(n)(t). Away from crossing intervals it equals Qn(t). On a crossing interval, the original increment has absolute value at most 2KωB(δn), while each of the at most two refined increments has absolute value at most KωB(δn), where ωB(δ)=supuvδ,u,v[0,T]BuBv on the continuous representative. This also bounds the discrepancy when the refined sum has included the boundary but the original interval is not yet complete. Adding the original squared contribution and the two subtracted refined squared contributions bounds the absolute discrepancy uniformly in t by 6mK2ωB(δn)2, which tends to zero almost surely by [F3].

F3F5step 1.2
3.1

Apply step 1.1 on each deterministic interval [tk,tk+1] to its translated Brownian increments and the induced mesh Rk, whose mesh is at most δn. Thus supt[tk,tk+1]Sk(n)(t)(ttk)0 in probability. Since At=kξk2(ttk+1ttk), the refined-sum error is bounded by K2 times the finite sum of these block errors. A finite union bound and step 2.1, with [F6] for its almost-sure vanishing error, give suptQn(t)At0 in probability for each bounded elementary H. No independence of ξk from these error suprema is needed, because the deterministic bound K is used.

F3F6step 1.1step 2.1
4.1

Finite-energy case: use [F9] and [F7] to choose HlH in L2(dtP) with Hl bounded elementary and set Nl:=HHl; by Cauchy--Schwarz in each partial sum, suptQn(H)(t)Qn(Hl)(t)Qn(Nl)(T)+2Qn(Nl)(T)1/2Qn(Hl)(T)1/2, and [F1] gives EQn(Nl)(T)=E0T(Nl)2ds0 and EQn(Hl)(T)=E0T(Hl)2dsC uniformly in n, so EsuptQn(H)Qn(Hl)0 as l uniformly in n; combined with step 3.1 for Hl and EsuptAHl(t)AH(t)HlH2Hl+H20, the finite-energy case follows by a two-parameter argument: for error threshold ε, split the total error into the quadratic-sum approximation, the elementary convergence error and the energy approximation, each at threshold ε/3. Their probabilities are bounded by 3/ε times the two expected approximation errors, plus the elementary error probability. The latter vanishes as n at fixed l, and the former vanish as l, uniformly in n.

F1F2F7F8F9step 3.1
5.1

Localized case: on the event {τmT} the processes M and Mτm agree on [0,T] and At(m)=At for tT by [F4], so the squared-increment sums of M coincide with those of the finite-energy integral Mτm there; consequently, for every ε>0, P(suptQn(M)A>ε)P(τm<T)+P(suptQn(Mτm)A(m)>ε), and the second term tends to 0 by step 4.1 while the first tends to 0 as m because τm almost surely.

F4step 4.1
6.1

Steps 3.1 and 5.1 establish uniform convergence in probability for the step convention; the partial-increment convention differs from the step value by at most the squared maximal oscillation of the continuous path of M over the partition intervals, which tends to 0 by [F3] and continuity of M, so both conventions have the same limit. The dyadic partitions are included; no almost-sure dyadic conclusion is asserted for general H. AC covers the declared interfaces and the countable approximating choices in [F7].

F3F6F7step 3.1step 5.1

Source notes

Van der Vaart, Lemma 5.77, uses elementary approximation and localization for covariation with a locally bounded predictable integrand. Lawler, Theorem 3.2.6, treats continuous or piecewise-continuous integrands and regular meshes. Neither is invoked as the full arbitrary-predictable, arbitrary-partition claim: the Brownian estimate, refinement error, finite-energy approximation and localization needed here are proved explicitly.

Depends on

Used by

Dependency tree · two levels

106 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources