From Axioms to Algorithms: Mechanized Proofs of the vNM Utility Theorem
This provides a rigorous computational foundation for applications in economic modeling, AI alignment, and decision systems, though it is incremental as it mechanizes an existing theorem.
The paper formalizes the von Neumann-Morgenstern expected utility theorem using the Lean 4 interactive theorem prover, verifying that preferences satisfying the axioms can be represented by expected utility maximization with proofs of existence and uniqueness.
This paper presents a comprehensive formalization of the von Neumann-Morgenstern (vNM) expected utility theorem using the Lean 4 interactive theorem prover. We implement the classical axioms of preference-completeness, transitivity, continuity, and independence-enabling machine-verified proofs of both the existence and uniqueness of utility representations. Our formalization captures the mathematical structure of preference relations over lotteries, verifying that preferences satisfying the vNM axioms can be represented by expected utility maximization. Our contributions include a granular implementation of the independence axiom, formally verified proofs of fundamental claims about mixture lotteries, constructive demonstrations of utility existence, and computational experiments validating the results. We prove equivalence to classical presentations while offering greater precision at decision boundaries. This formalization provides a rigorous foundation for applications in economic modeling, AI alignment, and management decision systems, bridging the gap between theoretical decision theory and computational implementation.