Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact prescribed-pair probability for block-preserving perfect matchings

Proved
QuantumBipartiteTesting.Bipartiteness.uniform_block_matching_contains

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

finite-probabilityperfect-matchingquantum-query-complexity

Let l≥1l\ge1l≥1 and let sss be even. Partition lslsls labeled vertices into lll canonical blocks of size sss. For each block jjj, prescribe a partial matching EjE_jEj​ of disjoint, nonloop pairs in that block. If hhh is uniform among fixed-point-free involutions preserving every block, then

Pr⁡[every Ej occurs in h]=∏j=1l∏a=0∣Ej∣−1(s−2a−1)−1.\Pr[\text{every }E_j\text{ occurs in }h] =\prod_{j=1}^{l}\prod_{a=0}^{|E_j|-1}(s-2a-1)^{-1}.Pr[every Ej​ occurs in h]=j=1∏l​a=0∏∣Ej​∣−1​(s−2a−1)−1.

This supplies the exact independent-block matching probability used in the hidden-block graph sampling law. Empty blocks and empty partial matchings follow the stated finite-sum conventions.

Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
open QuantumBipartiteTesting.Bipartiteness Finset
open scoped BigOperators Classical
Formal statement
theorem QuantumBipartiteTesting.Bipartiteness.uniform_block_matching_contains (l s : ℕ) (hl : 0 < l) (hs : Even s)
    (E : Fin l → Finset (Sym2 (Fin s)))
    (hloop : ∀ j, ∀ p ∈ E j, ¬ p.IsDiag)
    (hdisj : ∀ j, ∀ p ∈ E j, ∀ q ∈ E j, (∃ x, x ∈ p ∧ x ∈ q) → p = q) :
    Average (Matchings (l*s) l) (fun h =>
      if ∀ j a b, s(a,b) ∈ E j → h (finProdFinEquiv (j,a)) = finProdFinEquiv (j,b) then (1:ℝ) else 0) =
      ∏ j, ∏ a ∈ range (E j).card, ((s:ℝ)-2*a-1)⁻¹ := by sorry
Source
Kayal–Sen–Szabó, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/878.pdf, §2.5.1 hidden-block matching distribution and Appendix A.2, printed p.30, probability R_d and product (A.2).

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