Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Low-weight partition power sums have vanishing Möbius average

Proved
QuantumBipartiteTesting.Bipartiteness.partition_power_sum_cancellation

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

mobius-inversionpartition-latticepolynomial-method

Let ppp be a partition of a set of kkk elements, and let di,jd_{i,j}di,j​ be arbitrary real numbers indexed by an element iii and one of finitely many colors jjj. For a positive integer aaa and a partition rrr, define

Sa(r)=∑B∈r∑j(∑i∈Bdi,j)a.S_a(r)=\sum_{B\in r}\sum_j\left(\sum_{i\in B}d_{i,j}\right)^a.Sa​(r)=B∈r∑​j∑​(i∈B∑​di,j​)a.

Let a1,…,ama_1,\ldots,a_ma1​,…,am​ be positive integers satisfying

∑t=1m(at−1)<k−∣p∣.\sum_{t=1}^m(a_t-1)<k-|p|.t=1∑m​(at​−1)<k−∣p∣.

Then the signed refinement-chain coefficients satisfy

∑r≤pμ(r,p)∏t=1mSat(r)=0.\sum_{r\le p}\mu(r,p)\prod_{t=1}^m S_{a_t}(r)=0.r≤p∑​μ(r,p)t=1∏m​Sat​​(r)=0.

This is the polynomial cancellation identity underlying the extra power of the block parameter in the matching-moment numerator. It applies in particular to the component-color edge counts used in the source factorization.

Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
open scoped BigOperators Classical
Formal statement
theorem QuantumBipartiteTesting.Bipartiteness.partition_power_sum_cancellation {k colors m : ℕ}
    (p : QuantumBipartiteTesting.Bipartiteness.Partition k) (a : Fin m → ℕ)
    (ha : ∀ t, 0 < a t) (d : Fin k → Fin colors → ℝ)
    (hbudget : (∑ t, (a t-1))+(QuantumBipartiteTesting.Bipartiteness.Blocks p).card < k) :
    (∑ r : QuantumBipartiteTesting.Bipartiteness.Partition k,
      if QuantumBipartiteTesting.Bipartiteness.Refines r p then
        (QuantumBipartiteTesting.Bipartiteness.Mobius r p:ℝ) *
          (∏ t : Fin m, ∑ S ∈ QuantumBipartiteTesting.Bipartiteness.Blocks r,
            ∑ j : Fin colors, (∑ i ∈ S, d i j)^(a t)) else 0) = 0 := by sorry
Source
Ambainis–Childs–Liu, Quantum Property Testing for Bounded-Degree Graphs, https://arxiv.org/pdf/1012.3174, Proposition 19, §C.5 equation (13), printed pp.20–21; used in Proposition 6, pp.8–9. The polynomial identity is proved for arbitrary real entries, extending the nonnegative component-count entries used there. Kayal–Sen–Szabó, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/878.pdf, Appendix A.2 equation (A.7), pp.30–31.

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