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.

Expected exit time from an interval

Example

Assume the Axiom of Choice and the standing hypothesis (H) of Elementary predictable Brownian integrands. Let a,b>0, let Bx be the coordinate process under the shifted law Px on continuous path space, with x(a,b) Brownian motion started at x, equipped with its usual augmented natural filtration Natural and usual augmented Brownian filtrations, and let τ:=inf{t0:Btx(a,b)} be the first exit time from the interval. Then Exτ=(x+a)(bx),in particularE0τ=ab.

Facts & Assumptions

Given: AC, (H), a,b>0, a start x(a,b), the canonical shifted process Bx with its usual augmented natural filtration, and the exit time τ of (a,b).

[F0]

Stopping and normalization. Put C=(,a][b,). Every canonical path is continuous, so for each t0, {τt}=m1qQ[0,t]{dist(Bqx,C)<1/m}. A hit yields arbitrarily close rational times; conversely the continuous distance attains its zero infimum on [0,t]. Thus the literal exit is a stopping time. Under Px, W=Bxx is Brownian with the usual Brownian filtration. Dynkin uses its everywhere-continuous zero-start normalization; it agrees with W on {B0x=x}, 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

[F1]

Dynkin formula. If fCc2(R) and σ is a bounded stopping time, then Ex[f(Bσx)]=f(x)+Ex0σ12f(Bsx)ds. Dynkin formula for bounded Brownian stopping Brownian motion started at x

[F2]

Cutoff extension of a quadratic. For u(y)=(y+a)(by) there is fCc2(R) with f=u on a neighbourhood of [a,b] and f=2 there: choose R>max(a,b) and multiply u by χR, the smooth compactly supported cutoff equal to 1 on [R,R], using Explicit compactly supported smooth cutoffs; the resulting function is Cc, hence Cc2, and therefore bounded. The spaces Cc(Rn) and Cc(Rn)

[F3]

Finiteness of the exit time and endpoint values. The path of Bx is continuous, u(x)>0 at the start and u(a)=u(b)=0. By Two-sided Brownian exit probability, Bx reaches b before a with probability (x+a)/(a+b). The reflected process Bx is Brownian motion started at x by Brownian motion, so the same theorem on (b,a) gives probability (bx)/(a+b) that Bx reaches a before b. These disjoint events have probabilities summing to 1, hence τ< almost surely; on {τ<} continuity gives Bτx{a,b} and u(Bτx)=0. Brownian motion started at x 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]

Convergence tools. Dominated convergence applies to bounded sequences of random variables; monotone convergence applies to nondecreasing nonnegative sequences, so E(τn)Eτ including the value +. Dominated convergence Monotone convergence for the integral 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

[F5]

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

technique · direct
1.1

Applying Dynkin: for each integer n1, [F0] shows that the stopping time τn is bounded, so [F1] applied to the function f of [F2] gives Ex[f(Bτnx)]=f(x)+Ex0τn12f(Bsx)ds. On the common event B0x=x, one has Bsx[a,b] for sτ. Since f=u, f=u=2 on a neighbourhood of [a,b], the right-hand side equals u(x)Ex(τn).

F0F1F2
2.1

Left-hand limit: on {τ<} one has BτnxBτx{a,b} by continuity of the path, hence f(Bτnx)0; on {τ=} (a null set by [F3]) the sequence stays bounded and the conclusion is not needed. Since f is bounded, dominated convergence gives Ex[f(Bτnx)]0.

F3F4step 1.1
3.1

Conclusion: combining steps 1.1 and 2.1, u(x)Ex(τn)0, so Ex(τn)u(x); by monotone convergence of the nondecreasing sequence (τn) the limit of the expectations is Exτ, hence Exτ=(x+a)(bx). At x=0 this is ab.

F4step 1.1step 2.1
4.1

Boundary and consistency cases: for xa or xb the formula tends to 0, consistent with the starting point being at the boundary; for a=b and x=0 it gives a2; the cutoff agrees with u 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 Eτ< 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 τn at each n; and the inherited uses of AC are exactly those recorded in [F5], while all Brownian data remain hypotheses.

F1F3F4F5step 3.1

Source notes

The generator identity 12u=1 motivates the calculation. The proof above uses the Dynkin formula of this page on bounded truncations, the explicit C2 cutoff, and monotone convergence to pass to the unbounded stopping time.

Depends on

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