{"paper_id":"2506.07066","title":"From Axioms to Algorithms: Mechanized Proofs of the vNM Utility Theorem","authors":["Li Jingyuan"],"paper_date":"2025-06-08","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2506.07066v1","page_url":"https://thequant.space/flowcharts/from-axioms-to-algorithms-mechanized-proofs-of-the-vnm-util/","scores":{"empirical_rigor":2,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a comprehensive formalization and mechanized proof of the von Neumann‑Morgenstern utility theorem using the Lean 4 interactive theorem prover.","quote":"This paper presents a comprehensive formalization of the von Neumann-Morgenstern (vNM) expected utility theorem using the Lean 4 interactive theorem prover.","summary":"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…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Preferences satisfy the vNM axioms of completeness, transitivity, continuity, and independence.","type":"model","stated":"explicit","quote":"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.","support":"full"},{"assumption":"A preference dataset is non‑empty and contains no direct contradictions (no cycles).","type":"data","stated":"explicit","quote":"PrefDataset (X : Type) [Fintype X] [Nonempty X] [DecidableEq X] where 11 /-- List of preference pairs (p \\succ q) -/ 12 pairs : List (Lottery X \\times Lottery X) 13 14 /- Assumption: under certain conditions on the dataset, 15 the learned reward model satisfies VNM axioms -/ 16 /-- Checks if dataset has sufficient coverage of preference space -/ 17 def datasetCoverage (data : PrefDataset X) : Prop := 18","support":"full"}]},"datasets":{"status":"available","items":[{"name":"PrefDataset","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"PrefDataset (X : Type) [Fintype X] [Nonempty X] [DecidableEq X] where 11 /-- List of preference pairs (p \\succ q) -/ 12 pairs : List (Lottery X \\times Lottery X) 13 14 /- Assumption: under certain conditions on the dataset, 15 the learned reward model satisfies VNM axioms -/ 16 /-- Checks if dataset has sufficient coverage of preference space -/ 17 def datasetCoverage (data : PrefDataset X) : Prop := 18","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The formalization captures the mathematical structure of preference relations over lotteries and verifies that preferences satisfying the vNM axioms can be represented by expected utility maximization.","kind":"theoretical","quote":"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.","support":"full"},{"finding":"The mechanized proof establishes equivalence to classical presentations while offering greater precision at decision boundaries.","kind":"theoretical","quote":"We prove equivalence to classical presentations while offering greater precision at decision boundaries.","support":"full"},{"finding":"Executable implementations of utility representations enable computational experiments and empirical validation of the formalized results.","kind":"theoretical","quote":"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. A complete, mechanized proof of the vNM utility theorem with explicit, precisely formulated axioms 2.","support":"full"},{"finding":"The work demonstrates that formal verification tools can successfully capture the nuanced mathematical structure of foundational economic results.","kind":"theoretical","quote":"Our work demonstrates that formal verification tools can successfully capture the nuanced mathematical structure of foundational economic results.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":12,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/jingyuanli-hk/vNM-Theorem-pub","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:49:44Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}