Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, unnumbered Lemma: squeezed physical covariance sequence

Proved
QAlgorithms.Papers.Independent.Next46.P18.squeezed_covariance_sequence

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

prove2quantum

Let sA,sBs_A,s_BsA​,sB​ be finite mode counts, ΔA\Delta_AΔA​ the canonical real symplectic matrix, and K:R2sB→R2sAK:\mathbb R^{2s_B}\to\mathbb R^{2s_A}K:R2sB​→R2sA​ a real matrix with KTΔAK=0K^{\mathsf T}\Delta_AK=0KTΔA​K=0. There is a sequence of real symmetric matrices γn\gamma_nγn​ such that

γn±i2ΔA⪰0for every n,KTγnK⟶0.\gamma_n\pm\frac i2\Delta_A\succeq0\quad\text{for every }n,\qquad K^{\mathsf T}\gamma_nK\longrightarrow0.γn​±2i​ΔA​⪰0for every n,KTγn​K⟶0.

Convergence is in the finite-dimensional matrix topology. No noise covariance, rank-surjectivity or quantum-input assumption is required. Zero coupling and zero-dimensional phase spaces are allowed. The statement supplies physical squeezed covariances with arbitrarily small compressed fluctuations.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P18
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped ENNReal Topology BigOperators ComplexOrder BoundedContinuousFunction

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33

open QAlgorithms.Papers.Independent.Frontier18.P01
  (Channel homogeneousEntropy mutualInformation boundedConjugation traceFirst traceSecond)

open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff)

open QAlgorithms.Papers.Independent.Frontier30.P10 (HilbertPOVM)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (ScaledWeylRepresentation InterleavedPhase physicalCommutationMatrix
   gaussianFunction weylTraceCharacteristic tracePair)

open QAlgorithms.Papers.Independent.Claimed50.P13
  (PositiveObservable zeroObservable feasibleStates informationSupremum
   operationalAssistedCapacity regularizedUnassistedCapacity)

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex quantumCovariance)

namespace QAlgorithms.Papers.Independent.Next46.P18

attribute [local instance] Classical.propDecidable Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

/-- Holevo arXiv:1211.4774v1, PDF pp.7-8, unnumbered Lemma.
Only compressed covariances converge. K=0 and zero mode counts are permitted. -/
theorem squeezed_covariance_sequence {s t : ℕ}
    (K : Matrix (QuadratureIndex s) (QuadratureIndex t) ℝ) (hisotropic : K.transpose * (physicalCommutationMatrix s 1) * K = 0) :
    ∃ gamma : ℕ → Matrix (QuadratureIndex s) (QuadratureIndex s) ℝ,
      (∀ n, quantumCovariance ((2 : ℝ) • gamma n)) ∧
      Tendsto (fun n => K.transpose * gamma n * K) atTop (𝓝 0) := by sorry

end QAlgorithms.Papers.Independent.Next46.P18

end
Source
Gaussian classical-quantum channels: gain of entanglement-assistance, arXiv:1211.4774v1, PDF p. 7, §3, unnumbered Lemma: squeezed physical covariance sequence
Read-back

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

For every pair of natural numbers s,ts,ts,t, including zero, index the 2r2r2r coordinates of R2r\mathbb R^{2r}R2r by (j,a)∈{0,…,r−1}×{0,1}(j,a)\in\{0,\ldots,r-1\}\times\{0,1\}(j,a)∈{0,…,r−1}×{0,1}, and let Ωr\Omega_rΩr​ be the matrix whose entries within each coordinate pair are (Ωr)(j,0),(j,1)=1(\Omega_r)_{(j,0),(j,1)}=1(Ωr​)(j,0),(j,1)​=1 and (Ωr)(j,1),(j,0)=−1(\Omega_r)_{(j,1),(j,0)}=-1(Ωr​)(j,1),(j,0)​=−1, with all other entries zero. For every real 2s×2t2s\times2t2s×2t matrix KKK satisfying KTΩsK=0K^{\mathsf T}\Omega_sK=0KTΩs​K=0, there exists a sequence of real 2s×2s2s\times2s2s×2s matrices (γn)n∈N(\gamma_n)_{n\in\mathbb N}(γn​)n∈N​ such that, for every nnn, the complex matrix 2γn+iΩs2\gamma_n+i\Omega_s2γn​+iΩs​ is positive semidefinite, and

KTγnK⟶0(n→∞).K^{\mathsf T}\gamma_nK\longrightarrow 0 \qquad(n\to\infty).KTγn​K⟶0(n→∞).

The convergence is in the usual finite-dimensional matrix topology, equivalently entrywise. When s=0s=0s=0 or t=0t=0t=0, the relevant matrices may have empty index sets; these cases are included.

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

    Confirmed by the moderator at approval.

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