Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, Eq. (39) and following display: exceptional and symmetric border constructions

Open
QAlgorithms.Papers.Independent.Intakenext100.P46.type_iii_iv_borders

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

prove2quantum

For γA,γB≥1/2\gamma_A,\gamma_B\ge1/2γA​,γB​≥1/2 put δ=(γA2−1/4)(γB2−1/4)\delta=(\gamma_A^2-1/4)(\gamma_B^2-1/4)δ=(γA2​−1/4)(γB2​−1/4) and D=diag⁡(γA,γB,γA,γB)D=\operatorname{diag}(\gamma_A,\gamma_B,\gamma_A,\gamma_B)D=diag(γA​,γB​,γA​,γB​). The two exceptional blocks are

Q_L=\begin{pmatrix}(1+\delta/\gamma_A^2)^{1/4}&0\\[\delta^2/(\gamma_A^2(\gamma_B^2+\delta))]^{1/4}&[\gamma_B^2/(\gamma_B^2+\delta)]^{1/4}\end{pmatrix}, QU=([γA2/(γA2+δ)]1/4[δ2/(γB2(γA2+δ))]1/40(1+δ/γB2)1/4).Q_U=\begin{pmatrix}[\gamma_A^2/(\gamma_A^2+\delta)]^{1/4}&[\delta^2/(\gamma_B^2(\gamma_A^2+\delta))]^{1/4}\\0&(1+\delta/\gamma_B^2)^{1/4}\end{pmatrix}.QU​=([γA2​/(γA2​+δ)]1/40​[δ2/(γB2​(γA2​+δ))]1/4(1+δ/γB2​)1/4​).

The symmetric block is QS=2−1/2(s1s2s1−s2)Q_S=2^{-1/2}\begin{pmatrix}s_1&s_2\\s_1&-s_2\end{pmatrix}QS​=2−1/2(s1​s1​​s2​−s2​​), where

s1=[4γA2(4γB2+1)4γA2+1]1/4,s2=[4γB2+14γB2(4γA2+1)]1/4.s_1=\left[\frac{4\gamma_A^2(4\gamma_B^2+1)}{4\gamma_A^2+1}\right]^{1/4},\qquad s_2=\left[\frac{4\gamma_B^2+1}{4\gamma_B^2(4\gamma_A^2+1)}\right]^{1/4}.s1​=[4γA2​+14γA2​(4γB2​+1)​]1/4,s2​=[4γB2​(4γA2​+1)4γB2​+1​]1/4.

For each block QQQ, S=Q⊕Q−TS=Q\oplus Q^{-T}S=Q⊕Q−T is symplectic and SDSTSDS^TSDST is physical and lies on the actual Gaussian separability border. If both normal eigenvalues exceed 1/21/21/2, its finite EM is S−Tdiag⁡(m,m)S−1S^{-T}\operatorname{diag}(m,m)S^{-1}S−Tdiag(m,m)S−1 with mj=ln⁡((2γj+1)/(2γj−1))m_j=\ln((2\gamma_j+1)/(2\gamma_j-1))mj​=ln((2γj​+1)/(2γj​−1)). The symmetric covariance has the half-covariance form with nonnegative correlations and (m−kq)(m−kp)=1(m-k_q)(m-k_p)=1(m−kq​)(m−kp​)=1. In the strict chart each triangular covariance has standard form with positive c1,c2c_1,c_2c1​,c2​ and a/b=c1/c2a/b=c_1/c_2a/b=c1​/c2​ or a/b=c2/c1a/b=c_2/c_1a/b=c2​/c1​. These are constructed families, with no type-III same-type minimizer assertion. 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.3,9, (39) and following display: two exceptional triangular
border constructions and the symmetric border family. The numerators contain
delta^2, whereas the diagonal fractions contain delta. These are candidate
families, not a same-type minimizer theorem for a type-III input. -/
theorem type_iii_iv_borders (gA gB : ℝ) (hA : 1 / 2 ≤ gA) (hB : 1 / 2 ≤ gB) :
    (∀ Sq ∈ ({exceptionalLower gA gB, exceptionalUpper gA gB,
        symmetricBorderQ gA gB} : Set (Matrix Two Two ℝ)),
      IsSymplecticMatrix (symplecticLift Sq) ∧ IsPhysicalCovariance (borderCMFrom Sq gA gB) ∧
      CovBorder (borderCMFrom Sq gA gB) ∧
      (1 / 2 < gA → 1 / 2 < gB →
        GaussianEM (borderCMFrom Sq gA gB) (emFrom (symplecticLift Sq) (pairValues gA gB)))) ∧
    (∃ m kq kp : ℝ, 0 ≤ kq ∧ 0 ≤ kp ∧
      borderCMFrom (symmetricBorderQ gA gB) gA gB = symmetricCM m kq kp ∧
      (m - kq) * (m - kp) = 1) ∧
    (1 / 2 < gA → 1 / 2 < gB →
      ∀ Sq ∈ ({exceptionalLower gA gB, exceptionalUpper gA gB} : Set (Matrix Two Two ℝ)),
        ∃ a b c1 c2 : ℝ, 0 < c1 ∧ 0 < c2 ∧
          borderCMFrom Sq gA gB = standardCM a b c1 c2 ∧
          (a / b = c1 / c2 ∨ a / b = c2 / c1)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P46

end
Source
Gaussian relative entropy of entanglement, arXiv:quant-ph/0402109v3, PDF p. 9, §5, Eq. (39) and following display: exceptional and symmetric border constructions
Read-back

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

For every pair of real numbers gA,gB≥12g_A,g_B\ge\frac12gA​,gB​≥21​, order the two singleton mode labels as A,BA,BA,B, set J=(0I2−I20)J=\begin{pmatrix}0&I_2\\-I_2&0\end{pmatrix}J=(0−I2​​I2​0​), N(a,b)=diag⁡(a,b,a,b)N(a,b)=\operatorname{diag}(a,b,a,b)N(a,b)=diag(a,b,a,b), d=(gA2−14)(gB2−14)d=(g_A^2-\frac14)(g_B^2-\frac14)d=(gA2​−41​)(gB2​−41​), and define

Q−=((1+d/gA2)1/40(d2gA2(gB2+d))1/4(gB2gB2+d)1/4),Q+=((gA2gA2+d)1/4(d2gB2(gA2+d))1/40(1+d/gB2)1/4),Qs=12(111−1)diag⁡ ⁣((4gA2(4gB2+1)4gA2+1)1/4,(4gB2+14gB2(4gA2+1))1/4),L(Q)=diag⁡(Q,(QT)−1),α(Q)=L(Q)N(gA,gB)L(Q)T,M(Q)=(L(Q)T)−1N ⁣(log⁡2gA+12gA−1,log⁡2gB+12gB−1)L(Q)−1,Std⁡(a,b,c1,c2)=diag⁡ ⁣((ac1c1b),(a−c2−c2b)),Sym⁡(m,kq,kp)=Std⁡(m/2,m/2,kq/2,kp/2).\begin{gathered} Q_-= \begin{pmatrix} (1+d/g_A^2)^{1/4}&0\\ \left(\dfrac{d^2}{g_A^2(g_B^2+d)}\right)^{1/4}& \left(\dfrac{g_B^2}{g_B^2+d}\right)^{1/4} \end{pmatrix},\qquad Q_+= \begin{pmatrix} \left(\dfrac{g_A^2}{g_A^2+d}\right)^{1/4}& \left(\dfrac{d^2}{g_B^2(g_A^2+d)}\right)^{1/4}\\ 0&(1+d/g_B^2)^{1/4} \end{pmatrix},\\ Q_s=\frac1{\sqrt2} \begin{pmatrix}1&1\\1&-1\end{pmatrix} \operatorname{diag}\!\left( \left(\frac{4g_A^2(4g_B^2+1)}{4g_A^2+1}\right)^{1/4}, \left(\frac{4g_B^2+1}{4g_B^2(4g_A^2+1)}\right)^{1/4}\right),\\ L(Q)=\operatorname{diag}(Q,(Q^{\mathsf T})^{-1}),\qquad \alpha(Q)=L(Q)N(g_A,g_B)L(Q)^{\mathsf T},\\ M(Q)=(L(Q)^{\mathsf T})^{-1} N\!\left(\log\frac{2g_A+1}{2g_A-1}, \log\frac{2g_B+1}{2g_B-1}\right)L(Q)^{-1},\\ \operatorname{Std}(a,b,c_1,c_2) =\operatorname{diag}\!\left( \begin{pmatrix}a&c_1\\c_1&b\end{pmatrix}, \begin{pmatrix}a&-c_2\\-c_2&b\end{pmatrix}\right),\qquad \operatorname{Sym}(m,k_q,k_p) =\operatorname{Std}(m/2,m/2,k_q/2,k_p/2). \end{gathered}Q−​=​(1+d/gA2​)1/4(gA2​(gB2​+d)d2​)1/4​0(gB2​+dgB2​​)1/4​​,Q+​=​(gA2​+dgA2​​)1/40​(gB2​(gA2​+d)d2​)1/4(1+d/gB2​)1/4​​,Qs​=2​1​(11​1−1​)diag((4gA2​+14gA2​(4gB2​+1)​)1/4,(4gB2​(4gA2​+1)4gB2​+1​)1/4),L(Q)=diag(Q,(QT)−1),α(Q)=L(Q)N(gA​,gB​)L(Q)T,M(Q)=(L(Q)T)−1N(log2gA​−12gA​+1​,log2gB​−12gB​+1​)L(Q)−1,Std(a,b,c1​,c2​)=diag((ac1​​c1​b​),(a−c2​​−c2​b​)),Sym(m,kq​,kp​)=Std(m/2,m/2,kq​/2,kp​/2).​

All displayed fourth powers mean the real-power operation in the definitions. A physical covariance α\alphaα means αT=α\alpha^{\mathsf T}=\alphaαT=α and α−i2J\alpha-\frac i2Jα−2i​J is positive semidefinite; a symplectic matrix SSS means that SSS is invertible and SJST=JSJS^{\mathsf T}=JSJST=J. To specify the state predicates, a density kernel on a countable label set Λ\LambdaΛ admits an expansion ρab=∑nun(a)vn(b)‾\rho_{ab}=\sum_nu_n(a)\overline{v_n(b)}ρab​=∑n​un​(a)vn​(b)​, with un,vn∈ℓ2(Λ)u_n,v_n\in\ell^2(\Lambda)un​,vn​∈ℓ2(Λ) and ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞, has real nonnegative finite quadratic forms, and has summable real diagonal of sum 111. Define the trace size of a kernel as the infimum of its nuclear-expansion costs in [0,∞][0,\infty][0,∞], and call a bipartite density kernel separable if, for every ε>0\varepsilon>0ε>0, it lies within trace size <ε<\varepsilon<ε of the real convex hull of product density kernels. For occupation labels, define the Weyl kernel as the modewise product of

D(z)mn=e−∣z∣2/2m! n!∑h=0min⁡(m,n)zm−h(−z‾)n−hh! (m−h)! (n−h)!,zj=−ξqj+iξpj2,D(z)_{mn}=e^{-|z|^2/2}\sqrt{m!\,n!} \sum_{h=0}^{\min(m,n)} \frac{z^{m-h}(-\overline z)^{n-h}}{h!\,(m-h)!\,(n-h)!}, \qquad z_j=-\frac{\xi_{q_j}+i\xi_{p_j}}{\sqrt2},D(z)mn​=e−∣z∣2/2m!n!​h=0∑min(m,n)​h!(m−h)!(n−h)!zm−h(−z)n−h​,zj​=−2​ξqj​​+iξpj​​​,

using the product of the two parties’ kernels in the bipartite case. Write H(ρ,a,β)\mathcal H(\rho,a,\beta)H(ρ,a,β) when β\betaβ is physical, every inner and outer series in ∑u∑vρuvW(ξ)vu\sum_u\sum_v\rho_{uv}W(\xi)_{vu}∑u​∑v​ρuv​W(ξ)vu​ is summable, and, for every ξ\xiξ, this sum equals exp⁡(−12ξTJTβJξ+iξTJa)\exp(-\frac12\xi^{\mathsf T}J^{\mathsf T}\beta J\xi+i\xi^{\mathsf T}Ja)exp(−21​ξTJTβJξ+iξTJa). The predicate B(α)\mathcal B(\alpha)B(α) means that there exists a state ρ\rhoρ with H(ρ,0,α)\mathcal H(\rho,0,\alpha)H(ρ,0,α) which is separable and for which there exist a0,β0a_0,\beta_0a0​,β0​ with H(ρ,a0,β0)\mathcal H(\rho,a_0,\beta_0)H(ρ,a0​,β0​) such that every ε>0\varepsilon>0ε>0 admits a nonseparable state τ\tauτ and a matrix β\betaβ with H(τ,a0,β)\mathcal H(\tau,a_0,\beta)H(τ,a0​,β) and ∣βij−(β0)ij∣<ε|\beta_{ij}-(\beta_0)_{ij}|<\varepsilon∣βij​−(β0​)ij​∣<ε for every entry. The predicate E(α,M)\mathcal E(\alpha,M)E(α,M) means that there exist an invertible symplectic TTT and mode values hj>12h_j>\frac12hj​>21​ with α=TN(h)TT\alpha=T N(h)T^{\mathsf T}α=TN(h)TT and M=(TT)−1N(log⁡((2h+1)/(2h−1)))T−1M=(T^{\mathsf T})^{-1}N(\log((2h+1)/(2h-1)))T^{-1}M=(TT)−1N(log((2h+1)/(2h−1)))T−1, and that every centered Gaussian density kernel with covariance α\alphaα, on joint occupation-function labels, admits a representation CU(Gm)C_U(G_m)CU​(Gm​) with mj>0m_j>0mj​>0, Gm(u,v)=1u=v∏j(1−e−mj)e−mjujG_m(u,v)=\mathbf1_{u=v}\prod_j(1-e^{-m_j})e^{-m_ju_j}Gm​(u,v)=1u=v​∏j​(1−e−mj​)e−mj​uj​, a unitary UUU, and an invertible symplectic T0T_0T0​ such that M=(T0T)−1N(m)T0−1M=(T_0^{\mathsf T})^{-1}N(m)T_0^{-1}M=(T0T​)−1N(m)T0−1​ and CU∗(W(ξ))=W(−JT0TJξ)C_{U^*}(W(\xi))=W(-JT_0^{\mathsf T}J\xi)CU∗​(W(ξ))=W(−JT0T​Jξ) for every ξ\xiξ. Here NNN repeats a mode diagonal in both quadrature blocks and CU(K)ij=∑aUia(∑bKabUjb‾)C_U(K)_{ij}=\sum_aU_{ia}(\sum_bK_{ab}\overline{U_{jb}})CU​(K)ij​=∑a​Uia​(∑b​Kab​Ujb​​). With these definitions, the theorem asserts simultaneously that

∀Q∈{Q−,Q+,Qs}:L(Q) is symplectic,α(Q) is physical,B(α(Q)),gA>12 and gB>12 ⟹ E(α(Q),M(Q));∃m,kq,kp∈R:kq≥0,kp≥0,α(Qs)=Sym⁡(m,kq,kp),(m−kq)(m−kp)=1;gA>12 and gB>12 ⟹ ∀Q∈{Q−,Q+}, ∃a,b,c1,c2∈R:c1>0,c2>0,α(Q)=Std⁡(a,b,c1,c2),(ab=c1c2 or ab=c2c1).\begin{gathered} \forall Q\in\{Q_-,Q_+,Q_s\}:\quad L(Q)\text{ is symplectic},\quad \alpha(Q)\text{ is physical},\quad \mathcal B(\alpha(Q)),\\ \hspace{15mm} g_A>\tfrac12\ \text{and}\ g_B>\tfrac12 \ \Longrightarrow\ \mathcal E(\alpha(Q),M(Q));\\ \exists m,k_q,k_p\in\mathbb R:\quad k_q\ge0,\quad k_p\ge0,\quad \alpha(Q_s)=\operatorname{Sym}(m,k_q,k_p),\quad (m-k_q)(m-k_p)=1;\\ g_A>\tfrac12\ \text{and}\ g_B>\tfrac12 \ \Longrightarrow\ \forall Q\in\{Q_-,Q_+\},\ \exists a,b,c_1,c_2\in\mathbb R:\\ \hspace{15mm} c_1>0,\quad c_2>0,\quad \alpha(Q)=\operatorname{Std}(a,b,c_1,c_2),\quad \left(\frac ab=\frac{c_1}{c_2} \ \text{or}\ \frac ab=\frac{c_2}{c_1}\right). \end{gathered}∀Q∈{Q−​,Q+​,Qs​}:L(Q) is symplectic,α(Q) is physical,B(α(Q)),gA​>21​ and gB​>21​ ⟹ E(α(Q),M(Q));∃m,kq​,kp​∈R:kq​≥0,kp​≥0,α(Qs​)=Sym(m,kq​,kp​),(m−kq​)(m−kp​)=1;gA​>21​ and gB​>21​ ⟹ ∀Q∈{Q−​,Q+​}, ∃a,b,c1​,c2​∈R:c1​>0,c2​>0,α(Q)=Std(a,b,c1​,c2​),(ba​=c2​c1​​ or ba​=c1​c2​​).​

The finite sets do not require their listed matrices to be distinct. The first two conclusions include the cases gA=12g_A=\frac12gA​=21​ or gB=12g_B=\frac12gB​=21​; only the stated exponential-matrix conclusion and the final standard-form assertion require both strict inequalities. The final assertion explicitly requires positivity only of c1,c2c_1,c_2c1​,c2​, and the assertion about m,kq,kpm,k_q,k_pm,kq​,kp​ explicitly requires nonnegativity only of kq,kpk_q,k_pkq​,kp​.

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