Theorem 3 — the functional-equation solution is the optimal return
ProvedDenardoDP.Contraction.theorem3Suppose Denardo's contraction and monotonicity assumptions both hold. For every policy , let be its return function, the unique fixed point of . The maximization operator then has exactly one fixed point , and this solution is the optimal return function , defined pointwise over all policies:
The theorem identifies the solution of the functional equation with the best policy return at every state. Its monotonicity assumption matters: the paper gives a contraction that violates monotonicity for which the two functions can differ.
Formalization Note The policy operators and are supplied as maps constrained by equations (1) and (3), recording the paper's bounded-range assumptions. The family is supplied through equation (2), which has a unique solution for each policy under contraction. The formal statement includes existence and uniqueness of the fixed point and uses a real least-upper-bound predicate for the supremum of policy returns. IsMaxOperator enforces nonempty decision sets wherever a state exists.
import Mathlib import Definitions.Def_DenardoDP_Contraction_Model
namespace DenardoDP.Contraction
/-- Theorem 3, p. 168: the unique functional-equation solution is the optimal return. -/
theorem theorem3 {Ω : Type*} {D : Ω → Type*}
(h : (x : Ω) → D x → BFun Ω → ℝ)
(H : ((x : Ω) → D x) → BFun Ω → BFun Ω)
(A : BFun Ω → BFun Ω) (c : ℝ)
(v : ((x : Ω) → D x) → BFun Ω)
(hH : IsPolicyOperator h H) (hA : IsMaxOperator h A)
(hc : ContractionAssumption h c) (hmono : MonotonicityAssumption H)
(hv : ∀ δ, H δ (v δ) = v δ) :
(∃! w : BFun Ω, A w = w) ∧
∀ w : BFun Ω, A w = w → IsOptimalReturn v w := by sorry
end DenardoDP.Contraction
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.