Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Complex representation of the gauge purification

Proved
QAlgorithms.Papers.Independent.Support50.P29.gaugePurificationCorrespondence

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

prove2quantum

Let s≥1s\ge1s≥1, ℏ>0\hbar>0ℏ>0, and let NNN be a Hermitian positive semidefinite s×ss\times ss×s occupation matrix. Put

α=ℏ[Re⁡N+I/2−Im⁡NIm⁡NRe⁡N+I/2].\alpha=\hbar\begin{bmatrix}\operatorname{Re}N+I/2&-\operatorname{Im}N\\\operatorname{Im}N&\operatorname{Re}N+I/2\end{bmatrix}.α=ℏ[ReN+I/2ImN​−ImNReN+I/2​].

Construct α12\alpha_{12}α12​ with the reflected-reference purification formula and let Δ12=diag⁡(Δ,−Δ)\Delta_{12}=\operatorname{diag}(\Delta,-\Delta)Δ12​=diag(Δ,−Δ), where Δ=ℏ[0I−I0]\Delta=\hbar\begin{bmatrix}0&I\\-I&0\end{bmatrix}Δ=ℏ[0−I​I0​]. Under C↦[Re⁡C−Im⁡CIm⁡CRe⁡C]C\mapsto\begin{bmatrix}\operatorname{Re}C&-\operatorname{Im}C\\\operatorname{Im}C&\operatorname{Re}C\end{bmatrix}C↦[ReCImC​−ImCReC​], together with the explicit permutation from (q1;q2;p1;p2)(q_1;q_2;p_1;p_2)(q1​;q2​;p1​;p2​) to (q1;p1;q2;p2)(q_1;p_1;q_2;p_2)(q1​;p1​;q2​;p2​), one has

Δ12−1α12 ⟷ [i(N+I/2)N2+NN2+N−i(N+I/2)].\Delta_{12}^{-1}\alpha_{12}\ \longleftrightarrow\ \begin{bmatrix}i(N+I/2)&\sqrt{N^2+N}\\\sqrt{N^2+N}&-i(N+I/2)\end{bmatrix}.Δ12−1​α12​ ⟷ [i(N+I/2)N2+N​​N2+N​−i(N+I/2)​].

The square root is the nonnegative spectral square root. This algebraic representation includes zero occupation; no ordinary-density P integral at singular NNN is asserted. It makes the purification available for the subsequent one-mode channel calculation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P29
Formal statement
noncomputable section

open Filter

open scoped BigOperators ENNReal Topology ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Support50.P29

open QAlgorithms.RealRegisters (Hilbert)

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

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity rankOne productCoeff tensorApply IsTraceClassChannel)

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

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

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

open QAlgorithms.Papers.Independent.Frontier30.P14 (partialRight PureDensity)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (tracePair thermalInput thermalPurificationDensity vacuumChannel exchangeMatrix RealizedDensity)

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

open QAlgorithms.Papers.Independent.Information100.P49 (thermalEntropy)

/-- Holevo quant-ph/9809022v1, PDF pp.7-8, (3.8): exact complex
representation after the explicit middle-block shuffle. Positive semidefinite
occupation is enough: no ordinary Lebesgue P-density integral is asserted
at singular N, and the vacuum boundary is retained. -/
theorem gaugePurificationCorrespondence (s : ℕ) (hs : 0 < s)
    (hbar : ℝ) (hhbar : 0 < hbar) (N : Matrix (Fin s) (Fin s) ℂ)
    (hN : N.PosSemidef) :
    (reflectedDelta s hbar)⁻¹ * purificationCovariance hbar (gaugeCovariance hbar N) =
      (realify (gaugePurificationMatrix N)).submatrix shuffle shuffle := by sorry

end QAlgorithms.Papers.Independent.Support50.P29

end
Source
Sending Quantum Information with Gaussian States, arXiv:quant-ph/9809022v1, PDF p. 8, §3, equation (3.8): complex representation of gauge-invariant purification
Read-back

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

For every positive natural number sss, every real ℏ>0\hbar>0ℏ>0, and every positive semidefinite complex s×ss\times ss×s matrix NNN, the following matrix identity holds. Write

Δ=ℏ(01s−1s0),R(M)=(Re⁡M−Im⁡MIm⁡MRe⁡M),α=ℏ R ⁣(N+121s).\Delta=\hbar\begin{pmatrix}0&1_s\\-1_s&0\end{pmatrix}, \qquad \mathcal R(M)= \begin{pmatrix}\operatorname{Re}M&-\operatorname{Im}M\\ \operatorname{Im}M&\operatorname{Re}M\end{pmatrix}, \qquad \alpha=\hbar\,\mathcal R\!\left(N+\tfrac12 1_s\right).Δ=ℏ(0−1s​​1s​0​),R(M)=(ReMImM​−ImMReM​),α=ℏR(N+21​1s​).

For any finite complex matrix MMM and function f:C→Cf:\mathbb C\to\mathbb Cf:C→C, let Ff(M)\mathcal F_f(M)Ff​(M) be Qdiag⁡(f(dj))Q−1Q\operatorname{diag}(f(d_j))Q^{-1}Qdiag(f(dj​))Q−1, using a chosen invertible diagonalization M=Qdiag⁡(dj)Q−1M=Q\operatorname{diag}(d_j)Q^{-1}M=Qdiag(dj​)Q−1 if one exists, and let it be zero otherwise. For a finite real matrix LLL, let

S(L)=Re⁡F z↦Re⁡z(L),\mathcal S(L)=\operatorname{Re}\mathcal F_{\,z\mapsto\sqrt{\operatorname{Re}z}}(L),S(L)=ReFz↦Rez​​(L),

where LLL is first viewed as complex and the real part is taken entrywise; the real square root equals zero for negative inputs. Define

B=Δ S ⁣(−(Δ−1α)2−1412s),Γ=(αB−Bα),Δref=(Δ00−Δ),B=\Delta\,\mathcal S\!\left(-(\Delta^{-1}\alpha)^2-\tfrac14 1_{2s}\right), \qquad \Gamma=\begin{pmatrix}\alpha&B\\-B&\alpha\end{pmatrix}, \qquad \Delta_{\mathrm{ref}}=\begin{pmatrix}\Delta&0\\0&-\Delta\end{pmatrix},B=ΔS(−(Δ−1α)2−41​12s​),Γ=(α−B​Bα​),Δref​=(Δ0​0−Δ​),

and

C=F z↦Re⁡z(N2+N),G=(i(N+121s)CC−i(N+121s)).C=\mathcal F_{\,z\mapsto\sqrt{\operatorname{Re}z}}(N^2+N), \qquad G=\begin{pmatrix} i(N+\tfrac12 1_s)&C\\ C&-i(N+\tfrac12 1_s) \end{pmatrix}.C=Fz↦Rez​​(N2+N),G=(i(N+21​1s​)C​C−i(N+21​1s​)​).

Let π\piπ be the permutation of four blocks of sss indices which exchanges the second and third blocks and fixes the first and fourth; explicitly, on the nested disjoint-union indices it sends (L,L,j)(L,L,j)(L,L,j) to (L,L,j)(L,L,j)(L,L,j), (L,R,j)(L,R,j)(L,R,j) to (R,L,j)(R,L,j)(R,L,j), (R,L,j)(R,L,j)(R,L,j) to (L,R,j)(L,R,j)(L,R,j), and (R,R,j)(R,R,j)(R,R,j) to (R,R,j)(R,R,j)(R,R,j). Then

Δref−1Γ=(R(G)π(a),π(b))a,b.\Delta_{\mathrm{ref}}^{-1}\Gamma =\bigl(\mathcal R(G)_{\pi(a),\pi(b)}\bigr)_{a,b}.Δref−1​Γ=(R(G)π(a),π(b)​)a,b​.
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