Alphabeta MathFinite MDPs and Bellman operators — Examples
About this page
Pipeline-generated
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.
✓ 2 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Machine Learning Algorithms
Measure Theory
Real Analysis
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Foundations of the Real Numbers for Analysis
- limsup, liminf, and Subsequential Limits
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Suprema and Infima
Set Theory
2 · Logical flowchart
3 · Items
Example
A unit reward on a self-loop has no finite undiscounted return
Example
A common reward shift moves every one-state Bellman value equally
Example
A one-state value-iteration model attains the Bellman error bound
Example