Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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-horizon policy ratios are trajectory Radon-Nikodym derivatives

Statement

Assume AC and the finite-horizon dataset conditions of the preceding definition, with full horizon coverage PHπ≪PHμ. For 0≤t<H, let Ωt+1 be the finite set of trajectory prefixes through (Rt+1,St+1), and let Pt+1σ be the marginal law of this prefix under policy σ∈{π,μ}. On a behavior-positive prefix define

W0:t=∏k=0tπ(Ak∣Sk)μ(Ak∣Sk),

and set W0:t=0 on behavior-null prefixes. Then Pt+1π≪Pt+1μ, and W0:t is a version of dPt+1π/dPt+1μ up to Pt+1μ-almost-everywhere equality. In particular, for every real G integrable under PHπ, the full-horizon weight W0:H−1 satisfies

EPHμ[W0:H−1G]=EPHπ[G],EPHμ[W0:H−1∣G∣]<∞.

The same identity holds prefixwise: for each 0≤t<H and every real g integrable under Pt+1π, with g evaluated on the observed prefix,

EPHμ[W0:tg]=EPHπ[g],EPHμ[W0:t∣g∣]<∞.

Statement references

Facts & Assumptions

Given: AC, a finite MDP with fixed initial state s0, finite horizon H, stationary policies π,μ, their induced laws PHπ,PHμ, full horizon coverage PHπ≪PHμ, and integrable G.

[A1]

The Axiom of Choice: AC states that every family of nonempty sets has a choice function; the finite-MDP path-law supplier and the RN density and chain-rule suppliers assume it.

[F1]

Finite-horizon offline reinforcement-learning dataset and coverage: for each policy σ, a feasible length-H trajectory atom has mass ∏k=0H−1σ(ak∣sk)p(sk+1,rk+1∣sk,ak); the initial state and transition/reward law are the same for π and μ.

[F2]

A finite MDP policy generates action-state-reward trajectories: under AC, a finite MDP and stationary policy have the finite-prefix probabilities given by the same product formula.

[F3]

Absolute continuity of a signed or complex measure with respect to a positive measure: PHπ≪PHμ means every PHμ-null measurable set is PHπ-null.

[F4]

A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: under AC, a signed measure ν≪λ with sigma-finite common finite exhaustion has a measurable density unique up to λ-almost-everywhere equality; if ∣ν∣ is finite, the density is integrable.

[F5]

The Radon-Nikodym derivative as an almost-everywhere equivalence class: dν/dλ is the almost-everywhere class of functions representing ν by measurable-set integrals.

[F6]

Radon-Nikodym derivatives satisfy the chain rule along nu << mu << lambda: under AC and the common finite-exhaustion hypotheses, ν≪μ≪λ implies dν/dλ=(dν/dμ)(dμ/dλ) λ-almost everywhere.

[F7]

Integrating against a density agrees with integrating the product: for nonnegative measurable f,g, ∫g d(f dμ)=∫gf dμ on any measure space.

[F8]

Integrable real and complex functions, and their integrals and The Lebesgue integral is linear on L1(μ): real integrable functions have finite positive and negative integrals, and their integrals are linear.

Proof

Given: The hypotheses and conventions in the Statement.

1.1givenF1F3algebra

For a complete trajectory atom τ=(s0,a0,r1,…,aH−1,rH,sH), [F1] gives PHσ({τ})=∏k=0H−1σ(ak∣sk)p(sk+1,rk+1∣sk,ak). If this atom has positive target mass, coverage makes its behavior mass positive. The initial state and every transition/reward factor are common, so on every behavior-positive atom the quotient PHπ({τ})/PHμ({τ}) is exactly ∏k=0H−1π(ak∣sk)/μ(ak∣sk); if the target mass is zero, this quotient is zero.

2.1givenA1F1F2F3F4F5F6step 1.1construct

Fix t<H and project the full trajectory law onto Ωt+1. If a prefix set is behavior-null, its inverse image in ΩH is behavior-null; full coverage makes that inverse image target-null, so Pt+1π≪Pt+1μ. The prefix space is finite. Let λt+1 be counting measure on it; Pt+1μ≪λt+1, and the whole prefix space is a common finite exhaustion for λt+1, Pt+1μ, and Pt+1π. By [A1], [F4]–[F6] give the RN density classes and their chain rule. On each behavior-positive prefix, [F1]–[F2] give the atom-mass quotient by cancelling the common initial and transition/reward factors, leaving ∏k=0tπ(Ak∣Sk)/μ(Ak∣Sk). Thus W0:t=dPt+1π/dPt+1μ almost everywhere.

3.1givenF7F8step 2.1algebra∎

Fix t<H and a real g integrable under Pt+1π. Step 2.1 supplies the prefix density W0:t. Applying [F7] to g+ and g− gives EPHμ[W0:t∣g∣]=EPt+1π∣g∣<∞ and equality of the two weighted integrals for each part. Subtracting the finite positive and negative integrals by [F8] proves the prefix expectation identity. Taking t=H−1 and g=G gives the full-horizon assertion.

Depends on

Used by

Dependency tree · two levels

45 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