Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Limits on classical communication from quantum entropy power inequalities

Definition
QAlgorithms_Papers_Independent_Intakenext100_P62

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

prove2quantum

The objects the formalized statements of Limits on classical communication from quantum entropy power inequalities (arXiv:1205.3407) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • photonCapacityNats: PDF p.8, Appendix A: unassisted operational capacity in nats/use. The accepted bits capacity uses arbitrary normalized mixed entangled block signals, collective POVMs, vanishing uniform-message average error at all large positive blocklengths, and ensemble-average total input photons at most n*N. The positive unit factor preserves infinity. No entropy formula defines capacity.
  • balancedThermalUpperNats: PDF p.8, (A2): the balanced thermal upper bound in nats. Only the average output photon number is inside g.
  • conjecturedThermalUpperNats: PDF p.9, (A14): the conjecture-conditional numerical thermal bound. The complete weighted sum is inside the logarithm.
  • GeneralQuantumEPI: PDF pp.2,7,9, (17)/(A15): the universal general-transmissivity exponential EPI is a premise, never an unconditional theorem of this paper. Entropy is in nats, as required by (A10)–(A15), correcting the p.2 bit-unit mismatch. The full closed interval and arbitrary independent normalized n-mode inputs are quantified here, before any channel parameters in its applications.
  • oneModeBeamChannel: PDF pp.3–4, Fig.2/Fig.3: retained-port channel for a fixed arbitrary normalized one-mode environment, fresh and independent on every use. The accepted n-mode beam splitter is reindexed at n=1; no Gaussianity or finite environment-energy/entropy assumption is added.
  • maximumOutputEntropyNats: PDF pp.3–4, (7) and Fig.3: supremal one-use output entropy under the input photon budget. The extended supremum keeps infinity; it is the maximum value whenever attained and asserts no new attainment result.
  • classicalNoiseKernel: PDF pp.3,9, Fig.2 and (A18)–(A21): Gaussian displacement noise with photon increment nu. The accepted complex displacement has density exp(-|z|^2/nu)/(pi*nu) for nu>0 and is the identity at nu=0. This fixes the operational photon normalization without copying the inconsistent quadrature-density scale in Fig.2. The bounded realization is used on trace class.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P17
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P28

/-!
König and Smith, arXiv:1205.3407v2, PDF pp.1–9.
Only pinned accepted library modules are imported, as authorized by the independent
paper workflow. States and channels act on the full countable Fock space.
Capacity is operational; entropy remains extended nonnegative. New definitions
are confined to this paper. Reused results and two deferrals are recorded in the
unit artifacts. Compilation and independent moderation are pending.
-/

noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P62

open scoped ENNReal BigOperators
open QAlgorithms.Papers.Independent.Dependency50.P33 (State productCoeff)
open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)
open QAlgorithms.Papers.Independent.Claimed50.P19 (FockIndex)
open QAlgorithms.Papers.Independent.Claimed50.P39 (g displacementNoiseChannel)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Gap48.P26 (weightedPhotonExpectation)
open QAlgorithms.Papers.Independent.Bridge50.P28
  (classicalPhotonCapacityBits thermalNoiseChannelKernel coherentSignalRateBits)
open QAlgorithms.Papers.Independent.Next46.P17
  (beamSplitter bosonicEntropyPower diffusionChannel TotalFisherRegular totalFisher)

/-- PDF p.8, Appendix A: unassisted operational capacity in nats/use.
The accepted bits capacity uses arbitrary normalized mixed entangled block
signals, collective POVMs, vanishing uniform-message average error at all large
positive blocklengths, and ensemble-average total input photons at most n*N.
The positive unit factor preserves infinity. No entropy formula defines capacity. -/
def photonCapacityNats (T : Matrix ℕ ℕ ℂ → Matrix ℕ ℕ ℂ) (N : ℝ) : ℝ≥0∞ :=
  ENNReal.ofReal (Real.log 2) * classicalPhotonCapacityBits id T N

/-- PDF p.8, (A2): the balanced thermal upper bound in nats.
Only the average output photon number is inside g. -/
def balancedThermalUpperNats (NE N : ℝ) : ℝ :=
  g ((N + NE) / 2) - Real.log (1 + Real.exp (g NE)) + Real.log 2

/-- PDF p.9, (A14): the conjecture-conditional numerical thermal bound.
The complete weighted sum is inside the logarithm. -/
def conjecturedThermalUpperNats (lam NE N : ℝ) : ℝ :=
  g (lam * N + (1 - lam) * NE) -
    Real.log (lam + (1 - lam) * Real.exp (g NE))

/-- PDF pp.2,7,9, (17)/(A15): the universal general-transmissivity exponential
EPI is a premise, never an unconditional theorem of this paper. Entropy is in
nats, as required by (A10)–(A15), correcting the p.2 bit-unit mismatch.
The full closed interval and arbitrary independent normalized n-mode inputs
are quantified here, before any channel parameters in its applications. -/
def GeneralQuantumEPI : Prop :=
  ∀ (n : ℕ), 0 < n → ∀ (lam : ℝ), 0 ≤ lam → lam ≤ 1 →
    ∀ rhoX rhoY : State (FockIndex n),
      ENNReal.ofReal lam * bosonicEntropyPower n (extendedEntropyNats rhoX.coefficients) +
        ENNReal.ofReal (1 - lam) *
          bosonicEntropyPower n (extendedEntropyNats rhoY.coefficients) ≤
      bosonicEntropyPower n (extendedEntropyNats (beamSplitter lam
        (productCoeff rhoX.coefficients rhoY.coefficients)))

/-- PDF pp.3–4, Fig.2/Fig.3: retained-port channel for a fixed arbitrary
normalized one-mode environment, fresh and independent on every use.
The accepted n-mode beam splitter is reindexed at n=1; no Gaussianity or
finite environment-energy/entropy assumption is added. -/
def oneModeBeamChannel (lam : ℝ) (sigma : State ℕ)
    (X : Matrix ℕ ℕ ℂ) : Matrix ℕ ℕ ℂ :=
  fun a b => beamSplitter lam
    (productCoeff
      (fun p q : FockIndex 1 => X (p 0) (q 0))
      (fun p q : FockIndex 1 => sigma.coefficients (p 0) (q 0)))
    (fun _ => a) (fun _ => b)

/-- PDF pp.3–4, (7) and Fig.3: supremal one-use output entropy under the
input photon budget. The extended supremum keeps infinity; it is the maximum
value whenever attained and asserts no new attainment result. -/
def maximumOutputEntropyNats (T : Matrix ℕ ℕ ℂ → Matrix ℕ ℕ ℂ)
    (N : ℝ) : ℝ≥0∞ :=
  ⨆ rho : {rho : State ℕ //
    weightedPhotonExpectation id rho.coefficients ≤ ENNReal.ofReal N},
    extendedEntropyNats (T rho.val.coefficients)

/-- PDF pp.3,9, Fig.2 and (A18)–(A21): Gaussian displacement noise with
photon increment nu. The accepted complex displacement has density
exp(-|z|^2/nu)/(pi*nu) for nu>0 and is the identity at nu=0.
This fixes the operational photon normalization without copying the inconsistent
quadrature-density scale in Fig.2. The bounded realization is used on trace class. -/
def classicalNoiseKernel (nu : ℝ) (X : Matrix ℕ ℕ ℂ) : Matrix ℕ ℕ ℂ :=
  operatorCoeff (displacementNoiseChannel nu (boundedOperator X))

/-! Sanity checks pin unit conversion, zero-noise boundaries, the universal
premise's mode domain, input-budget restriction, and one-mode coordinate adapter.
These are definition checks, not proofs of any source result. -/

example (T : Matrix ℕ ℕ ℂ → Matrix ℕ ℕ ℂ) (N : ℝ) :
    photonCapacityNats T N =
      ENNReal.ofReal (Real.log 2) * classicalPhotonCapacityBits id T N := rfl

example (N : ℝ) : balancedThermalUpperNats 0 N = g (N / 2) := by
  simp [balancedThermalUpperNats, g]
  norm_num <;> ring

example (NE N : ℝ) : conjecturedThermalUpperNats 1 NE N = g N := by
  simp [conjecturedThermalUpperNats]

example (h : GeneralQuantumEPI) (rhoX rhoY : State (FockIndex 1)) :
    ENNReal.ofReal (1 / 2 : ℝ) *
        bosonicEntropyPower 1 (extendedEntropyNats rhoX.coefficients) +
      ENNReal.ofReal (1 - (1 / 2 : ℝ)) *
        bosonicEntropyPower 1 (extendedEntropyNats rhoY.coefficients) ≤
    bosonicEntropyPower 1 (extendedEntropyNats (beamSplitter (1 / 2 : ℝ)
      (productCoeff rhoX.coefficients rhoY.coefficients))) := by
  exact h 1 (by norm_num) (1 / 2) (by norm_num) (by norm_num) rhoX rhoY

example (lam : ℝ) (sigma : State ℕ) : oneModeBeamChannel lam sigma 0 = 0 := by
  funext a b
  simp [oneModeBeamChannel, beamSplitter, productCoeff]

example (T : Matrix ℕ ℕ ℂ → Matrix ℕ ℕ ℂ) (N : ℝ) (rho : State ℕ)
    (h : weightedPhotonExpectation id rho.coefficients ≤ ENNReal.ofReal N) :
    extendedEntropyNats (T rho.coefficients) ≤ maximumOutputEntropyNats T N := by
  exact le_iSup_of_le ⟨rho, h⟩ le_rfl

example (X : Matrix ℕ ℕ ℂ) :
    classicalNoiseKernel 0 X = operatorCoeff (boundedOperator X) := by
  simp [classicalNoiseKernel, displacementNoiseChannel]

end QAlgorithms.Papers.Independent.Intakenext100.P62
Source
Limits on classical communication from quantum entropy power inequalities, arXiv:1205.3407v2, https://arxiv.org/abs/1205.3407v2
Read-back

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

QAlgorithms.Papers.Independent.Intakenext100.P62.GeneralQuantumEPI

This defines the proposition that, for every positive integer nnn, every real 0≤λ≤10\le\lambda\le10≤λ≤1, and every pair of states X,YX,YX,Y indexed by Fn={0,…,n−1}→NF_n=\{0,\ldots,n-1\}\to\mathbb NFn​={0,…,n−1}→N,

[λ]+ Pn(H(X))+[1−λ]+ Pn(H(Y))≤Pn(H(Bλ(X,Y))).[\lambda]_+\,P_n(H(X))+[1-\lambda]_+\,P_n(H(Y)) \le P_n(H(B_\lambda(X,Y))).[λ]+​Pn​(H(X))+[1−λ]+​Pn​(H(Y))≤Pn​(H(Bλ​(X,Y))).

Here [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0), embedded in [0,∞][0,\infty][0,∞], and

Pn(S)={∞,S=∞,exp⁡(S/n),S<∞.P_n(S)= \begin{cases} \infty,&S=\infty,\\ \exp(S/n),&S<\infty. \end{cases}Pn​(S)={∞,exp(S/n),​S=∞,S<∞.​

For a complex matrix AAA indexed by any label set LLL, the entropy used here is precisely

H(A)=sup⁡s⊆Ls finite[(Re⁡tr⁡As)log⁡(Re⁡tr⁡As)−Re⁡tr⁡ ⁣(Aslog⁡fcAs)]+,H(A)=\sup_{\substack{s\subseteq L\\s\text{ finite}}} \left[ (\operatorname{Re}\operatorname{tr}A_s)\log(\operatorname{Re}\operatorname{tr}A_s) -\operatorname{Re}\operatorname{tr}\!\left(A_s\log_{\mathrm{fc}}A_s\right) \right]_+,H(A)=s⊆Ls finite​sup​[(RetrAs​)log(RetrAs​)−Retr(As​logfc​As​)]+​,

where AsA_sAs​ is the principal submatrix and log⁡fc\log_{\mathrm{fc}}logfc​ is the continuous functional calculus applied to the total real logarithm; the empty principal submatrix is included. The matrix Bλ(X,Y)B_\lambda(X,Y)Bλ​(X,Y) has entries

Bλ(X,Y)ab=∑k∈Fn′∑u∈Fn×Fn′∑v∈Fn×Fn′βλ((a,k),u) Xu1v1Yu2v2 βλ((b,k),v),βλ(o,p)=∏j=0n−1hλ(o1(j),o2(j);p1(j),p2(j)),B_\lambda(X,Y)_{ab} =\sum_{k\in F_n}'\sum_{u\in F_n\times F_n}'\sum_{v\in F_n\times F_n}' \beta_\lambda((a,k),u)\,X_{u_1v_1}Y_{u_2v_2}\, \beta_\lambda((b,k),v), \qquad \beta_\lambda(o,p)=\prod_{j=0}^{n-1} h_\lambda(o_1(j),o_2(j);p_1(j),p_2(j)),Bλ​(X,Y)ab​=k∈Fn​∑′​u∈Fn​×Fn​∑′​v∈Fn​×Fn​∑′​βλ​((a,k),u)Xu1​v1​​Yu2​v2​​βλ​((b,k),v),βλ​(o,p)=j=0∏n−1​hλ​(o1​(j),o2​(j);p1​(j),p2​(j)),

with the real coefficient

hλ(r,s;p,q)={r! s!p! q!∑k=0p∑ℓ=0q1{k+ℓ=r}(pk)(qℓ)(λ)k(1−λ)p−k(1−λ)ℓ(−λ)q−ℓ,r+s=p+q,0,r+s≠p+q.h_\lambda(r,s;p,q)= \begin{cases} \displaystyle \sqrt{\frac{r!\,s!}{p!\,q!}} \sum_{k=0}^{p}\sum_{\ell=0}^{q} \mathbf1_{\{k+\ell=r\}}\binom pk\binom q\ell (\sqrt\lambda)^k(\sqrt{1-\lambda})^{p-k} (\sqrt{1-\lambda})^\ell(-\sqrt\lambda)^{q-\ell}, &r+s=p+q,\\ 0,&r+s\ne p+q. \end{cases}hλ​(r,s;p,q)=⎩⎨⎧​p!q!r!s!​​k=0∑p​ℓ=0∑q​1{k+ℓ=r}​(kp​)(ℓq​)(λ​)k(1−λ​)p−k(1−λ​)ℓ(−λ​)q−ℓ,0,​r+s=p+q,r+s=p+q.​

A state AAA means that Aab=∑r′ur(a)vr(b)‾A_{ab}=\sum_r'u_r(a)\overline{v_r(b)}Aab​=∑r′​ur​(a)vr​(b)​ for square-summable vectors ur,vru_r,v_rur​,vr​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, that every finite quadratic form ∑a,b∈sza‾Aabzb\sum_{a,b\in s}\overline{z_a}A_{ab}z_b∑a,b∈s​za​​Aab​zb​ is real and nonnegative, and that (Re⁡Aaa)a(\operatorname{Re}A_{aa})_a(ReAaa​)a​ is summable with sum 111. There is no finite-energy or finite-entropy hypothesis, and no separate summability hypothesis on the displayed beam-splitter sums; a nonsummable complex family has total infinite sum 000. The proposition includes both endpoints λ=0,1\lambda=0,1λ=0,1, using extended nonnegative arithmetic, in particular 0⋅∞=00\cdot\infty=00⋅∞=0, and excludes n=0n=0n=0.

QAlgorithms.Papers.Independent.Intakenext100.P62.balancedThermalUpperNats

For arbitrary real numbers NE,NN_E,NNE​,N, this defines the real number

g ⁣(N+NE2)−log⁡ ⁣(1+exp⁡(g(NE)))+log⁡2,g(x)=(x+1)log⁡(x+1)−xlog⁡x.g\!\left(\frac{N+N_E}{2}\right) -\log\!\left(1+\exp(g(N_E))\right)+\log2, \qquad g(x)=(x+1)\log(x+1)-x\log x.g(2N+NE​​)−log(1+exp(g(NE​)))+log2,g(x)=(x+1)log(x+1)−xlogx.

There are no sign restrictions on either argument. The real logarithm is total: log⁡0=0\log0=0log0=0, and for negative xxx, log⁡x=log⁡∣x∣\log x=\log|x|logx=log∣x∣. This declaration defines a value without asserting an inequality involving it.

QAlgorithms.Papers.Independent.Intakenext100.P62.classicalNoiseKernel

For any real ν\nuν and any complex matrix XXX indexed by N\mathbb NN, first let O(X)\mathcal O(X)O(X) be a chosen bounded complex-linear operator on ℓ2(N;C)\ell^2(\mathbb N;\mathbb C)ℓ2(N;C) satisfying (O(X)ej)i=Xij(\mathcal O(X)e_j)_i=X_{ij}(O(X)ej​)i​=Xij​, if such an operator exists, and let O(X)=0\mathcal O(X)=0O(X)=0 otherwise. For a bounded operator AAA, write c(A)ij=(Aej)ic(A)_{ij}=(Ae_j)_ic(A)ij​=(Aej​)i​. This definition gives

Kν(X)={c(O(X)),ν=0,c(O(L)),ν≠0,Lmk=∫Cwν(z)(D(z)O(X)D(z)∗ek)m dz,K_\nu(X)= \begin{cases} c(\mathcal O(X)),&\nu=0,\\ c(\mathcal O(L)),&\nu\ne0, \end{cases} \qquad L_{mk}=\int_{\mathbb C}w_\nu(z) \bigl(D(z)\mathcal O(X)D(z)^*e_k\bigr)_m\,dz,Kν​(X)={c(O(X)),c(O(L)),​ν=0,ν=0,​Lmk​=∫C​wν​(z)(D(z)O(X)D(z)∗ek​)m​dz,

where dzdzdz is Lebesgue measure and

wν(z)=max⁡ ⁣{1πνe−∣z∣2/ν,0}.w_\nu(z)=\max\!\left\{\frac{1}{\pi\nu}e^{-|z|^2/\nu},0\right\}.wν​(z)=max{πν1​e−∣z∣2/ν,0}.

The displacement operator D(z)D(z)D(z) is itself obtained by the same chosen-operator-or-zero construction from the matrix

dz(m,n)=e−∣z∣2/2m! n!∑j=0min⁡(m,n)zm−j(−z‾)n−jj! (m−j)! (n−j)!.d_z(m,n)= e^{-|z|^2/2}\sqrt{m!\,n!} \sum_{j=0}^{\min(m,n)} \frac{z^{m-j}(-\overline z)^{n-j}} {j!\,(m-j)!\,(n-j)!}.dz​(m,n)=e−∣z∣2/2m!n!​j=0∑min(m,n)​j!(m−j)!(n−j)!zm−j(−z)n−j​.

There is no positivity, density, trace-class, or integrability hypothesis on XXX. The integrals are total Bochner integrals, which are 000 when the integrand is not integrable. In particular, at ν=0\nu=0ν=0 the result is the coefficient matrix of O(X)\mathcal O(X)O(X), so it is XXX when XXX has a bounded-operator realization and is 000 otherwise; for ν<0\nu<0ν<0, the displayed weight is everywhere 000, giving the zero kernel.

QAlgorithms.Papers.Independent.Intakenext100.P62.conjecturedThermalUpperNats

For arbitrary real numbers λ,NE,N\lambda,N_E,Nλ,NE​,N, this defines

g ⁣(λN+(1−λ)NE)−log⁡ ⁣(λ+(1−λ)exp⁡(g(NE))),g(x)=(x+1)log⁡(x+1)−xlog⁡x.g\!\left(\lambda N+(1-\lambda)N_E\right) -\log\!\left(\lambda+(1-\lambda)\exp(g(N_E))\right), \qquad g(x)=(x+1)\log(x+1)-x\log x.g(λN+(1−λ)NE​)−log(λ+(1−λ)exp(g(NE​))),g(x)=(x+1)log(x+1)−xlogx.

No bounds on λ\lambdaλ or sign restrictions on NE,NN_E,NNE​,N are assumed. All logarithms use the total real logarithm, with log⁡0=0\log0=0log0=0 and log⁡x=log⁡∣x∣\log x=\log|x|logx=log∣x∣ for negative xxx, so the definition also includes parameters for which the last logarithm has a nonpositive argument. No upper-bound assertion is part of this definition.

QAlgorithms.Papers.Independent.Intakenext100.P62.maximumOutputEntropyNats

For an arbitrary function T:CN×N→CN×NT:\mathbb C^{\mathbb N\times\mathbb N}\to\mathbb C^{\mathbb N\times\mathbb N}T:CN×N→CN×N and an arbitrary real NNN, this defines

sup⁡ρ a state on N∑j∈N′[jRe⁡ρjj]+≤[N]+H(T(ρ))in [0,∞],\sup_{\substack{\rho\text{ a state on }\mathbb N\\ \sum_{j\in\mathbb N}'[j\,\operatorname{Re}\rho_{jj}]_+\le[N]_+}} H(T(\rho)) \quad\text{in }[0,\infty],ρ a state on N∑j∈N′​[jReρjj​]+​≤[N]+​​sup​H(T(ρ))in [0,∞],

where [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0), embedded in [0,∞][0,\infty][0,∞]. Being a state means admitting an expansion ρij=∑r′ur(i)vr(j)‾\rho_{ij}=\sum_r'u_r(i)\overline{v_r(j)}ρij​=∑r′​ur​(i)vr​(j)​ with ur,vr∈ℓ2(N;C)u_r,v_r\in\ell^2(\mathbb N;\mathbb C)ur​,vr​∈ℓ2(N;C) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, having real nonnegative finite quadratic forms, and having a summable real diagonal whose sum is 111. For any matrix AAA, including outputs not assumed to be states,

H(A)=sup⁡s⊆Ns finite[(Re⁡tr⁡As)log⁡(Re⁡tr⁡As)−Re⁡tr⁡ ⁣(Aslog⁡fcAs)]+,H(A)=\sup_{\substack{s\subseteq\mathbb N\\s\text{ finite}}} \left[ (\operatorname{Re}\operatorname{tr}A_s)\log(\operatorname{Re}\operatorname{tr}A_s) -\operatorname{Re}\operatorname{tr}\!\left(A_s\log_{\mathrm{fc}}A_s\right) \right]_+,H(A)=s⊆Ns finite​sup​[(RetrAs​)log(RetrAs​)−Retr(As​logfc​As​)]+​,

with AsA_sAs​ the principal submatrix and log⁡fc\log_{\mathrm{fc}}logfc​ the continuous functional calculus of the total real logarithm. The empty principal submatrix is included. There is no channel or linearity assumption on TTT; N≤0N\le0N≤0 makes the input constraint the zero-photon-expectation constraint. The supremum can be infinite, and the empty-supremum convention is 000.

QAlgorithms.Papers.Independent.Intakenext100.P62.oneModeBeamChannel

For any real λ\lambdaλ, any state σ\sigmaσ indexed by N\mathbb NN, and any complex matrix XXX indexed by N\mathbb NN, this defines a matrix Tλ,σ(X)T_{\lambda,\sigma}(X)Tλ,σ​(X) by

Tλ,σ(X)ab=∑k∈N′∑(p,q)∈N2′∑(r,s)∈N2′hλ(a,k;p,q) Xprσqs hλ(b,k;r,s).T_{\lambda,\sigma}(X)_{ab} =\sum_{k\in\mathbb N}'\sum_{(p,q)\in\mathbb N^2}'\sum_{(r,s)\in\mathbb N^2}' h_\lambda(a,k;p,q)\,X_{pr}\sigma_{qs}\, h_\lambda(b,k;r,s).Tλ,σ​(X)ab​=k∈N∑′​(p,q)∈N2∑′​(r,s)∈N2∑′​hλ​(a,k;p,q)Xpr​σqs​hλ​(b,k;r,s).

This is the one-coordinate identification of functions {0}→N\{0\}\to\mathbb N{0}→N with their values at 000; the order and grouping of the three infinite sums are as displayed. The real coefficient is

hλ(a,b;p,q)={a! b!p! q!∑i=0p∑j=0q1{i+j=a}(pi)(qj)(λ)i(1−λ)p−i(1−λ)j(−λ)q−j,a+b=p+q,0,a+b≠p+q.h_\lambda(a,b;p,q)= \begin{cases} \displaystyle \sqrt{\frac{a!\,b!}{p!\,q!}} \sum_{i=0}^{p}\sum_{j=0}^{q} \mathbf1_{\{i+j=a\}}\binom pi\binom qj (\sqrt\lambda)^i(\sqrt{1-\lambda})^{p-i} (\sqrt{1-\lambda})^j(-\sqrt\lambda)^{q-j}, &a+b=p+q,\\ 0,&a+b\ne p+q. \end{cases}hλ​(a,b;p,q)=⎩⎨⎧​p!q!a!b!​​i=0∑p​j=0∑q​1{i+j=a}​(ip​)(jq​)(λ​)i(1−λ​)p−i(1−λ​)j(−λ​)q−j,0,​a+b=p+q,a+b=p+q.​

The state assumption on σ\sigmaσ means that σab=∑r′ur(a)vr(b)‾\sigma_{ab}=\sum_r'u_r(a)\overline{v_r(b)}σab​=∑r′​ur​(a)vr​(b)​ for ur,vr∈ℓ2(N;C)u_r,v_r\in\ell^2(\mathbb N;\mathbb C)ur​,vr​∈ℓ2(N;C) with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, that every finite quadratic form of σ\sigmaσ is real and nonnegative, and that its real diagonal is summable with sum 111. No state, trace-class, or summability assumption is imposed on XXX, and λ\lambdaλ need not lie in [0,1][0,1][0,1]. The real square root is 000 on negative inputs, zeroth powers are 111, and each nonsummable complex family has total infinite sum 000. The definition itself asserts no positivity or normalization property of the resulting matrix.

QAlgorithms.Papers.Independent.Intakenext100.P62.photonCapacityNats

For any function T:CN×N→CN×NT:\mathbb C^{\mathbb N\times\mathbb N}\to\mathbb C^{\mathbb N\times\mathbb N}T:CN×N→CN×N and any real NNN, this defines

Cnat(T,N)=[log⁡2]+ sup⁡{R∈[0,∞):R satisfies the condition below},C_{\mathrm{nat}}(T,N)=[\log 2]_+\,\sup\{R\in[0,\infty):R\text{ satisfies the condition below}\},Cnat​(T,N)=[log2]+​sup{R∈[0,∞):R satisfies the condition below},

where [x]+[x]_+[x]+​ denotes max⁡(x,0)\max(x,0)max(x,0), embedded in [0,∞][0,\infty][0,∞]. The condition on RRR is: for every real ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there exists an integer n0>0n_0>0n0​>0 such that, for every integer n≥n0n\ge n_0n≥n0​, there are an integer M>0M>0M>0, matrices ρ0,…,ρM−1\rho_0,\ldots,\rho_{M-1}ρ0​,…,ρM−1​ indexed by Fn={0,…,n−1}→NF_n=\{0,\ldots,n-1\}\to\mathbb NFn​={0,…,n−1}→N, and bounded complex-linear operators D0,…,DM−1D_0,\ldots,D_{M-1}D0​,…,DM−1​ on ℓ2(Fn;C)\ell^2(F_n;\mathbb C)ℓ2(Fn​;C), with each DmD_mDm​ having real nonnegative quadratic forms and ∑mDm=I\sum_mD_m=I∑m​Dm​=I, such that

∑a∈Fn′[(∑t=0n−1a(t))Re⁡ρˉaa]+≤[nN]+,1M∑m=0M−1Re⁡(∑a∈Fn′∑b∈Fn′(T[n](ρm))ab(Dmea)b)≥1−ϵ,R−δ≤log⁡Mnlog⁡2,\sum_{a\in F_n}'\left[\left(\sum_{t=0}^{n-1}a(t)\right)\operatorname{Re}\bar\rho_{aa}\right]_+ \le[nN]_+,\qquad \frac1M\sum_{m=0}^{M-1} \operatorname{Re}\left(\sum_{a\in F_n}'\sum_{b\in F_n}' (T^{[n]}(\rho_m))_{ab}(D_me_a)_b\right)\ge1-\epsilon, \qquad R-\delta\le\frac{\log M}{n\log2},a∈Fn​∑′​[(t=0∑n−1​a(t))Reρˉ​aa​]+​≤[nN]+​,M1​m=0∑M−1​Re(a∈Fn​∑′​b∈Fn​∑′​(T[n](ρm​))ab​(Dm​ea​)b​)≥1−ϵ,R−δ≤nlog2logM​,

where ρˉ=M−1∑mρm\bar\rho=M^{-1}\sum_m\rho_mρˉ​=M−1∑m​ρm​ and eae_aea​ is the coordinate unit vector. Each ρm\rho_mρm​ must be a state: it admits an expansion (ρm)ab=∑r∈N′ur(a)vr(b)‾(\rho_m)_{ab}=\sum_{r\in\mathbb N}'u_r(a)\overline{v_r(b)}(ρm​)ab​=∑r∈N′​ur​(a)vr​(b)​ with ur,vr∈ℓ2(Fn;C)u_r,v_r\in\ell^2(F_n;\mathbb C)ur​,vr​∈ℓ2(Fn​;C) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; every finite quadratic form ∑a,b∈sza‾(ρm)abzb\sum_{a,b\in s}\overline{z_a}(\rho_m)_{ab}z_b∑a,b∈s​za​​(ρm​)ab​zb​ is real and nonnegative; and its real diagonal is summable with sum 111. The map T[n]T^{[n]}T[n] is defined recursively by

(T[0]X)∅,∅=X∅,∅,(T[n+1]X)a,b=(T[n] ⁣[(s,t)↦T ⁣[(i,j)↦X(i,s),(j,t)]a(0),b(0)])tail⁡a,tail⁡b.(T^{[0]}X)_{\varnothing,\varnothing}=X_{\varnothing,\varnothing},\qquad (T^{[n+1]}X)_{a,b} =\left(T^{[n]}\!\left[(s,t)\mapsto T\!\left[(i,j)\mapsto X_{(i,s),(j,t)}\right]_{a(0),b(0)} \right]\right)_{\operatorname{tail}a,\operatorname{tail}b}.(T[0]X)∅,∅​=X∅,∅​,(T[n+1]X)a,b​=(T[n][(s,t)↦T[(i,j)↦X(i,s),(j,t)​]a(0),b(0)​])taila,tailb​.

Here (i,s)(i,s)(i,s) means prepending iii to sss. No channel or linearity assumption is imposed on TTT, and no nonnegativity assumption is imposed on NNN; when N<0N<0N<0, the budget on the displayed nonnegative sum is 000. Suprema are taken in [0,∞][0,\infty][0,∞], with empty supremum 000; the iterated complex sums use the total infinite-sum convention, which gives 000 for a nonsummable family.

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