Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform cutoff averaging bounds all prefix deletions by the chain budget

Proved
StabilityDichotomies.Bijunctive.uniform_cutoff_prefix_deletions_le_chain_budget

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

Take a uniform random ordering and a uniform cutoff among its possible prefixes. Suppose the sum of the consecutive last-edge costs in every ordering is at most BBB. For any nonnegative set-dependent deletion costs, the expected sum over all elements retained by the cutoff is at most BBB. The formal finite-sum statement also permits any family of prefix sets of the requisite sizes.

Preamble
import Mathlib
open scoped Classical BigOperators
Formal statement
theorem StabilityDichotomies.Bijunctive.uniform_cutoff_prefix_deletions_le_chain_budget
    {α τ : Type} [Fintype α] [DecidableEq α] [Fintype τ]
    (S : τ → Finset α) (last : τ → α) (cost : τ → Finset α → α → ℝ) (B : ℝ)
    (hsize : ∀ q, (S q).card ≤ Fintype.card τ)
    (hlast : ∀ q, S q ≠ ∅ → last q ∈ S q)
    (hnonneg : ∀ q π, 0 ≤ cost q ((S q).image π) (π (last q)))
    (hchain : ∀ π : Equiv.Perm α,
      (∑ q : τ, if S q = ∅ then 0 else cost q ((S q).image π) (π (last q))) ≤ B) :
    (∑ q : τ, ∑ π : Equiv.Perm α, ∑ i ∈ S q, cost q ((S q).image π) (π i)) ≤
      (Fintype.card τ : ℝ) * (Fintype.card (Equiv.Perm α) : ℝ) * B := by
  sorry
Source
Wang and Yoshida, Stability Dichotomies for Boolean CSPs, STOC 2027, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/535.pdf, proof of Theorem 4.9, outside-mask deletion symmetry.

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