Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Elementary predictable Brownian integrands

Definition

Assume the Axiom of Choice The Axiom of Choice, and fix a probability space (Ω,F,P) with a continuous-time filtration (Ft)t0 Continuous-time filtrations and all-pairs martingales and a standard Brownian motion B Brownian motion on it. Standing hypothesis (H). B is adapted to (Ft) and for all 0s<t the increment BtBs is independent of Fs and has law N(0,ts). The raw natural filtration and the usual augmented natural filtration Natural and usual augmented Brownian filtrations both satisfy (H) for a standard Brownian motion, by Future-path Markov property; for a general filtration, (H) is part of the data and is not automatic. Every statement in this development names (H) when it is used.

Throughout, fix a finite horizon T>0. An elementary predictable Brownian integrand on [0,T] is a process of the form Hs(ω)=k=0m1ξk(ω)1(tk,tk+1](s),s[0,T], where 0=t0<t1<<tm=T is a finite partition of [0,T], each ξk is a bounded real Ftk-measurable random variable, and the values at the partition points are irrelevant because the intervals are left-open and right-closed. The mesh of the representation is maxk(tk+1tk), and the supremum norm of the representation is maxkξk. The integrand itself is the process H; a second list of the same name with different coefficients is the same elementary integrand only if the two processes coincide in the almost-everywhere sense made precise below.

The following properties are part of the definition and are used at once.

  1. Predictability. H is predictable Progressively measurable and predictable processes. Indeed, for a Borel set ΓR, {HΓ}=ZΓk=0m1((tk,tk+1]×{ξkΓ}),ZΓ:={{0}×Ω,0Γ,,0Γ, a finite union of generators of the predictable sigma-algebra because {ξkΓ}Ftk and {0}×Ω is a time-zero generator. Consequently H is progressively measurable and measurable for the product sigma-algebra B([0,T])F, and H belongs to L2([0,T]×Ω,dtP): with c:=maxkξk< one has E0THs2dsc2T<.

  2. Endpoint and null-set conventions. Replacing the intervals by (tk,tk+1] makes the value at s=0 zero for every elementary integrand. More generally, if two elementary integrands agree for all s[0,T] except at finitely many deterministic times, then they agree (dtP)-almost everywhere, since a finite set of times is Lebesgue-null and Tonelli computes dtP({u}×Ω)=0. All integrands and all integrals below are therefore elements of the quotient spaces of L2(dtP) and L2(P); a claim about a process is a claim about its almost-everywhere class unless a representative is explicitly named, and path statements name the continuous representative.

  3. Deterministic coefficients. If every ξk is a deterministic real number, H is a deterministic step function on [0,T], so the elementary integrands include all step functions with deterministic coefficients. These are the integrands for which the integral is a Gaussian variable below.

The Axiom of Choice is declared because the Brownian construction and the conditional-expectation interface used in items 6, 7 and 13 assume it; the definition itself, including the predictability computation of clause 1, uses no choice. The countable-choice obligations inherited from that interface are declared as dependencies of this item.

Depends on

Used by

Dependency tree · two levels

35 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