Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.1 / (17): two-step coding inequality

Open
QAlgorithms.Papers.Independent.Gap20.P07.capacity_twoStep

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

prove2quantum

Let T1,T2,T3T_1,T_2,T_3T1​,T2​,T3​ be arbitrary CPTP channels on nonzero complex Hilbert spaces, with relative capacities defined by memoryless powers, CPTP coding, and full-cb error. Then

Q(T1,T3)≥Q(T1,T2)Q(T2,T3).Q(T_1,T_3)\ge Q(T_1,T_2)Q(T_2,T_3).Q(T1​,T3​)≥Q(T1​,T2​)Q(T2​,T3​).

Multiplication is in the extended nonnegative reals, with 0⋅∞=00\cdot\infty=00⋅∞=0. Introducing an intermediate channel cannot improve the direct simulation rate.

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 p.8, (17): two-step coding, with extended nonnegative multiplication. -/
theorem capacity_twoStep {I J K L A B : Type}
    [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L] [Nonempty A] [Nonempty B]
    (T1 : Operation I J) (T2 : Operation K L) (T3 : Operation A B)
    (h1 : IsTraceClassChannel T1) (h2 : IsTraceClassChannel T2) (h3 : IsTraceClassChannel T3) :
    relativeCapacity T1 T2 * relativeCapacity T2 T3 ≤ relativeCapacity T1 T3 := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 8, Section 3.1 / (17): two-step coding inequality
Read-back

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

Let I,J,K,L,A,BI,J,K,L,A,BI,J,K,L,A,B be nonempty types, and let T1:CI×I→CJ×JT_1:\mathbb C^{I\times I}\to\mathbb C^{J\times J}T1​:CI×I→CJ×J, T2:CK×K→CL×LT_2:\mathbb C^{K\times K}\to\mathbb C^{L\times L}T2​:CK×K→CL×L, and T3:CA×A→CB×BT_3:\mathbb C^{A\times A}\to\mathbb C^{B\times B}T3​:CA×A→CB×B be channels as follows. A trace-class matrix admits 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 finite ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥; τ(X)∈[0,∞]\tau(X)\in[0,\infty]τ(X)∈[0,∞] is the infimum of these sums, with value +∞+\infty+∞ if there is no expansion. A density is trace class, has positive semidefinite finite principal restrictions, and has summable real diagonal of sum 111. A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities under all finite ancillary extensions. Such an extension applies the map to each block with fixed ancillary row and column indices. Define ∥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). For maps P,QP,QP,Q, define ΔP,Q(n,m)=inf⁡E,D∥D∘P[n]∘E−Q[m]∥st\Delta_{P,Q}(n,m)=\inf_{E,D}\|D\circ P^{[n]}\circ E-Q^{[m]}\|_{\mathrm{st}}ΔP,Q​(n,m)=infE,D​∥D∘P[n]∘E−Q[m]∥st​, with channel encoders and decoders between the relevant registers. Powers apply the map first to the first-coordinate block and recursively to the remaining coordinates, with the zeroth power evaluating at the unique empty tuples. Let C(P,Q)C(P,Q)C(P,Q) be the supremum in [0,∞][0,\infty][0,∞] of real R>0R>0R>0 such that, for every positive-integer sequence pair na,man_a,m_ana​,ma​ with na→∞n_a\to\inftyna​→∞ and lim sup⁡ma/na≤R\limsup m_a/n_a\le Rlimsupma​/na​≤R, the errors ΔP,Q(na,ma)\Delta_{P,Q}(n_a,m_a)ΔP,Q​(na​,ma​) tend to 000; an empty rate supremum is 000. Then

C(T1,T2) C(T2,T3)≤C(T1,T3).C(T_1,T_2)\,C(T_2,T_3)\le C(T_1,T_3).C(T1​,T2​)C(T2​,T3​)≤C(T1​,T3​).

The multiplication is that of extended nonnegative reals, including its convention 0⋅(+∞)=(+∞)⋅0=00\cdot(+\infty)=(+\infty)\cdot0=00⋅(+∞)=(+∞)⋅0=0.

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