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 , , and let be any real sequence with . Then the series
converges absolutely; write for its sum. Every partial sum and the limit satisfy
For every integer ,
where the partial sum at is empty and , including when .
Statement references
Facts & Assumptions
Given: , , and a real sequence with .
For , , and for the series diverges: for , , with the series beginning at .
If eventually, convergence of gives convergence of , and divergence of gives divergence of : if and converges, then converges.
Convergent series add and scale termwise and A series converges iff each of its tail series converges, and the sum splits as plus the -th tail: a convergent geometric series can be scaled and shifted; its tail beginning at has sum .
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.
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.
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
For every , . By [F1] and the scaling part of [F3], the majorant series converges (and when it is the zero series); [F2] gives convergence of . Thus the stated series converges absolutely by definition of absolute convergence.
Every finite partial sum satisfies . The second inequality is [F7] applied to the nonnegative geometric series in [F1]. At the sum is empty and the inequality holds as well.
For , [F4] gives , where [F7] applies to the shifted geometric series and [F3] evaluates its sum. The finite tail sums converge to 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.
Taking in step 2.1 gives . The right side of the tail bound tends to zero by [F5], so the partial sums converge to with the stated uniform remainder control.
Depends on
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- If $0 \le a_k \le b_k$ eventually, convergence of $\sum b_k$ gives convergence of $\sum a_k$, and divergence of $\sum a_k$ gives divergence of $\sum b_k$
- Series, partial sums, convergence and the sum, divergence, and the tail series
- A series converges iff each of its tail series converges, and the sum splits as $s_N$ plus the $N$-th tail
- Convergent series add and scale termwise
- A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum
- Laws of finite sums and finite products
- Basic properties of the absolute value
- Limits preserve non-strict inequalities
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
Used by
- Discounted returns and policy values in a finite MDP Definition
- Expected discounted-cost feasibility constraint Definition
- Expected discounted policy value is a fixed point of its Bellman operator Lemma
- Normalized discounted occupancy is a probability distribution Lemma
- The optimal action value is attained by a greedy stationary policy Lemma
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
- Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, 2nd ed. (standard reference, not scraped)