Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3: arbitrary invertible multimode factors at p=2

Open
QAlgorithms.Papers.Independent.Support50.P28.multimode_two_purity_multiplicative

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 Gaussian channels, where factor iii acts on mi≥1m_i\ge1mi​≥1 complete modes. Assume det⁡Xi≠0\det X_i\ne0detXi​=0 for every iii. Then

ξ2 ⁣(⨂i=1rΦi)=∏i=1rξ2(Φi).\xi_2\!\left(\bigotimes_{i=1}^r\Phi_i\right)=\prod_{i=1}^r\xi_2(\Phi_i).ξ2​(i=1⨂r​Φi​)=i=1∏r​ξ2​(Φi​).

The partition is by channels, each of which may have several modes. No equal-sign, equal-determinant, or positive-definite-noise hypothesis is imposed. The norm here is the Schatten 222-norm, whose square is ordinary purity.

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.7, Proposition 3: arbitrary invertible multimode channel factors at
p=2. No equal-sign, equal-determinant or strictly positive noise restriction. -/
theorem multimode_two_purity_multiplicative {r : ℕ} (hr : 0 < r)
    (m : Fin r → ℕ) (hm : ∀ i, 0 < m i)
    (E : (i : Fin r) → CenteredOscillatorChannel (Fin (m i)))
    (hX : ∀ i, (E i).X.det ≠ 0) : GaussianPurityMultiplicative 2 E := 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. 7, Proposition 3: arbitrary invertible multimode factors at p=2
Read-back

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

Let r>0r>0r>0, let mi>0m_i>0mi​>0 be a natural number for every 0≤i<r0\le i<r0≤i<r, and let Ei=(Xi,Yi,Φi,outi)E_i=(X_i,Y_i,\Phi_i,\mathrm{out}_i)Ei​=(Xi​,Yi​,Φi​,outi​) be a centered oscillator channel on the mode set Ii={0,…,mi−1}I_i=\{0,\ldots,m_i-1\}Ii​={0,…,mi​−1}. Assume det⁡Xi≠0\det X_i\ne0detXi​=0 for every iii. The state and channel requirements are these: a matrix on a label set LLL is nuclear if Auv=∑jaj(u)bj(v)‾A_{uv}=\sum_j a_j(u)\overline{b_j(v)}Auv​=∑j​aj​(u)bj​(v)​ for aj,bj∈ℓ2(L;C)a_j,b_j\in\ell^2(L;\mathbb C)aj​,bj​∈ℓ2(L;C) with ∑j∥aj∥∥bj∥<∞\sum_j\|a_j\|\|b_j\|<\infty∑j​∥aj​∥∥bj​∥<∞, and it is a state if its finite quadratic forms are also real and nonnegative and its real diagonal is summable with sum 111. For finite III, let L=NIL=\mathbb N^IL=NI, 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)!}, \quad \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​​).

A state belongs to CI\mathcal C_ICI​ when some real symmetric GGG satisfies G+iJI≥0G+\mathrm iJ_I\ge0G+iJI​≥0 and, for every ξ\xiξ, each inner characteristic series and the outer series are summable 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. Each channel has real 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 matrix map preserves nuclear matrices, is additive and complex homogeneous on them, and preserves states under every finite blockwise ancilla extension, including the vacuous size 000. Its specified output state has coefficients Φ(A)\Phi(A)Φ(A), summable characteristic series, and characteristic

χΦ(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 if one exists, and 000 otherwise, and define

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

where the operator power is the continuous functional calculus power and ofReal⁡(t)=max⁡(t,0)\operatorname{ofReal}(t)=\max(t,0)ofReal(t)=max(t,0) in [0,∞][0,\infty][0,∞]. On I=∐i<rIiI=\coprod_{i<r}I_iI=∐i<r​Ii​, form TE\mathcal T_ETE​ by applying block maps in increasing order, where

(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

P2(TE)=∏i<rP2(Φi).P_2(\mathcal T_E)=\prod_{i<r}P_2(\Phi_i).P2​(TE​)=i<r∏​P2​(Φi​).

The block sizes and number of blocks are all positive; the purity exponent in this assertion is exactly 222.

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