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 , an open parameter set , and the finite response policy with nonempty fixed support and score vectors from the generation protocol. For any fixed finite reward function on that support, define
Then, for every ,
Statement references
Facts & Assumptions
Given: A fixed prompt , its finite response list and support, the differentiable normalized policy, and a fixed finite-valued reward function .
Finite truncated response spaces, correctness predicates, and verifiers: the support is finite and fixed; each supported mass is positive and totally differentiable, the masses sum to one, and .
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.
The chain rule for total derivatives: and The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: for positive , the chain rule gives .
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 terms is defined by recursion, and induction using the binary sum rule differentiates it term by term.
The total (Fréchet) derivative as the linear first-order approximation with remainder and The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: total differentiability supplies the derivative map, and the gradient is its scalar-valued coordinate vector.
Use one-based coordinate labels for vectors in , , and in the supplier gradient convention. Every score vector lies in ; write for its th coordinate. For a finite random vector , write for its th coordinate and define as the vector whose th coordinate is the finite scalar sum for ; vector sums and equalities are coordinatewise.
Proof
Given: The objects and hypotheses in the Statement.
For each coordinate and supported response , [F2] supplies differentiability and positive mass, so [F3] and [F1] give . This holds for every coordinate of each score vector.
Fix a coordinate . By [F4], differentiate the finite normalization identity in coordinate term by term. Using step 1.1 and [F6], the th coordinate of the expected score is . This holds for every , proving the vector identity.
Fix a coordinate . Since is fixed and finite, [F4] differentiates in coordinate term by term. Substituting step 1.1, the th coordinate of is . By [F6], these are the coordinates of the stated vector expectation; since this holds for every , 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
- Finite truncated response spaces, correctness predicates, and verifiers
- Differentiable stationary stochastic policies and score vectors
- The total (Fréchet) derivative $Df(a)$ as the linear first-order approximation with $o(\|h\|_2)$ remainder
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- Finite sums and finite products, by recursion
- Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
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
- Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, second-edition draft (standard reference, not scraped)