Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.6 — consecutive language memberships differ with probability 1/2

Proved
BBBV.RandomPermutation.prob_membership_differs

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandom-permutation

For n≥1n\ge1n≥1 and T≥1T\ge1T≥1, compare the languages associated with πT\pi_TπT​ and πT−1\pi_{T-1}πT−1​ at the string 1n1^n1n. Exactly one language contains 1n1^n1n precisely when the first bits of their two inverse images differ. Under the chain's uniform sample law,

Pr⁡[1n∈LπT△LπT−1]=12.\Pr\bigl[1^n\in\mathcal L_{\pi_T}\mathbin{\triangle}\mathcal L_{\pi_{T-1}}\bigr]=\frac12.Pr[1n∈LπT​​△LπT−1​​]=21​.

This is the membership split used to turn closeness of algorithmic states into a failure bound.

Formalization Note The first bit requires n≥1n\ge1n≥1 and the preceding permutation requires T≥1T\ge1T≥1.

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

theorem prob_membership_differs {n T : ℕ} (hn : 0 < n) (hT : 1 ≤ T) :
    ((Finset.univ.filter fun ω : Ω n T =>
      (firstBit hn ((piChain ω T).symm (BBBV.RandomOracle.ones n)) = 1) ↔
        ¬ (firstBit hn ((piChain ω (T - 1)).symm (BBBV.RandomOracle.ones n)) = 1)).card : ℝ) /
      (Fintype.card (Ω n T) : ℝ) = 1 / 2 := by sorry

end BBBV.RandomPermutation
Source
Bennett, Bernstein, Brassard and Vazirani, Strengths and weaknesses of quantum computing, arXiv:quant-ph/9701001v1, p. 11, proof of Theorem 3.6, first 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