Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 3 — among equal fff, larger ccc-value has larger slope

Proved
ZeroOneSimplex.claim_3

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-programmingp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1pivot-rulespolytopessimplex-method

Consider a 0/1-LP of form (1) with integral objective ccc, feasible region PPP, an initial vertex x0x^0x0 and the Ordered Shadow vector v(k)=(−1)x0(k)(c∗)kv(k)=(-1)^{x^0(k)}(c^*)^kv(k)=(−1)x0(k)(c∗)k, c∗=∥c∥1+2c^*=\|c\|_1+2c∗=∥c∥1​+2. Let u0,u1u^0,u^1u0,u1 be neighbors of a point xxx of PPP that are both ccc-improving and vvv-improving. Suppose b=f(u1)=f(u0)b=f(u^1)=f(u^0)b=f(u1)=f(u0), f(x)<bf(x)<bf(x)<b and c⊤u0>c⊤u1c^\top u^0>c^\top u^1c⊤u0>c⊤u1. Then

c⊤(u0−x)v⊤(u0−x)>c⊤(u1−x)v⊤(u1−x).\frac{c^\top(u^0-x)}{v^\top(u^0-x)}>\frac{c^\top(u^1-x)}{v^\top(u^1-x)} .v⊤(u0−x)c⊤(u0−x)​>v⊤(u1−x)c⊤(u1−x)​.

Together with Claim 2 and Claim 1 this shows that the Ordered Shadow rule picks a ccc-best fff-minimal improving neighbor, i.e. follows a Lemma 5 path.

Differences from the source:

  • encoding: the inequalities Dx ≤ d contain x ≥ 0 (assumption (ii), p.6) → x ≥ 0 is kept apart and D holds only the other inequalities; reason: the same feasible region; slacks are added only for the other inequalities, as on p.6
  • encoding: P a 0/1 polytope → P nonempty and bounded with every extreme point in {0,1}ⁿ (IsZeroOneLP); reason: P is a compact convex set, so it is the convex hull of its extreme points; an empty P has no vertex and no basis
  • generalization: c, b, d, A and D integral (p.2) → c integral; A, b, D, d real; reason: integrality of A, b, D, d is never used; integral data are a special case
  • generalization: A of full row rank (assumption (i), p.6) → not assumed; reason: the statement concerns the feasible region P and no basis; full-rank instances are a special case
  • encoding: coordinates k = 1, …, n → coordinates Fin n, the paper's coordinate k being k.val + 1 (exponents of c*, f and κ are 1-based); reason: Lean indexing; the same vectors and the same values of f
  • generalization: x⁰ = 0 after a change of coordinates (p.19), v = ((c*), (c*)², …, (c*)ⁿ) → x⁰ any vertex, v(k) = (−1)^{x⁰(k)}(c*)^k of Definition 5; reason: for x⁰ = 0 this is the printed statement; the change of coordinates is avoided
  • generalization: the standing context of the proof of Theorem 6 (p.19): xⁱ is the c-maximum of F_{f(xⁱ)}, so every c-improving neighbor has larger f → only f(x) < b is assumed; reason: the context implies f(x) < f(u⁰), f(u¹) ≤ b
Preamble
import Mathlib
import Definitions.Def_ZeroOneSimplex_LPData
import Definitions.Def_ZeroOneSimplex_IsEdge
import Definitions.Def_ZeroOneSimplex_LPData_orderedShadowVec
set_option autoImplicit false

open Matrix
Formal statement
namespace ZeroOneSimplex

/-- **Claim 3** (Black, De Loera, Kafer, Sanità, arXiv:2111.14050v1, p.19, in the proof of
Theorem 6; proved pp.21–22). Consider a 0/1-LP of the form (1) with integral objective `c`,
feasible region `P`, an initial vertex `x⁰`, and the vector `v` of Definition 5. Let `u⁰, u¹` be
neighbors of a vertex `x` of `P` that are both `c`-improving and `v`-improving.
Suppose that `b = f(u¹) = f(u⁰)` and `cᵀu⁰ > cᵀu¹`. Then
`cᵀ(u⁰ − x)/vᵀ(u⁰ − x) > cᵀ(u¹ − x)/vᵀ(u¹ − x)`.

**Formalization Note.** The paper proves the claim after the change of coordinates `x⁰ = 0` and
under the standing context of the proof of Theorem 6 (`x` is the `c`-maximum of `F_{f(x)}`, so
every `c`-improving neighbor has larger `f`). Here `x⁰` is any vertex and only `f(x) < b` is
assumed (hypothesis `hfx`). -/
theorem claim_3 {n m p : ℕ} (L : LPData n m p) (h01 : L.IsZeroOneLP) (x0 : Fin n → ℝ)
    (hx0 : x0 ∈ Set.extremePoints ℝ L.feasibleRegion) (x u0 u1 : Fin n → ℝ)
    (hu0 : IsEdge L.feasibleRegion x u0) (hu1 : IsEdge L.feasibleRegion x u1)
    (hc0 : L.c ⬝ᵥ x < L.c ⬝ᵥ u0) (hc1 : L.c ⬝ᵥ x < L.c ⬝ᵥ u1)
    (hv0 : L.orderedShadowVec x0 ⬝ᵥ x < L.orderedShadowVec x0 ⬝ᵥ u0)
    (hv1 : L.orderedShadowVec x0 ⬝ᵥ x < L.orderedShadowVec x0 ⬝ᵥ u1)
    (hf : fIndex x0 u0 = fIndex x0 u1) (hfx : fIndex x0 x < fIndex x0 u1)
    (hcc : L.c ⬝ᵥ u1 < L.c ⬝ᵥ u0) :
    L.c ⬝ᵥ (u1 - x) / L.orderedShadowVec x0 ⬝ᵥ (u1 - x) <
      L.c ⬝ᵥ (u0 - x) / L.orderedShadowVec x0 ⬝ᵥ (u0 - x) := by sorry

end ZeroOneSimplex
Source
Black, De Loera, Kafer, Sanità, On the Simplex method for 0/1 polytopes, arXiv:2111.14050v1, Claim 3, p.19 (in the proof of Theorem 6; proved pp.21–22)
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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