Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 10

Open
QAlgorithms.Papers.Independent.Gap48.P18.finite_constrained_channel_capacity_compact_image

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

prove2quantum

Let H and K be nonzero separable complex Hilbert spaces, Phi a quantum channel from H to K, and A a convex set of normalized input states. Let Cbar(Phi,A) be the supremum of output Holevo information over finite input ensembles whose average lies in A. If Cbar(Phi,A)<infinity, then Phi(A) is relatively compact in trace norm. The explicit convexity guard corrects the printed arbitrary-subset domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState traceSize traceClosure IsTraceClassChannel productCoeff)

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

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

namespace QAlgorithms.Papers.Independent.Gap48.P18

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Corollary 10, arXiv:quant-ph/0510073v2, PDF p.36, corrected domain.
Printed: arbitrary input subset A with finite average-constrained capacity.
Changed: explicitly require A convex; retain the same capacity and conclusion.
Why: for the identity channel, the noncompact set of orthogonal pure states has
average-constrained capacity zero. Convexity makes every finite ensemble of
signals in A admissible, which is exactly what the printed proof's inequality needs.
The correction is nonvacuous, including convex singletons and energy sublevels. -/
theorem finite_constrained_channel_capacity_compact_image {I J : Type}
    [Countable I] [Countable J] [Nonempty I] [Nonempty J]
    (Phi : StateChannel I J) (A : Set (State I))
    (hconvex : CoefficientConvexStates A)
    (hfinite : finiteEnsembleCapacity Phi.map A < ⊤) :
    IsCompact (closure (Phi.action '' A)) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 36, Corollary 10
Read-back

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

Let I,JI,JI,J be countable, nonempty types, allowing either finite or infinite types. For any label type DDD, call a complex matrix XXX on DDD trace class when it has an expansion Xij=∑n=0∞un(i)vn(j)‾X_{ij}=\sum_{n=0}^{\infty}u_n(i)\overline{v_n(j)}Xij​=∑n=0∞​un​(i)vn​(j)​, with un,vn∈ℓ2(D;C)u_n,v_n\in\ell^2(D;\mathbb C)un​,vn​∈ℓ2(D;C) and ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞, and define τD(X)\tau_D(X)τD​(X) as the infimum, over all such expansions, of max⁡{0,∑n∥un∥∥vn∥}\max\{0,\sum_n\|u_n\|\|v_n\|\}max{0,∑n​∥un​∥∥vn​∥}, viewed in [0,∞][0,\infty][0,∞]; an infimum over no expansions is +∞+\infty+∞. A state on DDD is a trace-class matrix RRR such that every finite quadratic form ∑i,j∈szi‾Rijzj\sum_{i,j\in s}\overline{z_i}R_{ij}z_j∑i,j∈s​zi​​Rij​zj​, for every finite s⊆Ds\subseteq Ds⊆D and every z:D→Cz:D\to\mathbb Cz:D→C, has zero imaginary part and nonnegative real part, and such that ∑iRe⁡Rii\sum_i\operatorname{Re}R_{ii}∑i​ReRii​ is summable and equals 111. Equip states with the topology generated by the sets {S:τD(S−R)<ε}\{S:\tau_D(S-R)<\varepsilon\}{S:τD​(S−R)<ε}, for states RRR and real ε>0\varepsilon>0ε>0, and with its Borel measurable structure. Suppose Φ\PhiΦ consists of a matrix map and an action on states whose coefficient matrix at each state RRR is Φ(R)\Phi(R)Φ(R). Assume this matrix map preserves trace class, is additive on pairs of trace-class matrices, is complex homogeneous on trace-class matrices, and, for every natural number nnn and every state RRR on I×{0,…,n−1}I\times\{0,\ldots,n-1\}I×{0,…,n−1}, produces a state coefficient matrix on J×{0,…,n−1}J\times\{0,\ldots,n-1\}J×{0,…,n−1} by the entrywise rule

[Φ⊗id](R)(j,a),(j′,b)=Φ((R(i,a),(i′,b))i,i′∈I)j,j′.[\Phi\otimes\mathrm{id}](R)_{(j,a),(j',b)} =\Phi\bigl((R_{(i,a),(i',b)})_{i,i'\in I}\bigr)_{j,j'}.[Φ⊗id](R)(j,a),(j′,b)​=Φ((R(i,a),(i′,b)​)i,i′∈I​)j,j′​.

Here n=0n=0n=0 is included, although its state quantification is empty. Let AAA be any set of states on III whose coefficient matrices form a real convex set. For finite matrices C,DC,DC,D of the same size, define

d(C,D)={max⁡ ⁣{0,Re⁡tr⁡(Clog⁡C−Clog⁡D+D−C)},ker⁡D⊆ker⁡C,+∞,otherwise,DJ(X,Y)=sup⁡s⊆Js finited(X∣s×s,Y∣s×s),d(C,D)= \begin{cases} \max\!\left\{0,\operatorname{Re}\operatorname{tr} \bigl(C\log C-C\log D+D-C\bigr)\right\}, &\ker D\subseteq\ker C,\\ +\infty,&\text{otherwise}, \end{cases} \qquad D_J(X,Y)=\sup_{\substack{s\subseteq J\\s\text{ finite}}}d(X|_{s\times s},Y|_{s\times s}),d(C,D)={max{0,Retr(ClogC−ClogD+D−C)},+∞,​kerD⊆kerC,otherwise,​DJ​(X,Y)=s⊆Js finite​sup​d(X∣s×s​,Y∣s×s​),

where matrix logarithms use continuous functional calculus with the total real logarithm, including log⁡0=0\log0=0log0=0, and the empty compression is included. For a Borel probability measure μ\muμ on input states, put (R‾μ)ii′=∫Rii′ dμ(R)(\overline R_\mu)_{ii'}=\int R_{ii'}\,d\mu(R)(Rμ​)ii′​=∫Rii′​dμ(R), and call a state R0R_0R0​ its average when every coefficient function is integrable and (R0)ii′=∫Rii′ dμ(R)(R_0)_{ii'}=\int R_{ii'}\,d\mu(R)(R0​)ii′​=∫Rii′​dμ(R). Assume the following extended nonnegative supremum is strictly less than +∞+\infty+∞:

CΦ(A)=sup⁡μ a Borel probability measure on input statessupp⁡μ finite∃R0∈A: R0 is the average of μ∫ ⁣+DJ(Φ(R),Φ(R‾μ)) dμ(R).C_\Phi(A)= \sup_{\substack{\mu\text{ a Borel probability measure on input states}\\ \operatorname{supp}\mu\text{ finite}\\ \exists R_0\in A:\ R_0\text{ is the average of }\mu}} \int^{\!+} D_J\bigl(\Phi(R),\Phi(\overline R_\mu)\bigr)\,d\mu(R).CΦ​(A)=μ a Borel probability measure on input statessuppμ finite∃R0​∈A: R0​ is the average of μ​sup​∫+DJ​(Φ(R),Φ(Rμ​))dμ(R).

The support here is topological support, and admissibility requires an average in AAA, without requiring the support to lie in AAA. Then the closure of {Φ.action(R):R∈A}\{\Phi.\mathrm{action}(R):R\in A\}{Φ.action(R):R∈A} is compact in the state topology on JJJ. The set AAA is allowed to be empty; in that case the displayed supremum is 000 and the concluded compact set is empty.

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