Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered result (20): finite-dimensional Holevo capacity bound

Open
QAlgorithms.Papers.Independent.Gap48.P45.holevoCapacity_inputDimensionBound

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. Let both input and output spaces have positive finite dimensions. Define the single-letter Holevo capacity by Cˉ(Φ)=sup⁡eχ(Φ(e))\bar C(\Phi)=\sup_e\chi(\Phi(e))Cˉ(Φ)=supe​χ(Φ(e)), over discrete input ensembles. Then

Cˉ(Φ)≤ln⁡dim⁡HA.\bar C(\Phi)\le\ln\dim H_A.Cˉ(Φ)≤lndimHA​.

This result bounds the single-letter classical information by the input dimension.

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)

/-- Equation (20), PDF p.21: finite-dimensional single-letter capacity bound,
in nats. Both physical spaces are positive finite-dimensional. -/
theorem holevoCapacity_inputDimensionBound
    {I J : Type} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J]
    (Phi : Channel I J) :
    (finiteEnsembleCapacity Phi.val Set.univ) ≤ ENNReal.ofReal (Real.log (Fintype.card I : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P45

end
Source
Reversibility conditions for quantum channels and their applications, arXiv:1203.0262v3, PDF p. 21, Unnumbered result (20): finite-dimensional Holevo capacity bound
Read-back

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

Let I,JI,JI,J be finite, nonempty types and let Φ\PhiΦ be a channel between their coefficient matrices. Here states are matrices admitting an expansion Xij=∑nun(i)vn(j)‾X_{ij}=\sum_nu_n(i)\overline{v_n(j)}Xij​=∑n​un​(i)vn​(j)​ in ℓ2\ell^2ℓ2-vectors with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞, having real, nonnegative quadratic forms on every finite coordinate set, and having summable real diagonal of sum 111. A channel preserves matrices admitting such expansions, is additive and complex homogeneous on them, and preserves states under blockwise amplification by the identity on every finite auxiliary coordinate space. Let τ(X)\tau(X)τ(X) be the infimum of the norm-product sums of these expansions, with empty infimum ∞\infty∞; equip states with the topology generated by τ\tauτ-balls. For matrices X,YX,YX,Y, set D(X,Y)=sup⁡s⊆I or Jd(Xs,Ys)D(X,Y)=\sup_{s\subseteq I\text{ or }J}d(X_s,Y_s)D(X,Y)=sups⊆I or J​d(Xs​,Ys​), using finite coordinate compressions in the relevant index type, where

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.​

Here [a]+=max⁡(a,0)[a]_+=\max(a,0)[a]+​=max(a,0) and log⁡0=0\log0=0log0=0. For a Borel probability measure μ\muμ on input states, write ρˉij=∫ρij dμ\bar\rho_{ij}=\int\rho_{ij}\,d\muρˉ​ij​=∫ρij​dμ. Consider only those μ\muμ with finite topological support and with a state ρ0\rho_0ρ0​ as barycenter, meaning that every coordinate function is integrable and (ρ0)ij=∫ρij dμ(\rho_0)_{ij}=\int\rho_{ij}\,d\mu(ρ0​)ij​=∫ρij​dμ. Then

sup⁡μ∫D(Φ(ρ),Φ(ρˉ)) dμ(ρ)≤max⁡ ⁣(log⁡∣I∣,0).\sup_{\mu} \int D\bigl(\Phi(\rho),\Phi(\bar\rho)\bigr)\,d\mu(\rho) \le \max\!\left(\log |I|,0\right).μsup​∫D(Φ(ρ),Φ(ρˉ​))dμ(ρ)≤max(log∣I∣,0).

The supremum and integrals take values in [0,∞][0,\infty][0,∞], and the right side is the extended nonnegative real obtained from log⁡∣I∣\log|I|log∣I∣; since I≠∅I\ne\varnothingI=∅, it equals log⁡∣I∣\log|I|log∣I∣, including the bound 000 when ∣I∣=1|I|=1∣I∣=1.

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