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

Finite-response score mean and reward-gradient identities

Statement

Fix a prompt q, an open parameter set U⊆Rd, and the finite response policy with nonempty fixed support (b1,…,bm) and score vectors Sθ(q,bj) from the generation protocol. For any fixed finite reward function r on that support, define

J(θ):=∑j=1mπθ(bj∣q)r(bj).

Then, for every θ∈U,

Eθ[Sθ(q,Y)∣q]=0,Eθ[r(Y)Sθ(q,Y)∣q]=∇θJ(θ).

Facts & Assumptions

Given: A fixed prompt q, its finite response list and support, the differentiable normalized policy, and a fixed finite-valued reward function r.

[F1]

Finite truncated response spaces, correctness predicates, and verifiers: the support (b1,…,bm) is finite and fixed; each supported mass is positive and totally differentiable, the masses sum to one, and Sθ(q,bj)=∇θlog⁡πθ(bj∣q).

[F2]

Differentiable stationary stochastic policies and score vectors: a supported policy mass is positive and totally differentiable on its open parameter domain, and its score is the gradient of its logarithm.

[F3]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a) and The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: for positive πθ(bj∣q), the chain rule gives ∇θlog⁡πθ(bj∣q)=∇θπθ(bj∣q)/πθ(bj∣q).

[F4]

Finite sums and finite products, by recursion and Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives: a sum over m terms is defined by recursion, and induction using the binary sum rule differentiates it term by term.

[F6]

Use one-based coordinate labels Xa:=X(a−1) for vectors in Rd, 1≤a≤d, and ∂θa:=∂a−1 in the supplier gradient convention. Every score vector lies in Rd; write Sθ,a(q,bj):=(Sθ(q,bj))a for its ath coordinate. For a finite random vector X, write Xa for its ath coordinate and define Eθ[X∣q] as the vector whose ath coordinate is the finite scalar sum ∑j=1mπθ(bj∣q)Xa(bj) for a=1,…,d; vector sums and equalities are coordinatewise.

Proof

Given: The objects and hypotheses in the Statement.

1.1givenF1F2F3algebra

For each coordinate a=1,…,d and supported response bj, [F2] supplies differentiability and positive mass, so [F3] and [F1] give πθ(bj∣q)Sθ,a(q,bj)=∂θaπθ(bj∣q). This holds for every coordinate of each score vector.

2.1F1F4F5F6step 1.1algebra

Fix a coordinate a. By [F4], differentiate the finite normalization identity ∑j=1mπθ(bj∣q)=1 in coordinate a term by term. Using step 1.1 and [F6], the ath coordinate of the expected score is ∑j=1mπθ(bj∣q)Sθ,a(q,bj)=∑j=1m∂θaπθ(bj∣q)=∂θa1=0. This holds for every a, proving the vector identity.

3.1givenF1F4F5F6step 1.1algebra∎

Fix a coordinate a. Since r(bj) is fixed and finite, [F4] differentiates J(θ)=∑j=1mπθ(bj∣q)r(bj) in coordinate a term by term. Substituting step 1.1, the ath coordinate of ∇θJ(θ) is ∑j=1mr(bj)∂θaπθ(bj∣q)=∑j=1mπθ(bj∣q)r(bj)Sθ,a(q,bj). By [F6], these are the coordinates of the stated vector expectation; since this holds for every a, the vector identity follows.

Remarks

This finite proof uses only the normalized mass function and finite sums. It uses no trajectory law, dominated interchange, conditional expectation, or choice principle.

Depends on

Used by

Dependency tree · two levels

38 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