Fact 5.10 — cost of a lifted weight
ProvedMajorityDepthThree.Exact.lift_costcircuit-complexityextremal-combinatoricsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a set system on the finite ground set , let be a restriction, and let be any nonnegative weight on . For ,
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.