Samplinglib
Lean gate passed 2026-08-19T06:32:39.895922+00:00 · 7bcd37294df1
Reviewed teaching declaration · localization.chewi-definition-1-1-15

IsLocalMartingale

compiled Samplinglib leaf Compiled explicit smoke test

A process is a local martingale when it becomes a centered martingale before every stop in an exhausting sequence.

Plain-English statement

A process is a local martingale when it becomes a centered martingale before every stop in an exhausting sequence.

Scope guard. This card records a compiled local declaration. Its mathematical scope is exactly the Lean statement below; the Registry note and source correspondence may describe motivation but do not strengthen it.

Mathematical statement

M is adapted and there are increasing stopping times tau_n tending a.s. to infinity such that M_{t wedge tau_n}-M_0 is a martingale.

Intuition

Localization removes global integrability while retaining martingale structure on every bounded stochastic window.

Conditions

  • adaptedness
  • increasing stopping times
  • a.s. divergence
  • ordinary martingale behavior after stopping

Why these conditions cannot be dropped

  • adaptedness prevents future information
  • a.s. divergence ensures every finite sample-path time is eventually covered

Proof route

  • this is the exact source definition
  • localized Ito integrals are handled by Proposition 1.1.16

Lean interface notes

  • uses Mathlib stoppedProcess
  • the centered stopped process is passed to Mathlib Martingale
Lean learning studio · mathematics → formal proof

Read the mathematics first, then descend into Lean

You do not need to know Lean before opening this panel. The page keeps the paper-level theorem, rigorous proof obligations, exact Lean declaration, and proof dependencies as separate layers so a first-time reader can move down one layer at a time.

BeginnerWhy this theorem exists → intuition → statement → one hand calculation. Hide proof-engineering detail.
RigorousExpose assumptions, hidden measure/limit/domain issues, proof route, and rigorous references.
Lean learnerOpen the exact declaration, proof tree/network, syntax glossary, and line-by-line explanation.

Proof architecture

Start with the tree when learning: prerequisites sit below the theorem and downstream results sit above it. Switch to the network when you want to understand where this declaration lives in the local formal library. Every mapped node is clickable.

Loading source-derived dependency evidence…

Graph rule: only dependencies found by the ASTIS source scan are drawn. Missing tactic indirection is treated as an under-approximation; the site never invents an edge just to make a prettier graph.

How to read the exact Lean declaration

Read a Lean theorem left-to-right exactly as you would unpack a mathematical sentence: name → ambient types → automatically inferred structures → explicit hypotheses → conclusion → proof. Then read the proof top-to-bottom as transformations of the current goal.

  1. NameWhat reusable mathematical fact is being created?
  2. ParametersWhich symbols are arbitrary, and which structures are inferred by typeclass search?
  3. PropositionAfter the colon, translate the Lean expression back into a paper statement.
  4. Proof actionsAfter by, ask what each tactic does to the mathematical goal—not only what syntax it uses.

Syntax used on this page

This glossary is filtered to syntax that actually occurs in the declaration above. Open a symbol only when you meet it, rather than memorizing Lean grammar in advance.

Source voice and ASTIS voice stay separate

When Samplinglib shows a short quotation from Chewi, it is labeled as a source excerpt and linked to the canonical book page. Intuition, expanded proof steps, hidden regularity assumptions, and Lean explanations are ASTIS-authored commentary. A quotation never substitutes for a formal proof, and an ASTIS explanation is never attributed to the textbook author.

Lean statement

def IsLocalMartingale
    {Omega : Type*} {m : MeasurableSpace Omega}
    (process : ℝ≥0 → Omega → ℝ) (filtration : Filtration ℝ≥0 m)
    (mu : Measure Omega) : Prop :=
  Adapted filtration process ∧
    ∃ tau : ℕ → Omega → WithTop ℝ≥0,
      (∀ n, IsStoppingTime filtration (tau n)) ∧
      Monotone tau ∧
      (∀ᵐ omega ∂mu, Tendsto (fun n => tau n omega) atTop (𝓝 (⊤ : WithTop ℝ≥0))) ∧
      ∀ n, Martingale
        (fun t omega => stoppedProcess process (tau n) t omega - process 0 omega)
        filtration mu

end

end Localization
end StochasticProcesses
end TechnicalLemmas
end AutoSamplingTheory
Common pitfall. A wrapper or display identity is not a new analytic theorem merely because it has its own Lean name. Check the statement, hypotheses, and downstream consumers before interpreting its mathematical contribution.