Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 5.10 — cost of a lifted weight

Proved
MajorityDepthThree.Exact.lift_cost

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

circuit-complexityextremal-combinatoricsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A\mathcal AA be a set system on the finite ground set VVV, let ρ\rhoρ be a restriction, and let fρf_\rhofρ​ be any nonnegative weight on Aρ\mathcal A_\rhoAρ​. For r=3/2/2r=\sqrt{3/2}/2r=3/2​/2,

cost⁡(Lρ(fρ))=r∣supp⁡+(ρ)∣cost⁡(fρ).\operatorname{cost}(L_\rho(f_\rho))=r^{|\operatorname{supp}^+(\rho)|}\operatorname{cost}(f_\rho).cost(Lρ​(fρ​))=r∣supp+(ρ)∣cost(fρ​).

Cost on either side uses its own family. No covering feasibility is required. This identity records the exact objective change when adding the positive support back to residual sets.

Differences from the source:

  • encoding: A finite ground set V and its subsets → Finite subsets V of a variable type, with finite families of subsets; reason: Every source instance has this representation; all assignments and ambient isolated variables are retained
  • encoding: Restrictions and the augmented restrictions of Note 5.3 → Disjoint positive and negative supports contained in V, plus optional clauses on unset variables; reason: An empty collection of extra clauses gives ordinary restrictions; residual families and lifted weights use strong consistency, while compatibility remains weaker
Preamble
import Definitions.Def_MajorityDepthThree_Exact_Restrictions
import Definitions.Def_MajorityDepthThree_Exact_Circuits

set_option autoImplicit false
Formal statement
namespace MajorityDepthThree.Exact

theorem lift_cost {α : Type} [DecidableEq α] (V : Finset α)
    (A : Family α) (hA : ∀ S ∈ A, S ⊆ V) (ρ : Restriction V)
    (f : Weight α) (hf : ∀ S ∈ residual A ρ, 0 ≤ f S) :
    cost A r (liftWeight ρ f) = r ^ ρ.pos.card * cost (residual A ρ) r f := by sorry

end MajorityDepthThree.Exact
Source
Mohit Gurumukhani, Daniel Kleber, Ramamohan Paturi, Christopher Rosin, Michael Saks, Navid Talebanfard, STOC 2027 submission #677 (October 2026), p.13, Fact 5.10
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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