Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Dynkin formula for bounded Brownian stopping

Statement

Assume the Axiom of Choice. Let d1 be a finite integer and let B be standard d-dimensional Brownian motion d-dimensional Brownian motion on a filtered probability space. Use the following vector filtration hypothesis: B is adapted, and for 0s<t the entire vector BtBs is independent of Fs and has law Nd(0,(ts)Id). Let xRd and let τ be a stopping time with 0τK everywhere for a fixed K>0. Let fCc2(Rd), meaning a twice continuously differentiable real function with compact support The spaces Cc(Rn) and Cc(Rn) Ck maps and multi-index derivative notation in Euclidean space.

Fix one measurable probability-one event of continuity and zero start for B, and replace its whole path by zero outside that event, obtaining B^. Write Bx=x+B^ in the formula below. This normalization is used for path evaluation and integration, while the vector filtration hypothesis concerns the original adapted process. In particular no transfer of adaptation through an arbitrary ambient null set is assumed. Then E[f(Bτx)]=f(x)+E0τLf(Bsx)ds,Lf=12Δf. The generator notation is that of The Brownian differential generator. Both random variables are measurable and bounded. They agree with the literal original path expressions on the one specified full event, and the expectations do not depend on the chosen normalization event. If the given deterministic bound holds only almost surely, replace τ by τK for evaluation; the formula agrees on {τK}. No shifted cylinder-space law or stochastic integral is needed to interpret this identity.

Facts & Assumptions

Given: AC, d,B,(Ft),x,K,τ,f and the vector filtration hypothesis of the Statement.

[F1]

A standard vector Brownian motion has a common measurable event of continuity and zero start; each coordinate is scalar Brownian motion. Normalizing its finitely many coordinates on that common event gives an everywhere-continuous, jointly measurable vector process, agreeing with B there. d-dimensional Brownian motion Brownian motion has a jointly measurable continuous version

[F2]

The meaning of a stopping time is {τt}Ft for every t0. Adaptation makes each original Bt measurable for Ft for every t0. Continuous-time stopping times and stopped sigma-algebras Continuous-time filtrations and all-pairs martingales

[F4]

For a Gaussian vector Z of law Nd(0,hId), its coordinates are independent centered N(0,h) variables. In particular EZiZj=hδij, EZ2=dh, and EZ43d2h2, using (iZi2)2diZi4 and the scalar fourth moment. d-dimensional Brownian motion Gaussian even moments for Brownian increments

[F5]

An integrable variable independent of a sigma-algebra has constant conditional expectation; bounded known factors can be taken out, and conditional expectation has linearity and expectation preservation. Conditioning a known variable and an independent variable Taking out what is known Basic algebra and order properties of conditional expectation

[F6]

Dominated convergence passes almost-sure limits through expectations when there is one integrable bound. Dominated convergence

[F7]

AC is the declared ambient assumption for the conditional-expectation interfaces above; it does not supply the Brownian motion, its filtration, or its Gaussian increment laws, which are given in the Statement and recorded in [F1], [F4], and [F5]. The function Lf here is precisely one half of the sum of the second partial derivatives. The Axiom of Choice The Brownian differential generator

[F8]

Under Countable Choice (supplied by AC), a bounded Riemann-integrable function on a nondegenerate compact interval has the same Lebesgue integral. A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral

Proof

technique · direct
1.1

The functions f, its first partial derivatives and its second partial derivatives are continuous and vanish outside a compact set: outside the support of f it vanishes on a neighborhood, so all these derivatives are zero. They are bounded: continuity provides a neighborhood with a finite bound at each point of the compact support, and a finite subcover gives a common bound. The Hessian Hf is uniformly continuous on all of Rd. To see the latter, enclose the support in a ball of radius R and apply [F3] on the ball of radius R+1. For points at distance less than 1, either both are in that larger ball or both Hessians vanish; this gives global uniform continuity. Fix C bounding the Hessian operator norm and put ω(r)=supyzrHf(y)Hf(z). Then 0ω(r)2C and ω(r)0 as r0. Applying the degree-one formula in [F3] and subtracting the base Hessian gives f(y+z)f(y)=f(y)z+12zTHf(y)z+R(y,z),R(y,z)12ω(z)z2. The remainder is defined by the displayed difference, so no measurable selection of the Lagrange point is used.

F3given
1.2

Fix a positive integer n, put m=2n, h=K/m and tj=jh for 0jm. Let τn=hτ/h; then ττnK and 0τnτ<h unless equality already holds. Each grid event {τn>tj}={τ>tj} belongs to Ftj by [F2]. Pathwise telescoping for the original process Yt=x+Bt gives f(Yτn)f(Y0)=j=0m11{τ>tj}(f(Ytj+1)f(Ytj)). This includes τ=0 (every summand vanishes) and τ=K (every grid increment is included).

F2given
2.1

For every random vector Y and Gaussian increment Z of variance hId, regardless of their dependence, the uniform bound of step 1.1 and [F4] imply ER(Y,Z)12ω(δ)dh+Cδ23d2h2 for every δ>0: split at Zδ, and use Z21Z>δδ2Z4 on the complement. Thus there is a deterministic function ε(h)0 as h0 such that ER(Y,Z)hε(h) uniformly in Y. Indeed divide the displayed bound by h, first send h to zero for fixed δ, and then send δ to zero.

F4step 1.1
2.2

Every grid evaluation is unchanged almost surely when Y is replaced by Bx=x+B^, because the processes agree on the common full event in [F1]. Joint measurability of Bx makes Bτx measurable: the map ω(τ(ω),ω) is measurable into the product sigma-algebra, as is seen on rectangles. Alternatively its coordinates are the limits of the measurable finite grid evaluations Bτnx, since every path is continuous. Consequently f(Bτnx)f(Bτx) everywhere and the variables are bounded by f. Their expectations converge by [F6].

F1F2F6step 1.2
3.1

In each summand apply step 1.1 with y=Ytj and z=Btj+1Btj. The indicator, gradient and Hessian at Ytj are bounded Ftj-measurable factors. The entire increment vector is independent of that sigma-algebra by the explicit hypothesis. Hence its coordinate means are zero and its conditional coordinate products have means hδik by [F4] and [F5]. The linear term therefore has expectation zero, and the quadratic term has expectation hE[1{τ>tj}Lf(Ytj)]. All terms are integrable by bounded derivatives and Gaussian moments. The sum of the absolute remainder expectations is at most mhε(h)=Kε(h) by step 2.1. Since Y0=x almost surely, Ef(Yτn)f(x)Ej=0m1h1{τ>tj}Lf(Ytj)Kε(h)0.

F4F5F7step 1.1step 2.1step 1.2
4.1

For each normalized path put g(s)=Lf(Bsx). This is continuous on [0,K] and bounded by Lf. The sum in step 3.1 with Bx is the left Riemann sum on [0,τn]. Its difference from 0τng(s)ds is bounded by Ksupsthg(s)g(t), which tends to zero by [F3]. The extra interval between τ and τn contributes at most hLf. Thus these measurable sums converge everywhere to the stated pathwise Lebesgue integral, using [F8] (and the zero integral if τn=0), which is therefore measurable, and each sum and the limit are bounded by KLf. By [F6] their expectations converge.

F3F6F7F8step 1.2step 2.2
5.1

Passing to the limit in step 3.1 using steps 2.2 and 4.1 proves the asserted identity. Changing the normalization event changes neither random expression on the intersection of the two measurable full events, so the expectations are unchanged. The argument uses the original adapted process only on finite deterministic grids and never claims that the normalized process is adapted to the original filtration.

step 3.1step 2.2step 4.1F1
6.1

For τ=0 the integral is zero and B0x=x everywhere, and for f=0 both sides vanish. Deterministic stopping times are included; d=1 gives the scalar statement, while d=0 is excluded. If Lf=0 the displayed identity directly reduces to Ef(Bτx)=f(x); no maximum principle or non-compact affine test is invoked. Compact support supplies uniform boundedness and Hessian continuity, and the deterministic bound K controls the summed remainders and both dominated limits. Full AC is declared for the conditional-expectation interfaces identified in [F7] and supplies the Countable Choice used in [F8]; the Brownian and Gaussian data remain hypotheses. There is no additional path selection and no assertion for unbounded τ.

F7F8step 1.1step 3.1step 2.2step 4.1step 5.1

Source notes

Lawler's Brownian generator computation in Section 2.10 motivates the Taylor argument. Here the stopped expectation identity is proved directly with finite Gaussian grids, a uniform second-order remainder estimate, and two bounded limits. It does not invoke the general multidimensional Ito theorem.

Depends on

Used by

Dependency tree · two levels

119 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