← All Papers · Formal Verification

Bellman

Dr. Tamás Nagy Updated 2026-04-10 Proof Record Formal Verification Lean-Verified
Mathematics verified. Core theorems are machine-checked in Lean 4. Prose and presentation may not have been human-reviewed.
Download PDF View in Graph BibTeX

Abstract

Bellman — ProofEnv: DP value bounds, MDP Bellman operator, contraction lemmas.

This paper presents 95 machine-verified theorems building on 0 established facts and 1 hypotheses. All results are formally verified in the Lean 4 (232 verification units, 95 proved statements) and exportable to Lean 4.

<!-- TODO: Write a proper abstract summarizing the key contributions -->

Length
1,180 words
Claims
76 theorems
Status
Skeleton

Novelty

No novelty is present — this is an auto-generated skeleton listing 95 formally verified but individually elementary lemmas (nonnegativity, commutativity, sqrt properties) about Bellman/MDP operators, with no narrative, no abstract, no proofs shown, and no intellectual contribution beyond the verification itself.

Referenced By

The Latent: Finite Sufficient Representations of Smooth Syst...

Browse all Formal Verification papers →