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.

Progressively measurable and predictable processes

Definition

Assume the Axiom of Choice The Axiom of Choice. Let (Ω,F,P) be a probability space with a continuous-time filtration (Ft)t0 Continuous-time filtrations and all-pairs martingales. All processes here are real-valued and indexed by [0,). AC is inherited from the cited continuous-time-filtration interface, whose separate martingale clause uses conditional expectation. Once the filtered probability space and stopping times are given, the progressive and predictable constructions below make no additional choice: they use only generated sigma-algebras and product rectangles.

  1. Progressively measurable. A process X=(Xt)t0 is progressively measurable relative to (Ft) when for every t0 the restricted map [0,t]×ΩR, (s,ω)Xs(ω), is measurable for the product sigma-algebra B([0,t])Ft The product sigma-algebra and its finite iterates.

  2. Time-zero and interval generators. On the product space [0,)×Ω, let P be the sigma-algebra generated by the family G:={(s,u]×A: 0s<u<, AFs}  {{0}×A: AF0}. The interval generators with s=0 are included, so (0,u]×A with AF0 is a generator. The sigma-algebra P exists by Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal and is called the predictable sigma-algebra. A process H=(Ht)t0 is predictable when the map (s,ω)Hs(ω) is P-measurable. For a finite horizon T>0 we write PT for the sigma-algebra on [0,T]×Ω generated by the same family restricted to uT together with the time-zero generators; this is the trace of P on [0,T]×Ω. Indeed, the trace of an interval generator is empty when sT, and otherwise is (s,min(u,T)]×A, while time-zero generators are unchanged. Conversely every listed finite-horizon generator is such a trace.

  3. Sections, adaptedness, and null sets. Two structural conventions are used repeatedly and are part of the definition. (a) Every generator is a measurable rectangle of B([0,))F, hence PB([0,))F; the time-zero generator {0}×A has dtP-measure zero for every A. A set in P has its section at each fixed time s in Fs: sets with that section property form a sigma-algebra, and each generator has the property by the increasing-filtration condition. Its section at each fixed ω is Borel in time, by the same sigma-algebra argument. (b) If a process is predictable then it is progressively measurable: for st the section ωHs(ω) is Fs-measurable Ft-measurable, and the progressive-measurability claim is the restriction of the joint map to [0,t]×Ω; the restriction of a P-measurable map to [0,t]×Ω is measurable for B([0,t])Ft because every generator with ut lies in that product sigma-algebra and the generators with u>t have intersection with [0,t]×Ω of the form (s,t]×A with s<t and AFs, or the empty set when st. The time-zero generators also lie in B([0,t])Ft.

The family G need not itself contain the whole space, but a finite intersection of generators is empty or again a generator, or a time-zero generator, because (s,u](s,u]=(ss,uu] and AAFss whenever AFs, AFs, while {0}×A is disjoint from every interval generator, including (0,u]×A. Two time-zero generators intersect in {0}×(AA) with AAF0. Thus the family consisting of the whole space together with finite intersections of generators is a pi-system generating P; this is the structural fact used by the density theorem below.

Because predictability is a measurability requirement for the joint map, it is preserved by pointwise limits, products and linear combinations of predictable processes. A deterministic function h of time defines a predictable process exactly when h is Borel measurable: the sets C for which C×ΩP form a sigma-algebra containing the intervals (s,u] and {0}, hence all Borel sets. Conversely, take any fixed ωΩ (a probability space is nonempty) and use the Borel time-section property from 3(a) on every inverse image of an open set. This single choice uses no choice axiom. In particular the indicators 1[0,u] and 1(0,u] are predictable for every deterministic u0, and the process s1sτ(ω) for a stopping time τ Continuous-time stopping times and stopped sigma-algebras is predictable, since {(s,ω):s>τ(ω)}=qQ>0(q,)×{τ<q}=qQ>0n>q(q,n]×{τ<q} is a countable union of generators: for rational q>0 one has {τ<q}=q<q, qQ{τq}Fq. The complement of that set inside [0,)×Ω is the event of the indicator, so 1[0,τ] is predictable; its left-continuity in the time variable is the visual form of the same computation.

No completeness of the filtration and no right continuity of (Ft) is used or assumed. Apart from the inherited ambient assumption just recorded, the constructions in this definition are choice-free.

Depends on

Used by

Dependency tree · two levels

11 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