Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, Eq. (15): general CM/EM commutation relation and shared normal form

Open
QAlgorithms.Papers.Independent.Intakenext100.P46.cm_em_conversion

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For a positive finite number of bosonic modes use Δ=(0I−I0)\Delta=\begin{pmatrix}0&I\\-I&0\end{pmatrix}Δ=(0−I​I0​) and real symmetric covariances in the vacuum-I/2I/2I/2 convention. Every covariance with α−iΔ/2>0\alpha-i\Delta/2>0α−iΔ/2>0 has a unique finite exponential matrix MMM, and every real positive-definite MMM has a unique physical covariance. Their common symplectic normal form obeys

α=Sdiag⁡(γ,γ)ST,STMS=diag⁡(m,m),γj=12coth⁡(mj/2),mj=ln⁡2γj+12γj−1,\alpha=S\operatorname{diag}(\gamma,\gamma)S^T,\quad S^TMS=\operatorname{diag}(m,m),\quad \gamma_j=\tfrac12\coth(m_j/2),\quad m_j=\ln\frac{2\gamma_j+1}{2\gamma_j-1},α=Sdiag(γ,γ)ST,STMS=diag(m,m),γj​=21​coth(mj​/2),mj​=ln2γj​−12γj​+1​,

where SSS is invertible and symplectic and mj>0m_j>0mj​>0. Moreover

MαΔ−1−Δ−1αM=0.M\alpha\Delta^{-1}-\Delta^{-1}\alpha M=0.MαΔ−1−Δ−1αM=0.

The scalar functions apply in the normal chart. These conversions concern finite exponential matrices; the pure-mode endpoint is not assigned a real logarithmic value. The finite exponential matrix refers to the actual normalized Gibbs density: after a bounded unitary implementing the stated symplectic transformation, its number-basis weights are ∏j(1−e−mj)e−mjnj\prod_j(1-e^{-m_j})e^{-m_j n_j}∏j​(1−e−mj​)e−mj​nj​. This operator meaning is part of the conclusion, alongside the covariance normal form.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P46

open scoped BigOperators ENNReal ComplexOrder Matrix

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsSeparable)

open QAlgorithms.Papers.Independent.Dependency50.P13
  (finiteRelativeEntropy compression entropyWeight)

open QAlgorithms.Papers.Independent.Claimed50.P47
  (Occupation bipartiteCharacteristic bipartiteWeyl gaussianStateCharacteristic)

-- These accepted definitions have the same completed Hilbert-space meaning.

open QAlgorithms.Papers.Independent.Next46.P13 (coordinateBasis)

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

open QAlgorithms.Papers.Independent.Claimed50.P41 (IsDiagonal)

/-- Chen, PDF pp.2–3, (4),(5),(14),(15): mutually inverse finite-chart CM/EM
conversion, actual spectral Gibbs densities, shared normal form and commutation.
Pure modes are excluded only
from this computational chart, not from any state theorem. -/
theorem cm_em_conversion {I : Type} [Fintype I] [Nonempty I] :
    (∀ alpha : ModeMatrix I, StrictPhysical alpha → ∃! M : ModeMatrix I, GaussianEM alpha M) ∧
    (∀ M : ModeMatrix I, M.PosDef → ∃! alpha : ModeMatrix I, IsPhysicalCovariance alpha ∧ GaussianEM alpha M) ∧
    (∀ alpha M : ModeMatrix I, CMEM alpha M →
      GaussianEM alpha M ∧ M.PosDef ∧ M * alpha * (groupedCCR I)⁻¹ - (groupedCCR I)⁻¹ * alpha * M = 0 ∧
      ∃ (S : ModeMatrix I) (g m : I → ℝ), IsSymplecticMatrix S ∧
        (∀ j, 0 < m j ∧ g j = (1 / 2) * coth (m j / 2) ∧ m j = modeEM (g j)) ∧
        alpha = S * normalDiagonal g * S.transpose ∧
        S.transpose * M * S = normalDiagonal m) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P46

end
Source
Gaussian relative entropy of entanglement, arXiv:quant-ph/0402109v3, PDF p. 3, §2, Eq. (15): general CM/EM commutation relation and shared normal form
Read-back

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

For every finite nonempty type III, all matrices below are real matrices indexed by I⊔II\sqcup II⊔I. Put J=(0I−I0)J=\begin{pmatrix}0&I\\-I&0\end{pmatrix}J=(0−I​I0​), D(g)=diag⁡(diag⁡g,diag⁡g)D(g)=\operatorname{diag}(\operatorname{diag}g,\operatorname{diag}g)D(g)=diag(diagg,diagg), e(x)=log⁡ ⁣2x+12x−1e(x)=\log\!\frac{2x+1}{2x-1}e(x)=log2x−12x+1​, and coth⁡x=cosh⁡x/sinh⁡x\coth x=\cosh x/\sinh xcothx=coshx/sinhx. Call α\alphaα physical when αT=α\alpha^T=\alphaαT=α and α−i2J\alpha-\tfrac i2Jα−2i​J is positive semidefinite after complexification, and strictly physical when the latter matrix is positive definite. In this paragraph, symplectic means invertible and satisfying SJST=JSJS^T=JSJST=J. Define C(α,M)C(\alpha,M)C(α,M) to mean that there exist a symplectic SSS and g:I→Rg:I\to\mathbb Rg:I→R, with every gj>12g_j>\tfrac12gj​>21​, such that α=SD(g)ST\alpha=SD(g)S^Tα=SD(g)ST and M=S−TD(e∘g)S−1M=S^{-T}D(e\circ g)S^{-1}M=S−TD(e∘g)S−1. Define E(α,M)E(\alpha,M)E(α,M) to mean C(α,M)C(\alpha,M)C(α,M) together with the following property: every density coefficient matrix RRR on the occupation labels I→NI\to\mathbb NI→N having covariance α\alphaα and centered Gaussian characteristic admits a finite exponential representation with matrix MMM. Explicitly, such a density matrix has a nuclear expansion Ruv=∑rar(u)br(v)‾R_{uv}=\sum_r a_r(u)\overline{b_r(v)}Ruv​=∑r​ar​(u)br​(v)​ with ar,br∈ℓ2(I→N)a_r,b_r\in\ell^2(I\to\mathbb N)ar​,br​∈ℓ2(I→N) and ∑r∥ar∥∥br∥<∞\sum_r\|a_r\|\|b_r\|<\infty∑r​∥ar​∥∥br​∥<∞, real nonnegative finite quadratic forms, and a summable real diagonal with sum one; its centered Gaussian condition requires physical α\alphaα, summability of every inner and outer characteristic sum, and

∑u∑vRuv(Wξ)vu=e−ξTJTαJξ/2for every ξ.\sum_u\sum_vR_{uv}(W_\xi)_{vu} =e^{-\xi^TJ^T\alpha J\xi/2}\quad\text{for every }\xi.u∑​v∑​Ruv​(Wξ​)vu​=e−ξTJTαJξ/2for every ξ.

The Weyl matrix is

(Wξ)uv=∏j∈ID ⁣(−ξq,j+iξp,j2)ujvj,D(z)rs=e−∣z∣2/2r!s!∑l=0min⁡(r,s)zr−l(−z‾)s−ll!(r−l)!(s−l)!.(W_\xi)_{uv}=\prod_{j\in I}D\!\left(-\frac{\xi_{q,j}+i\xi_{p,j}}{\sqrt2}\right)_{u_jv_j}, \qquad D(z)_{rs}=e^{-|z|^2/2}\sqrt{r!s!} \sum_{l=0}^{\min(r,s)} \frac{z^{r-l}(-\overline z)^{s-l}}{l!(r-l)!(s-l)!}.(Wξ​)uv​=j∈I∏​D(−2​ξq,j​+iξp,j​​)uj​vj​​,D(z)rs​=e−∣z∣2/2r!s!​l=0∑min(r,s)​l!(r−l)!(s−l)!zr−l(−z)s−l​.

The required exponential representation consists of a symplectic TTT, numbers mj>0m_j>0mj​>0, and a unitary UUU on ℓ2(I→N)\ell^2(I\to\mathbb N)ℓ2(I→N) such that

CU−1(Wξ)=W−JTTJξ,R=CU(Km),M=T−TD(m)T−1,\mathcal C_{U^{-1}}(W_\xi)=W_{-JT^TJ\xi},\qquad R=\mathcal C_U(K_m),\qquad M=T^{-T}D(m)T^{-1},CU−1​(Wξ​)=W−JTTJξ​,R=CU​(Km​),M=T−TD(m)T−1,

where (Km)uv=0(K_m)_{uv}=0(Km​)uv​=0 for u≠vu\ne vu=v, (Km)uu=∏j(1−e−mj)e−mjuj(K_m)_{uu}=\prod_j(1-e^{-m_j})e^{-m_ju_j}(Km​)uu​=∏j​(1−e−mj​)e−mj​uj​, and CU(K)uv=∑aUua∑bKabUvb‾\mathcal C_U(K)_{uv}=\sum_a U_{ua}\sum_bK_{ab}\overline{U_{vb}}CU​(K)uv​=∑a​Uua​∑b​Kab​Uvb​​, with Uua=(Uδa)uU_{ua}=(U\delta_a)_uUua​=(Uδa​)u​. With these definitions, the declaration asserts all three statements:

∀α,α strictly physical ⟹ ∃!M, E(α,M),∀M,M positive definite ⟹ ∃!α, α physical and E(α,M),∀α,M,C(α,M) ⟹ E(α,M) ∧ M positive definite ∧ MαJ−1−J−1αM=0,\begin{gathered} \forall\alpha,\quad \alpha\text{ strictly physical}\ \Longrightarrow\ \exists!M,\ E(\alpha,M),\\ \forall M,\quad M\text{ positive definite}\ \Longrightarrow\ \exists!\alpha,\ \alpha\text{ physical and }E(\alpha,M),\\ \forall\alpha,M,\quad C(\alpha,M)\ \Longrightarrow\ E(\alpha,M)\ \land\ M\text{ positive definite}\ \land\ M\alpha J^{-1}-J^{-1}\alpha M=0, \end{gathered}∀α,α strictly physical ⟹ ∃!M, E(α,M),∀M,M positive definite ⟹ ∃!α, α physical and E(α,M),∀α,M,C(α,M) ⟹ E(α,M) ∧ M positive definite ∧ MαJ−1−J−1αM=0,​

and, under the last hypothesis, there also exist a symplectic SSS and functions g,m:I→Rg,m:I\to\mathbb Rg,m:I→R such that, for every jjj,

mj>0,gj=12coth⁡(mj/2),mj=e(gj),α=SD(g)ST,STMS=D(m).m_j>0,\qquad g_j=\tfrac12\coth(m_j/2),\qquad m_j=e(g_j), \qquad \alpha=SD(g)S^T,\qquad S^TMS=D(m).mj​>0,gj​=21​coth(mj​/2),mj​=e(gj​),α=SD(g)ST,STMS=D(m).

The functions in these definitions use total real division and logarithm, including 1/0=01/0=01/0=0 and log⁡0=0\log0=0log0=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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