Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fawzi–Renner lower bound in bits

Open
QAlgorithms.Papers.Independent.Intakenext100.P75.fawziRenner

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

prove2quantum

Let ρABC\rho_{ABC}ρABC​ be any density operator on finite-dimensional nonzero complex systems. Let F(A;B∣C)ρF(A;B|C)_\rhoF(A;B∣C)ρ​ be the maximum squared fidelity with states recovered from ρBC\rho_{BC}ρBC​ by an arbitrary CPTP map C→ACC\to ACC→AC, acting identically on BBB. Then

I(A:B∣C)ρ≥−log⁡2F(A;B∣C)ρ.I(A:B|C)_\rho\ge-\log_2 F(A;B|C)_\rho.I(A:B∣C)ρ​≥−log2​F(A;B∣C)ρ​.

The conditional mutual information is H(AC)+H(BC)−H(ABC)−H(C)H(AC)+H(BC)-H(ABC)-H(C)H(AC)+H(BC)−H(ABC)−H(C) with entropy in bits. The negative logarithm at zero is interpreted as +∞+\infty+∞. This is Theorem 5, reproved operationally in this paper, with no full-rank or Markov-state restriction.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P75
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P75

open scoped Matrix ComplexOrder

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

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

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)

variable {A B C D Ap Bp Cp R I J K L : Type}

variable [Fintype A] [DecidableEq A] [Nonempty A]

variable [Fintype B] [DecidableEq B] [Nonempty B]

variable [Fintype C] [DecidableEq C] [Nonempty C]

variable [Fintype D] [DecidableEq D] [Nonempty D]

variable [Fintype Ap] [DecidableEq Ap] [Nonempty Ap]

variable [Fintype Bp] [DecidableEq Bp] [Nonempty Bp]

variable [Fintype Cp] [DecidableEq Cp] [Nonempty Cp]

variable [Fintype R] [DecidableEq R] [Nonempty R]

/-- Theorem 5, PDF p.6, (37), proved through p.7, (47): Fawzi–Renner
in bits. Extended negative log at zero is +infinity. -/
theorem fawziRenner
    [Nonempty A] [Nonempty B] [Nonempty C] (rho : Mat (B × (A × C))) (hrho : IsDensityMatrix rho) :
    (if ordinaryRecovery rho = 0 then (⊤ : EReal)
      else ((-Real.logb 2 (ordinaryRecovery rho) : ℝ) : EReal)) ≤ (conditionedLastCMIBits rho : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P75
Source
The Fidelity of Recovery is Multiplicative, arXiv:1502.07973v2, PDF p. 6, Theorem 5, (37),(47)
Read-back

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

For finite nonempty types A,B,CA,B,CA,B,C with decidable equality and every positive semidefinite trace-one matrix ρ\rhoρ on B×(A×C)B\times(A\times C)B×(A×C), define ρBC(b,c),(b′,c′)=∑aρ(b,(a,c)),(b′,(a,c′))\rho_{BC}{}_{(b,c),(b',c')}=\sum_a\rho_{(b,(a,c)),(b',(a,c'))}ρBC​(b,c),(b′,c′)​=∑a​ρ(b,(a,c)),(b′,(a,c′))​ and

O(ρ)=sup⁡R:C→A×C(Re⁡tr⁡ρ (id⁡B⊗R)(ρBC) ρ)2,O(\rho)=\sup_{\mathcal R:C\to A\times C} \left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt\rho\,(\operatorname{id}_B\otimes\mathcal R)(\rho_{BC})\,\sqrt\rho}\right)^2,O(ρ)=R:C→A×Csup​(Retrρ​(idB​⊗R)(ρBC​)ρ​​)2,

where the supremum ranges over maps admitting finite Kraus representations with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Then

{+∞,O(ρ)=0,−log⁡2O(ρ),O(ρ)≠0 ≤ H(ρAC)+H(ρCB)−H(ρC)−H(ρ),\begin{cases} +\infty,&O(\rho)=0,\\ -\log_2O(\rho),&O(\rho)\ne0 \end{cases} \ \le\ H(\rho_{AC})+H(\rho_{CB})-H(\rho_C)-H(\rho),{+∞,−log2​O(ρ),​O(ρ)=0,O(ρ)=0​ ≤ H(ρAC​)+H(ρCB​)−H(ρC​)−H(ρ),

as an inequality in the extended real numbers. The marginals use the displayed register ordering after rearranging ρ\rhoρ to A×(C×B)A\times(C\times B)A×(C×B), and H(X)=−Re⁡tr⁡[Xlog⁡2X]H(X)=-\operatorname{Re}\operatorname{tr}[X\log_2X]H(X)=−Retr[Xlog2​X] is defined by spectral functional calculus with 0log⁡20=00\log_2 0=00log2​0=0. In particular, the zero-recovery case is explicitly assigned +∞+\infty+∞ on the left.

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