Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Simulation gradient estimation and simultaneous perturbation — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A moving uniform support contributes a missing score boundary term

Example

For θ>0, let Xθ∼Unif⁡(0,θ) and use constant payoff H(x)=1. The objective is J(θ)=1, so J′(θ)=0. The pathwise representation Xθ=θU, U∼Unif⁡(0,1), has derivative estimator 0. The interior score is −1/θ, so E[H(Xθ)Sθ(Xθ)]=−1/θ; it misses the moving endpoint contribution +1/θ.

Facts & Assumptions

Given: θ>0, the density pθ(x)=θ−11(0,θ)(x) with respect to Lebesgue measure, and the constant payoff H(x)=1.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by the score definition.

[F1]

Score and Fisher information: on the positive-density set the score is ∂θlog⁡pθ(x).

[F2]

Pathwise and reparameterized simulation-gradient estimators: in a representation using a fixed random input U, the pathwise estimator is the derivative with U held fixed.

[F3]

Simulation objectives and unbiased payoff oracles: an objective is the expectation of its integrable simulation payoff.

[F4]

Integrating against a density agrees with integrating the product: expectation under density pθ is integration of the payoff times pθ against Lebesgue measure.

[F5]

Expectation of a nonnegative or integrable random variable: the expectation of an integrable constant random variable is that constant.

Verification

1.1givenF2F3F4algebra

The density is normalized because ∫0θθ−1 dx=1. By [F3] and [F4], the constant payoff has J(θ)=∫0θθ−1 dx=1, hence J′(θ)=0. In the representation Xθ=θU, H(Xθ)=1 for every U, so its pathwise derivative is zero by [F2].

2.1A1F1F5step 1.1algebra

On 0<x<θ, pθ(x)=1/θ, so [F1] gives Sθ(x)=−1/θ almost surely under Pθ. Since H=1, the score product is the constant −1/θ almost surely, and [F5] gives Eθ[H(Xθ)Sθ(Xθ)]=−1/θ. This differs from J′(θ)=0, so the fixed-support score identity does not apply.

3.1givenstep 1.1step 2.1algebra∎

The integral is J(θ)=θ⋅θ−1. Differentiating this product gives the interior density-derivative contribution ∫0θH(x)∂θ(θ−1) dx=−1/θ and the moving-endpoint contribution H(θ)pθ(θ−)=1/θ, where pθ(θ−) is the left limit of the density. Their sum is zero, exactly J′(θ) from step 1.1; the interior score term alone omits this boundary correction.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

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 θ=(0.20,0.20,0.20), take c=0.02 and Rademacher perturbation Δ=(1,−1,1). If the two simulator calls return 13.1 and 12.7, the SPSA estimate is (10,−10,10) 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.

[F1]

Two-evaluation simultaneous-perturbation gradient estimator: with two values Y±, the coordinate output is (Y+−Y−)/(2cΔi).

Verification

1.1givenalgebra

The perturbed parameters are θ+cΔ=(0.22,0.18,0.22) and θ−cΔ=(0.18,0.22,0.18), so both remain in the positive-rate domain.

1.2givenF1algebra

The common numerator is 13.1−12.7=0.4 and 2c=0.04. By [F1], the three outputs are 0.4/0.04=10, 0.4/(−0.04)=−10, and 0.4/0.04=10.

2.1step 1.2givenalgebra∎

The estimate uses the two simulator values for all coordinates, whereas one central-difference pair per coordinate uses 2d=6 calls at d=3. The finite calculation verifies the estimator output only; it does not certify its bias, variance, or convergence for the biological model.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Common random numbers can remove finite-difference noise

Example

Assume AC and fix c>0. Let Z∼N(0,1) and let one simulation output be Y(θ,Z)=θ+Z, so J(θ)=θ. Using the same Z at θ+c and θ−c gives a central-difference estimate identically equal to 1. Using independent Z+ and Z− gives variance 1/(2c2).

Facts & Assumptions

Given: AC, a radius c>0, a standard normal noise variable and the simulator Y(θ,Z)=θ+Z.

[F1]

Coupled finite-difference simulation-gradient estimator: the paired estimate is (Y+−Y−)/(2c), with the joint law fixed by the coupling.

[F2]

Coupled finite differences have a covariance-controlled variance: the variance is (Var⁡Y++Var⁡Y−−2Cov⁡(Y+,Y−))/(4c2).

[F3]

Standard normal and normal laws, The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω) and A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: AC implies Countable Choice, and reflection z↦−z preserves Lebesgue measure; since the density ϕ(z) is even, the standard normal law is symmetric.

[F4]

Expectations factor over finite products of independent random variables: independent integrable random variables have factorized product expectation.

[F5]

Verification

1.1givenF1F3F5F6algebra

By [F5], 2∣Z∣≤1+Z2 gives integrability, and symmetry in [F3] implies EZ=E[−Z]=−EZ, hence EZ=0. Therefore [F5] gives J(θ)=E[θ+Z]=θ, as stated; [F5] and [F6] also give Var⁡(Z)=1. With a shared Z, Y(θ+c,Z)−Y(θ−c,Z)=2c for every outcome. Thus the coupled estimate is exactly 1 and has variance zero.

1.2F3F4F5F6algebra

With independent Z+,Z−, the estimate is 1+(Z+−Z−)/(2c). Each noise has the same mean zero and variance one just proved; by [F4] their product expectation factors, so their covariance is zero.

2.1F2step 1.1step 1.2algebra∎

Applying [F2] gives variance (1+1)/(4c2)=1/(2c2). The variance contrast is caused by the coupling covariance; common random numbers do not guarantee this benefit for every payoff.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Gaussian reparameterization gives two gradient estimators

Example

Let Z∼N(0,1), set Xθ=θ+Z, and use payoff H(x)=x. The objective is J(θ)=EXθ=θ. The pathwise estimator is constant 1; the score estimator is Xθ(Xθ−θ), which is unbiased and has variance θ2+2.

Facts & Assumptions

Given: A standard normal Z, the affine representation Xθ=θ+Z, and the identity payoff H(x)=x.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by the normal-law and score interfaces below.

[F1]

Standard normal and normal laws: Z has symmetric density ϕ(z)=(2π)−1/2e−z2/2, and Xθ is the location-shifted normal law N(θ,1). A positive-variance normal law has its location-scale density gives its density pθ(x)=ϕ(x−θ) on R.

[F2]
[F3]

Pathwise and reparameterized simulation-gradient estimators: with the same Z held fixed, the pathwise estimator is ∂θH(Xθ).

[F4]

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.

[F5]

Score and Fisher information: on positive density support the score is ∂θlog⁡pθ.

[F6]

The likelihood-ratio score gradient is unbiased on fixed support: under fixed support, dominated density differentiation, and a finite weighted second moment, ∂θEθH=Eθ[HSθ].

[F7]

A positive-variance normal law has its location-scale density: N(0,2) has density (4π)−1/2e−z2/4.

[F8]

Integrating against a density agrees with integrating the product: the integral of a nonnegative measurable function under a law with density pθ is its integral after multiplication by pθ against Lebesgue measure.

[F9]

Change of variables for expectation: if Z2=2Z with Z∼N(0,1), then EZ22=2EZ2.

[F10]

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.

[F11]

The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω) 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 z↦−z with the even density in [F1] shows that the standard normal law is symmetric.

[F12]

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

1.1givenF1F2F3F4F11F12algebra

From [F2], 2∣Z∣≤1+Z2 makes Z integrable. By [F11], the law is symmetric; [F12] therefore gives EZ=E[−Z]=−EZ, so EZ=0. Linearity in [F12] gives EXθ=θ. The pathwise payoff derivative is 1 by [F3], has envelope M=1 and second moment 1, so [F4] gives the correct derivative J′(θ)=1 and variance zero.

1.2A1F1F5algebra

Differentiating log⁡pθ(x)=−12(x−θ)2−12log⁡(2π) gives Sθ(x)=x−θ. The support is the fixed set R.

1.3A1F1F2F6F7F8F9F11F12algebra

Fix θ0 and restrict η to ∣η−θ0∣<1. With z=x−θ0 and a=η−θ0, (z−a)2≥z2/2−a2, while ∣x∣∣x−η∣≤(∣z∣+∣θ0∣)(∣z∣+1). Hence ∣x ∂ηpη(x)∣≤Cθ0(1+z2)e−z2/4 for a finite constant Cθ0. By [F7]–[F9], the integral of this majorant is a constant times E[1+Z22]<∞ for Z2∼N(0,2). Also 2∣Z∣3≤Z2+Z4 makes Z3 integrable by [F2]; symmetry in [F11] and [F12] gives EZ3=0. Therefore Eθ[Xθ2Sθ(Xθ)2]=E[(θZ+Z2)2]=θ2+3<∞ by [F2], so [F6] applies.

2.1A1F2F6F10step 1.1step 1.3algebra∎

By [F6], the score estimator has mean J′(θ)=1. Its variance is E[(θZ+Z2)2]−1=θ2+3−1=θ2+2, using [F2] and [F10].