Compatible ordinary diagonalization and Gibbs-matrix equivalence
ProvedQAlgorithms.Papers.Independent.Support50.P03.covariance_explicit_diagonalizationLet and let be a physical real covariance matrix in grouped coordinates , with and vacuum covariance . Thus is symmetric positive definite and . There exist symplectic eigenvalues and a real symplectic matrix , with and , where . For every such Williamson decomposition, set and . Then is invertible and
If every , set , where on . The primary spectral matrix function obeys
These identities give compatible ordinary eigenvectors and the equivalent Gibbs-matrix formula. Pure modes are included in the diagonalization; the matrix function is asserted on faithful covariances only.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P03
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 A, arXiv:1608.06991v2, PDF p.7, (A4)--(A13).
Every physical covariance has the displayed COMPATIBLE eigenvectors; arbitrary
ordinary eigenvectors are not assumed to give a real symplectic S. Pure modes
are included in diagonalization. Matrix arcoth and Gibbs identities require
faithfulness; interpolation on distinct eigenvalues gives the primary spectral
matrix function without applying the normal-operator CFC to iVOmega. -/
theorem covariance_explicit_diagonalization (n : ℕ) (hn : 0 < n)
(V : PhaseMatrix n) (hV : HalfVacuumCovariance V) :
(∃ (nu : Fin n → ℝ) (S : PhaseMatrix n), GroupedWilliamsonData V nu S) ∧
(∀ (nu : Fin n → ℝ) (S : PhaseMatrix n), GroupedWilliamsonData V nu S →
(let E := complexify S * modeEigenbasis n
IsUnit E.det ∧
Complex.I • (complexify V * complexify (sigma n)) =
E * complexify (signedDiagonal nu) * E⁻¹ ∧
complexify S = E * (modeEigenbasis n).conjTranspose ∧
(FaithfulSpectrum nu →
(let B := (2 * Complex.I) • (complexify V * complexify (sigma n))
spectralArcoth nu B =
E * complexify (signedDiagonal (fun j => realArcoth (2 * nu j))) * E⁻¹ ∧
(2 * Complex.I) • (complexify (sigma n) * spectralArcoth nu B) =
complexify (gibbsMatrix S nu))))) := by sorry
end QAlgorithms.Papers.Independent.Support50.P03
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer and every real matrix , suppose that , that is positive definite, and that is positive semidefinite, where denotes entrywise inclusion of a real matrix into the complex matrices and . There exist real numbers , indexed by , and a real symplectic matrix , meaning , such that every and , where . Moreover, for every and satisfying these conditions, define
Then , , and , where is the conjugate transpose. If, in addition, every , let , and let be the complex Lagrange interpolation polynomial on the set of distinct nodes , with prescribed value at each node ; thus repeated nodes are included only once, and explicitly . Writing , the following two identities hold:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.