Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A deterministic step integrand

Example

Assume the Axiom of Choice and the standing hypothesis (H) of Elementary predictable Brownian integrands. Let h=∑k=0m−1ak1(tk,tk+1] be a deterministic step function on [0,T], with real coefficients ak and partition 0=t0<⋯<tm=T. Then ∫0ths dBs=∑k=0m−1ak(Bt∧tk+1−Bt∧tk)(0≤t≤T), and at the terminal time the integral has law N(0,∑kak2(tk+1−tk)); in particular it has mean 0 and variance ∫0Th2ds.

Facts & Assumptions

Given: AC, the standing hypothesis (H), a deterministic step function h=∑kak1(tk,tk+1] on [0,T] and t∈[0,T].

[F1]

A deterministic step function is an elementary predictable integrand with coefficients ak∈Ftk (constants), and its elementary integral is the finite sum ∑kak(Bt∧tk+1−Bt∧tk); the general integral agrees with the elementary one on this subspace. Elementary predictable Brownian integrands Ito integral of an elementary predictable process Ito integral for square-integrable predictable processes

[F2]

For deterministic h∈L2[0,T] the integral is centered normal with variance ∫0Th2ds. Deterministic Ito integrals are Gaussian Standard normal and normal laws

[F3]

AC is declared for the ambient interfaces. The Axiom of Choice

Verification

technique · direct
1.1F1given

Substituting the deterministic coefficients into the definition gives the displayed finite sum for every t, and at t=T it is ∑kak(Btk+1−Btk), a linear combination of the independent increments over the partition intervals.

2.1F2step 1.1

The squared L2[0,T] norm of h is ∫0Th2ds=∑kak2(tk+1−tk), so by [F2] the law of the terminal integral is N(0,∑kak2(tk+1−tk)), with mean 0 and that variance.

3.1F2F3step 2.1given∎

The cases are covered: a single-interval step (m=1, a0=a) gives a(BT−B0)=aBT of law N(0,a2T); the degenerate case ak=0 for some k contributes zero variance on that block; and h=0 gives the Dirac law N(0,0) at 0. AC enters only through [F3].

Source notes

Lawler, Section 3.2.2, defines the integral of a simple process exactly as this finite sum; the distribution statement is the deterministic-step instance of the deterministic-integrand corollary.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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