Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Absolute convergence and tail bound for bounded discounted rewards

Statement

Let M≥0, 0≤γ<1, and let (ρj)j≥1 be any real sequence with ∣ρj∣≤M. Then the series

∑j=0∞γjρj+1

converges absolutely; write G for its sum. Every partial sum and the limit satisfy

∣∑j=0N−1γjρj+1∣≤M1−γ,∣G∣≤M1−γ.

For every integer N≥0,

∣G−∑j=0N−1γjρj+1∣≤MγN1−γ,

where the partial sum at N=0 is empty and γ0=1, including when γ=0.

Facts & Assumptions

Given: M≥0, 0≤γ<1, and a real sequence (ρj)j≥1 with ∣ρj∣≤M.

[F1]

For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges: for 0≤γ<1, ∑j=0∞γj=1/(1−γ), with the series beginning at j=0.

[F3]

Convergent series add and scale termwise and A series converges iff each of its tail series converges, and the sum splits as sN plus the N-th tail: a convergent geometric series can be scaled and shifted; its tail beginning at N has sum γN/(1−γ).

[F4]

Basic properties of the absolute value and Laws of finite sums and finite products: the absolute value of a finite sum is at most the sum of the absolute values, and finite sums preserve termwise upper bounds.

[F6]

Limits preserve non-strict inequalities: if two real sequences converge and one is eventually at most the other, their limits satisfy the same non-strict inequality.

[F7]

A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum: for a convergent series of nonnegative terms, every finite partial sum is at most its sum.

Proof

1.1givenF1F2F3

For every j≥0, 0≤γj∣ρj+1∣≤Mγj. By [F1] and the scaling part of [F3], the majorant series ∑j≥0Mγj converges (and when M=0 it is the zero series); [F2] gives convergence of ∑j≥0γj∣ρj+1∣. Thus the stated series converges absolutely by definition of absolute convergence.

1.2givenF1F4F7algebra

Every finite partial sum satisfies ∣∑j=0N−1γjρj+1∣≤M∑j=0N−1γj≤M∑j=0∞γj=M/(1−γ). The second inequality is [F7] applied to the nonnegative geometric series in [F1]. At N=0 the sum is empty and the inequality holds as well.

2.1step 1.1F3F4F6F7

For K≥N, [F4] gives ∣∑j=NK−1γjρj+1∣≤M∑j=NK−1γj≤M∑j=N∞γj=MγN/(1−γ), where [F7] applies to the shifted geometric series and [F3] evaluates its sum. The finite tail sums converge to G−∑j<Nγjρj+1 by step 1.1, and each lies between the negatives and positives of the displayed bound; [F6] passes both inequalities to the limit. Therefore the required tail estimate holds.

3.1step 2.1F5∎

Taking N=0 in step 2.1 gives ∣G∣≤M/(1−γ). The right side of the tail bound tends to zero by [F5], so the partial sums converge to G with the stated uniform remainder control.

Depends on

Used by

Dependency tree · two levels

52 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