Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4: both equality characterizations of the capacity bound

Open
QAlgorithms.Papers.Independent.Gap48.P45.holevoCapacity_equalityCharacterizations

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

prove2quantum

All physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. Write HBΦH_B^\PhiHBΦ​ for the closed span of all output supports, dΦ=dim⁡HBΦd_\Phi=\dim H_B^\PhidΦ​=dimHBΦ​, m0(Φ)=dim⁡ker⁡(Φ∗∣B(HBΦ))m_0(\Phi)=\dim\ker(\Phi^*|_{\mathcal B(H_B^\Phi)})m0​(Φ)=dimker(Φ∗∣B(HBΦ​)​), and mr=min⁡{m0(Φ)+r2,dΦ}m_r=\min\{m_0(\Phi)+r^2,d_\Phi\}mr​=min{m0​(Φ)+r2,dΦ​}; dimensions retain infinity. For vectors ψpk\psi_p^kψpk​ with ∑p∥ψpk∥2=1\sum_p\|\psi_p^k\|^2=1∑p​∥ψpk​∥2=1 and ⟨ψtk∣ψpk⟩=0\langle\psi_t^k|\psi_p^k\rangle=0⟨ψtk​∣ψpk​⟩=0 when p≠tp\ne tp=t, define NP,ψ(X)=∑k,l,p,tPkXPl⊗⟨ψtl∣ψpk⟩∣p⟩⟨t∣N_{P,\psi}(X)=\sum_{k,l,p,t}P_kXP_l\otimes\langle\psi_t^l|\psi_p^k\rangle|p\rangle\langle t|NP,ψ​(X)=∑k,l,p,t​Pk​XPl​⊗⟨ψtl​∣ψpk​⟩∣p⟩⟨t∣ on HA⊗HmH_A\otimes H_mHA​⊗Hm​. Here HmH_mHm​ has dimension mmm, including countable infinity. For unit vectors ηk\eta_kηk​, write GP,η(X)=∑k,l⟨ηl∣ηk⟩PkXPlG_{P,\eta}(X)=\sum_{k,l}\langle\eta_l|\eta_k\rangle P_kXP_lGP,η​(X)=∑k,l​⟨ηl​∣ηk​⟩Pk​XPl​. For a channel between positive finite-dimensional spaces:

Cˉ(Φ)=ln⁡dim⁡HA  ⟺  ∃ nonzero orthogonal resolution {Pk} with all four classification properties below.\bar C(\Phi)=\ln\dim H_A\iff\exists\text{ nonzero orthogonal resolution }\{P_k\}\text{ with all four classification properties below}.Cˉ(Φ)=lndimHA​⟺∃ nonzero orthogonal resolution {Pk​} with all four classification properties below.

These properties are: one recovery for all pure states within individual blocks; one recovery for all block-diagonal states; the complementary form Φ^(X)=∑kTr⁡(PkX)σk\widehat\Phi(X)=\sum_k\operatorname{Tr}(P_kX)\sigma_kΦ(X)=∑k​Tr(Pk​X)σk​ with states of rank at most m1m_1m1​; and isometrical equivalence to NP,ψN_{P,\psi}NP,ψ​ with m=m1m=m_1m=m1​. If HB=HAH_B=H_AHB​=HA​, there is also the characterization

Cˉ(Φ)=ln⁡dim⁡HA  ⟺  Φ is unitarily equivalent to some GP,η.\bar C(\Phi)=\ln\dim H_A\iff\Phi\text{ is unitarily equivalent to some }G_{P,\eta}.Cˉ(Φ)=lndimHA​⟺Φ is unitarily equivalent to some GP,η​.

All output vectors and states, the resolution, and the common recovery maps are existential conclusions.

This result characterizes both general and equal-space equality cases of the dimension bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap48.P45

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)

open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)

open QAlgorithms.Papers.Independent.Frontier18.P18
  (operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
   IsParsevalFrame IsKrausRepresentation)

open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)

open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)

open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)

/-- Corollary 4, PDF p.21, BOTH A and B. A expands all four explicit channel
forms; B specializes to the same input and output Hilbert space. -/
theorem holevoCapacity_equalityCharacterizations
    {I : Type} [Fintype I] [Nonempty I] :
    (∀ (J E : Type) [Fintype J] [Nonempty J] [Countable E] [Nonempty E]
        (Phi : Channel I J) (Psi : Channel I E), Complementary Phi Psi →
      ((finiteEnsembleCapacity Phi.val Set.univ) = ENNReal.ofReal (Real.log (Fintype.card I : ℝ)) ↔
        ∃ (K : Type) (_ : Countable K) (P : K → (Hilbert I →L[ℂ] Hilbert I)),
          OrthogonalResolution P ∧ ResolutionClassification Phi.val Psi.val P)) ∧
    (∀ Phi : Channel I I,
      (finiteEnsembleCapacity Phi.val Set.univ) = ENNReal.ofReal (Real.log (Fintype.card I : ℝ)) ↔
        ∃ (K : Type) (_ : Countable K) (P : K → (Hilbert I →L[ℂ] Hilbert I)),
          OrthogonalResolution P ∧ HasGramNormalForm Phi.val P False) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P45

end
Source
Reversibility conditions for quantum channels and their applications, arXiv:1203.0262v3, PDF p. 21, Corollary 4: both equality characterizations of the capacity bound
Read-back

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

Let III be a finite, nonempty type and write HA=ℓ2(A;C)H_A=\ell^2(A;\mathbb C)HA​=ℓ2(A;C). A trace-class coefficient matrix admits Xij=∑nun(i)vn(j)‾X_{ij}=\sum_nu_n(i)\overline{v_n(j)}Xij​=∑n​un​(i)vn​(j)​ with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞; denote the infimum of these sums by τ(X)\tau(X)τ(X), with empty infimum ∞\infty∞. States additionally have real, nonnegative finite-coordinate quadratic forms and summable real diagonal of sum 111; a pure state has coefficients uu∗uu^*uu∗ with ∥u∥=1\|u\|=1∥u∥=1. States carry the topology generated by τ\tauτ-balls. Channels preserve trace class, are additive and complex homogeneous there, and preserve states under blockwise amplification by all finite-dimensional identities. For each relevant index type, define D(X,Y)D(X,Y)D(X,Y) as the supremum over finite coordinate compressions of

d(A,B)={[Re⁡tr⁡(Alog⁡fcA−Alog⁡fcB+B−A)]+,ker⁡B⊆ker⁡A,∞,otherwise,d(A,B)= \begin{cases} [\operatorname{Re}\operatorname{tr}(A\log_{\mathrm{fc}}A-A\log_{\mathrm{fc}}B+B-A)]_+, &\ker B\subseteq\ker A,\\ \infty,&\text{otherwise}, \end{cases}d(A,B)={[Retr(Alogfc​A−Alogfc​B+B−A)]+​,∞,​kerB⊆kerA,otherwise,​

where [a]+=max⁡(a,0)[a]_+=\max(a,0)[a]+​=max(a,0) and log⁡0=0\log0=0log0=0, and define C(Φ)\mathcal C(\Phi)C(Φ) to be the supremum of ∫D(Φ(ρ),Φ(ρˉ)) dμ\int D(\Phi(\rho),\Phi(\bar\rho))\,d\mu∫D(Φ(ρ),Φ(ρˉ​))dμ over Borel probability measures μ\muμ with finite topological support and an integrable coordinatewise barycenter ρˉ\bar\rhoρˉ​ that is a state. To describe the characterizations, let B(X)B(X)B(X) be a chosen bounded operator with coordinate matrix XXX, or 000 if none exists, and C(T)ij=(Tej)iC(T)_{ij}=(Te_j)_iC(T)ij​=(Tej​)i​. An orthogonal resolution (Pk)k∈K(P_k)_{k\in K}(Pk​)k∈K​ consists of nonzero self-adjoint idempotents with PkPl=0P_kP_l=0Pk​Pl​=0 for k≠lk\ne lk=l and ∑kPkx=x\sum_kP_kx=x∑k​Pk​x=x in norm for every xxx. Write ∑ktrXk=Y\sum_k^{\mathrm{tr}}X_k=Y∑ktr​Xk​=Y when YYY and every XkX_kXk​ are trace-class coefficient matrices, B(Y)B(Y)B(Y), all finite sums of the B(Xk)B(X_k)B(Xk​), and their differences from B(Y)B(Y)B(Y) admit operator-norm convergent nuclear expansions with summable norm products, and the real infimum of the norm-product sums for these differences tends to zero. Put

BP={ρ:∑ktrC(PkB(ρ)Pk)=ρ},PP={ρ:ρ is pure and C(PkB(ρ)Pk)=ρ for some k}.\mathcal B_P=\left\{\rho:\sum_k^{\mathrm{tr}}C(P_kB(\rho)P_k)=\rho\right\}, \quad \mathcal P_P=\{\rho:\rho\text{ is pure and }C(P_kB(\rho)P_k)=\rho \text{ for some }k\}.BP​={ρ:k∑tr​C(Pk​B(ρ)Pk​)=ρ},PP​={ρ:ρ is pure and C(Pk​B(ρ)Pk​)=ρ for some k}.

For a channel Φ:I→J\Phi:I\to JΦ:I→J, let OOO be the closed span of all range⁡B(Φ(ρ))\operatorname{range}B(\Phi(\rho))rangeB(Φ(ρ)), with projection QQQ, and set

Φ†(T)=B ⁣((∑aC(TB(Φ(Eji)))aa)i,j),m=min⁡ ⁣(dim⁡∞span⁡C{T:QTQ=T, Φ†(T)=0}+1, dim⁡∞O),\Phi^\dagger(T) =B\!\left(\left(\sum_aC(TB(\Phi(E_{ji})))_{aa}\right)_{i,j}\right),\qquad m=\min\!\left( \dim_\infty\operatorname{span}_{\mathbb C}\{T:QTQ=T,\ \Phi^\dagger(T)=0\}+1,\ \dim_\infty O\right),Φ†(T)=B​(a∑​C(TB(Φ(Eji​)))aa​)i,j​​,m=min(dim∞​spanC​{T:QTQ=T, Φ†(T)=0}+1, dim∞​O),

where dim⁡∞\dim_\inftydim∞​ replaces every infinite algebraic dimension by ∞\infty∞. The first assertion is that, for every finite nonempty JJJ, countable nonempty EEE, and channels Φ:I→J,Ψ:I→E\Phi:I\to J,\Psi:I\to EΦ:I→J,Ψ:I→E obtained as the two partial traces of one isometric dilation V:HI→HJ×EV:H_I\to H_{J\times E}V:HI​→HJ×E​, one has C(Φ)=log⁡∣I∣\mathcal C(\Phi)=\log|I|C(Φ)=log∣I∣ if and only if there exist a countable type KKK and an orthogonal resolution PkP_kPk​ with all the following properties: a channel recovers Φ\PhiΦ on PP\mathcal P_PPP​; a channel, possibly different, recovers it on BP\mathcal B_PBP​; there are states σk\sigma_kσk​ on EEE, with dim⁡∞range⁡B(σk)≤m\dim_\infty\operatorname{range}B(\sigma_k)\le mdim∞​rangeB(σk​)≤m, satisfying

∑ktr(∑aC(PkB(X))aa)σk=Ψ(X)\sum_k^{\mathrm{tr}} \left(\sum_aC(P_kB(X))_{aa}\right)\sigma_k=\Psi(X)k∑tr​(a∑​C(Pk​B(X))aa​)σk​=Ψ(X)

for every trace-class XXX; and, writing M={n∈N:n<m}M=\{n\in\mathbb N:n<m\}M={n∈N:n<m}, there are a countable nonempty type FFF and vectors ψk,a∈HF\psi_{k,a}\in H_Fψk,a​∈HF​ such that ∑a∥ψk,a∥2=1\sum_a\|\psi_{k,a}\|^2=1∑a​∥ψk,a​∥2=1, different vectors within each row are orthogonal, and

N(X)(i,a),(j,b)=∑k∑lC(PkB(X)Pl)ij⟨ψl,b,ψk,a⟩N(X)_{(i,a),(j,b)} =\sum_k\sum_l C(P_kB(X)P_l)_{ij} \langle\psi_{l,b},\psi_{k,a}\rangleN(X)(i,a),(j,b)​=k∑​l∑​C(Pk​B(X)Pl​)ij​⟨ψl,b​,ψk,a​⟩

is a channel isometrically equivalent to Φ\PhiΦ, meaning that some bounded W:HJ→HI×MW:H_J\to H_{I\times M}W:HJ​→HI×M​ satisfies WW∗W=WWW^*W=WWW∗W=W, N(X)=C(WB(Φ(X))W∗)N(X)=C(WB(\Phi(X))W^*)N(X)=C(WB(Φ(X))W∗), and Φ(X)=C(W∗B(N(X))W)\Phi(X)=C(W^*B(N(X))W)Φ(X)=C(W∗B(N(X))W) on all trace-class XXX. The common dilation condition above means explicitly that Φ(ρ)\Phi(\rho)Φ(ρ) and Ψ(ρ)\Psi(\rho)Ψ(ρ) are the two partial traces of the matrix with entries ∑i∑j(Vei)pρij(Vej)q‾\sum_i\sum_j(Ve_i)_p\rho_{ij}\overline{(Ve_j)_q}∑i​∑j​(Vei​)p​ρij​(Vej​)q​​, for every state ρ\rhoρ. The second assertion is that, for every channel Φ:I→I\Phi:I\to IΦ:I→I, C(Φ)=log⁡∣I∣\mathcal C(\Phi)=\log|I|C(Φ)=log∣I∣ if and only if there exist a countable type KKK, an orthogonal resolution PkP_kPk​, a countable nonempty type FFF, unit vectors ψk∈HF\psi_k\in H_Fψk​∈HF​, and a surjective complex linear isometry U:HI→HIU:H_I\to H_IU:HI​→HI​ such that

G(X)ab=∑k∑l⟨ψl,ψk⟩C(PkB(X)Pl)abG(X)_{ab} =\sum_k\sum_l\langle\psi_l,\psi_k\rangle C(P_kB(X)P_l)_{ab}G(X)ab​=k∑​l∑​⟨ψl​,ψk​⟩C(Pk​B(X)Pl​)ab​

is a channel and Φ(X)=C(UB(G(X))U∗)\Phi(X)=C(UB(G(X))U^*)Φ(X)=C(UB(G(X))U∗) for every trace-class XXX. This second characterization places no nonvanishing requirement on the overlaps ⟨ψl,ψk⟩\langle\psi_l,\psi_k\rangle⟨ψl​,ψk​⟩.

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