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

Performance-difference identity for an arbitrary bounded baseline

Statement

Let a finite discounted CMDP, a bounded transition signal g, a bounded function f:S→R, and stationary policies π,π′ be given. All sums below over a,ρ,s′ range over A(s),R,S, respectively. For a policy σ define

δfg(s,a,ρ,s′):=g(s,a,ρ,s′)+γf(s′)−f(s),δˉfg,σ(s):=∑a,ρ,s′σ(a∣s)p(s′,ρ∣s,a)δfg(s,a,ρ,s′).

Put

Lπ,fg(π′):=∑sdπ(s)(δˉfg,π′(s)−δˉfg,π(s)).

Then the exact performance-difference identity is

Jgπ′(μ)−Jgπ(μ)=Lπ,fg(π′)1−γ+11−γ∑s(dπ′(s)−dπ(s))δˉfg,π′(s).

Facts & Assumptions

Given: A finite discounted CMDP, bounded g and f, stationary policies π,π′, and 0≤γ<1.

[F1]

Finite discounted constrained Markov decision process: the finite-time state masses obey the one-step transition recurrence with joint masses p(s′,ρ∣s,a).

[F2]

Expected discounted-cost feasibility constraint: Jgσ(μ) is the discounted series of finite sums of g against the time-t transition masses.

[F3]

Normalized discounted state occupancy: dσ(s)=(1−γ)∑t≥0γtμtσ(s).

[F4]

Normalized discounted occupancy is a probability distribution: every μtσ is a probability distribution, and every bounded transition-signal discounted series is absolutely convergent.

Proof

1.1F1givenalgebra

Fix a policy σ. For each t, let etσ be the finite transition-mass sum of g at time t, and let htσ:=∑sμtσ(s)f(s). By [F1] and the definition of δfg, the finite sum of δfg at time t is etσ+γht+1σ−htσ. Summing after multiplication by γt for t=0,…,N telescopes to ∑t=0Nγtetσ−h0σ+γN+1hN+1σ.

2.1F2F3F4F5step 1.1algebra

The remainder satisfies ∣γN+1hN+1σ∣≤γN+1∥f∥∞→0 by [F4] and [F5]. Also ∣δfg∣≤∥g∥∞+(1+γ)∥f∥∞, so [F4] makes its discounted series convergent. Passing to the limit in step 1.1 and using [F2]–[F3] gives Jgσ(μ)=∑sμ(s)f(s)+(1−γ)−1∑sdσ(s)δˉfg,σ(s).

3.1F2F3step 2.1algebra∎

Apply the identity in step 2.1 to σ=π′ and σ=π and subtract; the initial terms ∑sμ(s)f(s) cancel. Add and subtract ∑sdπ(s)δˉfg,π′(s). The first resulting term is Lπ,fg(π′) by its definition, and the second is ∑s(dπ′(s)−dπ(s))δˉfg,π′(s). Dividing by 1−γ>0 gives the claimed identity.

Depends on

Used by

Dependency tree · two levels

27 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