Alphabeta Math
TheoremStatement: 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.

Trajectory and per-decision importance sampling are unbiased under coverage

Statement

Assume AC and the finite-horizon dataset conditions with full trajectory coverage PHπ≪PHμ, true known behavior propensities, and the integrability hypotheses in the dataset definition. Whenever the preceding algorithm returns numerical estimates, all three estimates are finite. Under the behavior-generated law of the n independent trajectories, its unsupported status occurs only on a null event; assign any fixed finite values to the three estimator expressions there. The ordinary trajectory estimator and per-decision estimator then each have expectation JH(π;s0). This statement makes no finite-sample unbiasedness claim for the self-normalized weighted estimator.

Facts & Assumptions

Given: AC, a finite-horizon dataset of n≥1 independent behavior trajectories, target and behavior policies, full trajectory coverage, and the finite-horizon return.

[A1]

The Axiom of Choice: AC is assumed by the trajectory-law and RN-density suppliers.

[F1]

Finite-horizon offline reinforcement-learning dataset and coverage: each feasible trajectory atom has mass ∏k=0H−1μ(ak∣sk)p(sk+1,rk+1∣sk,ak), logged trajectories are independent with law PHμ, the target value is JH(π;s0)=EPHπGH, and the finite-horizon return is integrable.

[F2]

Ordinary, per-decision, and weighted trajectory importance sampling: OIS averages Wi,H−1Gi; PDIS averages ∑t=0H−1γtWi,tRt+1i.

[F3]

Finite-horizon policy ratios are trajectory Radon-Nikodym derivatives: the full weight changes PHμ to PHπ, and each prefix weight changes the behavior prefix law to the target prefix law; the corresponding weighted absolute integrals are finite.

[F4]

The Lebesgue integral is linear on L1(μ): the integral of a finite sum of integrable trajectory functions is the sum of their integrals.

Proof

Given: The hypotheses and conventions in the Statement and [A1], [F1]–[F4].

1.1F1F2algebra

On any input where the algorithm returns numerical estimates, each propensity ratio is finite: when μ(Ati∣Sti)>0, it is a quotient of finite probabilities by a positive probability; when both probabilities are zero, the algorithm sets the ratio to zero. If μ(Ati∣Sti)=0<π(Ati∣Sti), the algorithm returns unsupported instead. Thus every cumulative weight is finite. Each return and every finite sum in OIS and PDIS is finite because the reward set, horizon, and dataset are finite. The WIS numerator and denominator are finite, and the procedure either divides by a positive finite denominator or returns zero.

2.1givenF1F2step 1.1algebra

An observed pair with μ(Ati∣Sti)=0 lies on a behavior-null trajectory atom by [F1]. Since the trajectory space, horizon, and sample size are finite, the event that any observed pair has zero behavior propensity is a finite union of null events. The algorithm therefore returns numerical estimates almost surely under the behavior sample law. Extending the three estimator expressions by any fixed finite values on the unsupported null event does not change their expectations.

3.1givenA1F1F2F3F4step 2.1algebra

Fix a logged trajectory index i. By [F1], its law is PHμ, and [F3] applied to Gi gives Eμ[Wi,H−1Gi]=Eπ[GH]=JH(π;s0). Linearity [F4] gives Eμ[J^OIS]=n−1∑i=1nJH(π;s0)=JH(π;s0).

3.2givenF1F2F3F4step 2.1algebra

Fix i and 0≤t<H. The reward Rt+1i is a function of the prefix through (Rt+1,St+1), so [F3] gives Eμ[Wi,tRt+1i]=Eπ[Rt+1]. Multiplying each equality by the fixed γt and summing the finite range 0≤t<H, [F4] yields Eμ[∑t=0H−1γtWi,tRt+1i]=JH(π;s0).

4.1step 2.1step 3.1step 3.2F2F4algebra∎

Each of the n PDIS trajectory scores in [F2] has expectation JH(π;s0) by step 3.2. Their finite sample average has the same expectation by [F4], proving Eμ[J^PDIS]=JH(π;s0). Step 3.1 proves the ordinary-estimator claim.

Depends on

Used by

Cited to discharge well-definedness by Ordinary, per-decision, and weighted trajectory importance sampling.

Dependency tree · two levels

19 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