Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.6 — each permutation in the transposition chain is uniform

Proved
BBBV.RandomPermutation.piChain_uniform

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-permutationtransposition

In the transposition chain, for every index 0≤i≤T+10\le i\le T+10≤i≤T+1, the permutation πi\pi_iπi​ is uniformly distributed among all permutations of length-nnn binary strings:

Pr⁡[πi=σ]=1(2n)!for every permutation σ.\Pr[\pi_i=\sigma]=\frac{1}{(2^n)!}\quad\text{for every permutation }\sigma.Pr[πi​=σ]=(2n)!1​for every permutation σ.

The construction also satisfies πi(xi)=1n\pi_i(x_i)=1^nπi​(xi​)=1n for every sampled outcome. These facts identify both the law of the oracle and the distinguished inverse image at each stage.

Preamble
import Mathlib
import Definitions.Def_BBBV_RandomPermutation_Chain
Formal statement
namespace BBBV.RandomPermutation

theorem piChain_uniform {n T : ℕ} (i : ℕ) (hi : i ≤ T + 1)
    (σ : Equiv.Perm (BBBV.RandomOracle.Str n)) :
    (((Finset.univ.filter fun ω : Ω n T => piChain ω i = σ).card : ℝ) /
      (Fintype.card (Ω n T) : ℝ) =
        1 / (Fintype.card (Equiv.Perm (BBBV.RandomOracle.Str n)) : ℝ)) ∧
    (∀ ω : Ω n T, piChain ω i (x ω i) = BBBV.RandomOracle.ones n) := by sorry

end BBBV.RandomPermutation
Source
Bennett, Bernstein, Brassard and Vazirani, Strengths and weaknesses of quantum computing, arXiv:quant-ph/9701001v1, p. 10, proof of Theorem 3.6, transposition-chain paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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