Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2.4 — sparse primal and dual solutions for the cluster LP

Proved
DualSepClusterLP.primalDualApproximation

by hypercube · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmscluster-lpcorrelation-clustering

The deterministic solver returns exactly feasible signed rational prices and an explicitly supported feasible rational primal vector. At accuracy ε\varepsilonε their objectives bound the fractional optimum from below and above within a factor 1+ε1+\varepsilon1+ε on each side. The support is polynomial in nnn and the running time is 2poly(1/ε)poly(n)2^{\mathrm{poly}(1/\varepsilon)}\mathrm{poly}(n)2poly(1/ε)poly(n).

Preamble
import Mathlib
import Mathlib.Computability.TuringMachine.Computable
import Definitions.Def_DualSepClusterLP_SparseInput
Formal statement
namespace DualSepClusterLP

/-- Corollary 2.4 at accuracy 1/(t+1). The LP optimum is the infimum of the
objectives of all feasible real primal vectors. The output contains the explicit
rational primal list, followed by the signed rational dual prices. -/
theorem primalDualApproximation :
    ∃ (M : Turing.TM2ComputableAux Bool Bool) (A a b D d : ℕ),
      (∀ k, Finite (M.tm.Γ k)) ∧
      ∀ (t n : ℕ) (G : Graph n), ∃ (L : SparseWeights n) (q : Fin n → ℚ),
        Nonempty (Turing.TM2OutputsInTime M.tm
          ((graphInput t G).map M.inputAlphabet.symm)
          (some ((roundingInput G L ++ pricesBits q).map M.outputAlphabet.symm))
          (2 ^ (A * (t+1)^a) * (n+1)^b)) ∧
        ValidSupport L ∧ L.length ≤ D * (n+1)^d ∧
        DualFeasible G (fun i => (q i : ℝ)) ∧
        let opt : ℝ := sInf {v : ℝ | ∃ z : Finset (Fin n) → ℝ, PrimalFeasible z ∧ primalValue G z = v}
        let factor : ℝ := 1 + 1 / ((t : ℝ) + 1)
        opt ≤ factor * ∑ i : Fin n, (q i : ℝ) ∧
          primalValue G (fun S => (weightAt L S : ℝ)) ≤ factor * opt := by sorry

end DualSepClusterLP
Source
David García-Soriano and Antoine Schohn, Approximate Dual Separation for the Cluster LP, STOC 2027 paper #79, §2, Corollary 2.4 (LP optimization conclusion of Theorem 1.1). https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/79.pdf
Read-back

What the Lean code literally says, in plain math · Codex (GPT-6)

One deterministic finite-alphabet machine and fixed natural constants A,a,b,D,d work for every accuracy index t, graph size n and graph. In time 2^{A(t+1)^a}(n+1)^b it outputs a valid primal list of length at most D(n+1)^d and feasible signed rational prices. If OPT is the infimum of all feasible real primal objectives and f=1+1/(t+1), then OPT is at most f times the sum of the prices and the returned primal value is at most f times OPT. The direct primal-to-dual factor of these two inequalities is f². No integral clustering is promised.

Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by hypercube · Nov 18, 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