- The paper provides a detailed mechanized proof that demonstrates the irreducibility of the cross-pair condition from ordinal axioms in additive conjoint measurement.
- It employs a certificate-driven proof decomposition that ensures explicit assumptions and modular construction of additive utility representations.
- The mechanization in Lean 4 fully validates topology and continuity conditions, offering an auditable framework for decision-theoretic economics.
Kernel-Clean Mechanization of Additive Representation Theorems in Lean
Overview
The paper "A Kernel-Clean Lean Mechanization of Classical Lottery in Action and the Wakker--Debreu--Koopmans Representation Layer" (2606.08902) reports a comprehensive formal mechanization in Lean 4/Mathlib of the foundational constructs and theorems underlying classical-lottery-based decision theory, with a particular focus on the additive conjoint measurement program as developed in Wakker IV.2.7 and the representational results of Debreu–Koopmans. The core technical contribution is a machine-checked irreducibility result: the cross-pair (Thomsen/double-cancellation, "hexagon") condition cannot be derived from the ensemble of ordinal axioms (weak order, restricted solvability, Archimedean property, and tradeoff consistency), establishing by explicit countermodel that additional structure is required for the additive representation to be constructed.
Methodological Structure
The artifact is architected as two interacting Lean 4 modules. The first mechanizes the "theorem surface" required for direct application in decision-theoretic economics, encoding average-utility representation, matching-frequency lemmas, smooth-model sufficiency, normalized ambiguity formulas, and curvature statements. The second encodes the representation-theoretic content, with the Wakker/Debreu–Koopmans module implementing the full construction stack, constituent certificates for proof decomposition, topology bundles, gluing chains, and uniqueness theorems. All non-ordinal steps of the combinatorial and topological construction are fully mechanized; only the cross-pair (double-cancellation) input is assumed as irreducible, an assertion confirmed by explicit kernel-audited countermodels.
Critically, every nonlocal mathematical assumption—averaging, matching frequency separation, smooth-representation properties, and ambiguity curvature relations—is isolated as a named "bridge" interface rather than an implicit global axiom. All Lean theorems are thus conditional on transparent, inspectable assumptions, not hidden artifacts. Kernel-level axiom audits verify all public theorems depend only on Lean's propext and standard foundations.
Main Technical Results
Irreducibility of Cross-Pair (Double-Cancellation) Condition
A key result is the formal, mechanized proof that the cross-pair Thomsen/double-cancellation (hexagon) axiom is irreducible from the conjunction of ordinal axioms central to additive conjoint measurement. The artifact provides an explicit countermodel (additiveRealBoolPref) satisfying all standard ordinal postulates but failing the cross-pair property. In this model, all strict standard sequences are arithmetic progressions, and thus the possible existence of a densely refined grid fails—formally precluding derivation of the cross-pair condition from weaker assumptions.
This formally certifies the mathematical folklore—common to the work of Wakker, Krantz–Luce–Suppes–Tversky, and Debreu–Koopmans—that a cancellation/independence structure must be taken as an explicit primitive in constructing additive representations for multidimensional (product) spaces. The certificate-based construction, as mechanized here, precisely calibrates the minimal necessary input.
Certificate-Driven Proof Decomposition
The formalization does not treat the representation theorems as monolithic endpoints. Instead, the construction is decomposed into explicit certificates—for standard-sequence grids, pairwise representations, global gluing, affine uniqueness up to scale and translation, topology transfer, and concavity. Each of these is attached to consumer theorems, facilitating granular proof auditing and enabling explicit regression checks of dependency at the module level.
This certificate architecture is essential for proof engineering. For example, in establishing uniqueness of additive representations (the M2 case), the design mandates explicit extraction and normalization data rather than implicit existential choices, ensuring that strengthening or relaxation of uniqueness claims is made manifest in the formal development.
Full Mechanization of Topology and Continuity
The paper builds a complete conditional construction of the Wakker IV.2.7 and Debreu–Koopmans theorems—including standard-sequence grid infrastructure, calibration, dyadic refinement, and full utility gluing—entirely within the Lean/Mathlib foundations. Existence and continuity (Eilenberg style) of utility representations follow rigorously from separability, dense order, and connectedness assumptions, with no use of unproven (sorry) statements. The only irreducible input is the cross-pair axiom.
Auditability and Reproducibility
A defining feature is kernel-level auditability. Every component and public theorem surface is checked for axiom cleanliness using Lean's axiom verification tools. No project-specific or hidden axioms exist in the repository; all nonlocal mathematical content is encapsulated in public theorem inputs and bridge interfaces. The full construct, spanning the applied artifact and the representation layers, is reproducible with complete job-tree builds and agnostic to module boundaries.
Implications and Open Boundaries
The research delineates with formal precision the boundary between what can be achieved in additive conjoint measurement via "ordinal" axioms (from weak order to tradeoff consistency) and what fundamentally requires additional, cross-coordinate structure. The presence of a minimal irreducible input (the double-cancellation/hexagon/cross-pair property) is machine-checked, and its necessity is supported by explicit countermodels. No construction route—through topology, solvability, or any combination of single-coordinate properties—can avoid the need for this extra assumption; this is demonstrated via a sequence of denied candidate mechanismizations.
At the practical level, the two-layer formalization serves both as a reusable formal-methods infrastructure for economic theorem mechanization and as a precise map of what is and isn't delivered by standard decision-theoretic axiomatizations. Every "bridge" theorem interface corresponds to a visible mathematical gap, facilitating incremental discharge as new formal or mathematical insights become available.
The theoretical consequence is definitive: additive representation for product preferences, as realized in the Wakker–Debreu–Koopmans layer, requires at least the cross-pair/Thomsen hexagon in addition to ordinal axioms. Mechanization makes this claim explicit and robust to informal proof errors.
Speculation and Future Directions
The artifact establishes a scalable blueprint for future mechanization of measurement-theoretical frameworks in economics and mathematical psychology. The certificate-based, audit-friendly methodology is likely to be adapted for related representation theorems—particularly those with complex algebraic and topological structure, such as multi-attribute utility or nonadditive integrals. The approach taken here provides a new standard for explicitness and granularity in theorem mechanization, conducive to both mathematical transparency and downstream modularity.
Given the lack of prior mechanization of Wakker's additive representation, tradeoff consistency, or the Debreu–Koopmans hard direction in Lean, Isabelle, or Coq, this work should significantly influence standards for verified reasoning in axiomatic economic theory.
Conclusion
This paper presents a complete, auditable, and kernel-clean Lean mechanization of the additive representation infrastructure required for classical-lottery-based decision analysis. By isolating and machine-certifying the irreducibility of the cross-pair (double-cancellation) axiom, and exposing all theorem interfaces as conditional in Lean, it provides a definitive partition between what is derivable and what is primitive in measurement theory. The result is a modular, reviewer-sized artifact, supporting both economic application proofs and advances in mechanized representation theory, and is expected to have substantial influence on future formalizations in mathematical economics and decision science (2606.08902).