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.
Exponential martingale Brownian tail bound
Example
Assume AC and hypothesis (H) of Elementary predictable Brownian integrands. Let be standard Brownian motion. Fix a measurable probability-one event of continuous paths and zero start, and replace the whole path by zero outside it, obtaining . The supremum below means the supremum of this continuous representative; its distribution is independent of that normalization. For and ,
Facts & Assumptions
Given: AC, (H), , its normalized representative , and as in the Example.
The positive process is a unit-mean martingale for each real . Only the direct Gaussian conditioning argument in the cited corollary (steps 1.2 and 2.1), not its stochastic integral representation, is used: the normal exponential moment gives and the independent increment multiplier has conditional mean one. The exponential Brownian martingale Elementary predictable Brownian integrands Continuous-time filtrations and all-pairs martingales
A martingale sampled on a deterministic finite grid is a discrete martingale, and its expectation at a bounded discrete stopping index is unchanged. Optional sampling for bounded stopping times
The normalized Brownian process has measurable time coordinates, continuous paths and zero initial value everywhere, and agrees with the original process on one measurable full event. No claim of adaptation of the normalized process to the original filtration is needed. Brownian motion Brownian motion has a jointly measurable continuous version
For increasing measurable events, the measure of their union is the supremum of their measures. Continuity from below for measures
Full AC is assumed for the Brownian and conditional-expectation interfaces and the discrete optional-sampling theorem. The Axiom of Choice
Verification
Fix , and an integer . Set , , and use the original adapted process on this grid. Define as the first index with , or if there is no such index. For , the event is the finite union and is in ; the event for is the whole space. Thus is a bounded discrete stopping index for the grid filtration. By [F1] and [F2], . This variable is measurable and integrable, being a finite sum of integrable grid values times indicators.
Let . On the selected value satisfies and , whence . Positivity therefore gives No continuous-time hitting time or finiteness of an unbounded hitting time has entered.
Write . This is the supremum over the countable union of the nested dyadic grids: for any in the interval there are grid times tending to it, and continuity gives convergence of the path values. The supremum is finite, since a continuous function on a compact interval is bounded. Measurability also follows from the countable supremum. The normalized grid events increase to and have the same probabilities as , since the original and normalized paths agree on the common full event. Consequently [F4] and step 2.1 give . Normalizing on another full event gives the same on their full intersection, so its distribution is independent of the choice.
Choose in step 3.1, the positive minimizer of the quadratic, to get . Since for every , take the explicit sequence , , and let tend to infinity in the numerical upper bounds. Continuity of the exponential gives . This last argument does not assume that a dyadic grid attains the continuous maximum or that has no atoms.
The parameter range is . At the probability is one and the limiting bound is one; for the probability is also one, but the displayed formula would be less than one and is not asserted. At and the probability is zero and division by is not used. With fixed, the bound tends to zero as ; with fixed, it tends to one as and to zero as . The real exponential martingale has random magnitude; its integrability follows from its Gaussian unit mean, not a deterministic modulus. Only finite-grid optional sampling is used, so no uniform-integrability assertion for an unbounded stopped family is needed. AC has exactly the interface uses in [F5].
Source notes
The exponential-martingale method is the one indicated by the cited Lawler reference. This proof uses the corollary's direct Gaussian conditioning calculation, finite-grid optional sampling, and a countable dense-grid limit.
Depends on
- The exponential Brownian martingale
- Brownian motion
- Elementary predictable Brownian integrands
- Continuous-time filtrations and all-pairs martingales
- Optional sampling for bounded stopping times
- Brownian motion has a jointly measurable continuous version
- Continuity from below for measures
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
43 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, Sections 3.3 and 3.5 (standard reference, not scraped)