Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.12 — combined coverage and normalized cost

Proved
MajorityDepthThree.Exact.combine_restrictions

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 VVV, n=∣V∣n=|V|n=∣V∣, and let ρ1,…,ρk\rho_1,\ldots,\rho_kρ1​,…,ρk​ be restrictions. For each S∈AS\in\mathcal AS∈A, let I(S)I(S)I(S) index its compatible restrictions. Suppose λi≥0\lambda_i\ge0λi​≥0 and

∑i∈I(S)λiq∣S∩supp⁡−(ρi)∣≥1(S∈A).\sum_{i\in I(S)}\lambda_i q^{|S\cap\operatorname{supp}^-(\rho_i)|}\ge1\quad(S\in\mathcal A).i∈I(S)∑​λi​q∣S∩supp−(ρi​)∣≥1(S∈A).

For feasible residual weights fif_ifi​, the combined weight f=∑iλiLρi(fi)f=\sum_i\lambda_iL_{\rho_i}(f_i)f=∑i​λi​Lρi​​(fi​) is feasible and satisfies

cost⁡(f)=∑iλir∣supp⁡+(ρi)∣cost⁡(fi).\operatorname{cost}(f)=\sum_i\lambda_i r^{|\operatorname{supp}^+(\rho_i)|}\operatorname{cost}(f_i).cost(f)=i∑​λi​r∣supp+(ρi​)∣cost(fi​).

Furthermore, for any real ωi\omega_iωi​ satisfying CAρi≤ωipn−∣supp⁡(ρi)∣C_{\mathcal A_{\rho_i}}\le\omega_i p^{n-|\operatorname{supp}(\rho_i)|}CAρi​​​≤ωi​pn−∣supp(ρi​)∣ for every iii,

CApn≤∑iλiωir∣supp⁡+(ρi)∣p∣supp⁡(ρi)∣=∑iλiωi2−∣supp⁡+(ρi)∣q∣supp⁡−(ρi)∣.\frac{C_{\mathcal A}}{p^n}\le\sum_i\frac{\lambda_i\omega_i r^{|\operatorname{supp}^+(\rho_i)|}}{p^{|\operatorname{supp}(\rho_i)|}}=\sum_i\lambda_i\omega_i2^{-|\operatorname{supp}^+(\rho_i)|}q^{|\operatorname{supp}^-(\rho_i)|}.pnCA​​≤i∑​p∣supp(ρi​)∣λi​ωi​r∣supp+(ρi​)∣​=i∑​λi​ωi​2−∣supp+(ρi​)∣q∣supp−(ρi​)∣.

All three conclusions are retained. The parameters are the fixed Section 5 values, and every CCC is the actual covering minimum. This is the common statement used to combine residual budgets.

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
  • encoding: Indices 1 through k → Fin k; reason: This changes only index names; the empty sum is allowed
Preamble
import Definitions.Def_MajorityDepthThree_Exact_Restrictions
import Definitions.Def_MajorityDepthThree_Exact_Circuits

set_option autoImplicit false
open scoped Classical
Formal statement
namespace MajorityDepthThree.Exact

theorem combine_restrictions {α : Type} [DecidableEq α] (V : Finset α)
    (A : Family α) (hA : ∀ S ∈ A, S ⊆ V) (k : ℕ)
    (ρ : Fin k → Restriction V) (coeff : Fin k → ℝ)
    (hcoeff : ∀ i, 0 ≤ coeff i)
    (hc : ∀ S ∈ A,
      1 ≤ ∑ i ∈ Finset.univ.filter (fun i => Compatible A (ρ i) S),
        coeff i * q ^ (S ∩ (ρ i).neg).card)
    (f : Fin k → Weight α) (hf : ∀ i, CoverFeasible (residual A (ρ i)) q (f i)) :
    CoverFeasible A q (combinedWeight ρ coeff f) ∧
    cost A r (combinedWeight ρ coeff f) =
      ∑ i, coeff i * r ^ (ρ i).pos.card * cost (residual A (ρ i)) r (f i) ∧
    ∀ omega : Fin k → ℝ,
      (∀ i, coverValue (residual A (ρ i)) r q ≤ omega i * p ^ (V.card - (ρ i).support.card)) →
      coverValue A r q / p ^ V.card ≤
        ∑ i, coeff i * omega i * r ^ (ρ i).pos.card / p ^ (ρ i).support.card ∧
      (∑ i, coeff i * omega i * r ^ (ρ i).pos.card / p ^ (ρ i).support.card) =
        ∑ i, coeff i * omega i * (2 : ℝ) ^ (-((ρ i).pos.card : ℤ)) * q ^ (ρ i).neg.card := 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, Lemma 5.12 (proof continues p.15)
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