Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3 / Eq.(23): classical capacity of the full Unruh channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.unruh_classicalCapacity

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

prove2quantum

Let 0≤z<10\le z<10≤z<1, pℓ=(1−z)3zℓ−2ℓ(ℓ−1)/2p_\ell=(1-z)^3z^{\ell-2}\ell(\ell-1)/2pℓ​=(1−z)3zℓ−2ℓ(ℓ−1)/2, and Δℓ=ℓ(ℓ−1)/2\Delta_\ell=\ell(\ell-1)/2Δℓ​=ℓ(ℓ−1)/2. Let UzU_zUz​ be the full countable flagged qubit-input Unruh channel. Its classical capacity, independently defined by regularized Holevo optimization over arbitrary finite ensembles and entangled positive-block-length inputs, is

C(Uz)=1−∑ℓ=2∞pℓlog⁡2(ℓ−1)+∑ℓ=2∞pℓΔℓ∑j=0ℓ−1jlog⁡2j.C(U_z)=1-\sum_{\ell=2}^{\infty}p_\ell\log_2(\ell-1) +\sum_{\ell=2}^{\infty}\frac{p_\ell}{\Delta_\ell}\sum_{j=0}^{\ell-1}j\log_2j.C(Uz​)=1−ℓ=2∑∞​pℓ​log2​(ℓ−1)+ℓ=2∑∞​Δℓ​pℓ​​j=0∑ℓ−1​jlog2​j.

Both infinite series converge separately, and the output entropies and optimization suprema satisfy the regularity assertions of Theorem 2. The zero summand uses 0log⁡20=00\log_2 0=00log2​0=0. At z=0z=0z=0 only the identity sector has positive weight and the expression is 111 bit. This gives the capacity of the full channel, with no finite cutoff or value assigned at z=1z=1z=1.

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, Corollary 3, Eq.(23): separately convergent signed series for
the independently regularized capacity; z=1 is excluded. -/
theorem unruh_classicalCapacity (z : ℝ) (_hz0 : 0 ≤ z) (_hz1 : z < 1) :
    UnruhRegular z ∧ Summable (unruhFirstTerm z) ∧ Summable (unruhSecondTerm z) ∧
    unruhClassicalCapacity z =
      1 - (∑' k : ℕ, unruhFirstTerm z k) + (∑' k : ℕ, unruhSecondTerm z k) := 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, Corollary 3 / Eq.(23)
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, define 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, and define 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 by (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, b<k+2b<k+2b<k+2, j<k+1j<k+1j<k+1, and x<2x<2x<2, with zero-based indices. For k∈Nn\mathbf k\in\mathbb N^nk∈Nn, write Uk=⨂iUkiU_{\mathbf k}=\bigotimes_iU_{k_i}Uk​=⨂i​Uki​​, grouping receiver and environment coordinates separately, 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†​). Set

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, including on these unnormalized matrices. For any real-valued matrix function HHH, let V(H)\mathcal V(H)V(H) consist of 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 let χ(H)=sup⁡V(H)\chi(H)=\sup\mathcal V(H)χ(H)=supV(H). The conclusion includes these regularity assertions: wz(k)≥0w_z(k)\ge0wz​(k)≥0 for every kkk and ∑kwz(k)=1\sum_k w_z(k)=1∑k​wz​(k)=1; for every n≥1n\ge1n≥1, the series defining Hz,n(ρ)H_{z,n}(\rho)Hz,n​(ρ) is summable for every density matrix ρ\rhoρ, and V(Hz,n)\mathcal V(H_{z,n})V(Hz,n​) is nonempty and bounded above; {χ(Hz,n)/n:n≥1}\{\chi(H_{z,n})/n:n\ge1\}{χ(Hz,n​)/n:n≥1} is bounded above; and for all positive a,ba,ba,b, all channels T:Mat⁡a(C)→Mat⁡b(C)T:\operatorname{Mat}_a(\mathbb C)\to\operatorname{Mat}_b(\mathbb C)T:Mata​(C)→Matb​(C), and all n≥1n\ge1n≥1, the series defining Hz,n,T(ρ)H_{z,n,T}(\rho)Hz,n,T​(ρ) is summable for every density matrix ρ\rhoρ, and V(Hz,n,T)\mathcal V(H_{z,n,T})V(Hz,n,T​) is nonempty and bounded above. Here channels have finite Kraus representations with ∑sEs†Es=Ia\sum_sE_s^\dagger E_s=I_a∑s​Es†​Es​=Ia​, and tensor products act on matrix units by tensoring their images. Furthermore, both real series on the right below are summable, and the specified regularized quantity satisfies

sup⁡n≥1χ(Hz,n)n=1−∑k=0∞wz(k)log⁡2(k+1)+∑k=0∞wz(k)(k+2)(k+1)/2∑j=0k+1jlog⁡2j.\sup_{n\ge1}\frac{\chi(H_{z,n})}{n} = 1-\sum_{k=0}^\infty w_z(k)\log_2(k+1) +\sum_{k=0}^\infty \frac{w_z(k)}{(k+2)(k+1)/2} \sum_{j=0}^{k+1}j\log_2j.n≥1sup​nχ(Hz,n​)​=1−k=0∑∞​wz​(k)log2​(k+1)+k=0∑∞​(k+2)(k+1)/2wz​(k)​j=0∑k+1​jlog2​j.

The finite inner sums include j=0j=0j=0, with the total real logarithm convention log⁡20=0\log_2 0=0log2​0=0, and powers at z=0z=0z=0 use 00=10^0=100=1.

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