Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tensor-power subadditivity for EB channels

Open
QAlgorithms.Papers.Independent.Support50.P19.eb_power_subadditivity

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

prove2quantum

For an entanglement-breaking channel NEB\mathcal N_{\rm EB}NEB​ on nonzero finite complex spaces, every 1<α≤21<\alpha\le21<α≤2 and every positive integer nnn satisfy

χ~α(NEB⊗n)≤nχ~α(NEB).\widetilde\chi_\alpha(\mathcal N_{\rm EB}^{\otimes n})\le n\widetilde\chi_\alpha(\mathcal N_{\rm EB}).χ​α​(NEB⊗n​)≤nχ​α​(NEB​).

The left side optimizes over all mixed joint input ensembles. The statement gives the tensor-power estimate needed to obtain a single-letter success bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

open Filter Topology

namespace QAlgorithms.Papers.Independent.Support50.P19

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P35
  (tr Dominates spectralPower elog elogNN rawTrace cq)

open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)

open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)

open QAlgorithms.Papers.Independent.Dependency50.P23
  (UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)

open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)

open QAlgorithms.Papers.Independent.Claimed50.P26
  (CovariantIrreducible minOutput UnassistedExponentialConverse)

variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]

variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]

/-- PDF p.21, Corollary 19: full tensor-input quantity for every positive integer n. -/
theorem eb_power_subadditivity [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
    (N : Superop I J) (hN : IsChannel N) (hEB : IsEB N) (n : ℕ) (hn : 0 < n) :
    channelInformation true a (channelPower N n) ≤
      ((n : ℝ) : EReal) * channelInformation true a N := by sorry

end QAlgorithms.Papers.Independent.Support50.P19

end
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 21, corollary19
Read-back

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

Let I,JI,JI,J be finite nonempty index types with decidable equality, let 1<a≤21<a\le21<a≤2, and let NNN admit a finite Kraus representation N(X)=∑ℓKℓXKℓ†N(X)=\sum_\ell K_\ell XK_\ell^\daggerN(X)=∑ℓ​Kℓ​XKℓ†​ with ∑ℓKℓ†Kℓ=1\sum_\ell K_\ell^\dagger K_\ell=1∑ℓ​Kℓ†​Kℓ​=1. Suppose that for every positive integer rrr and every density matrix XXX on {0,…,r−1}×I\{0,\ldots,r-1\}\times I{0,…,r−1}×I, applying NNN to each matrix block produces a finite sum of tensor products of density matrices with nonnegative coefficients, without a separate coefficient-sum requirement. Then, for every positive integer nnn,

Ia(N⊗n)≤n Ia(N)\mathcal I_a(N^{\otimes n})\le n\,\mathcal I_a(N)Ia​(N⊗n)≤nIa​(N)

in the extended real numbers, where N⊗nN^{\otimes n}N⊗n applies NNN independently to all nnn factors and is extended linearly. For any channel TTT, Ia(T)\mathcal I_a(T)Ia​(T) is the supremum over finite ensembles (px,ρx)(p_x,\rho_x)(px​,ρx​), with px≥0p_x\ge0px​≥0, ∑xpx=1\sum_xp_x=1∑x​px​=1, and positive semidefinite matrices ρx\rho_xρx​ of trace 111, of

inf⁡σ a density matrixDa ⁣(⨁xpxT(ρx) ∥ ⨁xpxσ).\inf_{\sigma\text{ a density matrix}} D_a\!\left(\bigoplus_xp_xT(\rho_x)\,\middle\|\,\bigoplus_xp_x\sigma\right).σ a density matrixinf​Da​(x⨁​px​T(ρx​)​x⨁​px​σ).

Zero ensemble probabilities are allowed. For these density matrices, Da(X∥Y)=+∞D_a(X\|Y)=+\inftyDa​(X∥Y)=+∞ if ker⁡Y⊈ker⁡X\ker Y\not\subseteq\ker XkerY⊆kerX; otherwise

Da(X∥Y)=1a−1log⁡2Re⁡tr⁡[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]],D_a(X\|Y)=\frac1{a-1}\log_2\operatorname{Re}\operatorname{tr} \left[\left(Y^{[(1-a)/(2a)]}XY^{[(1-a)/(2a)]}\right)^{[a]}\right],Da​(X∥Y)=a−11​log2​Retr[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]],

where zero eigenvalues remain 000 under every displayed spectral power and the extended logarithm is −∞-\infty−∞ at zero. The quantification includes n=1n=1n=1 and excludes n=0n=0n=0.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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