Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered local Gaussification construction, (5)-(11)

Open
QAlgorithms.Papers.Independent.Support50.P14.localGaussification

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

prove2quantum

Let ρ\rhoρ be a normalized density on a nonempty finite collection of full oscillator modes, with zero first moments and finite symmetric covariance Γ\GammaΓ. For n=2mn=2^mn=2m, label the copies by binary strings k∈{0,1}mk\in\{0,1\}^mk∈{0,1}m and use the Sylvester matrix Hkl=(−1)k⋅lH_{kl}=(-1)^{k\cdot l}Hkl​=(−1)k⋅l. There exist bounded unitaries implementing H/nH/\sqrt nH/n​ on both quadratures of the copies at each site. Their action on ρ⊗n\rho^{\otimes n}ρ⊗n gives normalized states with computed one-copy marginals ρ~m,k\widetilde\rho_{m,k}ρ​m,k​. A normalized Gaussian density ρG\rho_GρG​ with moments (0,Γ)(0,\Gamma)(0,Γ) exists, and

∀ε>0 ∃m0 ∀m≥m0 ∀k∈{0,1}m:∥ρ~m,k−ρG∥1<ε.\forall\varepsilon>0\ \exists m_0\ \forall m\ge m_0\ \forall k\in\{0,1\}^m:\quad\|\widetilde\rho_{m,k}-\rho_G\|_1<\varepsilon.∀ε>0 ∃m0​ ∀m≥m0​ ∀k∈{0,1}m:∥ρ​m,k​−ρG​∥1​<ε.

Each marginal has the same moments and characteristic function χ(ξ/n)n+χ(−ξ/n)n−n+\chi(\xi/\sqrt n)^{n_+}\chi(-\xi/\sqrt n)^{n-n_+}χ(ξ/n​)n+​χ(−ξ/n​)n−n+​, where n+=nn_+=nn+​=n for the zero row and n+=n/2n_+=n/2n+​=n/2 otherwise. This construction supplies the local Gaussian limit used by Lemma 1.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P14
Formal statement
noncomputable section

open Filter

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Support50.P14

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsTraceClass traceSize)

open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (unitaryCoeff conjugateKernel boundedUnitaryConjugation)

open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

/-- Local Gaussification, PDF p.2, (5)--(11). For a centered finite-energy
input, actual bounded Sylvester copy mixers and their computed normalized
marginals converge in trace norm UNIFORMLY in the growing copy label.
The exact two characteristic-function formulas are retained. -/
theorem localGaussification {I : Type} [Fintype I] [Nonempty I]
    (rho : State (Occupation I)) (gamma : OscillatorCovariance I)
    (hmoments : CompleteMoments rho.coefficients 0 gamma) :
    ∃ rhoG : State (Occupation I), GaussianAt rhoG.coefficients 0 gamma ∧
    ∃ U : (m : ℕ) → Hilbert (Occupation (Copies Bool m)) ≃ₗᵢ[ℂ]
      Hilbert (Occupation (Copies Bool m)),
      (∀ m (xi : InterleavedQuadrature (Copies Bool m) → ℝ),
        boundedUnitaryConjugation (U m).symm (oscillatorWeylKernel xi) = oscillatorWeylKernel (mixedArgument m xi)) ∧
      (∀ m, IsDensity (conjugateKernel (copyMixerKernel m (U m))
        (copiesKernel m rho.coefficients))) ∧
      (∀ m (k : Copies Bool m),
        let reduced := copyMarginal (conjugateKernel (copyMixerKernel m (U m))
          (copiesKernel m rho.coefficients)) k
        IsDensity reduced ∧ CompleteMoments reduced 0 gamma ∧
        ∀ xi : InterleavedQuadrature I → ℝ,
          oscillatorCharacteristic reduced xi =
            oscillatorCharacteristic rho.coefficients (((Real.sqrt ((2 : ℝ) ^ m))⁻¹) • xi) ^
              positiveEntries m k *
            oscillatorCharacteristic rho.coefficients ((-(Real.sqrt ((2 : ℝ) ^ m))⁻¹) • xi) ^
              (2 ^ m - positiveEntries m k)) ∧
      (∀ epsilon : ℝ, 0 < epsilon → ∃ m0 : ℕ, ∀ m : ℕ, m0 ≤ m →
        ∀ k : Copies Bool m,
          traceSize (copyMarginal (conjugateKernel (copyMixerKernel m (U m))
            (copiesKernel m rho.coefficients)) k - rhoG.coefficients) <
              ENNReal.ofReal epsilon) := by sorry

end QAlgorithms.Papers.Independent.Support50.P14

end
Source
Extremality of Gaussian quantum states, arXiv:quant-ph/0509154v1, PDF p. 2, Unnumbered local Gaussification construction, (5)-(11)
Read-back

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

Let III be a finite nonempty type, let ρ\rhoρ be a density matrix indexed by occupations NI\mathbb N^INI, and let γ\gammaγ be a real matrix indexed by I×{0,1}I\times\{0,1\}I×{0,1}. Here a density on an index type LLL means a complex matrix XXX admitting an expansion Xx,y=∑rar(x)br(y)‾X_{x,y}=\sum_r a_r(x)\overline{b_r(y)}Xx,y​=∑r​ar​(x)br​(y)​, with ar,br∈ℓ2(L;C)a_r,b_r\in\ell^2(L;\mathbb C)ar​,br​∈ℓ2(L;C) and summable costs ∥ar∥2∥br∥2\|a_r\|_2\|b_r\|_2∥ar​∥2​∥br​∥2​, such that every finite quadratic form ∑x,y∈Fz(x)‾Xx,yz(y)\sum_{x,y\in F}\overline{z(x)}X_{x,y}z(y)∑x,y∈F​z(x)​Xx,y​z(y) is real and nonnegative, and such that its real diagonal is summable with sum 111. Write N(X)\mathcal N(X)N(X) for the infimum in [0,∞][0,\infty][0,∞] of those expansion costs, taking an empty infimum to be +∞+\infty+∞. For any finite mode type JJJ, define

D(z)r,s=e−∣z∣2/2r! s!∑h=0min⁡(r,s)zr−h(−z‾)s−hh! (r−h)! (s−h)!,WJ(ξ)u,v=∏j∈JD ⁣(−ξ(j,1)+iξ(j,0)2)u(j),v(j),χX(ξ)=∑u∑vXu,vWJ(ξ)v,u,E(X)=∑u∈NJ(∑ju(j))max⁡(Re⁡Xu,u,0)∈[0,∞],vγ(ξ)=∑a,bξ(a)γa,bξ(b).\begin{gathered} D(z)_{r,s} =e^{-|z|^2/2}\sqrt{r!\,s!} \sum_{h=0}^{\min(r,s)} \frac{z^{r-h}(-\overline z)^{s-h}}{h!\,(r-h)!\,(s-h)!},\\ W_J(\xi)_{u,v} =\prod_{j\in J}D\!\left(\frac{-\xi(j,1)+i\xi(j,0)}{\sqrt2}\right)_{u(j),v(j)},\qquad \chi_X(\xi)=\sum_u\sum_vX_{u,v}W_J(\xi)_{v,u},\\ E(X)=\sum_{u\in\mathbb N^J} \left(\sum_j u(j)\right)\max(\operatorname{Re}X_{u,u},0)\in[0,\infty], \qquad v_\gamma(\xi)=\sum_{a,b}\xi(a)\gamma_{a,b}\xi(b). \end{gathered}D(z)r,s​=e−∣z∣2/2r!s!​h=0∑min(r,s)​h!(r−h)!(s−h)!zr−h(−z)s−h​,WJ​(ξ)u,v​=j∈J∏​D(2​−ξ(j,1)+iξ(j,0)​)u(j),v(j)​,χX​(ξ)=u∑​v∑​Xu,v​WJ​(ξ)v,u​,E(X)=u∈NJ∑​(j∑​u(j))max(ReXu,u​,0)∈[0,∞],vγ​(ξ)=a,b∑​ξ(a)γa,b​ξ(b).​

Assume that ρ\rhoρ has the following complete moments with zero mean and matrix γ\gammaγ: E(ρ)<∞E(\rho)<\inftyE(ρ)<∞, γT=γ\gamma^{\mathsf T}=\gammaγT=γ, and for every ξ:I×{0,1}→R\xi:I\times\{0,1\}\to\mathbb Rξ:I×{0,1}→R, each inner family and the outer family of sums defining χρ(ξ)\chi_\rho(\xi)χρ​(ξ) are summable; furthermore gξ(t)=χρ(tξ)g_\xi(t)=\chi_\rho(t\xi)gξ​(t)=χρ​(tξ) has derivative 000 at 000, and its total derivative function has derivative −vγ(ξ)/2-v_\gamma(\xi)/2−vγ​(ξ)/2 there. Then there exists a density ρG\rho_GρG​ on NI\mathbb N^INI having these same complete moments and satisfying χρG(ξ)=exp⁡(−vγ(ξ)/4)\chi_{\rho_G}(\xi)=\exp(-v_\gamma(\xi)/4)χρG​​(ξ)=exp(−vγ​(ξ)/4) for every ξ\xiξ. There also exists, for every natural number mmm, a complex linear isometric equivalence UmU_mUm​ of ℓ2(NCm;C)\ell^2(\mathbb N^{C_m};\mathbb C)ℓ2(NCm​;C) with itself, where Cm={0,1}{0,…,m−1}C_m=\{0,1\}^{\{0,\ldots,m-1\}}Cm​={0,1}{0,…,m−1}, with all the following properties. For every real ξ:Cm×{0,1}→R\xi:C_m\times\{0,1\}\to\mathbb Rξ:Cm​×{0,1}→R, define

(Hmξ)(l,a)=∑k∈Cm(−1)∣{j:k(j)=l(j)=1}∣2mξ(k,a).(H_m\xi)(l,a) =\sum_{k\in C_m} \frac{(-1)^{|\{j:k(j)=l(j)=1\}|}}{\sqrt{2^m}}\xi(k,a).(Hm​ξ)(l,a)=k∈Cm​∑​2m​(−1)∣{j:k(j)=l(j)=1}∣​ξ(k,a).

Writing Vx,y=(Um−1ey)(x)V_{x,y}=(U_m^{-1}e_y)(x)Vx,y​=(Um−1​ey​)(x), where eye_yey​ is the coordinate unit vector, the inverse equivalence satisfies the coefficient identity

∑xVu,x(∑yWCm(ξ)x,yVv,y‾)=WCm(Hmξ)u,vfor every u,v∈NCm.\sum_xV_{u,x}\left(\sum_yW_{C_m}(\xi)_{x,y}\overline{V_{v,y}}\right) =W_{C_m}(H_m\xi)_{u,v} \quad\text{for every }u,v\in\mathbb N^{C_m}.x∑​Vu,x​(y∑​WCm​​(ξ)x,y​Vv,y​​)=WCm​​(Hm​ξ)u,v​for every u,v∈NCm​.

For occupations u,v:I×Cm→Nu,v:I\times C_m\to\mathbb Nu,v:I×Cm​→N, define

Pm(u,v)=∏k∈Cmρuk,vk,uk(j)=u(j,k),Km(u,v)=∏j∈I(Umevj)(uj),uj(k)=u(j,k),P_m(u,v)=\prod_{k\in C_m}\rho_{u_k,v_k}, \quad u_k(j)=u(j,k),\qquad K_m(u,v)=\prod_{j\in I}(U_me_{v_j})(u_j), \quad u_j(k)=u(j,k),Pm​(u,v)=k∈Cm​∏​ρuk​,vk​​,uk​(j)=u(j,k),Km​(u,v)=j∈I∏​(Um​evj​​)(uj​),uj​(k)=u(j,k),

and

Tm(u,v)=∑xKm(u,x)(∑yPm(x,y)Km(v,y)‾).T_m(u,v)=\sum_xK_m(u,x)\left(\sum_yP_m(x,y)\overline{K_m(v,y)}\right).Tm​(u,v)=x∑​Km​(u,x)(y∑​Pm​(x,y)Km​(v,y)​).

For every mmm, TmT_mTm​ is a density. For every k∈Cmk\in C_mk∈Cm​, define its selected-copy matrix by

Rm,k(u,v)=∑r:I×(Cm∖{k})→NTm(insert⁡k(u,r),insert⁡k(v,r)),R_{m,k}(u,v)= \sum_{r:I\times(C_m\setminus\{k\})\to\mathbb N} T_m\bigl(\operatorname{insert}_k(u,r),\operatorname{insert}_k(v,r)\bigr),Rm,k​(u,v)=r:I×(Cm​∖{k})→N∑​Tm​(insertk​(u,r),insertk​(v,r)),

where insert⁡k(u,r)(j,l)=u(j)\operatorname{insert}_k(u,r)(j,l)=u(j)insertk​(u,r)(j,l)=u(j) when l=kl=kl=k, and r(j,l)r(j,l)r(j,l) otherwise. Then Rm,kR_{m,k}Rm,k​ is a density and has the same complete zero-mean moments and matrix γ\gammaγ described above, and for every real ξ:I×{0,1}→R\xi:I\times\{0,1\}\to\mathbb Rξ:I×{0,1}→R,

χRm,k(ξ)=χρ ⁣(ξ2m)pm(k)χρ ⁣(−ξ2m)2m−pm(k),pm(k)={2m,k is identically 0,2m/2,otherwise,\chi_{R_{m,k}}(\xi) = \chi_\rho\!\left(\frac{\xi}{\sqrt{2^m}}\right)^{p_m(k)} \chi_\rho\!\left(-\frac{\xi}{\sqrt{2^m}}\right)^{2^m-p_m(k)}, \qquad p_m(k)= \begin{cases} 2^m,&k\text{ is identically }0,\\ 2^m/2,&\text{otherwise}, \end{cases}χRm,k​​(ξ)=χρ​(2m​ξ​)pm​(k)χρ​(−2m​ξ​)2m−pm​(k),pm​(k)={2m,2m/2,​k is identically 0,otherwise,​

where the division in pmp_mpm​ is natural-number division. Finally, the convergence is uniform over the selected copy:

∀ϵ>0 ∃m0∈N ∀m≥m0 ∀k∈Cm,N(Rm,k−ρG)<ϵ.\forall\epsilon>0\ \exists m_0\in\mathbb N\ \forall m\ge m_0\ \forall k\in C_m,\qquad \mathcal N(R_{m,k}-\rho_G)<\epsilon.∀ϵ>0 ∃m0​∈N ∀m≥m0​ ∀k∈Cm​,N(Rm,k​−ρG​)<ϵ.

All natural numbers mmm, including 000, are covered: at m=0m=0m=0, there is one copy, p0(k)=1p_0(k)=1p0​(k)=1, and the second characteristic-function factor has exponent 000, so equals 111 even when its base is 000. The coefficient sums used in the definitions are totalized sums, equal to 000 for nonsummable complex families; summability is explicitly required for the characteristic functions in the complete-moment conditions, but is not separately asserted for every conjugation or marginal sum.

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