Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.5 — Entropy-preserving resampling

Proved
RandomOracleUnitarySynthesis.synthesis_entropy_resampling

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

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

Fix the full circuit V0,…,VkV_0,\ldots,V_kV0​,…,Vk​ with n≤mn\le mn≤m and m0≤mm_0\le mm0​≤m, and put N=2nN=2^nN=2n, M0=2m0M_0=2^{m_0}M0​=2m0​. For every 0<r≤10<r\le10<r≤1 there is a finite randomized algorithm taking a uniform Boolean function fff to a subset SSS of oracle inputs and a function fSf_SfS​, such that

H(fS∣f)≥M0−32k2Nr2,E∥Af−AfS∥F2≤2Nr2.H(f_S\mid f)\ge M_0-\frac{32k^2N}{r^2},\qquad \mathbb E\|A_f-A_{f_S}\|_F^2\le2Nr^2.H(fS​∣f)≥M0​−r232k2N​,E∥Af​−AfS​​∥F2​≤2Nr2.

Entropy is in bits. Both conclusions refer to the same randomized algorithm, with no running-time constraint and no positive-query restriction.

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: a randomized algorithm producing a subset and function → an existential finite PMF kernel producing the same two outputs; reason: every finite-output randomized procedure has such a kernel, and conversely the kernel is the allowed randomized procedure
Preamble
import Definitions.Def_RandomOracleUnitarySynthesis_synthesis_resampling

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

theorem synthesis_entropy_resampling {n m m₀ k : ℕ}
    (C : synthesis_Circuit n m m₀ k) (r : ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :
    ∃ K : synthesis_Resampler m₀,
      (2 : ℝ)^m₀ - 32 * (k : ℝ)^2 * (2 : ℝ)^n / r^2 ≤ synthesis_conditionalEntropy K ∧
      synthesis_energy C K ≤ 2 * (2 : ℝ)^n * r^2 := by sorry

end RandomOracleUnitarySynthesis
Source
Andrew Huang, Akshar Ramkumar, John Wright, STOC 2027 submission #157 (October 2026), Theorem 4.5, printed p. 17 (PDF p. 19); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/157.pdf#page=19; 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