Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section V remark after Lemma 2: zero-determinant factors

Open
QAlgorithms.Papers.Independent.Support50.P28.singular_factors

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

prove2quantum

Consider finitely many complete bosonic modes, with no photon cutoff or energy constraint. Covariances use the interleaved coordinates (x1,p1,…)(x_1,p_1,\ldots)(x1​,p1​,…), [xj,pj]=i[x_j,p_j]=i[xj​,pj​]=i, and doubled vacuum covariance III. A centered Gaussian channel ΦX,Y\Phi_{X,Y}ΦX,Y​ is an actual completely positive trace-preserving map, with covariance action γ↦XTγX+Y\gamma\mapsto X^T\gamma X+Yγ↦XTγX+Y and Y+iσ−iXTσX≥0Y+i\sigma-iX^T\sigma X\ge0Y+iσ−iXTσX≥0, where X,YX,YX,Y are real, Y=YTY=Y^TY=YT, and σ=⨁j[01−10]\sigma=\bigoplus_j\left[\begin{smallmatrix}0&1\\-1&0\end{smallmatrix}\right]σ=⨁j​[0−1​10​].

Write G\mathcal GG for the normalized centered Gaussian densities and, for real p>1p>1p>1, put ξp(Φ)=sup⁡ρ∈G(Tr⁡Φ(ρ)p)1/p\xi_p(\Phi)=\sup_{\rho\in\mathcal G}(\operatorname{Tr}\Phi(\rho)^p)^{1/p}ξp​(Φ)=supρ∈G​(TrΦ(ρ)p)1/p. For a finite channel family, multiplicativity means equality of the joint Gaussian-input supremum to the product of the factor suprema; joint inputs may be entangled.

Let r≥1r\ge1r≥1 and let Φi=ΦXi,Yi\Phi_i=\Phi_{X_i,Y_i}Φi​=ΦXi​,Yi​​ be single-mode Gaussian channels with det⁡Xi=0\det X_i=0detXi​=0 for every iii. For every real p>1p>1p>1, their tensor product is multiplicative. Moreover, if another physical single-mode family Ψi=ΦXi′,Yi\Psi_i=\Phi_{X_i',Y_i}Ψi​=ΦXi′​,Yi​​ has the same noise matrices and det⁡Xi′=0\det X_i'=0detXi′​=0 for every iii, then

ξp ⁣(⨂iΦi)=∏iξp(Φi),ξp ⁣(⨂iΦi)=ξp ⁣(⨂iΨi).\xi_p\!\left(\bigotimes_i\Phi_i\right)=\prod_i\xi_p(\Phi_i),\qquad \xi_p\!\left(\bigotimes_i\Phi_i\right)=\xi_p\!\left(\bigotimes_i\Psi_i\right).ξp​(i⨂​Φi​)=i∏​ξp​(Φi​),ξp​(i⨂​Φi​)=ξp​(i⨂​Ψi​).

Thus the supremum in this regime depends only on the noise, not on the zero-determinant matrices XiX_iXi​. Infinite squeezing may approximate the supremum without attaining it.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P28
Formal statement
noncomputable section

open scoped BigOperators ENNReal ComplexOrder Matrix

namespace QAlgorithms.Papers.Independent.Support50.P28

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsTraceClassChannel rankOne)

open QAlgorithms.Papers.Independent.Claimed50.P47
  (Occupation gaussianStateCharacteristic singleCharacteristic weylKernel)

open QAlgorithms.Papers.Independent.Claimed50.P30 (phiMinus)

/-- PDF p.5, remark after Lemma 2: all-zero determinant factors are multiplicative
and the supremum does not depend on X. Comparison to every physical family with
the same Y expresses independence without assuming attainment. -/
theorem singular_factors {r : ℕ} (hr : 0 < r)
    (E : Fin r → CenteredOscillatorChannel (Fin 1)) (hzero : ∀ i, (E i).X.det = 0)
    (p : ℝ) (hp : 1 < p) :
    GaussianPurityMultiplicative p E ∧
    ∀ F : Fin r → CenteredOscillatorChannel (Fin 1),
      (∀ i, (F i).X.det = 0 ∧ (F i).Y = (E i).Y) →
      maximalOutputPurity p (tensorOscillatorChannel E) = maximalOutputPurity p (tensorOscillatorChannel F) := by sorry

end QAlgorithms.Papers.Independent.Support50.P28

end
Source
Multiplicativity of maximal output purities of Gaussian channels under Gaussian inputs, arXiv:quant-ph/0406065v1, PDF p. 5, Section V remark after Lemma 2: zero-determinant factors
Read-back

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

Let r>0r>0r>0, let p>1p>1p>1 be real, and let Ei=(Xi,Yi,Φi,outi)E_i=(X_i,Y_i,\Phi_i,\mathrm{out}_i)Ei​=(Xi​,Yi​,Φi​,outi​), 0≤i<r0\le i<r0≤i<r, be centered one-mode oscillator channels with det⁡Xi=0\det X_i=0detXi​=0 for every iii. The terms in this assertion have the following meanings. A nuclear coefficient matrix on LLL admits Auv=∑jaj(u)bj(v)‾A_{uv}=\sum_j a_j(u)\overline{b_j(v)}Auv​=∑j​aj​(u)bj​(v)​ with aj,bj∈ℓ2(L;C)a_j,b_j\in\ell^2(L;\mathbb C)aj​,bj​∈ℓ2(L;C) and ∑j∥aj∥∥bj∥<∞\sum_j\|a_j\|\|b_j\|<\infty∑j​∥aj​∥∥bj​∥<∞; a state is such a matrix with real nonnegative finite quadratic forms and summable real diagonal of sum 111. For a finite mode set III, use L=NIL=\mathbb N^IL=NI, the block matrix JI=⨁i∈I(01−10)J_I=\bigoplus_{i\in I}\begin{pmatrix}0&1\\-1&0\end{pmatrix}JI​=⨁i∈I​(0−1​10​), and

Dab(z)=e−∣z∣2/2a! b!∑ℓ=0min⁡(a,b)za−ℓ(−z‾)b−ℓℓ! (a−ℓ)! (b−ℓ)!,χA(ξ)=∑u∑vAuv∏i∈IDvi,ui ⁣(−ξi,0+iξi,12).D_{ab}(z)=e^{-|z|^2/2}\sqrt{a!\,b!} \sum_{\ell=0}^{\min(a,b)} \frac{z^{a-\ell}(-\overline z)^{b-\ell}}{\ell!\,(a-\ell)!\,(b-\ell)!}, \qquad \chi_A(\xi)=\sum_u\sum_v A_{uv}\prod_{i\in I} D_{v_i,u_i}\!\left(-\frac{\xi_{i,0}+\mathrm i\xi_{i,1}}{\sqrt2}\right).Dab​(z)=e−∣z∣2/2a!b!​ℓ=0∑min(a,b)​ℓ!(a−ℓ)!(b−ℓ)!za−ℓ(−z)b−ℓ​,χA​(ξ)=u∑​v∑​Auv​i∈I∏​Dvi​,ui​​(−2​ξi,0​+iξi,1​​).

Write CI\mathcal C_ICI​ for states admitting a real symmetric GGG with G+iJI≥0G+\mathrm iJ_I\ge0G+iJI​≥0, summable inner and outer characteristic series for every ξ\xiξ, and χA(ξ)=e−ξTJITGJIξ/4\chi_A(\xi)=e^{-\xi^{\mathsf T}J_I^{\mathsf T}GJ_I\xi/4}χA​(ξ)=e−ξTJIT​GJI​ξ/4. A centered oscillator channel has real matrices X,YX,YX,Y satisfying YT=YY^{\mathsf T}=YYT=Y and Y+i(JI−XTJIX)≥0Y+\mathrm i(J_I-X^{\mathsf T}J_IX)\ge0Y+i(JI​−XTJI​X)≥0; its map Φ\PhiΦ preserves nuclear matrices and is additive and complex homogeneous on them, and applying Φ\PhiΦ to each block of any state with a finite ancilla gives a state. All finite ancilla sizes, including the vacuous size 000, are included. Its specified output state has coefficients Φ(A)\Phi(A)Φ(A), summable characteristic series, and

χΦ(A)(ξ)=χA(JITXJIξ)e−ξTJITYJIξ/4\chi_{\Phi(A)}(\xi)=\chi_A(J_I^{\mathsf T}XJ_I\xi) e^{-\xi^{\mathsf T}J_I^{\mathsf T}YJ_I\xi/4}χΦ(A)​(ξ)=χA​(JIT​XJI​ξ)e−ξTJIT​YJI​ξ/4

for every input state. Let R(A)R(A)R(A) be a chosen bounded operator with coordinate coefficients AAA when one exists, and 000 otherwise, and set

∥A∥p,∗=(∑uofReal⁡(Re⁡⟨eu,R(A)peu⟩))1/p,Pp(Φ)=sup⁡A∈CI∥Φ(A)∥p,∗,\|A\|_{p,*}= \left(\sum_u\operatorname{ofReal}\bigl( \operatorname{Re}\langle e_u,R(A)^p e_u\rangle\bigr)\right)^{1/p}, \qquad P_p(\Phi)=\sup_{A\in\mathcal C_I}\|\Phi(A)\|_{p,*},∥A∥p,∗​=(u∑​ofReal(Re⟨eu​,R(A)peu​⟩))1/p,Pp​(Φ)=A∈CI​sup​∥Φ(A)∥p,∗​,

where operator powers use continuous functional calculus and ofReal⁡(t)=max⁡(t,0)\operatorname{ofReal}(t)=\max(t,0)ofReal(t)=max(t,0) in [0,∞][0,\infty][0,∞]. On the combined mode set ∐i<r{0}\coprod_{i<r}\{0\}∐i<r​{0}, define TE\mathcal T_ETE​ by applying the maps successively in increasing block order, with

(Ei(i)A)uv=Φi ⁣((Au[i←a], v[i←b])a,b)ui,vi.(E_i^{(i)}A)_{uv} =\Phi_i\!\left((A_{u[i\leftarrow a],\,v[i\leftarrow b]})_{a,b}\right)_{u_i,v_i}.(Ei(i)​A)uv​=Φi​((Au[i←a],v[i←b]​)a,b​)ui​,vi​​.

Then

Pp(TE)=∏i<rPp(Φi).P_p(\mathcal T_E)=\prod_{i<r}P_p(\Phi_i).Pp​(TE​)=i<r∏​Pp​(Φi​).

Moreover, for every other family of centered one-mode channels FiF_iFi​, with maps Ψi\Psi_iΨi​, if det⁡XFi=0\det X_{F_i}=0detXFi​​=0 and YFi=YiY_{F_i}=Y_iYFi​​=Yi​ for every iii, then

Pp(TE)=Pp(TF).P_p(\mathcal T_E)=P_p(\mathcal T_F).Pp​(TE​)=Pp​(TF​).

The hypotheses permit arbitrary singular XiX_iXi​, including the zero matrix; they specify equality of the noise matrices themselves for the second conclusion.

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

    Confirmed by the moderator at approval.

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