Alphabeta Math
RemarkRemark: AI-adaptedProof: 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.

Raw versus usual filtrations in the strong Markov theorem

Remark

The strong Markov theorem Strong Markov property of Brownian motion is stated for the usual augmentation (Ft), not for the raw natural filtration (Ft0) Natural and usual augmented Brownian filtrations. Four distinctions matter and are fixed by that choice.

  1. The theorem names the filtration it uses. Its hypothesis is that τ is a stopping time for (Ft) with τ< almost surely; the conclusion is an identity of conditional expectations given Fτ. Neither the raw filtration nor the completed raw filtration is substituted for the usual one in the statement.
  2. What the dyadic proof actually uses. The ceiling times τn=2n2nτ are stopping times of the same filtration and satisfy FτFτn; the countably valued case applies the deterministic future-path theorem Future-path Markov property at the countably many values of τn; and the passage to general τ uses path continuity and dominated convergence. Completion enters through the null event {τ=}, on which Bτ is defined by a convention, and through the identification of conditional laws up to null sets.
  3. Completion is not independence from arbitrary future information. The theorem asserts that the increment process (Bτ+tBτ)t0 is independent of Fτ and that the conditional law of the shifted future path is Wiener measure translated by Bτ. For τ equal to a deterministic time s>0 this is not the claim that the future path (Bs+t)t0 is independent of Fs: its conditional law depends on the state Bs through the translation, and only the increment process is independent of the past. No completion of the filtration removes that dependence, and none of the items on this page asserts it.
  4. The stopping-time hypothesis is not decorative. For a random time that is not a stopping time the conclusion can fail outright; the companion example cex-strong-markov-fails-at-a-nonstopping-random-time on the companion examples page exhibits the last zero before a fixed time, where the post-time future has no zero in a right-neighbourhood and therefore cannot have the Wiener law.

The strict and non-strict forms of the stopping tests agree for the usual augmentation because it is right-continuous, while the raw statements on this page use the non-strict test directly; the ceiling identity {τnt}={τ2n2nt} is a non-strict test and needs no right-continuity. AC is declared because the conditional-expectation interface and the ambient Brownian construction assume it.

  • Reading order. The example items named by ID above are homed on later pages of the plan, so they are named rather than hyperlinked: a body link to later material must be declared as a forward reference, and Step-5b closure removes every such declaration. Rehoming those items to an earlier page (an owner-only reading-order change) would make the citations backward and restore the links.

Source notes

Sousi, Sections 6.3-6.5, distinguishes the natural filtration from its right-continuous completion and states the strong Markov property for the latter; Durrett, Section 7.3, works throughout with the completed filtration. The counterexample on the companion page is oriented as a boundary for the stopping-time hypothesis, not used as a supplier anywhere in this pair.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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