Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.2 / (18): ideal channel capacity

Proved
QAlgorithms.Papers.Independent.Gap20.P07.idealCapacity

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

prove2quantum

Let n≥1n\ge1n≥1 and m≥2m\ge2m≥2 be integers. The capacity of an ideal nnn-level channel relative to an ideal mmm-level channel is

Q(idn,idm)=log⁡2nlog⁡2m.Q(\mathrm{id}_n,\mathrm{id}_m)=\frac{\log_2n}{\log_2m}.Q(idn​,idm​)=log2​mlog2​n​.

The one-dimensional physical channel gives zero; the one-dimensional reference is excluded from the quotient. This calibrates ideal quantum transmission in bits.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

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

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.9--10, (18): n=1 gives zero; the reference dimension exceeds one. -/
theorem idealCapacity (n m : ℕ) (hn : 0 < n) (hm : 2 ≤ m) :
    relativeCapacity (id : Operation (Fin n) (Fin n)) (id : Operation (Fin m) (Fin m)) =
      ENNReal.ofReal (Real.logb 2 n / Real.logb 2 m) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 9, Section 3.2 / (18): ideal channel capacity
Read-back

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

For every pair of natural numbers n,mn,mn,m with n>0n>0n>0 and m≥2m\ge2m≥2, let idn,idm\mathrm{id}_n,\mathrm{id}_midn​,idm​ be the identity maps on complex matrices of the indicated dimensions. The relative capacity C(P,Q)C(P,Q)C(P,Q) used here has the following precise meaning. A trace-class matrix has an expansion Xij=∑r≥0ur(i)vr(j)‾X_{ij}=\sum_{r\ge0}u_r(i)\overline{v_r(j)}Xij​=∑r≥0​ur​(i)vr​(j)​ with square-summable vectors and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; τ(X)\tau(X)τ(X) is the infimum of these sums in [0,∞][0,\infty][0,∞], with empty infimum +∞+\infty+∞. A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum 111. A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities after adjoining every finite ancillary register. For any map FFF, its stabilized size is ∥F∥st=sup⁡r≥0, X trace class, τ(X)≤1τ((F⊗idr)X)\|F\|_{\mathrm{st}}=\sup_{r\ge0,\ X\text{ trace class},\ \tau(X)\le1}\tau((F\otimes\mathrm{id}_r)X)∥F∥st​=supr≥0, X trace class, τ(X)≤1​τ((F⊗idr​)X), where the ancillary extension applies FFF to each block with fixed ancillary row and column indices. For positive integers a,ba,ba,b, put ΔP,Q(a,b)=inf⁡E,D∥D∘P[a]∘E−Q[b]∥st\Delta_{P,Q}(a,b)=\inf_{E,D}\|D\circ P^{[a]}\circ E-Q^{[b]}\|_{\mathrm{st}}ΔP,Q​(a,b)=infE,D​∥D∘P[a]∘E−Q[b]∥st​, with channel encoders and decoders between the corresponding registers. Powers recursively apply the map to the first-coordinate block and then to the remaining coordinates, with the zeroth power evaluating at the unique empty tuples. Finally, C(P,Q)C(P,Q)C(P,Q) is the supremum in [0,∞][0,\infty][0,∞] of real R>0R>0R>0 for which every positive-integer sequence pair ar,bra_r,b_rar​,br​, satisfying ar→∞a_r\to\inftyar​→∞ and lim sup⁡br/ar≤R\limsup b_r/a_r\le Rlimsupbr​/ar​≤R, has ΔP,Q(ar,br)→0\Delta_{P,Q}(a_r,b_r)\to0ΔP,Q​(ar​,br​)→0; an empty rate supremum is 000. The assertion is

C(idn,idm)=max⁡ ⁣(0,log⁡2nlog⁡2m).C(\mathrm{id}_n,\mathrm{id}_m) =\max\!\left(0,\frac{\log_2 n}{\log_2 m}\right).C(idn​,idm​)=max(0,log2​mlog2​n​).

The ratio is nonnegative under these hypotheses, and n=1n=1n=1 is included, giving capacity 000.

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