Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6, first sentence — the data of (HLP) remain integral with bit length O(L)O(L)O(L)

Proved
SelfDualLP.Complexity.theorem_6_data

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

bit-complexitycomplexitylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A∈Zm×nA\in\mathbb Z^{m\times n}A∈Zm×n, b∈Zmb\in\mathbb Z^mb∈Zm, c∈Znc\in\mathbb Z^nc∈Zn be integer data with n≥1n\ge1n≥1 and bit length LLL. Under the choice (7) the additional data of (HLP),

bˉ=b−Ae,cˉ=c−e,zˉ=cTe+1,\bar b=b-Ae,\qquad \bar c=c-e,\qquad \bar z=c^Te+1,bˉ=b−Ae,cˉ=c−e,zˉ=cTe+1,

are integral, and the bit length of all the (HLP) data (A,b,c,bˉ,cˉ,zˉA,b,c,\bar b,\bar c,\bar zA,b,c,bˉ,cˉ,zˉ and the right-hand side −(n+1)-(n+1)−(n+1)) is O(L)O(L)O(L): at most C⋅LC\cdot LC⋅L for an absolute constant C>0C>0C>0.

This is why the complexity bound for (HLP) is stated in terms of the bit length LLL of the original data.

Formalization Note Integrality is stated as: the real vectors bˉ,cˉ\bar b,\bar cbˉ,cˉ and the real number zˉ\bar zzˉ obtained from the cast data are the casts of the corresponding integer expressions. O(L)O(L)O(L) is pinned with CCC chosen before m,n,A,b,cm,n,A,b,cm,n,A,b,c. The paper implicitly has n≥1n\ge1n≥1; this excludes an empty LP whose input length is zero while (HLP) still has a nonzero normalizing constant.

Preamble
import Mathlib
import Definitions.Def_SelfDualLP_Complexity_HLP
import Definitions.Def_SelfDualLP_Complexity_BitLength

open Matrix
Formal statement
namespace SelfDualLP.Complexity

/-- Theorem 6, first sentence (p. 61). For integer data `(A, b, c)` with `n ≥ 1` and bit length `L`, the data
of (HLP) under (7) remain integral — `b̄ = b − Ae`, `c̄ = c − e`, `z̄ = cᵀe + 1` are the casts of
the integer vectors/number `bbarInt`, `cbarInt`, `zbarInt` — and the bit length of the (HLP)
data is `O(L)`: at most `C·L` for an absolute constant `C`. -/
theorem theorem_6_data :
    ∃ C : ℝ, 0 < C ∧ ∀ (m n : ℕ), 1 ≤ n →
      ∀ (A : Matrix (Fin m) (Fin n) ℤ) (b : Fin m → ℤ) (c : Fin n → ℤ),
      bbar (castMat A) (castVec b) (ones n) = castVec (bbarInt A b) ∧
      cbar (castMat A) (castVec c) 0 (ones n) = castVec (cbarInt c) ∧
      zbar (castVec b) (castVec c) (ones n) 0 = ((zbarInt c : ℤ) : ℝ) ∧
      (hlpBitLength A b c : ℝ) ≤ C * (bitLength A b c : ℝ) := by sorry

end SelfDualLP.Complexity
Source
Ye, Todd, Mizuno, An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm, Math. Oper. Res. 19(1) (1994), p. 61, Theorem 6 (first sentence); (8) on p. 58
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