Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§III.B, Fig.1: positivity, monotonicity, convexity and endpoints

Open
QAlgorithms.Papers.Independent.Support50.P01.unruh_capacity_shape

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

prove2quantum

For 0<z<10<z<10<z<1, let Nz\mathcal N_zNz​ be the full Unruh channel of Eqs.(11),(12), with receiver ⨁k≥0Ck+2\bigoplus_{k\ge0}\mathbb C^{k+2}⨁k≥0​Ck+2, genuine environment ⨁k≥0Ck+1\bigoplus_{k\ge0}\mathbb C^{k+1}⨁k≥0​Ck+1, and the common flagged dilation of the 1→k+11\to k+11→k+1 cloning sectors with weights pk(z)=(1−z)3zk(k+1)(k+2)/2p_k(z)=(1-z)^3z^k(k+1)(k+2)/2pk​(z)=(1−z)3zk(k+1)(k+2)/2. Use the entire countable sums, bit entropies, and unrestricted entangled density inputs for every positive block length. Write Q(z)Q(z)Q(z) for the regularized optimized coherent information of this channel. On 0<z<10<z<10<z<1,

Q(z)>0,Q is nonincreasing and convex,lim⁡z↓0Q(z)=1,lim⁡z↑1Q(z)=0.Q(z)>0,\qquad Q\text{ is nonincreasing and convex},\qquad \lim_{z\downarrow0}Q(z)=1,\quad\lim_{z\uparrow1}Q(z)=0.Q(z)>0,Q is nonincreasing and convex,z↓0lim​Q(z)=1,z↑1lim​Q(z)=0.

These are one-sided limits. No value of a channel at z=1z=1z=1 or numerical curvature constant is asserted.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P01

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

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

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)

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

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

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

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {a b e c : ℕ}

/-- PDF pp.7–8, Fig.1: positivity, monotonicity, convexity and one-sided endpoints.
There is no z=1 channel and no substitution into a divergent entropy sum. -/
theorem unruh_capacity_shape :
    (∀ z ∈ Set.Ioo (0 : ℝ) 1, 0 < unruhCapacity z) ∧
    AntitoneOn unruhCapacity (Set.Ioo 0 1) ∧
    ConvexOn ℝ (Set.Ioo 0 1) unruhCapacity ∧
    Tendsto unruhCapacity (nhdsWithin 0 (Set.Ioi 0)) (nhds 1) ∧
    Tendsto unruhCapacity (nhdsWithin 1 (Set.Iio 1)) (nhds 0) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 8, §III.B, Fig.1: positivity, monotonicity, convexity and endpoints
Read-back

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

Write S(X)=−Re⁡tr⁡(f(X))S(X)=-\operatorname{Re}\operatorname{tr}(f(X))S(X)=−Retr(f(X)), where f(x)=xlog⁡2xf(x)=x\log_2 xf(x)=xlog2​x is applied by continuous functional calculus. For k∈Nk\in\mathbb Nk∈N, define a matrix Vk:C2→Ck+2⊗Ck+1V_k:\mathbb C^2\to\mathbb C^{k+2}\otimes\mathbb C^{k+1}Vk​:C2→Ck+2⊗Ck+1 by

(Vk)(r,s),x={2(k+1)(k+2){k+1−s,x=0,s+1,x=1,r=x+s,0otherwise,(V_k)_{(r,s),x}= \begin{cases} \displaystyle\sqrt{\frac{2}{(k+1)(k+2)} \begin{cases}k+1-s,&x=0,\\s+1,&x=1,\end{cases}}&r=x+s,\\ 0&\text{otherwise}, \end{cases}(Vk​)(r,s),x​=⎩⎨⎧​(k+1)(k+2)2​{k+1−s,s+1,​x=0,x=1,​​0​r=x+s,otherwise,​

with 0≤r<k+20\le r<k+20≤r<k+2, 0≤s<k+10\le s<k+10≤s<k+1, and x∈{0,1}x\in\{0,1\}x∈{0,1}. For z∈Rz\in\mathbb Rz∈R, 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 n≥1n\ge1n≥1 and k∈Nn\boldsymbol k\in\mathbb N^nk∈Nn, let VkV_{\boldsymbol k}Vk​ have entries ∏i=0n−1(Vki)(ri,si),xi\prod_{i=0}^{n-1}(V_{k_i})_{(r_i,s_i),x_i}∏i=0n−1​(Vki​​)(ri​,si​),xi​​, and put wz(k)=∏iwz(ki)w_z(\boldsymbol k)=\prod_iw_z(k_i)wz​(k)=∏i​wz​(ki​). Define

C(z)=sup⁡n≥1{1n[∑k∈NnS ⁣(wz(k)Tr⁡s(VkρVk†))−∑k∈NnS ⁣(wz(k)Tr⁡r(VkρVk†))]:ρ⪰0, tr⁡ρ=1},C(z)=\sup_{n\ge1}\left\{\frac1n\left[ \sum_{\boldsymbol k\in\mathbb N^n}S\!\left(w_z(\boldsymbol k)\operatorname{Tr}_{s}(V_{\boldsymbol k}\rho V_{\boldsymbol k}^{\dagger})\right) -\sum_{\boldsymbol k\in\mathbb N^n}S\!\left(w_z(\boldsymbol k)\operatorname{Tr}_{r}(V_{\boldsymbol k}\rho V_{\boldsymbol k}^{\dagger})\right) \right]:\rho\succeq0,\ \operatorname{tr}\rho=1\right\},C(z)=n≥1sup​{n1​[k∈Nn∑​S(wz​(k)Trs​(Vk​ρVk†​))−k∈Nn∑​S(wz​(k)Trr​(Vk​ρVk†​))]:ρ⪰0, trρ=1},

where ρ\rhoρ acts on (C2)⊗n(\mathbb C^2)^{\otimes n}(C2)⊗n; the two infinite sums are the formal real sums used by the definition, each assigned 000 if its family is not summable. The assertion is that C(z)>0C(z)>0C(z)>0 for every 0<z<10<z<10<z<1, that CCC is nonincreasing on (0,1)(0,1)(0,1), that CCC is convex there, meaning C(λx+(1−λ)y)≤λC(x)+(1−λ)C(y)C(\lambda x+(1-\lambda)y)\le\lambda C(x)+(1-\lambda)C(y)C(λx+(1−λ)y)≤λC(x)+(1−λ)C(y) for x,y∈(0,1)x,y\in(0,1)x,y∈(0,1) and 0≤λ≤10\le\lambda\le10≤λ≤1, and that

lim⁡z→0+C(z)=1,lim⁡z→1−C(z)=0.\lim_{z\to0^+}C(z)=1,\qquad \lim_{z\to1^-}C(z)=0.z→0+lim​C(z)=1,z→1−lim​C(z)=0.

These are one-sided limits; no values at z=0z=0z=0 or z=1z=1z=1 are asserted.

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

    Confirmed by the moderator at approval.

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