Fact 5.11 — coverage of compatible sets
ProvedMajorityDepthThree.Exact.lift_coveragecircuit-complexityextremal-combinatoricsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a finite set system on , a restriction and a feasible covering weight on . Put . Every compatible with satisfies
Compatibility allows intersection with the negative support. The bound therefore measures partial coverage as well as full coverage and is the source's interface for overlapping branches.
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_coverage {α : Type} [DecidableEq α] (V : Finset α)
(A : Family α) (hA : ∀ S ∈ A, S ⊆ V) (ρ : Restriction V)
(f : Weight α) (hf : CoverFeasible (residual A ρ) q f)
(S : Finset α) (hS : S ∈ A) (hc : Compatible A ρ S) :
q ^ (S ∩ ρ.neg).card ≤ contribution A q (liftWeight ρ f) S := 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.14, Fact 5.11
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.