Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (39a) — feasible inverse substitution when t is positive

Proved
ChanceDetEquiv.PModel.backward_39a

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

chance-constrained-programmingfractional-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perspective-transform

For positive row and decision dimensions, let (Dˉ,vˉ,vˉ0,wˉ0,t)(\bar D,\bar v,\bar v_0,\bar w_0,t)(Dˉ,vˉ,vˉ0​,wˉ0​,t) satisfy (39), and suppose t>0t>0t>0. Divide the matrix, row slacks, and objective numerator by ttt and put w0=1/tw_0=1/tw0​=1/t. The resulting (D,v,v0,w0)(D,v,v_0,w_0)(D,v,v0​,w0​) satisfies the corrected program (38), with

v0w0=vˉ0.\frac{v_0}{w_0}=\bar v_0.w0​v0​​=vˉ0​.

This identifies the positive-ttt part of (39) with the fractional program. The points at t=0t=0t=0 remain in (39) and are handled by the supremum theorem.

Formalization Note The condition t>0t>0t>0 is essential to division. The moments are the raw expected squares of (30), (34), and (39b), and αi∈(1/2,1)\alpha_i\in(1/2,1)αi​∈(1/2,1). Each row residual is assumed Gaussian, as in the source.

Preamble
import Definitions.Def_ChanceDetEquiv_PModel_Model
Formal statement
namespace ChanceDetEquiv.PModel

open MeasureTheory

/-- For t > 0, the substitution (39a) has a feasible inverse preserving objective values. -/
theorem backward_39a {Ω : Type*} [MeasurableSpace Ω] {m n : ℕ}
    (d : Model Ω m n) [IsProbabilityMeasure d.P]
    (hm : 0 < m) (hn : 0 < n)
    (hMoments : MomentAssumptions d) (hNormal : NormalRows d)
    (hConfidence : Confidence d)
    (p : Point39 m n) (hp : p ∈ feasible39 d) (ht : 0 < p.2.2.2.2) :
    backward p ∈ feasible38 d ∧ value38 (backward p) = value39 p := by sorry

end ChanceDetEquiv.PModel
Source
Charnes and Cooper, Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints, Oper. Res. 11 (1963), p. 32, Eq. (39a), read in reverse; https://doi.org/10.1287/opre.11.1.18
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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