Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity of total displacement Fisher information, Eq. (15)

Open
QAlgorithms.Papers.Independent.Intakenext100.P62.fisherConvexityClosed

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

prove2quantum

Let n≥1n\ge1n≥1 and let ρX,ρY\rho_X,\rho_YρX​,ρY​ be arbitrary normalized states on the full nnn-mode bosonic Fock spaces. Their joint input is the product ρX⊗ρY\rho_X\otimes\rho_YρX​⊗ρY​; entanglement within either input is unrestricted. Let BλB_\lambdaBλ​ retain the port with quadratures λRX+1−λRY\sqrt\lambda R_X+\sqrt{1-\lambda}R_Yλ​RX​+1−λ​RY​. Write SSS for extended nonnegative von Neumann entropy in nats.

For each state, let J~\widetilde JJ be the sum of its divergence-based displacement Fisher information over all 2n2n2n canonical directions, without averaging. Require local finiteness and genuine second-derivative regularity for every directional divergence of both inputs and their output. Then, for all 0≤λ≤10\le\lambda\le10≤λ≤1,

J~(Bλ(ρX⊗ρY))≤λJ~(ρX)+(1−λ)J~(ρY).\widetilde J(B_\lambda(\rho_X\otimes\rho_Y))\le\lambda\widetilde J(\rho_X)+(1-\lambda)\widetilde J(\rho_Y).J(Bλ​(ρX​⊗ρY​))≤λJ(ρX​)+(1−λ)J(ρY​).

The same displacement scale is used throughout. This is convexity under beam-splitter mixing on the finite Fisher domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P62
Formal statement
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.5, (15): total displacement Fisher convexity under beam-splitter
mixing, including lambda=0,1. Every one of the 2n directional second derivatives
is in its genuine locally finite differentiability domain for both inputs and
output. A common displacement or bits/nats rescaling cancels from this inequality. -/
theorem fisherConvexityClosed {n : ℕ} (hn : 0 < n)
    (lam : ℝ) (hlam0 : 0 ≤ lam) (hlam1 : lam ≤ 1)
    (rhoX rhoY : State (FockIndex n))
    (hX : TotalFisherRegular rhoX.coefficients)
    (hY : TotalFisherRegular rhoY.coefficients)
    (hOut : TotalFisherRegular (beamSplitter lam
      (productCoeff rhoX.coefficients rhoY.coefficients))) :
    totalFisher (beamSplitter lam (productCoeff rhoX.coefficients rhoY.coefficients)) ≤
      lam * totalFisher rhoX.coefficients +
        (1 - lam) * totalFisher rhoY.coefficients := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P62

end
Source
Limits on classical communication from quantum entropy power inequalities, arXiv:1205.3407v2, PDF p. 5, Convexity of total displacement Fisher information, Eq. (15)
Read-back

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

For every positive integer nnn, every real 0≤λ≤10\le\lambda\le10≤λ≤1, and every pair of states X,YX,YX,Y on Fn={0,…,n−1}→NF_n=\{0,\ldots,n-1\}\to\mathbb NFn​={0,…,n−1}→N, assume the regularity condition defined below holds for each of XXX, YYY, and Z=Bλ(X,Y)Z=B_\lambda(X,Y)Z=Bλ​(X,Y). The theorem asserts

J(Z)≤λJ(X)+(1−λ)J(Y).J(Z)\le\lambda J(X)+(1-\lambda)J(Y).J(Z)≤λJ(X)+(1−λ)J(Y).

A state AAA admits an expansion Aab=∑r′ur(a)vr(b)‾A_{ab}=\sum_r'u_r(a)\overline{v_r(b)}Aab​=∑r′​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​∥<∞, has real nonnegative finite quadratic forms, and has summable real diagonal of sum 111. The output matrix is

Bλ(X,Y)ab=∑k∈Fn′∑u∈Fn2′∑v∈Fn2′βλ((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^2}'\sum_{v\in F_n^2}' \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∈Fn2​∑′​v∈Fn2​∑′​βλ​((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)),

where

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

For R=(j,k)∈{0,…,n−1}×{0,1}R=(j,k)\in\{0,\ldots,n-1\}\times\{0,1\}R=(j,k)∈{0,…,n−1}×{0,1}, define

UR(t)ab=∏ℓ=0n−1dzℓ(a(ℓ),b(ℓ)),zℓ={−t/2,ℓ=j, k=0,−it/2,ℓ=j, k=1,0,ℓ≠j,U_R(t)_{ab}=\prod_{\ell=0}^{n-1}d_{z_\ell}(a(\ell),b(\ell)), \qquad z_\ell= \begin{cases} -t/\sqrt2,&\ell=j,\ k=0,\\ -it/\sqrt2,&\ell=j,\ k=1,\\ 0,&\ell\ne j, \end{cases}UR​(t)ab​=ℓ=0∏n−1​dzℓ​​(a(ℓ),b(ℓ)),zℓ​=⎩⎨⎧​−t/2​,−it/2​,0,​ℓ=j, k=0,ℓ=j, k=1,ℓ=j,​

where

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

The orbit of any matrix AAA is

OR,A(t)ab=∑u∈Fn′∑v∈Fn′UR(t)auAuvUR(t)bv‾.O_{R,A}(t)_{ab} =\sum_{u\in F_n}'\sum_{v\in F_n}' U_R(t)_{au}A_{uv}\overline{U_R(t)_{bv}}.OR,A​(t)ab​=u∈Fn​∑′​v∈Fn​∑′​UR​(t)au​Auv​UR​(t)bv​​.

For matrices A,BA,BA,B on FnF_nFn​, define

D(A∥B)=sup⁡s⊆Fns finiteDs(As,Bs),Ds(P,Q)={[Re⁡tr⁡(Plog⁡fcP−Plog⁡fcQ+Q−P)]+,ker⁡Q⊆ker⁡P,∞,ker⁡Q⊈ker⁡P.D(A\Vert B)= \sup_{\substack{s\subseteq F_n\\s\text{ finite}}}D_s(A_s,B_s), \qquad D_s(P,Q)= \begin{cases} \left[\operatorname{Re}\operatorname{tr} \left(P\log_{\mathrm{fc}}P-P\log_{\mathrm{fc}}Q+Q-P\right)\right]_+, &\ker Q\subseteq\ker P,\\ \infty,&\ker Q\not\subseteq\ker P. \end{cases}D(A∥B)=s⊆Fn​s finite​sup​Ds​(As​,Bs​),Ds​(P,Q)={[Retr(Plogfc​P−Plogfc​Q+Q−P)]+​,∞,​kerQ⊆kerP,kerQ⊆kerP.​

Here the kernels are those of finite-matrix multiplication on complex coordinate vectors, [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0) embedded in [0,∞][0,\infty][0,∞], log⁡fc\log_{\mathrm{fc}}logfc​ uses continuous functional calculus of the total real logarithm, and the supremum includes the empty submatrix. Set

fR,A(t)=toReal⁡D(OR,A(0)∥OR,A(t)),J(A)=∑RfR,A′′(0),f_{R,A}(t)=\operatorname{toReal} D(O_{R,A}(0)\Vert O_{R,A}(t)), \qquad J(A)=\sum_R f_{R,A}''(0),fR,A​(t)=toRealD(OR,A​(0)∥OR,A​(t)),J(A)=R∑​fR,A′′​(0),

where toReal⁡(∞)=0\operatorname{toReal}(\infty)=0toReal(∞)=0, and the second derivative means the derivative of the total derivative function. The required regularity, separately for every RRR and for each A=X,Y,ZA=X,Y,ZA=X,Y,Z, is that on some neighborhood of 000 the displayed relative entropy is finite, on some neighborhood of 000 the real function fR,Af_{R,A}fR,A​ is differentiable at every point, and the function fR,A′f_{R,A}'fR,A′​ is differentiable at 000. These neighborhoods need not be the same. The assertion includes λ=0,1\lambda=0,1λ=0,1, excludes n=0n=0n=0, and imposes no separate energy assumption; all complex infinite sums use their stated grouping and the total nonsummable-family value 000.

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