Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2: Fano bound using the support dimension of R

Proved
QAlgorithms.Papers.Independent.Support50.P41.rankRefinedFano

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For a density matrix ρ\rhoρ, CPTP map Φ\PhiΦ on dimension d≥1d\ge1d≥1, and any normalized finite-reference purification ψ\psiψ, let r=rank⁡(Tr⁡Q∣ψ⟩⟨ψ∣)r=\operatorname{rank}(\operatorname{Tr}_Q|\psi\rangle\langle\psi|)r=rank(TrQ​∣ψ⟩⟨ψ∣). Then 1≤r≤d1\le r\le d1≤r≤d and, for rd>1rd>1rd>1,

Se(ρ,Φ)≤h(Fe)+(1−Fe)log⁡2(rd−1).S_e(\rho,\Phi)\le h(F_e)+(1-F_e)\log_2(rd-1).Se​(ρ,Φ)≤h(Fe​)+(1−Fe​)log2​(rd−1).

Here Fe=Fe(ψ,Φ)F_e=F_e(\psi,\Phi)Fe​=Fe​(ψ,Φ); for rd=1rd=1rd=1 the values are Fe=1F_e=1Fe​=1, Se=0S_e=0Se​=0. Thus only the occupied reference support contributes, even when the reference itself is larger.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

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

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF p.27: the occupied reference support replaces its ambient dimension in Fano. -/
theorem rankRefinedFano {d a : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi) :
    let r := (traceRight (pureDensity psi)).rank
    0 < r ∧ r ≤ d ∧
    (r*d = 1 → purificationFidelity psi Phi = 1 ∧ entropyExchange Phi rho = 0) ∧
    (1 < r*d → entropyExchange Phi rho ≤ binEntropy2 (purificationFidelity psi Phi) +
      (1-purificationFidelity psi Phi)*Real.logb 2 (((r*d : ℕ) : ℝ)-1)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 27, §6.2: Fano bound using the support dimension of R
Read-back

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

Let d>0d>0d>0 and a≥0a\ge0a≥0, let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) admit a finite representation Φ(X)=∑jEjXEj†\Phi(X)=\sum_jE_jXE_j^\daggerΦ(X)=∑j​Ej​XEj†​ with ∑jEj†Ej=Id\sum_jE_j^\dagger E_j=I_d∑j​Ej†​Ej​=Id​, let ρ≥0\rho\ge0ρ≥0 have trace 111, and let ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd satisfy ∥ψ∥=1\|\psi\|=1∥ψ∥=1 and Tr⁡Ca(ψψ†)=ρ\operatorname{Tr}_{\mathbb C^a}(\psi\psi^\dagger)=\rhoTrCa​(ψψ†)=ρ. Set r=rank⁡(Tr⁡Cd(ψψ†))r=\operatorname{rank}(\operatorname{Tr}_{\mathbb C^d}(\psi\psi^\dagger))r=rank(TrCd​(ψψ†)), F=Re⁡∑u,vψu‾[(id⁡⊗Φ)(ψψ†)]uvψvF=\operatorname{Re}\sum_{u,v}\overline{\psi_u}[(\operatorname{id}\otimes\Phi)(\psi\psi^\dagger)]_{uv}\psi_vF=Re∑u,v​ψu​​[(id⊗Φ)(ψψ†)]uv​ψv​, and EΦ(ρ)=S((id⁡⊗Φ)(ΓρΓρ†))E_\Phi(\rho)=S((\operatorname{id}\otimes\Phi)(\Gamma_\rho\Gamma_\rho^\dagger))EΦ​(ρ)=S((id⊗Φ)(Γρ​Γρ†​)), where Γρ(i,j)=(ρ)ji\Gamma_\rho(i,j)=(\sqrt\rho)_{ji}Γρ​(i,j)=(ρ​)ji​ and S(Z)=−Re⁡Tr⁡[xlog⁡2x (Z)]S(Z)=-\operatorname{Re}\operatorname{Tr}[x\log_2x\,(Z)]S(Z)=−ReTr[xlog2​x(Z)] uses continuous functional calculus with 0log⁡20=00\log_2 0=00log2​0=0. Then 0<r≤d0<r\le d0<r≤d; if rd=1rd=1rd=1, then F=1F=1F=1 and EΦ(ρ)=0E_\Phi(\rho)=0EΦ​(ρ)=0; and if 1<rd1<rd1<rd, then

EΦ(ρ)≤h2(F)+(1−F)log⁡2(rd−1),E_\Phi(\rho)\le h_2(F)+(1-F)\log_2(rd-1),EΦ​(ρ)≤h2​(F)+(1−F)log2​(rd−1),

where h2(x)=(−xln⁡x−(1−x)ln⁡(1−x))/ln⁡2h_2(x)=(-x\ln x-(1-x)\ln(1-x))/\ln2h2​(x)=(−xlnx−(1−x)ln(1−x))/ln2, with zero logarithmic terms taken as zero. Although a=0a=0a=0 is quantified, it makes the unit-vector hypothesis impossible.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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