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.
A dominated pathwise simulation gradient is unbiased
Statement
Gradients are Euclidean column vectors, and vector expectations are taken coordinatewise.
Let be open, let be the simulation payoff from Simulation objectives and unbiased payoff oracles, and fix . Suppose there is an open ball about such that for almost every , is continuously differentiable on and is continuous there, and is measurable for every . Assume for all outside one measurable null set, where is nonnegative and integrable, and assume . Then is Fréchet differentiable at and Thus the pathwise estimator from Pathwise and reparameterized simulation-gradient estimators is unbiased at and has finite coordinate variances.
Facts & Assumptions
Given: The payoff and objective, , the neighborhood and pathwise differentiability, the common integrable derivative envelope, and the square-integrable pathwise gradient in the Statement.
Pathwise and reparameterized simulation-gradient estimators: when the same random input is held fixed, the pathwise estimator is ; the definition by itself does not assert unbiasedness.
The chain rule for total derivatives: : for a differentiable composition, . Gradients are column vectors represented using the Euclidean inner product of The Euclidean inner product on , so .
The second fundamental theorem: if is differentiable on with and is integrable, then and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: if is continuous on a compact interval, it is integrable there and .
Dominated convergence: almost-everywhere convergence under one integrable majorant permits passage of the limit through the integral.
Moments, variance, and covariance on a probability space and Variance and covariance identities for random variables: for square-integrable , .
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for integrable variables and satisfies .
Simulation objectives and unbiased payoff oracles: the objective is .
Proof
Fix nonzero with . For almost every , set on . By [F2], , which is continuous and hence integrable by [F3]. The FTC [F3] gives
For each such , the random variable is measurable: continuity in makes this countable supremum equal the supremum over . It satisfies almost surely. As , continuity of the sample gradient at gives almost surely.
By [F8], . Taking expectations in step 1.1, linearity in [F7] moves the finite inner product through expectation, and [F6] bounds it by . The modulus bound in [F7] therefore bounds the absolute first-order remainder divided by by . Along every sequence of nonzero , [F4] with majorant gives . Hence which is the Fréchet derivative formula.
Each coordinate of the unbiased estimator is square-integrable by the stated second-moment assumption. [F5] therefore gives finite variance for each coordinate.
Depends on
- Pathwise and reparameterized simulation-gradient estimators
- Simulation objectives and unbiased payoff oracles
- Dominated convergence
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- The second fundamental theorem: if $G$ is differentiable on $[a,b]$ with $G' = f$ and $f$ is integrable, then $\int_a^b f = G(b)-G(a)$
- A continuous function on $[a,b]$ is Riemann integrable, by Heine-Cantor and Riemann's criterion
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- Moments, variance, and covariance on a probability space
- Variance and covariance identities for random variables
- Linearity, monotonicity, and the modulus bound for expectation
Used by
Dependency tree · two levels
72 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
- Paul Glasserman, Monte Carlo Methods in Financial Engineering, §7.2.2 (standard reference, not scraped)
- Michael C. Fu, Stochastic Gradient Estimation, preprint of Handbook of Simulation Optimization, §3.1 (standard reference, not scraped)