Plain-English statement
Chewi, Proposition 1.1.16. Assume the filtration satisfies the usual conditions, `B` is Brownian motion with respect to that filtration, and `eta` is strongly progressive with finite pathwise square energy on every finite horizon. Then the canonically glued local Itô integral process is strongly adapted, has continuous paths, and is a local martingale. The first component is included explicitly for readers even though adaptedness is already part of `Localization.IsLocalMartingale`.
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.
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.
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.
- NameWhat reusable mathematical fact is being created?
- ParametersWhich symbols are arbitrary, and which structures are inferred by typeclass search?
- PropositionAfter the colon, translate the Lean expression back into a paper statement.
- 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
theorem chewi_proposition_1_1_16
[IsProbabilityMeasure mu]
(hUsual : SatisfiesUsualConditions filtration mu)
(eta : GlobalLocalProgressiveL2Integrand filtration mu)
(hB : IsBrownianMotionWithFiltration B filtration mu) :
StronglyAdapted filtration (globalItoProcess hUsual eta hB) ∧
(∀ omega, Continuous (fun t => globalItoProcess hUsual eta hB t omega)) ∧
Localization.IsLocalMartingale
(globalItoProcess hUsual eta hB) filtration mu := by
exact ⟨globalItoProcess_stronglyAdapted hUsual eta hB,
globalItoProcess_continuous hUsual eta hB,
globalItoProcess_isLocalMartingale hUsual eta hB⟩
/-- **Localized Itô representation for Proposition 1.1.16.**
For every canonical dyadic localizer `tau_k`, stopping the globally glued local
Itô process at `tau_k` recovers, almost surely and at every deterministic time
inside the matching horizon, the completed Itô process of the literal source
integrand `eta_s * 1_{s ≤ tau_k}`. This is the formal certificate that the
process in `chewi_proposition_1_1_16` is Chewi's local stochastic integral, not
an unrelated local martingale with the same localization sequence. -/
Open AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/ChewiProposition1_1_16.lean:51published source at 7bcd37294df1
Proof architecture
package random-stopping consistency, cross-horizon overlap, localized martingale coherence, and pathwise gluing into the source local-Ito continuous-local-martingale result
Lean proof walkthrough
- Read the quantified variables and typeclass brackets as part of the mathematical statement; inferred arguments are not missing assumptions.
- `exact` closes the current goal with an already typed term.
Why the statement has this shape
The declaration is kept at the reusable level recorded by its Registry tags and direct consumers. Explicit measures, spaces, wrappers, and regularity hypotheses expose interfaces that paper notation often infers. A theorem card explains those interfaces but never widens the compiled statement.
Hidden assumptions and non-claims
- Measurability is represented explicitly or must be supplied by a dependency.