Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.2 — Lifting to integer unary Sherali–Adams

Open
UnaryParityLifting.Exact.Supplement.integer_lifting

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1proof-complexitysherali-adams

Fix a surjective 1-stifling gadget g on m≥1 bits, with c_g exactly (3.3). For every source CNF F on N≥1 variables with positive width bound w and every input uSA(⊕) certificate for F∘g of published charged size at most S≥1, put T=(mN+2)S and choose the exact R of (4.7). There exists an exact integer uSA refutation q of F with degree≤R and nonnegative constant axiom multipliers. With

TN,R=∑j=0min⁡(R,N)2j(Nj),T_{N,R}=\sum_{j=0}^{\min(R,N)}2^j\binom Nj,TN,R​=j=0∑min(R,N)​2j(jN​),

its coefficient mass satisfies

W(q)≤3⋅4R(S+TN,R)(6T2R+1).W(q)\le3\cdot4^R(S+T_{N,R})(6T2^R+1).W(q)≤3⋅4R(S+TN,R​)(6T2R+1).

Both its mass and its total unary encoding size are bounded by C S^K(N+1)^{KR}, and R≤C_d(w+log(NS+1)), for positive C,C_d and a natural K depending only on g and chosen before all instance data. Unary size includes the actual listing of each used clause and term, variable indices and unary coefficients. All conclusions hold together for the same q, including the capped R=N case and formulas containing an empty clause. This gives the paper's integer output with its separate, larger mass bound.

Differences from the source:

  • encoding: integer output, equation (4.7), and the two O-notation conclusions → integrality of the unchanged real-certificate data, natural ceiling, fixed unary listing cost and uniform polynomial constants; reason: this changes no instance, keeps every factor of (A.2), and expresses both mass and total encoding size for the same certificate
Preamble
import Definitions.Def_UnaryParityLifting_Exact_Supplement_integerOutput

noncomputable section
open Classical
open scoped BigOperators
Formal statement
namespace UnaryParityLifting.Exact.Supplement

/-- Theorem A.2: explicit integer bound, unary size and degree asymptotics together. -/
theorem integer_lifting {m : ℕ} (g : (Fin m → Bool) → Bool)
    (hm : 1 ≤ m) (hg : Function.Surjective g) (hs : LiftSAParity.IsOneStifling g) :
    ∃ C Cd : ℝ, 0 < C ∧ 0 < Cd ∧ ∃ K : ℕ,
    ∀ (N w S : ℕ) (F : LiftSAParity.CNF (Fin N))
      (enc : EncodingCharge (Fin N × Fin m)),
      1 ≤ N → 1 ≤ S → WidthAtMost F w →
      HasParityCertificate (LiftSAParity.lift F g) enc S →
      let R := liftingDegree g N w S
      let T := normalizationBudget m N S
      (R : ℝ) ≤ Cd * (w + Real.log (N * S + 1 : ℝ)) ∧
      ∃ q : RealCertificate F, q.IsExact ∧ IntegerOutput q ∧ q.DegreeLE R ∧
        q.mass ≤ 3 * (4 : ℝ) ^ R * (S + termCount N R) * (6 * T * (2 : ℝ) ^ R + 1) ∧
        q.mass ≤ C * (S : ℝ) ^ K * (N + 1 : ℝ) ^ (K * R) ∧
        unaryOutputSize q ≤ C * (S : ℝ) ^ K * (N + 1 : ℝ) ^ (K * R) := by sorry

end UnaryParityLifting.Exact.Supplement
Source
Yaroslav Alekseev, Lifting to Unary Sherali–Adams over Parities, STOC 2027 submission #567 (October 2026), canonical source.pdf SHA256 088f9b64d3926dd700996884111b97c94806141880e07004f529211a40c0619b; citation_basis: published (submission artifact, no acceptance claim), printed/PDF p.25, Theorem A.2

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