Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.9 — Reversible resampling energy

Proved
RandomOracleUnitarySynthesis.synthesis_resampling_energy

by mikedeng1 · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquery-complexityrandom-oracles

Fix a circuit and 0<r≤10<r\le10<r≤1. Start with a uniform truth table f=f0f=f_0f=f0​, then run the concrete symmetric resampling procedure from the proof of Theorem 4.5, with independent fair replacement bits. If its successive functions are f1,…,fM0=fSf_1,\ldots,f_{M_0}=f_Sf1​,…,fM0​​=fS​, then

E∥Af−AfS∥F2≤2∑i=1M0E∥Afi−Afi−1∥F2.\mathbb E\|A_f-A_{f_S}\|_F^2\le2\sum_{i=1}^{M_0}\mathbb E\|A_{f_i}-A_{f_{i-1}}\|_F^2.E∥Af​−AfS​​∥F2​≤2i=1∑M0​​E∥Afi​​−Afi−1​​∥F2​.

The statement concerns this particular adaptive procedure and makes no energy-invariant assumption about an arbitrary path.

Differences from the source:

  • encoding: binary computational bases, Boolean truth tables, and the stated register inequalities → Fin n → Fin 2 bases, Bool-valued truth tables, and a circuit type carrying n ≤ m and m₀ ≤ m; reason: these are bijective finite encodings of exactly the source registers and functions
  • encoding: uniform finite expectations → normalized finite sums and genuine PMF expectations; reason: the truth-table and seed sets are finite and nonempty, so the sums equal the source expectations
  • encoding: the procedure with threshold r²/(8k) in the positive-query proof → the same procedure, with threshold zero at k=0 and fully independent resampling; reason: the zero-query compressed block is constant and this defines the boundary without division by zero
Preamble
import Definitions.Def_RandomOracleUnitarySynthesis_synthesis_resampling

open scoped Matrix ComplexConjugate
open MeasureTheory Filter Classical
noncomputable section
Formal statement
namespace RandomOracleUnitarySynthesis

theorem synthesis_resampling_energy {n m m₀ k : ℕ}
    (C : synthesis_Circuit n m m₀ k) (r : ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :
    synthesis_energy C (synthesis_resample C r) ≤
      2 * ∑ i : Fin (Fintype.card (synthesis_Bits m₀)), synthesis_stepEnergy C r i.val := by sorry

end RandomOracleUnitarySynthesis
Source
Andrew Huang, Akshar Ramkumar, John Wright, STOC 2027 submission #157 (October 2026), Lemma 4.9, printed p. 21 (PDF p. 23); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/157.pdf#page=23; PDF SHA256 2f2d7fa67fe2665257ec12cb0d11d7e2a80752cdecc0484b26a311d1223c5d11
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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