Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: strong Holevo additivity of the full qubit-input Unruh channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.unruh_strongAdditivity

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let 0≤z<10\le z<10≤z<1. The one-use Unruh channel has a qubit input and the full countable flagged output

Uz(ρ)=⨁ℓ=2∞pℓ(z) Cl1,ℓ−1(ρ),pℓ(z)=(1−z)3zℓ−2ℓ(ℓ−1)2.U_z(\rho)=\bigoplus_{\ell=2}^{\infty}p_\ell(z)\,\mathrm{Cl}_{1,\ell-1}(\rho), \qquad p_\ell(z)=(1-z)^3z^{\ell-2}\frac{\ell(\ell-1)}2.Uz​(ρ)=ℓ=2⨁∞​pℓ​(z)Cl1,ℓ−1​(ρ),pℓ​(z)=(1−z)3zℓ−22ℓ(ℓ−1)​.

For every CPTP auxiliary channel TTT between arbitrary positive finite dimensions,

χ(Uz⊗T)=χ(Uz)+χ(T).\chi(U_z\otimes T)=\chi(U_z)+\chi(T).χ(Uz​⊗T)=χ(Uz​)+χ(T).

Every Holevo optimization uses arbitrary finite ensembles, including mixed and entangled inputs. The formal statement also establishes nonnegative normalized sector weights, convergence of the output-entropy series for arbitrary normalized block inputs and finite auxiliary inputs, and nonempty bounded optimization sets and regularized rates. These conditions make the infinite-output Holevo quantities genuine finite-entropy quantities. This result concerns the dual-rail qubit-input channel, including z=0z=0z=0, and retains all sectors.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P49

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

open QAlgorithms.Papers.Independent.Support50.P01
  (unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
   unruhReceiver unruhReceiverEntropy)

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

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

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

open QAlgorithms.QuditFidelity (depolarizingMap)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.5, Theorem 2: strong additivity of the full countable-output
qubit-input Unruh channel against every positive finite-dimensional auxiliary.
Entropy summability and bounded optimizations are established, not assumed. -/
theorem unruh_strongAdditivity (z : ℝ) (_hz0 : 0 ≤ z) (_hz1 : z < 1) :
    UnruhRegular z ∧
    ∀ a b : ℕ, 0 < a → 0 < b → ∀ T : Superop (Fin a) (Fin b), IsChannel T →
      unruhAuxHolevo z 1 T = unruhHolevo z 1 + holevoCapacity T := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P49

end
Source
An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels, arXiv:0903.1638v7, PDF p. 5, Theorem 2
Read-back

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

For every real zzz with 0≤z<10\le z<10≤z<1, including z=0z=0z=0, put wz(k)=(1−z)3zk(k+1)(k+2)/2w_z(k)=(1-z)^3z^k(k+1)(k+2)/2wz​(k)=(1−z)3zk(k+1)(k+2)/2 for natural kkk, and let Uk:C2→Ck+2⊗Ck+1U_k:\mathbb C^2\to\mathbb C^{k+2}\otimes\mathbb C^{k+1}Uk​:C2→Ck+2⊗Ck+1 have entries (Uk)(b,j),x=1{b=x+j}2cx,j/((k+1)(k+2))(U_k)_{(b,j),x}=\mathbf1_{\{b=x+j\}}\sqrt{2c_{x,j}/((k+1)(k+2))}(Uk​)(b,j),x​=1{b=x+j}​2cx,j​/((k+1)(k+2))​, where c0,j=k+1−jc_{0,j}=k+1-jc0,j​=k+1−j, c1,j=j+1c_{1,j}=j+1c1,j​=j+1, and all indices start at zero. For n≥1n\ge1n≥1 and k=(k1,…,kn)∈Nn\mathbf k=(k_1,\ldots,k_n)\in\mathbb N^nk=(k1​,…,kn​)∈Nn, let Uk=⨂i=1nUkiU_{\mathbf k}=\bigotimes_{i=1}^nU_{k_i}Uk​=⨂i=1n​Uki​​, with receiver coordinates grouped together and environment coordinates grouped together, wz(k)=∏iwz(ki)w_z(\mathbf k)=\prod_iw_z(k_i)wz​(k)=∏i​wz​(ki​), and Ck(X)=Tr⁡environment(UkXUk†)C_{\mathbf k}(X)=\operatorname{Tr}_{\mathrm{environment}}(U_{\mathbf k}XU_{\mathbf k}^\dagger)Ck​(X)=Trenvironment​(Uk​XUk†​). Define

Hz,n(ρ)=∑k∈NnS(wz(k)Ck(ρ)),Hz,n,T(ρ)=∑k∈NnS ⁣(wz(k)(Ck⊗T)(ρ)),H_{z,n}(\rho)=\sum_{\mathbf k\in\mathbb N^n}S(w_z(\mathbf k)C_{\mathbf k}(\rho)), \qquad H_{z,n,T}(\rho)=\sum_{\mathbf k\in\mathbb N^n} S\!\left(w_z(\mathbf k)(C_{\mathbf k}\otimes T)(\rho)\right),Hz,n​(ρ)=k∈Nn∑​S(wz​(k)Ck​(ρ)),Hz,n,T​(ρ)=k∈Nn∑​S(wz​(k)(Ck​⊗T)(ρ)),

where S(X)=−Re⁡Tr⁡[(x↦xlog⁡2x)(X)]S(X)=-\operatorname{Re}\operatorname{Tr}[(x\mapsto x\log_2x)(X)]S(X)=−ReTr[(x↦xlog2​x)(X)] uses continuous functional calculus, also for the unnormalized blocks in these sums, and tensor products act on matrix units by tensoring their images. For a real-valued matrix function HHH, let V(H)\mathcal V(H)V(H) be the set of values H(∑sqsρs)−∑sqsH(ρs)H(\sum_s q_s\rho_s)-\sum_s q_sH(\rho_s)H(∑s​qs​ρs​)−∑s​qs​H(ρs​) over all finite probability ensembles of positive semidefinite trace-one matrices, and put χ(H)=sup⁡V(H)\chi(H)=\sup\mathcal V(H)χ(H)=supV(H) and χ(T)=χ(S∘T)\chi(T)=\chi(S\circ T)χ(T)=χ(S∘T). The theorem asserts all of the following regularity conditions: every wz(k)w_z(k)wz​(k) is nonnegative and ∑k=0∞wz(k)=1\sum_{k=0}^\infty w_z(k)=1∑k=0∞​wz​(k)=1; for every n≥1n\ge1n≥1 and every density matrix ρ\rhoρ on (C2)⊗n(\mathbb C^2)^{\otimes n}(C2)⊗n, the series defining Hz,n(ρ)H_{z,n}(\rho)Hz,n​(ρ) is summable; each V(Hz,n)\mathcal V(H_{z,n})V(Hz,n​) is nonempty and bounded above; the set {χ(Hz,n)/n:n≥1}\{\chi(H_{z,n})/n:n\ge1\}{χ(Hz,n​)/n:n≥1} is bounded above; and, for every pair of positive natural numbers a,ba,ba,b, every channel T:Mat⁡a(C)→Mat⁡b(C)T:\operatorname{Mat}_a(\mathbb C)\to\operatorname{Mat}_b(\mathbb C)T:Mata​(C)→Matb​(C), every n≥1n\ge1n≥1, and every density matrix on (C2)⊗n⊗Ca(\mathbb C^2)^{\otimes n}\otimes\mathbb C^a(C2)⊗n⊗Ca, the series defining Hz,n,TH_{z,n,T}Hz,n,T​ is summable and V(Hz,n,T)\mathcal V(H_{z,n,T})V(Hz,n,T​) is nonempty and bounded above. For every such a,b,Ta,b,Ta,b,T, it additionally asserts the one-copy identity

χ(Hz,1,T)=χ(Hz,1)+χ(T).\chi(H_{z,1,T})=\chi(H_{z,1})+\chi(T).χ(Hz,1,T​)=χ(Hz,1​)+χ(T).

A channel here means a map T(X)=∑sEsXEs†T(X)=\sum_sE_sXE_s^\daggerT(X)=∑s​Es​XEs†​ on every matrix, for a finite family satisfying ∑sEs†Es=Ia\sum_sE_s^\dagger E_s=I_a∑s​Es†​Es​=Ia​.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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