Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.3 — Linear simulation by unary parity certificates

Open
UnaryParityLifting.Exact.Supplement.reversible_simulation

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

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

There is one absolute C>0 such that, for every finite variable set V, ordinary source CNF F and RevRes(⊕) refutation p of F, an actual uSA(⊕) certificate q of F exists with

s(q)≤Csize⁡(p).s(q)\le C\operatorname{size}(p).s(q)≤Csize(p).

Every axiom multiplier of q is a nonnegative integer constant and every conical parity weight is a nonnegative integer. Both sides use matched explicit clause serialization; size includes initial occurrences and rule applications, not just the number of steps or maximum configuration size. The overhead constant is quantified before the variable set, formula and proof. This is the simulation used for the Tseitin upper bound in incomparability.

Differences from the source:

  • encoding: O(S) with the source written-occurrence encoding → one uniform positive linear constant and a fixed matched binary charge; reason: each final occurrence is charged to an initial occurrence or its last production as on p.21, so the constant is independent of dimension and proof
Preamble
import Definitions.Def_UnaryParityLifting_Exact_Supplement_reversible

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

/-- Proposition 7.3: one absolute linear written-size overhead. -/
theorem reversible_simulation :
    ∃ C : ℝ, 0 < C ∧ ∀ (V : Type) [Fintype V] (F : LiftSAParity.CNF V)
      (p : RevProof V), SourceCNF F → p.Refutes F →
      ∃ q : CertificateSyntax F, q.Valid ∧ ConstantParity q ∧
        (chargedSize (binaryCharge V) q : ℝ) ≤ C * p.size := 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.21, Proposition 7.3

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