Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, corrected regular-case optimal-product majorization

Open
QAlgorithms.Papers.Independent.Support50.P28.regular_optimal_product_majorization

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.

This is an explicitly corrected regular-case statement. Let Φ=ΦX,Y\Phi=\Phi_{X,Y}Φ=ΦX,Y​ be a single-mode Gaussian channel with det⁡X≠0\det X\ne0detX=0 and Y>0Y>0Y>0 in the strict Loewner sense. There exists a centered pure Gaussian density ρ0\rho_0ρ0​, chosen independently of ppp and of the number of channel uses, such that for all real p>1p>1p>1 and all integers r≥1r\ge1r≥1,

∥Φ(ρ0)∥p=ξp(Φ),∥Φ⊗r(ρ0⊗r)∥p=ξp(Φ⊗r),Φ(ρ0)⊗r≻Φ⊗r(ρ)(ρ∈Gr).\|\Phi(\rho_0)\|_p=\xi_p(\Phi),\qquad \|\Phi^{\otimes r}(\rho_0^{\otimes r})\|_p=\xi_p(\Phi^{\otimes r}),\qquad \Phi(\rho_0)^{\otimes r}\succ\Phi^{\otimes r}(\rho)\quad(\rho\in\mathcal G_r).∥Φ(ρ0​)∥p​=ξp​(Φ),∥Φ⊗r(ρ0⊗r​)∥p​=ξp​(Φ⊗r),Φ(ρ0​)⊗r≻Φ⊗r(ρ)(ρ∈Gr​).

Here A≻BA\succ BA≻B means that for every positive integer kkk, the sum of the kkk largest eigenvalues of AAA is at least the corresponding sum for BBB, with multiplicities and zero padding. This identifies one product input that is optimal simultaneously for every p>1p>1p>1 and dominates every joint Gaussian output. The two regularity guards are additions to the printed unrestricted claim; the full printed claim remains deferred.

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, corrected regular-case Proposition 1: det X != 0 and Y positive
definite are ADDED guards, as explicitly inventoried in the plan. The printed
unrestricted optimizer assertion is false and remains in HARD.md. One pure
one-mode input works for all p>1 and all tensor powers; comparison is against
every Gaussian joint input, including entangled and mixed ones. -/
theorem regular_optimal_product_majorization (E : CenteredOscillatorChannel (Fin 1))
    (hX : E.X.det ≠ 0) (hY : E.Y.PosDef) :
    ∃ rho0 : State (Occupation (Fin 1)), IsCenteredGaussianDensity rho0 ∧ IsPureOscillatorDensity rho0 ∧
      (∀ p : ℝ, 1 < p → pNorm p (E.map rho0.coefficients) = maximalOutputPurity p E.map) ∧
      ∀ r : ℕ, 0 < r →
        (∀ p : ℝ, 1 < p →
          pNorm p (tensorOscillatorChannel (m := fun _ : Fin r => 1) (fun _ => E)
            (productInput (m := fun _ : Fin r => 1) (fun _ => rho0))) =
          maximalOutputPurity p (tensorOscillatorChannel (m := fun _ : Fin r => 1) (fun _ => E))) ∧
        ∀ rho : State (Occupation (Σ _ : Fin r, Fin 1)), IsCenteredGaussianDensity rho →
          OscillatorMajorizes
            (tensorOscillatorChannel (m := fun _ : Fin r => 1) (fun _ => E)
              (productInput (m := fun _ : Fin r => 1) (fun _ => rho0)))
            (tensorOscillatorChannel (m := fun _ : Fin r => 1) (fun _ => E) rho.coefficients) := 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, Proposition 1, corrected regular-case optimal-product majorization
Read-back

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

Let E=(X,Y,Φ,out)E=(X,Y,\Phi,\mathrm{out})E=(X,Y,Φ,out) be a centered one-mode oscillator channel with det⁡X≠0\det X\ne0detX=0 and YYY positive definite. For the meaning of its state spaces, 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​∥<∞, and it is a state when additionally its finite quadratic forms are real and nonnegative and its real diagonal is summable with sum 111. For a finite mode set III, use 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 the characteristic

χA(ξ)=∑u∑vAuv∏i∈IDvi,ui ⁣(−ξi,0+iξi,12),Dab(z)=e−∣z∣2/2a! b!∑ℓ=0min⁡(a,b)za−ℓ(−z‾)b−ℓℓ! (a−ℓ)! (b−ℓ)!.\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), \quad 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)!}.χA​(ξ)=u∑​v∑​Auv​i∈I∏​Dvi​,ui​​(−2​ξi,0​+iξi,1​​),Dab​(z)=e−∣z∣2/2a!b!​ℓ=0∑min(a,b)​ℓ!(a−ℓ)!(b−ℓ)!za−ℓ(−z)b−ℓ​.

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 characteristic e−ξTJITGJIξ/4e^{-\xi^{\mathsf T}J_I^{\mathsf T}GJ_I\xi/4}e−ξTJIT​GJI​ξ/4. The 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; Φ\PhiΦ preserves nuclear matrices, is additive and complex homogeneous on them, and every finite blockwise extension preserves states, including the vacuous extension size 000. Its specified output state has coefficients Φ(A)\Phi(A)Φ(A), summable characteristic series, and characteristic χA(JITXJIξ)e−ξTJITYJIξ/4\chi_A(J_I^{\mathsf T}XJ_I\xi)e^{-\xi^{\mathsf T}J_I^{\mathsf T}YJ_I\xi/4}χA​(JIT​XJI​ξ)e−ξTJIT​YJI​ξ/4 for every input state AAA. Let R(A)R(A)R(A) be a chosen bounded operator with coefficients AAA if one exists, and 000 otherwise, and 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}, \quad 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,∗​,

where powers use continuous functional calculus and extended nonnegative real powers, and ofReal⁡(t)=max⁡(t,0)\operatorname{ofReal}(t)=\max(t,0)ofReal(t)=max(t,0). On rrr one-mode blocks, let TE,r\mathcal T_{E,r}TE,r​ apply Φ\PhiΦ successively in increasing block order, with block iii acting by (Φ(i)A)uv=Φ((Au[i←a],v[i←b])a,b)ui,vi(\Phi^{(i)}A)_{uv}=\Phi((A_{u[i\leftarrow a],v[i\leftarrow b]})_{a,b})_{u_i,v_i}(Φ(i)A)uv​=Φ((Au[i←a],v[i←b]​)a,b​)ui​,vi​​. There exists a single one-mode state ρ0∈C{0}\rho_0\in\mathcal C_{\{0\}}ρ0​∈C{0}​ whose coefficients are w(a)w(b)‾w(a)\overline{w(b)}w(a)w(b)​ for a unit vector w∈ℓ2(N{0};C)w\in\ell^2(\mathbb N^{\{0\}};\mathbb C)w∈ℓ2(N{0};C), such that for every real p>1p>1p>1,

∥Φ(ρ0)∥p,∗=Pp(Φ).\|\Phi(\rho_0)\|_{p,*}=P_p(\Phi).∥Φ(ρ0​)∥p,∗​=Pp​(Φ).

For every natural r>0r>0r>0, put A0(r)uv=∏i<r(ρ0)ui,viA_0^{(r)}{}_{uv}=\prod_{i<r}(\rho_0)_{u_i,v_i}A0(r)​uv​=∏i<r​(ρ0​)ui​,vi​​. Then, for every real p>1p>1p>1,

∥TE,r(A0(r))∥p,∗=Pp(TE,r).\|\mathcal T_{E,r}(A_0^{(r)})\|_{p,*}=P_p(\mathcal T_{E,r}).∥TE,r​(A0(r)​)∥p,∗​=Pp​(TE,r​).

Furthermore, for every centered Gaussian state ρ\rhoρ on the mode set ∐i<r{0}\coprod_{i<r}\{0\}∐i<r​{0}, every natural kkk, including k=0k=0k=0, satisfies

sup⁡v0,…,vk−1∈ℓ2(N∐i<r{0};C)⟨va,vb⟩=δab∑j<kofReal⁡(Re⁡⟨vj,R(TE,r(ρ))vj⟩) ≤ sup⁡v0,…,vk−1∈ℓ2(N∐i<r{0};C)⟨va,vb⟩=δab∑j<kofReal⁡(Re⁡⟨vj,R(TE,r(A0(r)))vj⟩).\sup_{\substack{v_0,\ldots,v_{k-1}\in\ell^2(\mathbb N^{\coprod_{i<r}\{0\}};\mathbb C)\\ \langle v_a,v_b\rangle=\delta_{ab}}} \sum_{j<k}\operatorname{ofReal} \bigl(\operatorname{Re}\langle v_j,R(\mathcal T_{E,r}(\rho))v_j\rangle\bigr) \ \le\ \sup_{\substack{v_0,\ldots,v_{k-1}\in\ell^2(\mathbb N^{\coprod_{i<r}\{0\}};\mathbb C)\\ \langle v_a,v_b\rangle=\delta_{ab}}} \sum_{j<k}\operatorname{ofReal} \bigl(\operatorname{Re}\langle v_j,R(\mathcal T_{E,r}(A_0^{(r)}))v_j\rangle\bigr).v0​,…,vk−1​∈ℓ2(N∐i<r​{0};C)⟨va​,vb​⟩=δab​​sup​j<k∑​ofReal(Re⟨vj​,R(TE,r​(ρ))vj​⟩) ≤ v0​,…,vk−1​∈ℓ2(N∐i<r​{0};C)⟨va​,vb​⟩=δab​​sup​j<k∑​ofReal(Re⟨vj​,R(TE,r​(A0(r)​))vj​⟩).

Thus the same ρ0\rho_0ρ0​, chosen before ppp and rrr, satisfies all these equalities and inequalities; the k=0k=0k=0 sums are empty and equal to 000.

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