Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1: chi-deficit maximal-distance bound

Open
QAlgorithms.Papers.Independent.Gap48.P46.chi_deficit_bound

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

prove2quantum

All quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel Φ\PhiΦ, write χΦ(ρ)\chi_\Phi(\rho)χΦ​(ρ) for the maximum ensemble Holevo information at mean ρ\rhoρ, H^Φ(ρ)\widehat H_\Phi(\rho)HΦ​(ρ) for the minimum average output entropy at that mean, and C‾(Φ;A)\overline C(\Phi;\mathcal A)C(Φ;A) for the maximum of χΦ\chi_\PhiχΦ​ over a nonempty closed mean constraint A\mathcal AA.

Let A\mathcal AA be nonempty, closed and convex, and let ρav\rho_{\rm av}ρav​ be the average of an optimal ensemble for Φ\PhiΦ with this constraint. For every ρ∈A\rho\in\mathcal Aρ∈A,

C‾(Φ;A)=χΦ(ρav)≥χΦ(ρ)+D2(Φ(ρ)∥Φ(ρav)).\overline C(\Phi;\mathcal A)=\chi_\Phi(\rho_{\rm av})\ge\chi_\Phi(\rho)+D_2(\Phi(\rho)\|\Phi(\rho_{\rm av})).C(Φ;A)=χΦ​(ρav​)≥χΦ​(ρ)+D2​(Φ(ρ)∥Φ(ρav​)).

Here D2D_2D2​ is extended nonnegative relative entropy, infinite on support failure. The inequality bounds the loss in chi by the distance to the optimal output mean.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P46

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

open Filter

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)

open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)

open QAlgorithms.Papers.Independent.Information100.P08
  (Ensemble ensembleAverage outputHolevo mixedRoof)

variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]

variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]

/-- PDF p.6, Corollary 1: optimal mean capacity and the chi-deficit distance bound.
Convexity is inherited from Proposition 1, which the proof invokes. -/
theorem chi_deficit_bound [Nonempty I] [Nonempty O]
    (Phi : Superop I O) (hPhi : IsChannel Phi) (A : Set (Matrix I I ℂ))
    (hA : Constraint A) (hconvex : Convex ℝ A) (e : Ensemble I) (he : IsOptimalConstrainedEnsemble Phi A e) :
    constrainedChiCapacity Phi A = fixedMeanChi Phi (ensembleAverage e) ∧ ∀ rho ∈ A,
      ENNReal.ofReal (fixedMeanChi Phi rho) + relativeEntropyBits (Phi rho) (Phi (ensembleAverage e)) ≤
        ENNReal.ofReal (constrainedChiCapacity Phi A) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 6, Corollary 1: chi-deficit maximal-distance bound
Read-back

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

Let I,OI,OI,O be finite nonempty types with decidable equality, and let Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ be a channel, with a finite Kraus family satisfying ∑jKj†Kj=1\sum_jK_j^\dagger K_j=1∑j​Kj†​Kj​=1. Let A\mathcal AA be a nonempty closed convex subset of the density matrices on III. For a finite ensemble e=(pi,ρi)e=(p_i,\rho_i)e=(pi​,ρi​), require pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, and each ρi\rho_iρi​ to be positive semidefinite with trace 111, and put ρˉe=∑ipiρi\bar\rho_e=\sum_i p_i\rho_iρˉ​e​=∑i​pi​ρi​. Define

χΦ(e)=H(Φ(ρˉe))−∑ipiH(Φ(ρi)),χΦ(ρ)=sup⁡ρˉf=ρχΦ(f),CΦ(A)=sup⁡ρ∈AχΦ(ρ),\chi_\Phi(e)=H(\Phi(\bar\rho_e))-\sum_i p_iH(\Phi(\rho_i)),\qquad \chi_\Phi(\rho)=\sup_{\bar\rho_f=\rho}\chi_\Phi(f),\qquad C_\Phi(\mathcal A)=\sup_{\rho\in\mathcal A}\chi_\Phi(\rho),χΦ​(e)=H(Φ(ρˉ​e​))−i∑​pi​H(Φ(ρi​)),χΦ​(ρ)=ρˉ​f​=ρsup​χΦ​(f),CΦ​(A)=ρ∈Asup​χΦ​(ρ),

where H(X)=−∑jλjlog⁡2λjH(X)=-\sum_j\lambda_j\log_2\lambda_jH(X)=−∑j​λj​log2​λj​, with zero terms equal to 000. Suppose ρˉe∈A\bar\rho_e\in\mathcal Aρˉ​e​∈A and χΦ(e)=CΦ(A)\chi_\Phi(e)=C_\Phi(\mathcal A)χΦ​(e)=CΦ​(A). Then

CΦ(A)=χΦ(ρˉe),[χΦ(ρ)]++D2 ⁣(Φ(ρ) ∥ Φ(ρˉe))≤[CΦ(A)]+(ρ∈A).C_\Phi(\mathcal A)=\chi_\Phi(\bar\rho_e), \qquad [\chi_\Phi(\rho)]_+ +D_2\!\left(\Phi(\rho)\,\middle\Vert\,\Phi(\bar\rho_e)\right) \le[C_\Phi(\mathcal A)]_+ \quad(\rho\in\mathcal A).CΦ​(A)=χΦ​(ρˉ​e​),[χΦ​(ρ)]+​+D2​(Φ(ρ)∥Φ(ρˉ​e​))≤[CΦ​(A)]+​(ρ∈A).

Here the latter inequality is in the extended nonnegative reals, [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0), and, for density matrices τ,σ\tau,\sigmaτ,σ, D2(τ∥σ)D_2(\tau\Vert\sigma)D2​(τ∥σ) is +∞+\infty+∞ unless ker⁡σ⊆ker⁡τ\ker\sigma\subseteq\ker\taukerσ⊆kerτ; when this inclusion holds, it equals [Re⁡tr⁡(τln⁡τ−τln⁡σ)]+/ln⁡2[\operatorname{Re}\operatorname{tr}(\tau\ln\tau-\tau\ln\sigma)]_+/\ln2[Retr(τlnτ−τlnσ)]+​/ln2. Matrix functions use spectral functional calculus with ln⁡0=0\ln0=0ln0=0 and 0ln⁡0=00\ln0=00ln0=0.

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

    Confirmed by the moderator at approval.

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