Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Signed standard-form symplectic decomposition and reduced Gibbs matrix

Proved
QAlgorithms.Papers.Independent.Support50.P03.standard_form_diagonalization

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

prove2quantum

Let a,b,c∈Ra,b,c\in\mathbb Ra,b,c∈R and suppose that V=[accb]⊕[a−c−cb]V=\left[\begin{smallmatrix}a&c\\c&b\end{smallmatrix}\right]\oplus\left[\begin{smallmatrix}a&-c\\-c&b\end{smallmatrix}\right]V=[ac​cb​]⊕[a−c​−cb​] is a physical covariance matrix with vacuum covariance I/2I/2I/2. Set V0=[accb]V_0=\left[\begin{smallmatrix}a&c\\c&b\end{smallmatrix}\right]V0​=[ac​cb​], C=I2⊕σZC=I_2\oplus\sigma_ZC=I2​⊕σZ​, y=(a+b)2−4c2y=(a+b)^2-4c^2y=(a+b)2−4c2 and

ν±=y±(b−a)2,D=diag⁡(ν−,ν+),ω+=a+b+y2y,ω−=sgn⁡(c)a+b−y2y,S0=[ω+ω−ω−ω+],\nu_\pm=\frac{\sqrt y\pm(b-a)}2,\quad D=\operatorname{diag}(\nu_-,\nu_+),\quad \omega_+=\sqrt{\frac{a+b+\sqrt y}{2\sqrt y}},\quad \omega_-=\operatorname{sgn}(c)\sqrt{\frac{a+b-\sqrt y}{2\sqrt y}},\quad S_0=\begin{bmatrix}\omega_+&\omega_-\\\omega_-&\omega_+\end{bmatrix},ν±​=2y​±(b−a)​,D=diag(ν−​,ν+​),ω+​=2y​a+b+y​​​,ω−​=sgn(c)2y​a+b−y​​​,S0​=[ω+​ω−​​ω−​ω+​​],

where sgn⁡(0)=0\operatorname{sgn}(0)=0sgn(0)=0. Then a,b≥1/2a,b\ge1/2a,b≥1/2, y>0y>0y>0, ν±≥1/2\nu_\pm\ge1/2ν±​≥1/2, and

∣c∣≤min⁡ ⁣{(a−1/2)(b+1/2),(a+1/2)(b−1/2)},V0=S0DS0T,S=C(S0⊕S0)C,SΩST=Ω,V=S(D⊕D)ST.|c|\le\min\!\left\{\sqrt{(a-1/2)(b+1/2)},\sqrt{(a+1/2)(b-1/2)}\right\},\quad V_0=S_0DS_0^T,\quad S=C(S_0\oplus S_0)C,\quad S\Omega S^T=\Omega,\quad V=S(D\oplus D)S^T.∣c∣≤min{(a−1/2)(b+1/2)​,(a+1/2)(b−1/2)​},V0​=S0​DS0T​,S=C(S0​⊕S0​)C,SΩST=Ω,V=S(D⊕D)ST.

If ν±>1/2\nu_\pm>1/2ν±​>1/2, put A=arcoth⁡(2D)A=\operatorname{arcoth}(2D)A=arcoth(2D) and define G=−2ΩS(A⊕A)STΩG=-2\Omega S(A\oplus A)S^T\OmegaG=−2ΩS(A⊕A)STΩ as in (6). Its reduced expression is

G=−2ΩC((S0AS0)⊕(S0AS0))CΩ.G=-2\Omega C\big((S_0AS_0)\oplus(S_0AS_0)\big)C\Omega.G=−2ΩC((S0​AS0​)⊕(S0​AS0​))CΩ.

This gives explicit normal modes and a two-dimensional Gibbs factor. The signed off-diagonal square root extends the printed parametrization to physical standard covariances with either sign of ccc.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P03
Formal statement
noncomputable section

open Filter

open scoped BigOperators ComplexOrder Topology Matrix

namespace QAlgorithms.Papers.Independent.Support50.P03

open QAlgorithms.Papers.Independent.Dependency50.P10
  (Phase complexify sigma thermalCovariance)

open QAlgorithms.Papers.Independent.Frontier30.P02 (PhaseMatrix)

/-- Appendix E, arXiv:1608.06991v2, PDF p.12, (E4)--(E9).
Source correction: printed (E3) has c rather than abs c and (E5) has a positive
omega_minus. Physicality is retained and omega_minus is signed by c (zero at
c=0), so reconstruction also holds for negative c. Denominators and spectral
bounds are conclusions, not assumed diagonalization identities. Gibbs equality
is asserted only when the covariance is faithful; pure-mode diagonalization
is included. The correction awaits independent moderation. -/
theorem standard_form_diagonalization (a b c : ℝ)
    (hV : HalfVacuumCovariance (standardCovariance a b c)) :
    (1 / 2 : ℝ) ≤ a ∧ (1 / 2 : ℝ) ≤ b ∧
    |c| ≤ min (Real.sqrt ((a - 1 / 2) * (b + 1 / 2)))
      (Real.sqrt ((a + 1 / 2) * (b - 1 / 2))) ∧
    0 < standardY a b c ∧
    (∀ j, (1 / 2 : ℝ) ≤ standardSpectrum a b c j) ∧
    standardV0 a b c = standardS0 a b c * Matrix.diagonal (standardSpectrum a b c) *
      (standardS0 a b c).transpose ∧
    standardS a b c ∈ Matrix.symplecticGroup (Fin 2) ℝ ∧
    standardCovariance a b c = standardS a b c *
      thermalCovariance (standardSpectrum a b c) * (standardS a b c).transpose ∧
    (FaithfulSpectrum (standardSpectrum a b c) →
      gibbsMatrix (standardS a b c) (standardSpectrum a b c) =
        (-2 : ℝ) • (sigma 2 * standardParity * repeatBlock (standardReducedGibbs a b c) *
          standardParity * sigma 2)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P03

end
Source
Gaussian hypothesis testing and quantum illumination, arXiv:1608.06991v2, PDF p. 12, Appendix E, (E4)–(E9), corrected signs
Read-back

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

For every a,b,c∈Ra,b,c\in\mathbb Ra,b,c∈R, put A=(accb)A=\begin{pmatrix}a&c\\c&b\end{pmatrix}A=(ac​cb​), Z=diag⁡(1,−1)Z=\operatorname{diag}(1,-1)Z=diag(1,−1), P=diag⁡(I2,Z)P=\operatorname{diag}(I_2,Z)P=diag(I2​,Z), V=Pdiag⁡(A,A)PV=P\operatorname{diag}(A,A)PV=Pdiag(A,A)P, and Σ=(0I2−I20)\Sigma=\begin{pmatrix}0&I_2\\-I_2&0\end{pmatrix}Σ=(0−I2​​I2​0​). Suppose that VT=VV^{\mathsf T}=VVT=V, that VVV is positive definite, and that VC+i2ΣCV_{\mathbb C}+\frac{i}{2}\Sigma_{\mathbb C}VC​+2i​ΣC​ is positive semidefinite, where the subscript C\mathbb CC denotes entrywise inclusion into complex matrices. Define

y=(a+b)2−4c2,ν0=y−(b−a)2,ν1=y+(b−a)2,ω+=a+b+y2y,ω−={0,c=0,a+b−y2y,c>0,−a+b−y2y,c<0,y=(a+b)^2-4c^2,\qquad \nu_0=\frac{\sqrt y-(b-a)}2,\qquad \nu_1=\frac{\sqrt y+(b-a)}2,\qquad \omega_+=\sqrt{\frac{a+b+\sqrt y}{2\sqrt y}}, \qquad \omega_-= \begin{cases} 0,&c=0,\\ \sqrt{\dfrac{a+b-\sqrt y}{2\sqrt y}},&c>0,\\ -\sqrt{\dfrac{a+b-\sqrt y}{2\sqrt y}},&c<0, \end{cases}y=(a+b)2−4c2,ν0​=2y​−(b−a)​,ν1​=2y​+(b−a)​,ω+​=2y​a+b+y​​​,ω−​=⎩⎨⎧​0,2y​a+b−y​​​,−2y​a+b−y​​​,​c=0,c>0,c<0,​

and put R=(ω+ω−ω−ω+)R=\begin{pmatrix}\omega_+&\omega_-\\\omega_-&\omega_+\end{pmatrix}R=(ω+​ω−​​ω−​ω+​​), D=diag⁡(ν0,ν1)D=\operatorname{diag}(\nu_0,\nu_1)D=diag(ν0​,ν1​), and S=Pdiag⁡(R,R)PS=P\operatorname{diag}(R,R)PS=Pdiag(R,R)P. Here square roots are the nonnegative real square roots, with the total convention x=0\sqrt{x}=0x​=0 for x<0x<0x<0, and real division is total, with division by zero equal to zero. Then a≥12a\ge\frac12a≥21​, b≥12b\ge\frac12b≥21​, ∣c∣≤min⁡{(a−12)(b+12),(a+12)(b−12)}|c|\le\min\{\sqrt{(a-\frac12)(b+\frac12)},\sqrt{(a+\frac12)(b-\frac12)}\}∣c∣≤min{(a−21​)(b+21​)​,(a+21​)(b−21​)​}, y>0y>0y>0, and ν0,ν1≥12\nu_0,\nu_1\ge\frac12ν0​,ν1​≥21​. Furthermore, A=RDRTA=RDR^{\mathsf T}A=RDRT, SSS belongs to the real symplectic matrix group, equivalently STΣS=ΣS^{\mathsf T}\Sigma S=\SigmaSTΣS=Σ, and V=Sdiag⁡(D,D)STV=S\operatorname{diag}(D,D)S^{\mathsf T}V=Sdiag(D,D)ST. Finally, if both ν0>12\nu_0>\frac12ν0​>21​ and ν1>12\nu_1>\frac12ν1​>21​, define r(x)=12log⁡ ⁣(x+1x−1)r(x)=\frac12\log\!\left(\frac{x+1}{x-1}\right)r(x)=21​log(x−1x+1​), T=diag⁡(r(2ν0),r(2ν1))T=\operatorname{diag}(r(2\nu_0),r(2\nu_1))T=diag(r(2ν0​),r(2ν1​)), and H=RTRH=RTRH=RTR; then

−2ΣSdiag⁡(T,T)STΣ=−2ΣPdiag⁡(H,H)PΣ.-2\Sigma S\operatorname{diag}(T,T)S^{\mathsf T}\Sigma = -2\Sigma P\operatorname{diag}(H,H)P\Sigma.−2ΣSdiag(T,T)STΣ=−2ΣPdiag(H,H)PΣ.
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

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