Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform prefix deletion costs equal prefix size times the last-edge cost

Proved
StabilityDichotomies.Bijunctive.uniform_prefix_deletion_sum_eq_last_edge

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

Let a finite set of positions be uniformly permuted, and let SSS be a nonempty set of retained positions with distinguished last position j∈Sj\in Sj∈S. For any real cost depending on the retained image set and the selected element, the sum over permutations and retained positions of the deletion cost equals ∣S∣|S|∣S∣ times the sum over permutations of the cost of deleting the element at jjj. This is the symmetry identity used in the outside-first-mask part of Theorem 4.9.

Preamble
import Mathlib
open scoped Classical BigOperators
Formal statement
theorem StabilityDichotomies.Bijunctive.uniform_prefix_deletion_sum_eq_last_edge {α : Type} [Fintype α] [DecidableEq α]
    (S : Finset α) (j : α) (hj : j ∈ S) (cost : Finset α → α → ℝ) :
    (∑ π : Equiv.Perm α, ∑ i ∈ S, cost (S.image π) (π i)) =
      S.card * ∑ π : Equiv.Perm α, cost (S.image π) (π j) := 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