Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Itô integral of a step on a stopping-time interval

Statement

Assume AC and the usual filtered-space hypotheses for the Itô integral. Let W be a scalar Brownian motion on [0,T], let 0≤τ≤σ≤T be stopping times, and let ξ∈L2(Fτ). The process Hs=ξ 1(τ,σ](s) is predictable with finite energy, and its continuous Itô-integral version satisfies ∫0tHs dWs=ξ(Wt∧σ−Wt∧τ)(0≤t≤T) up to indistinguishability. The statement applies coordinatewise to each entry of a matrix-valued coefficient and a finite-dimensional Brownian motion.

Facts & Assumptions

Given: AC, T>0, a scalar Brownian motion with increments independent of the current filtration, stopping times 0≤τ≤σ≤T, and a square-integrable Fτ-measurable real random variable ξ.

[F1]

A square-integrable predictable step integrand on a finite deterministic partition has continuous Itô integral equal to the finite sum of its left-endpoint coefficients times Brownian increments. The integral map on predictable L2 is an isometry. A square-integrable predictable step Itô integral is its finite sum Ito isometry and linearity in predictable L2

[F2]

For a stopping time ρ, Fρ consists of events A such that A∩{ρ≤t}∈Ft for each t; on a right-continuous filtration the equivalent strict tests also hold. Continuous-time stopping times and stopped sigma-algebras

[F3]

Brownian motion is adapted and has continuous paths on one measurable full event; its evaluations at bounded stopping times are measurable at the stopped sigma-algebras. Brownian motion Continuous adapted processes are measurable at bounded stopping times

[F4]

Each finite-energy predictable integral has a continuous martingale version, and continuous versions equal at all times on one measurable probability-one event. The Ito integral process has a continuous martingale version The rationals embed densely in the reals

[A1]

AC is inherited from the Brownian and Itô-integral construction interfaces; the deterministic-grid approximation below makes no further choice. The Axiom of Choice

Proof

1.1F2givenconstruct

First verify that Hs=ξ1(τ,σ](s) is predictable pointwise. For s>0 and Borel C⊆R, put AC={ξ∈C}∈Fτ. Then AC∩{τ<s}=⋃q∈Q∩[0,s)AC∩{τ≤q}∈Fs, and {σ≥s}={σ<s}c∈Fs, since {σ<s}=⋃q∈Q∩[0,s){σ≤q}. With Es={τ<s}∩{σ≥s}, both Es and AC∩Es belong to Fs. The preimage {Hs∈C} is AC∩Es if 0∉C, and (AC∩Es)∪Esc if 0∈C; thus it belongs to Fs. Thus H is adapted. Its paths are left-continuous and H0=0. On the nested deterministic grids tj(r)=jT2−r, define P0(r)=0 and Ps(r)=Htj(r) on each cell (tj(r),tj+1(r)]. Each P(r) is predictable by [F2]; the left endpoints of the cells containing any fixed s>0 increase to s from below, so left-continuity gives Ps(r)→Hs. Hence H is a pointwise limit of predictable processes and is predictable. Now let δn=T2−n, and round each stopping time upward to the next point of this deterministic grid: τn=δn⌈τ/δn⌉ and σn=δn⌈σ/δn⌉. The stopping-time test shows these are finite-valued stopping times, τn≤σn, τn↓τ, and σn↓σ. On a grid cell (tk,tk+1], the process Hn=ξ1(τn,σn] has coefficient ξ1{τn≤tk<σn}. This coefficient is Ftk-measurable: the active event is in Ftk, and ξ restricted to {τn≤tk}={τ≤tk} is Ftk-measurable by [F2]. Thus Hn is a finite predictable step process.

1.2F1givenalgebra

The intervals (τn,σn] and (τ,σ] differ in Lebesgue measure by at most 2δn on each path. Hence E∫0T∣Hsn−Hs∣2ds≤2δnE∣ξ∣2⟶0. Also E∫0THs2ds=E[∣ξ∣2(σ−τ)]≤TE∣ξ∣2<∞. The predictable L2 space is closed under almost-everywhere limits: since the displayed squared errors are summable in n, Tonelli implies Hn→H for dt⊗P-almost every (s,ω); therefore H has a predictable representative.

2.1F1F3step 1.2

Apply [F1] to the deterministic-grid representation of Hn. The active cells are consecutive, so their finite sum telescopes and gives ∫0tHsn dWs=ξ(Wt∧σn−Wt∧τn) almost surely for every fixed t. By the isometry in [F1] and step 1.2 the left side converges in L2 to ∫0tHs dWs. By [F3], path continuity and the endpoint convergence imply that the right side converges almost surely to ξ(Wt∧σ−Wt∧τ). Uniqueness of limits in probability identifies the two limits almost surely.

3.1A1F3F4step 2.1given∎

Apply step 2.1 at the countable dense set of rational times in [0,T] and intersect those measurable probability-one events with the continuity events from [F3] and [F4]. The two continuous processes then agree at every time on that one event. If τ=σ, both sides vanish; τ=0, σ=T, and t=0 are included by the same formula. AC is used only through [A1].

Depends on

Used by

Dependency tree · two levels

43 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