Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section V final unnumbered result: conformally symplectic multimode factors

Open
QAlgorithms.Papers.Independent.Support50.P28.conformal_multimode_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​​ act on mi≥1m_i\ge1mi​≥1 modes. Suppose Xi=xiSiX_i=x_i S_iXi​=xi​Si​, where xi>0x_i>0xi​>0 and SiTσiSi=σiS_i^T\sigma_i S_i=\sigma_iSiT​σi​Si​=σi​, with σi\sigma_iσi​ the canonical form on those modes. Then for every real p>1p>1p>1,

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

This is the explicit last-paragraph scope in Section V. The scalars need not agree, and the noise matrices need not be positive definite. The paper's explanation through Proposition 2 does not establish the unequal-scalar case as written; that proof issue is recorded without adding an absent hypothesis.

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, last paragraph: the written conformally symplectic multimode
scope, without equality of the positive scalar factors and without Y>0.
The source's claimed implication from Proposition 2 is an incomplete proof route;
the explicit statement is retained unchanged, with this issue recorded. -/
theorem conformal_multimode_multiplicative {r : ℕ} (hr : 0 < r)
    (m : Fin r → ℕ) (hm : ∀ i, 0 < m i)
    (E : (i : Fin r) → CenteredOscillatorChannel (Fin (m i)))
    (x : Fin r → ℝ) (hx : ∀ i, 0 < x i)
    (S : (i : Fin r) → OscillatorCovariance (Fin (m i)))
    (hS : ∀ i, PreservesInterleavedSigma (S i)) (hX : ∀ i, (E i).X = x i • S i)
    (p : ℝ) (hp : 1 < p) : GaussianPurityMultiplicative p 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, Section V final unnumbered result: conformally symplectic multimode factors
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 natural numbers for 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 centered oscillator channels on Ii={0,…,mi−1}I_i=\{0,\ldots,m_i-1\}Ii​={0,…,mi​−1}. For each iii, let xi>0x_i>0xi​>0 be real and let SiS_iSi​ be a real matrix on Ii×{0,1}I_i\times\{0,1\}Ii​×{0,1} satisfying

SiTJIiSi=JIi,Xi=xiSi,whereJI=⨁j∈I(01−10).S_i^{\mathsf T}J_{I_i}S_i=J_{I_i}, \qquad X_i=x_iS_i, \quad\text{where}\quad J_I=\bigoplus_{j\in I}\begin{pmatrix}0&1\\-1&0\end{pmatrix}.SiT​JIi​​Si​=JIi​​,Xi​=xi​Si​,whereJI​=j∈I⨁​(0−1​10​).

Fix a real p>1p>1p>1. In the state spaces used here, a matrix on LLL is nuclear when 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​∥<∞; it is a state when its finite quadratic forms are also real and nonnegative and its real diagonal is summable with sum 111. For finite III, put L=NIL=\mathbb N^IL=NI and define

Dab(z)=e−∣z∣2/2a! b!∑ℓ=0min⁡(a,b)za−ℓ(−z‾)b−ℓℓ! (a−ℓ)! (b−ℓ)!,χA(ξ)=∑u∑vAuv∏j∈IDvj,uj ⁣(−ξj,0+iξj,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_{j\in I} D_{v_j,u_j}\!\left(-\frac{\xi_{j,0}+\mathrm i\xi_{j,1}}{\sqrt2}\right).Dab​(z)=e−∣z∣2/2a!b!​ℓ=0∑min(a,b)​ℓ!(a−ℓ)!(b−ℓ)!za−ℓ(−z)b−ℓ​,χA​(ξ)=u∑​v∑​Auv​j∈I∏​Dvj​,uj​​(−2​ξj,0​+iξj,1​​).

The centered Gaussian states CI\mathcal C_ICI​ are states admitting a real symmetric GGG with G+iJI≥0G+\mathrm iJ_I\ge0G+iJI​≥0 such that, for every ξ\xiξ, the inner and outer characteristic 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. A channel requires real X,YX,YX,Y, YT=YY^{\mathsf T}=YYT=Y, Y+i(JI−XTJIX)≥0Y+\mathrm i(J_I-X^{\mathsf T}J_IX)\ge0Y+i(JI​−XTJI​X)≥0, preservation of nuclear matrices, additivity and complex homogeneity on that class, and state preservation under every finite blockwise ancilla extension; size 000 is included and vacuous. Its specified output is a state with 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. For any coefficient matrix AAA, choose a bounded operator R(A)R(A)R(A) with those coefficients if one exists, and otherwise use 000; define

∥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(\Psi)=\sup_{A\in\mathcal C_I}\|\Psi(A)\|_{p,*},∥A∥p,∗​=(u∑​ofReal(Re⟨eu​,R(A)peu​⟩))1/p,Pp​(Ψ)=A∈CI​sup​∥Ψ(A)∥p,∗​,

with continuous functional calculus powers 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​, define TE\mathcal T_ETE​ by applying blocks 0,…,r−10,\ldots,r-10,…,r−1 successively, with block iii acting by

(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​).
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