Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.3 — deterministic cluster-LP rounding at 1.38651.38651.3865

Proved
DualSepClusterLP.deterministicRounding

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

approximation-algorithmscluster-lpcorrelation-clustering

From an explicitly represented feasible rational cluster-LP solution, a deterministic polynomial-time algorithm returns a clustering with cost at most 2773/20002773/20002773/2000 times the supplied objective value.

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

/-- Theorem 1.3 and Proposition F.1 for an explicitly supplied feasible rational support.
The step bound is polynomial in the full bit length of the graph and LP input. -/
theorem deterministicRounding :
    ∃ (M : Turing.TM2ComputableAux Bool Bool) (A b : ℕ),
      (∀ k, Finite (M.tm.Γ k)) ∧
      ∀ (n : ℕ) (G : Graph n) (L : SparseWeights n), ValidSupport L →
        ∃ C : Clustering n,
          Nonempty (Turing.TM2OutputsInTime M.tm
            ((roundingInput G L).map M.inputAlphabet.symm)
            (some ((partitionOutput C).map M.outputAlphabet.symm))
            (A * ((roundingInput G L).length + 1)^b)) ∧
          (disagreements G C : ℝ) ≤ (2773 / 2000 : ℝ) *
            primalValue G (fun S => (weightAt L S : ℝ)) := by sorry

end DualSepClusterLP
Source
David García-Soriano and Antoine Schohn, Approximate Dual Separation for the Cluster LP, STOC 2027 paper #79, §1, Theorem 1.3 and Appendix F, Proposition F.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 rounds every valid explicit list to a partition whose disagreement count is at most 2773/2000 times the supplied fractional objective. Time is polynomial in the full encoded input length. The supplied list may be exponentially large in n, and the assertion does not produce it.

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