Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, p. 143 — the two problems have equal minimal values

Proved
ExecCompLP.LAD.minimal_values_eq

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

least-absolute-deviationslinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let FFF be the feasible weight vectors specified by (2), and let GGG be the feasible triples (a,u,v)(a,u,v)(a,u,v) specified by (2), (4), and (5). For every real threshold ttt,

(∃a∈F: D(a)≤t)⟺(∃(a,u,v)∈G: P(u,v)≤t),\bigl(\exists a\in F:\ D(a)\le t\bigr)\quad\Longleftrightarrow\quad\bigl(\exists(a,u,v)\in G:\ P(u,v)\le t\bigr),(∃a∈F: D(a)≤t)⟺(∃(a,u,v)∈G: P(u,v)≤t),

where D(a)=∑k∈K∣Sk(a)−sk∣D(a)=\sum_{k\in K}|S_k(a)-s_k|D(a)=∑k∈K​∣Sk​(a)−sk​∣ and P(u,v)=∑k∈K(uk+vk)P(u,v)=\sum_{k\in K}(u_k+v_k)P(u,v)=∑k∈K​(uk​+vk​). Consequently the two problems have the same attainable objective thresholds and, whenever a minimum is attained, the same minimum value.

Formalization Note Threshold equivalence also covers an empty feasible set without assigning a default real value to its infimum.

Preamble
import Mathlib
import Definitions.Def_ExecCompLP_LAD_Setting
Formal statement
namespace ExecCompLP.LAD

theorem minimal_values_eq {n L : ℕ} [NeZero L]
    (x : Fin n → Fin L → ℝ) (sM sm : ℝ) (K : Finset (Fin L))
    (s : Fin L → ℝ) :
    ∀ t : ℝ,
      (∃ a : Fin n → ℝ, Feasible x sM sm a ∧ obj x K s a ≤ t) ↔
      (∃ (a : Fin n → ℝ) (u v : Fin L → ℝ),
        LPFeasible x sM sm K s a u v ∧ lpObj K u v ≤ t) := by sorry

end ExecCompLP.LAD
Source
Charnes, Cooper & Ferguson, Optimal estimation of executive compensation by linear programming, Management Science 1(2) (1955), p. 143, §6, first full paragraph; https://doi.org/10.1287/mnsc.1.2.138
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