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.
Simulation gradient estimation and simultaneous perturbation — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conjugate families and Gaussian conditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scores and Information Bounds
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Simulation gradient estimation and simultaneous perturbation
- Sine, Cosine, and the Definition of Pi
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
Examples
These examples compare pathwise and score gradients in a Gaussian location model, show the missing boundary term for a moving support, compute the covariance benefit of common random numbers, and work through the two simulator calls in one biological-model SPSA step. The numerical outputs in the black-box example verify the estimator arithmetic only; they are not convergence or accuracy certificates for that model.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A moving uniform support contributes a missing score boundary term
Example
For , let and use constant payoff . The objective is , so . The pathwise representation , , has derivative estimator . The interior score is , so ; it misses the moving endpoint contribution .
Facts & Assumptions
Given: , the density with respect to Lebesgue measure, and the constant payoff .
The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by the score definition.
Score and Fisher information: on the positive-density set the score is .
Pathwise and reparameterized simulation-gradient estimators: in a representation using a fixed random input , the pathwise estimator is the derivative with held fixed.
Simulation objectives and unbiased payoff oracles: an objective is the expectation of its integrable simulation payoff.
Integrating against a density agrees with integrating the product: expectation under density is integration of the payoff times against Lebesgue measure.
Expectation of a nonnegative or integrable random variable: the expectation of an integrable constant random variable is that constant.
Verification
The density is normalized because . By [F3] and [F4], the constant payoff has , hence . In the representation , for every , so its pathwise derivative is zero by [F2].
On , , so [F1] gives almost surely under . Since , the score product is the constant almost surely, and [F5] gives . This differs from , so the fixed-support score identity does not apply.
The integral is . Differentiating this product gives the interior density-derivative contribution and the moving-endpoint contribution , where is the left limit of the density. Their sum is zero, exactly from step 1.1; the interior score term alone omits this boundary correction.
One two-call SPSA estimate for an expensive biological simulator
Example
Suppose a costly black-box biological simulator reports a scalar mismatch for three positive kinetic rates. At , take and Rademacher perturbation . If the two simulator calls return and , the SPSA estimate is and uses two calls, compared with six coordinatewise central-difference calls.
Facts & Assumptions
Given: The parameter, step, perturbation, two observed simulator outputs, and the SPSA procedure in the Statement.
Two-evaluation simultaneous-perturbation gradient estimator: with two values , the coordinate output is .
Verification
The perturbed parameters are and , so both remain in the positive-rate domain.
The common numerator is and . By [F1], the three outputs are , , and .
The estimate uses the two simulator values for all coordinates, whereas one central-difference pair per coordinate uses calls at . The finite calculation verifies the estimator output only; it does not certify its bias, variance, or convergence for the biological model.
Common random numbers can remove finite-difference noise
Example
Assume AC and fix . Let and let one simulation output be , so . Using the same at and gives a central-difference estimate identically equal to . Using independent and gives variance .
Facts & Assumptions
Given: AC, a radius , a standard normal noise variable and the simulator .
Coupled finite-difference simulation-gradient estimator: the paired estimate is , with the joint law fixed by the coupling.
Coupled finite differences have a covariance-controlled variance: the variance is .
Standard normal and normal laws, The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice () and A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: AC implies Countable Choice, and reflection preserves Lebesgue measure; since the density is even, the standard normal law is symmetric.
Expectations factor over finite products of independent random variables: independent integrable random variables have factorized product expectation.
Gaussian even moments for Brownian increments gives ; Change of variables for expectation and symmetry in [F3] then give . Linearity, monotonicity, and the modulus bound for expectation gives linearity of expectation.
Verification
By [F5], gives integrability, and symmetry in [F3] implies , hence . Therefore [F5] gives , as stated; [F5] and [F6] also give . With a shared , for every outcome. Thus the coupled estimate is exactly and has variance zero.
With independent , the estimate is . Each noise has the same mean zero and variance one just proved; by [F4] their product expectation factors, so their covariance is zero.
Applying [F2] gives variance . The variance contrast is caused by the coupling covariance; common random numbers do not guarantee this benefit for every payoff.
Gaussian reparameterization gives two gradient estimators
Example
Let , set , and use payoff . The objective is . The pathwise estimator is constant ; the score estimator is , which is unbiased and has variance .
Facts & Assumptions
Given: A standard normal , the affine representation , and the identity payoff .
The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by the normal-law and score interfaces below.
Standard normal and normal laws: has symmetric density , and is the location-shifted normal law . A positive-variance normal law has its location-scale density gives its density on .
Pathwise and reparameterized simulation-gradient estimators: with the same held fixed, the pathwise estimator is .
A dominated pathwise simulation gradient is unbiased: an integrably dominated continuous pathwise derivative is the derivative of the expected payoff and has finite variance under its second-moment hypothesis.
Score and Fisher information: on positive density support the score is .
The likelihood-ratio score gradient is unbiased on fixed support: under fixed support, dominated density differentiation, and a finite weighted second moment, .
Integrating against a density agrees with integrating the product: the integral of a nonnegative measurable function under a law with density is its integral after multiplication by against Lebesgue measure.
Change of variables for expectation: if with , then .
Moments, variance, and covariance on a probability space and Variance and covariance identities for random variables: variance is the centered second moment and equals the second moment minus squared mean.
The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice () and A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: AC implies Countable Choice, and applying change of variables to reflection with the even density in [F1] shows that the standard normal law is symmetric.
Change of variables for expectation and Linearity, monotonicity, and the modulus bound for expectation: integrable functions of a random variable may be integrated against its law, and expectation is linear.
Verification
From [F2], makes integrable. By [F11], the law is symmetric; [F12] therefore gives , so . Linearity in [F12] gives . The pathwise payoff derivative is by [F3], has envelope and second moment , so [F4] gives the correct derivative and variance zero.
Differentiating gives . The support is the fixed set .
Fix and restrict to . With and , , while . Hence for a finite constant . By [F7]–[F9], the integral of this majorant is a constant times for . Also makes integrable by [F2]; symmetry in [F11] and [F12] gives . Therefore by [F2], so [F6] applies.
By [F6], the score estimator has mean . Its variance is , using [F2] and [F10].