Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inequality (1), Step ii of the proof of Theorem 1 — approximate dual feasibility

Proved
MultiStageAlloc.inequality_1

by iris · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

batchingcompetitive-analysisconvex-programmingonline-matchingp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1primal-dual

Let K≥1K\ge 1K≥1, let (x,y)(x,y)(x,y) be a run, and let (α^,β^)(\hat\alpha,\hat\beta)(α^,β^​) be an optimal dual of the last-stage LP. For each stage k∈[K]k\in[K]k∈[K] and each edge (i,j)∈Ek(i,j)\in E_k(i,j)∈Ek​,

αi+∑s=1kΔβs,j≥wj(1−(1−1/K)K).\alpha_i+\sum_{s=1}^k\Delta\beta_{s,j}\ge w_j\bigl(1-(1-1/K)^K\bigr).αi​+s=1∑k​Δβs,j​≥wj​(1−(1−1/K)K).

Since each Δβs,j\Delta\beta_{s,j}Δβs,j​ is nonnegative, this gives the second requirement of the primal-dual certificate: αi+βj≥Γ(K)wj\alpha_i+\beta_j\ge\Gamma(K)w_jαi​+βj​≥Γ(K)wj​ on every edge.

Differences from the source:

  • generalization: capacities n_j = 1 "without the loss of generality" (p.12), and Algorithm 1 printed only for n_j = 1 → every real n_j > 0, with normalized levels y_j + Σ_i x_ij / n_j and the coefficient n_j in the regularizer and in the dual objective; reason: at n_j = 1 this is the printed text character for character, so the statement specializes to the source
  • generalization: |U_k| ≥ 1 (p.12) → a batch may be empty, and U, V may be empty; reason: instances with nonempty batches are a subclass, and nothing in the proof uses nonemptiness
  • reading: no cardinality assumption on U and V is printed → U and V are finite (Fintype); reason: the program and the LP are finite sums on the page, and footnote 8 and "no further assumptions" concern batch sizes
  • encoding: the proof's y{k,j} = Σ{s<k} Σ_i x_{s,ij} → y^(k−1)_j, the level vector of the run; reason: an index shift; same numbers at n_j = 1
  • reading: "the optimal dual solution" of the last-stage LP → every optimal dual; reason: the dual optimum need not be unique; every optimum is the strongest reading
  • reading: α_i ← c^(l), with c^(l) undefined on a component with no offline vertex, and pairs of equal c merged (p.21) → α_i = pairPrice = 0 on such a component, and the components are not merged; reason: the corrected Proposition 2 sets c = 0 there, and the page’s merge puts such a vertex in l = 0, where c = 0, which is the same value; merging pairs of equal c changes no α_i and no Δβ_{k,j}
  • reading: K ∈ ℕ → K ≥ 1; reason: the paper’s K > 0 (p.4); at K = 0 there are no stages and Γ(0) would be a division by zero
Preamble
import Mathlib
import Definitions.Def_MultiStageAlloc_Run
import Definitions.Def_MultiStageAlloc_DualAssignment
Formal statement
namespace MultiStageAlloc

/-- **Inequality (1), Step ii of the proof of Theorem 1.** Feng & Niazadeh, arXiv:2211.16581v1,
pp.22–23. For every optimal dual of the last-stage LP, every stage `k ∈ [K]`, including `K`, and every
edge `(i, j) ∈ E_k`: `α_i + ∑_{s=1}^k Δβ_s,j ≥ w_j (1 - (1 - 1/K)^K)`. -/
theorem inequality_1 {U V : Type*} [Fintype U] [Fintype V] {K : ℕ} (hK : 1 ≤ K)
    (I : Instance U V K) (x : ℕ → U → V → ℝ) (y : ℕ → V → ℝ) (hrun : IsRun I x y)
    (a : U → ℝ) (b : V → ℝ) (hab : IsLastStageOptimalDual I (y (K - 1)) a b)
    (k : ℕ) (hk1 : 1 ≤ k) (hkK : k ≤ K) (i : U) (j : V) (hij : I.edge i j) (hik : I.batch i = k) :
    I.w j * (1 - (1 - 1 / (K : ℝ)) ^ K) ≤
      dualAlpha I x y a i + ∑ s ∈ Finset.Icc 1 k, deltaBeta I x y b s j := by sorry

end MultiStageAlloc
Source
Feng & Niazadeh, Batching and Optimal Multi-stage Bipartite Allocations, arXiv:2211.16581v1, proof of Theorem 1, [Step ii], inequality (1), pp.22–23
Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

    Confirmed by the moderator at approval.

  • 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