Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-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.

Natural and usual augmented Brownian filtrations

Definition

Assume the Axiom of Choice. Let B be a standard Brownian motion on a probability space (Ω,F,P) Brownian motion. First replace the ambient space by its completion, retaining the notation (Ω,F,P) for this extension. This is supplied by Assuming countable choice, every measure space has a unique complete extension to its completion; AC supplies its countable-choice hypothesis by AC supplies countable selections and prescribed serial paths. The coordinate functions, their laws, and their raw sigma-algebras are unchanged. Four families are distinguished.

  1. Raw natural filtration. Ft0:=σ(Bs:0st) for t0, and F0:=σ(t0Ft0)=σ(Bs:s0). Both sigma-algebras exist by Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal, and (Ft0)t0 is a continuous-time filtration in the sense of Continuous-time filtrations and all-pairs martingales, the smallest one to which B is adapted. It contains no completion and no right-continuous augmentation.
  2. Raw right limit. Ft+0:=u>tFu0 for t0. At t=0 this is the germ sigma-algebra used later on this page; the uncountable intersection is the decreasing intersection over the rational u>t, since tFt0 is increasing. No null sets are adjoined in this operation.
  3. Ambient null ideal and completed raw filtration. Let N:={MΩ:there is N0F with P(N0)=0 and MN0} be the family of all subsets of ambient P-null events. These sets are ambient-measurable because the ambient probability space was completed. This is a sigma-ideal: for a countable family choose null envelopes using AC, then take their union; subsets require the same envelope. Nullness follows from Null sets are closed under countable unions and, in a complete space, under arbitrary subsets. Put Ft0:=σ(Ft0N),t0. Each Ft0 is a sub-sigma-algebra of F, contains every member of N, and Fs0Ft0 for st, so (Ft0)t0 is a filtration.
  4. Usual augmentation. Ft:=u>tFu0 for t0.

The following facts are part of the definition and are the form in which it is used later.

(a) Ft0Ft0Ft for every t0, and every Ft contains N. (b) (Ft)t0 is increasing and right-continuous: for every t0, s>tFs=Ft. Indeed, if As>tFs, fix u>t and take s=(t+u)/2. Then AFsFu0. Since u>t was arbitrary, AFt. Conversely ts gives FtFs, because F0 is increasing and the intersection defining Ft ranges over the larger parameter set {u>t}{u>s}, so Fts>tFs. (c) Every completed set differs from a raw set by a null set. Let Dt:={AΩ:there is A0Ft0 and MN with AA0M}. Then Dt is a sigma-algebra containing Ft0N: complementation preserves symmetric difference, and, after selecting countably many witnesses by AC, (kAk)(kA0,k)k(AkA0,k)kMkN. Thus Ft0Dt. Conversely, if AA0MN, then AA0N, so A=A0(AA0)Ft0. This proves equality, and also ambient measurability of every ADt. In particular, for AFt0 one has P(A)=P(A0) for such an A0, and AXdP=A0XdP for every integrable real or complex X, by Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree applied to X1A and X1A0. Apply it to indicators for the measure equality. If P(A)=0, its raw representative A0 is null, so AA0M is contained in an ambient null envelope. Every subset of A therefore belongs to N. This proves completeness of each Ft0. It also proves completeness of Ft: a null member belongs to Ft+10 and hence all its subsets belong to NFt. Thus every ambient null event and every one of its subsets belongs already to F0; together with right-continuity, this is the usual-conditions convention used below. (d) The four families Ft0, Ft+0, Ft0 and Ft are kept distinct in every statement below. The strong Markov theorem is stated for (Ft) and the deterministic Markov theorems are stated for both (Ft0) and (Ft); the companion examples page carries a counterexample showing that F0+0F00 in the canonical realization.

The raw filtration remains raw even though the ambient measure has been completed; no null set is removed from Ω. Choice is used for the completion theorem and the countable witnesses above, and is also inherited from the ambient Brownian construction.

Source notes

Sousi, Definition 6.10 (printed p. 54), defines the natural filtration and its raw right limit; it does not supply the completion construction. Completion is supplied by the declared measure-space theorem, with the ambient-null-ideal convention and the symmetric-difference description proved above. These distinctions are needed when moving between completed events and raw representatives in the later Markov and zero-one arguments.

Depends on

Used by

Dependency tree · two levels

29 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