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.
Expected exit time from an interval
Example
Assume the Axiom of Choice and the standing hypothesis (H) of Elementary predictable Brownian integrands. Let , let be the coordinate process under the shifted law on continuous path space, with Brownian motion started at x, equipped with its usual augmented natural filtration Natural and usual augmented Brownian filtrations, and let be the first exit time from the interval. Then
Facts & Assumptions
Given: AC, (H), , a start , the canonical shifted process with its usual augmented natural filtration, and the exit time of .
Stopping and normalization. Put . Every canonical path is continuous, so for each , . A hit yields arbitrarily close rational times; conversely the continuous distance attains its zero infimum on . Thus the literal exit is a stopping time. Under , is Brownian with the usual Brownian filtration. Dynkin uses its everywhere-continuous zero-start normalization; it agrees with on , a common probability-one event, so all path evaluations and integrals agree there. Continuous-time stopping times and stopped sigma-algebras Brownian motion started at x Natural and usual augmented Brownian filtrations
Dynkin formula. If and is a bounded stopping time, then . Dynkin formula for bounded Brownian stopping Brownian motion started at x
Cutoff extension of a quadratic. For there is with on a neighbourhood of and there: choose and multiply by , the smooth compactly supported cutoff equal to on , using Explicit compactly supported smooth cutoffs; the resulting function is , hence , and therefore bounded. The spaces and
Finiteness of the exit time and endpoint values. The path of is continuous, at the start and . By Two-sided Brownian exit probability, reaches before with probability . The reflected process is Brownian motion started at by Brownian motion, so the same theorem on gives probability that reaches before . These disjoint events have probabilities summing to , hence almost surely; on continuity gives and . Brownian motion started at x Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point
Convergence tools. Dominated convergence applies to bounded sequences of random variables; monotone convergence applies to nondecreasing nonnegative sequences, so including the value . Dominated convergence Monotone convergence for the integral Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point
AC bookkeeping. Full AC is declared because the cited Dynkin and conditional-expectation interfaces assume it, and it supplies the Countable Choice used by inherited measure-theoretic interfaces. The Brownian coordinate process, shifted law, usual filtration, standing hypothesis (H), and other data of Dynkin's formula are hypotheses recorded in the Statement and [F0]--[F1], not consequences of AC. The cutoff and integer truncations are explicit. The Axiom of Choice
Verification
Applying Dynkin: for each integer , [F0] shows that the stopping time is bounded, so [F1] applied to the function of [F2] gives . On the common event , one has for . Since , on a neighbourhood of , the right-hand side equals .
Left-hand limit: on one has by continuity of the path, hence ; on (a null set by [F3]) the sequence stays bounded and the conclusion is not needed. Since is bounded, dominated convergence gives .
Conclusion: combining steps 1.1 and 2.1, , so ; by monotone convergence of the nondecreasing sequence the limit of the expectations is , hence . At this is .
Boundary and consistency cases: for or the formula tends to , consistent with the starting point being at the boundary; for and it gives ; the cutoff agrees with on a neighbourhood of the whole closed interval, so the computation is unaffected by the modification; the exit time is finite almost surely by [F3], and the argument does not need in advance because monotone convergence allows the value and the computation identifies it as finite; the bounded-stopping hypothesis of Dynkin's formula is met by at each ; and the inherited uses of AC are exactly those recorded in [F5], while all Brownian data remain hypotheses.
Source notes
The generator identity motivates the calculation. The proof above uses the Dynkin formula of this page on bounded truncations, the explicit cutoff, and monotone convergence to pass to the unbounded stopping time.
Depends on
- Dynkin formula for bounded Brownian stopping
- Brownian motion started at x
- Brownian motion
- Natural and usual augmented Brownian filtrations
- The spaces $C_c(\mathbb{R}^n)$ and $C_c^\infty(\mathbb{R}^n)$
- Explicit compactly supported smooth cutoffs
- Two-sided Brownian exit probability
- Continuous-time stopping times and stopped sigma-algebras
- Dominated convergence
- Monotone convergence for the integral
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- Heine-Cantor in $\mathbb{R}$: a continuous real function on a compact subset of $\mathbb{R}$ is uniformly continuous, proved $\mathbb{R}$-natively from sequential compactness
- The Axiom of Choice
- AC supplies countable selections and prescribed serial paths
- Elementary predictable Brownian integrands
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
94 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
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Section 3.5 (standard reference, not scraped)