Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2: exact Renyi-gap communication bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.exact_renyi_gap_lower

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ϕ,ψ\phi,\psiϕ,ψ be normalized bipartite pure vectors and 0≤α<β≤∞0\le\alpha<\beta\le\infty0≤α<β≤∞. For a density matrix ρ\rhoρ, let Sa(ρ)S_a(\rho)Sa​(ρ) be its base-two Rényi entropy, using support counting at zero, von Neumann entropy at one, and minus the logarithm of the largest eigenvalue at infinity. Set Δαβ=Sα−Sβ\Delta^{\alpha\beta}=S_\alpha-S_\betaΔαβ=Sα​−Sβ​. Every exact deterministic quantum transformation protocol of cost CCC obeys

C≥12(Δαβ(ψA)−Δαβ(ϕA)).C\ge\tfrac12\bigl(\Delta^{\alpha\beta}(\psi_A)-\Delta^{\alpha\beta}(\phi_A)\bigr).C≥21​(Δαβ(ψA​)−Δαβ(ϕA​)).

Alice's reductions are denoted by the subscript AAA. The orders are fixed before comparing the two endpoint spectra.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P61

open scoped Matrix ComplexConjugate

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)

open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

attribute [local instance] Classical.propDecidable

section Operational

variable {A B C D : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
    [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

/-- PDF p.3, Remark 2: exact Renyi-gap bound, including orders zero, one, infinity. -/
theorem exact_renyi_gap_lower (phi : EuclideanSpace ℂ (A × B))
    (psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1)
    (alpha beta : RenyiOrder) (horder : alpha < beta) (cost : ℝ)
    (hprotocol : Quantum (pureDensity phi) (pureDensity psi) cost) :
    cost ≥ (renyiGap (aliceDensity psi) alpha beta -
      renyiGap (aliceDensity phi) alpha beta) / 2 := by sorry

end Operational

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 3, Remark 2: exact Renyi-gap communication bound
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For finite register types A,B,C,DA,B,C,DA,B,C,D, unit vectors ϕ\phiϕ on A×BA\times BA×B and ψ\psiψ on C×DC\times DC×D, orders α,β∈[0,∞]\alpha,\beta\in[0,\infty]α,β∈[0,∞] with α<β\alpha<\betaα<β, and a real number ccc, suppose a quantum execution takes ϕϕ†\phi\phi^\daggerϕϕ† exactly to ψψ†\psi\psi^\daggerψψ† at cost exactly ccc. This execution relation is generated by identity and trace-preserving local Kraus maps at zero cost, transfers of positive integer dimensional tensor factors in either direction at cost log⁡2m\log_2mlog2​m, and finite composition adding costs, after relabeling finite registers by consecutive integers. Write ρϕ=tr⁡B(ϕϕ†)\rho_\phi=\operatorname{tr}_B(\phi\phi^\dagger)ρϕ​=trB​(ϕϕ†) and ρψ=tr⁡D(ψψ†)\rho_\psi=\operatorname{tr}_D(\psi\psi^\dagger)ρψ​=trD​(ψψ†). If λi\lambda_iλi​ are the positive eigenvalues of ρ\rhoρ, counted with multiplicity, define

Ha(ρ)={log⁡2∣{i:λi>0}∣,a=0,−∑iλilog⁡2λi,a=1,log⁡2∑iλia1−a,0<a<∞, a≠1,−log⁡2max⁡iλi,a=∞.H_a(\rho)= \begin{cases} \log_2|\{i:\lambda_i>0\}|,&a=0,\\ -\sum_i\lambda_i\log_2\lambda_i,&a=1,\\ \dfrac{\log_2\sum_i\lambda_i^a}{1-a},&0<a<\infty,\ a\ne1,\\ -\log_2\max_i\lambda_i,&a=\infty. \end{cases}Ha​(ρ)=⎩⎨⎧​log2​∣{i:λi​>0}∣,−∑i​λi​log2​λi​,1−alog2​∑i​λia​​,−log2​maxi​λi​,​a=0,a=1,0<a<∞, a=1,a=∞.​

Then

c≥[Hα(ρψ)−Hβ(ρψ)]−[Hα(ρϕ)−Hβ(ρϕ)]2.c\ge\frac{[H_\alpha(\rho_\psi)-H_\beta(\rho_\psi)] -[H_\alpha(\rho_\phi)-H_\beta(\rho_\phi)]}{2}.c≥2[Hα​(ρψ​)−Hβ​(ρψ​)]−[Hα​(ρϕ​)−Hβ​(ρϕ​)]​.

The allowed orders include zero, one, and infinity subject to the strict ordering.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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