Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Continuous adapted processes are measurable at bounded stopping times

Statement

Assume AC and use the usual augmented Brownian filtration of Natural and usual augmented Brownian filtrations. Let X=(Xt)0≤t≤T be an adapted, finite-dimensional real process with continuous paths on a measurable event of probability one. If τ is a stopping time with 0≤τ≤T, then the stopped random vector Xτ is Fτ-measurable.

Facts & Assumptions

Given: AC; a usual augmented Brownian filtration; an adapted Rd-valued process on [0,T] with paths continuous on a measurable full-probability event; and a stopping time τ≤T.

[F1]

Every ambient measurable null set and each of its subsets belong to F0, hence to every Ft. Natural and usual augmented Brownian filtrations

[F2]

τ is a stopping time when {τ≤s}∈Fs for every s, and Fτ consists of events A with A∩{τ≤s}∈Fs for every s. Continuous-time stopping times and stopped sigma-algebras

[F3]

Adaptedness means Xs is Fs-measurable for every deterministic s, and the filtration is increasing. Continuous-time filtrations and all-pairs martingales

[A1]

AC is inherited from the usual augmented Brownian-filtration convention; the deterministic-grid approximation below makes no selection. The Axiom of Choice

Proof

1.1F2F3givenconstruct

Fix t∈(0,T] and, for each integer n≥1, form the deterministic grid Gn,t={kt2−n:0≤k≤2n}. Let τn,t be the least point of Gn,t greater than or equal to τ∧t. For s<t, {τn,t≤s}=⋃q∈Gn,t, q≤s{τ≤q}∈Fs by [F2] and [F3]; for s≥t the event is all of Ω. Thus τn,t is a finite-valued stopping time, τn,t≤t, and τn,t↓τ∧t. Each event {τn,t=q} belongs to Fq by subtracting consecutive sublevel events, so the finite-valued variable Xτn,t is Ft-measurable by [F3].

2.1F3givenstep 1.1construct

Define Zt as the limit of Xτn,t where that finite vector limit exists, and as 0 otherwise. Since each approximant is Ft-measurable, Zt is Ft-measurable. On {τ≤t} and on the full-probability continuity event, τn,t↓τ and continuity gives Zt=Xτ. The case t=0 follows directly from τ∧0=0 and Z0=X0.

3.1A1F1F2step 2.1given∎

For any Borel set C⊆Rd, the events {Xτ∈C}∩{τ≤t} and {Zt∈C}∩{τ≤t} differ only on the measurable null set where path continuity may fail. The second event is in Ft by [F2] and step 2.1; [F1] places their symmetric difference in Ft, so the first event is in Ft. At t=T this also gives {Xτ∈C}∈FT. All tests in [F2] hold, proving Xτ∈Fτ. AC enters only through [A1].

Depends on

Used by

Dependency tree · two levels

14 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