Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.5.7 — complementary slackness for the primal/dual pair

Proved
MDPFinance.LPDuality.theorem_7_5_7

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

complementary-slacknesslinear-optimizationmarkov-decision-process

A feasible primal vvv and dual μ\muμ are simultaneously optimal, with matching primal and dual values, exactly when the primal constraint they are both tied to holds with equality μ\muμ-almost everywhere — the infinite-dimensional analogue of complementary slackness in ordinary linear programming, and the key technical tool the strong duality theorem (the goal) uses to certify optimality of the pair it exhibits.

Moderation note. The draft had no hypotheses at all (no bounding function, no contracting model, no setting for IMIMIM and ppp), under which the integrals defining ZDZ_DZD​ and the values are default values; §7.5.2's standing setting is now stated as in Theorem 7.5.6.

Preamble
import Mathlib
import Definitions.Def_MDPFinance_LPDuality_Model
import Definitions.Def_MDPFinance_LPDuality_LP

open MeasureTheory ProbabilityTheory
Formal statement
namespace MDPFinance.LPDuality

/-- Theorem 7.5.7 (Bäuerle–Rieder, p. 217, PDF 228). Let `v \in Z_P` and `\mu \in Z_D`. Then the
following statements are equivalent: (i) `v` and `\mu` are optimal and `val(P) = val(D)`. (ii)
`v(x) = Lv(x,a)` for `\mu`-almost all `(x,a) \in D`. Setting of §7.5.2 as in Theorem 7.5.6. -/
theorem theorem_7_5_7 {E A : Type*} [MeasurableSpace E] [MeasurableSpace A] (M : MarkovDecisionModel E A)
    (b : E → ℝ) (cr αb : ℝ) (hb : IsBoundingFunction M b cr αb) (hb1 : ∀ x, 1 ≤ b x)
    (hαb : M.β * αb < 1) (IMs : Set (E → ℝ)) (hIM : IsClosedSubspaceOf b IMs) (hbIM : b ∈ IMs)
    (p : Measure E) (hpb : ∫⁻ x, ENNReal.ofReal (b x) ∂p < ⊤) (v : E → ℝ) (hv : v ∈ ZP M IMs)
    (μ : Measure (E × A)) (hμ : μ ∈ ZD M b IMs p) :
    (((∫ x, v x ∂p : ℝ) : EReal) = valP M IMs p ∧
        ((∫ xa, M.r xa ∂μ : ℝ) : EReal) = valD M b IMs p ∧ valP M IMs p = valD M b IMs p) ↔
      (∀ᵐ xa ∂μ, xa ∈ M.D → v xa.1 = M.r xa + M.β * ∫ x', v x' ∂(M.Q xa)) := by sorry

end MDPFinance.LPDuality
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 217, Theorem 7.5.7
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Nov 4, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me