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.

Hitting probabilities from an exponential martingale

Example

Assume the Axiom of Choice and the standing hypothesis (H) of Elementary predictable Brownian integrands. Let a,b>0, let Z be the coordinate process under the canonical shifted Brownian law Px on continuous path space, let μ be real, and let Xt:=Zt+μt for x(a,b). Let τ:=inf{t0:Xt(a,b)} be its first exit time from (a,b). Then for μ0 Px(X exits (a,b) at b)=1e2μ(x+a)1e2μ(a+b), and for μ=0 the probability is (x+a)/(a+b).

Facts & Assumptions

Given: AC, (H), a,b>0, a start x(a,b), a real μ0, the continuous coordinate process Z under Px equipped with its usual augmented natural filtration, the drifted process Xt=Zt+μt, and the exit time τ. Brownian motion started at x Natural and usual augmented Brownian filtrations

[F1]

Exponential martingale. Under Px, Wt:=Ztx is a standard Brownian motion. Consequently Mt:=exp(2μXt)=e2μxexp(2μWt2μ2t) is a positive continuous martingale, so ExMt=e2μx and Ex[MtFs]=Ms. The exponential Brownian martingale Brownian motion started at x Brownian motion

[F2]

The exit time is a stopping time. The set C=(,a][b,) is closed, and every canonical path of X is continuous. Hence {τt}=m1qQ[0,t]{dist(Xq,C)<1/m}, which belongs to the coordinate filtration at time t; thus τ is a stopping time. Continuous-time stopping times and stopped sigma-algebras Continuity of f:AR at a point of A and on A: the ε-δ condition, its agreement with limxcf(x)=f(c) at a limit point, and continuity at an isolated point Brownian motion started at x

[F3]

Finiteness of τ. By the law of the iterated logarithm (Ztx)/t0 almost surely, so Xt/tμ0 and Xt+ or according to the sign of μ. Continuity forces a boundary crossing, so τ< almost surely. Brownian law of the iterated logarithm at infinity Continuity of f:AR at a point of A and on A: the ε-δ condition, its agreement with limxcf(x)=f(c) at a limit point, and continuity at an isolated point

[F4]

Finite-grid sampling. The restriction of an all-pairs continuous martingale to a finite deterministic grid is a discrete martingale, so discrete optional sampling applies to bounded grid-valued stopping indices. Conditional expectations of one fixed integrable variable are uniformly integrable, and uniform integrability plus convergence in probability gives convergence in L1. Optional sampling for bounded stopping times Uniform integrability of conditional expectations of one variable Uniform integrability plus convergence in probability implies L1 convergence Continuous-time filtrations and all-pairs martingales Convergence in probability

[F5]

Domination. On the probability-one event Z0=x, continuity gives XτT[a,b] for every T>0. Thus 0<MτTK:=max(e2μa,e2μb) simultaneously for all T. This almost-sure deterministic bound suffices for dominated convergence as T. Dominated convergence

[F6]

AC bookkeeping. Full AC supplies the conditional-expectation interface and the inherited choice requirements of the Brownian and LIL suppliers. The Axiom of Choice

Verification

technique · direct
1.1

Stopping identity at a bounded continuous time: fix T>0, put ρ=τT, and for n1 round ρ upward to the grid {jT2n:0j2n}, obtaining ρn. At a grid point u<T, {ρnu}={ρu}Fu, so ρn is a bounded stopping index for the sampled discrete martingale. Discrete optional sampling gives ExMρn=ExM0=e2μx. It also identifies Mρn as a conditional expectation of the fixed integrable variable MT at the grid stopped sigma-algebra, so [F4] makes (Mρn)n uniformly integrable. Continuity gives MρnMρ almost surely, hence in probability; [F4] upgrades this to L1, proving ExMτT=e2μx. This uses the discrete theorem only on finite grids and proves the continuous bounded-time passage explicitly.

F1F2F4
2.1

Define Xτ by evaluation on {τ<} and as 0 otherwise, and define Mτ=e2μXτ. These are measurable: bounded-time evaluations are limits of the finite-grid evaluations in step 1.1, and the finite-exit value is their eventual value as integer horizons increase. Since τ< almost surely by [F3], MτTMτ as T; the deterministic bound in [F5] gives ExMτ=e2μx by dominated convergence.

F1F3F5step 1.1
3.1

The value at the exit: Xτ{a,b} almost surely by continuity and the definition of τ as the first exit, so Mτ=e2μXτ equals e2μa on {Xτ=a} and e2μb on {Xτ=b}. Writing p:=Px(Xτ=b), the identity of step 2.1 becomes e2μx=pe2μb+(1p)e2μa.

F2step 2.1
4.1

Solving: p=e2μxe2μae2μbe2μa=1e2μ(x+a)1e2μ(a+b), multiplying numerator and denominator by e2μa; the denominator is nonzero because μ0 and a+b>0 make the two endpoint exponentials distinct.

step 3.1
5.1

The case μ=0: then X=Z is Brownian motion started at x, and Two-sided Brownian exit probability gives Px(Xτ=b)=(x+a)/(a+b) directly; this agrees with the limit of the formula of step 4.1 as μ0.

F1given
6.1

Boundary and consistency cases: for xa the probability tends to 0 and for xb it tends to 1, consistent with the starting point being at the boundary; for μ0 step 4.1 has a removable singularity with limit (x+a)/(a+b); for μ<0 the same computation applies with the sign carried through; the stopping time is not bounded, and the passage to the limit was justified by the uniform boundedness of Mτt from [F5] rather than by assuming uniform integrability of an unbounded family; the exit time is finite almost surely by the law of the iterated logarithm; and AC supplies the conditional-expectation interface and the inherited Brownian and LIL choice requirements, as declared in the Given hypotheses.

F3F5F6step 4.1step 5.1

Source notes

Durrett, Section 7.5, Theorem 7.5.6, proves the exponential Brownian martingale by Gaussian conditioning. The finite-grid conditional-expectation and uniform-integrability suppliers cited in [F4] justify the bounded-time passage here; the drifted exit formula is then the explicit two-point calculation in steps 3.1–4.1. The proof above verifies the stopping-time property of the closed-set exit time through rational approximations, uses boundedness on the exit interval for the passage to the limit, and treats μ=0 through the two-sided exit theorem rather than through the singular limit of the formula.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

113 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