Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Exponential martingale Brownian tail bound

Example

Assume AC and hypothesis (H) of Elementary predictable Brownian integrands. Let B 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 B^. The supremum below means the supremum of this continuous representative; its distribution is independent of that normalization. For a>0 and T>0, P(sup0tTB^ta)exp(a22T).

Facts & Assumptions

Given: AC, (H), B, its normalized representative B^, and a,T>0 as in the Example.

[F1]

The positive process Zt=exp(θBtθ2t/2) 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 EZt=1 and the independent increment multiplier has conditional mean one. The exponential Brownian martingale Elementary predictable Brownian integrands Continuous-time filtrations and all-pairs martingales

[F2]

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

[F3]

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

[F4]

For increasing measurable events, the measure of their union is the supremum of their measures. Continuity from below for measures

[F5]

Full AC is assumed for the Brownian and conditional-expectation interfaces and the discrete optional-sampling theorem. The Axiom of Choice

Verification

technique · direct
1.1

Fix 0<b<a, θ>0 and an integer n1. Set m=2n, tj=jT/m, and use the original adapted process on this grid. Define J as the first index j{0,,m} with Btj>b, or m if there is no such index. For j<m, the event {Jj} is the finite union kj{Btk>b} and is in Ftj; the event for j=m is the whole space. Thus J is a bounded discrete stopping index for the grid filtration. By [F1] and [F2], EZtJ=1. This variable is measurable and integrable, being a finite sum of integrable grid values times indicators.

F1F2given
2.1

Let En={max0jmBtj>b}. On En the selected value satisfies BtJ>b and tJT, whence ZtJexp(θbθ2T/2). Positivity therefore gives P(En)exp(θ2T/2θb). No continuous-time hitting time or finiteness of an unbounded hitting time has entered.

F1step 1.1
3.1

Write MT=suptTB^t. This is the supremum over the countable union of the nested dyadic grids: for any t 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 E^n={maxjB^tj>b} increase to {MT>b} and have the same probabilities as En, since the original and normalized paths agree on the common full event. Consequently [F4] and step 2.1 give P(MT>b)exp(θ2T/2θb). Normalizing on another full event gives the same MT on their full intersection, so its distribution is independent of the choice.

F3F4step 2.1
4.1

Choose θ=b/T in step 3.1, the positive minimizer of the quadratic, to get P(MT>b)eb2/(2T). Since {MTa}{MT>b} for every 0<b<a, take the explicit sequence bk=a(11/k), k2, and let k tend to infinity in the numerical upper bounds. Continuity of the exponential gives P(MTa)ea2/(2T). This last argument does not assume that a dyadic grid attains the continuous maximum or that MT has no atoms.

step 3.1
5.1

The parameter range is a,T>0. At a=0 the probability is one and the limiting bound is one; for a<0 the probability is also one, but the displayed formula would be less than one and is not asserted. At T=0 and a>0 the probability is zero and division by T is not used. With T fixed, the bound tends to zero as a; with a>0 fixed, it tends to one as T and to zero as T0. 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].

F1F3F5step 1.1step 4.1

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

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