Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2.1 / (3),(19): change of reference units

Open
QAlgorithms.Papers.Independent.Gap20.P07.referenceUnits

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

prove2quantum

Let TTT be any CPTP channel between nonzero complex Hilbert spaces, and let m,n≥2m,n\ge2m,n≥2 be integer reference dimensions. Write Q(T,idd)Q(T,\mathrm{id}_d)Q(T,idd​) for Definition 2.1 capacity relative to an ideal ddd-level channel. Then

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

The scalar product is taken in the extended nonnegative reals. Changing the nontrivial reference dimension changes only the unit of capacity; dimension one is excluded from the logarithmic ratio.

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.3,9, (3),(19): only nontrivial reference systems have a log ratio. -/
theorem referenceUnits {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T)
    (n m : ℕ) (hn : 2 ≤ n) (hm : 2 ≤ m) :
    relativeCapacity T (id : Operation (Fin n) (Fin n)) =
      ENNReal.ofReal (Real.logb 2 m / Real.logb 2 n) *
        relativeCapacity T (id : Operation (Fin m) (Fin m)) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 3, Section 2.1 / (3),(19): change of reference units
Read-back

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

Let I,JI,JI,J be arbitrary nonempty types and TTT a map from complex coefficient matrices on III to those on JJJ. Here a trace-class coefficient matrix has a countable expansion Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​ with ur,vr∈ℓ2u_r,v_r\in\ell^2ur​,vr​∈ℓ2 and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; write ν(X)\nu(X)ν(X) for the infimum of these sums in [0,∞][0,\infty][0,∞]. A density coefficient matrix is trace class, has real nonnegative quadratic forms on every finite set of coordinates, and has summable real diagonal entries summing to 111. Assume TTT preserves trace class, is additive and complex homogeneous there, and preserves density coefficient matrices after extension by the identity on every finite ancillary register, acting on each ancillary matrix block separately. Call maps satisfying these conditions channels. Define ∥Φ∥∗=sup⁡q≥0sup⁡ν(X)≤1, X trace classν((Φ⊗idq)X)\|\Phi\|_*=\sup_{q\ge0}\sup_{\nu(X)\le1,\ X\text{ trace class}}\nu((\Phi\otimes\mathrm{id}_q)X)∥Φ∥∗​=supq≥0​supν(X)≤1, X trace class​ν((Φ⊗idq​)X). For a target channel SSS, let δT,S(b,c)\delta_{T,S}(b,c)δT,S​(b,c) be the infimum of ∥DT⊗bE−S⊗c∥∗\|D T^{\otimes b}E-S^{\otimes c}\|_*∥DT⊗bE−S⊗c∥∗​ over channel encoders and decoders of the appropriate types, and define C(T,S)\mathcal C(T,S)C(T,S) as the supremum of positive real RRR such that every pair of positive-integer sequences ba,cab_a,c_aba​,ca​, with ba→∞b_a\to\inftyba​→∞ and lim sup⁡ca/ba≤R\limsup c_a/b_a\le Rlimsupca​/ba​≤R, satisfies δT,S(ba,ca)→0\delta_{T,S}(b_a,c_a)\to0δT,S​(ba​,ca​)→0. Tensor powers apply the map independently to coordinate blocks, and all these infima, suprema, and limits use extended nonnegative values; an empty capacity supremum is 000. For every natural n,mn,mn,m satisfying n≥2n\ge2n≥2 and m≥2m\ge2m≥2, the assertion is

C(T,idn)=log⁡2mlog⁡2n C(T,idm),\mathcal C(T,\mathrm{id}_n) =\frac{\log_2m}{\log_2n}\,\mathcal C(T,\mathrm{id}_m),C(T,idn​)=log2​nlog2​m​C(T,idm​),

where idd\mathrm{id}_didd​ is the identity map on d×dd\times dd×d complex matrices and the product is taken in [0,∞][0,\infty][0,∞]. Both logarithms are positive under the stated hypotheses, and infinite capacities are allowed.

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