Two separability certificates along the Gaussian covariance iteration
OpenQAlgorithms.Papers.Independent.Intakenext100.P68.separabilityCriterionLet be finite local mode counts, with interleaved quadratures , , and doubled covariance . Thus vacuum covariance is . Put . A covariance matrix (CM) is real symmetric and satisfies . All inequalities below are Loewner inequalities.
Let be a physical CM. Construct the sequence as follows: a nonphysical matrix is followed by zero; otherwise put , , and . All inverses are spectral Moore–Penrose inverses. Every positive-index matrix has split . Set for , where the norm is Euclidean induced. Separability always means the trace-norm closed convex hull of full oscillator product densities, independently of covariance witness inequalities.
Let be any actual normalized Gaussian density of covariance and arbitrary first moments. Then both implications hold:
These are sound rejection and acceptance certificates. They do not assert finite termination for every input.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P68
noncomputable section
open MeasureTheory Filter
open scoped BigOperators Topology ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P68
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P33
(State PureState IsSeparable IsBarycenter productCoeff)
open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)
open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)
open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
/-- PDF p.2, Theorem 1, BOTH certificates, for an actual normalized Gaussian
input with arbitrary first moments. Tail k means N=k+1 >= 1. No termination,
invertibility, local-witness-existence or separability assumption is added. -/
theorem separabilityCriterion {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
(g : CovarianceBlocks n m) (rho : State (Occupation (Fin n) × Occupation (Fin m)))
(d : QuadratureIndex n ⊕ QuadratureIndex m → ℝ) (hG : HasGaussianCovariance rho g d) :
((∃ k : ℕ, ¬ Uncertainty (tail g k).A) → ¬ IsSeparable rho.coefficients) ∧
((∃ k : ℕ, Uncertainty (lowerWitness (tail g k))) →
IsSeparable rho.coefficients) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P68
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural numbers , put , , and . Take arbitrary real blocks of sizes , a state with kernel on , and a real vector on . A state kernel on any label set here admits an expansion with and , has real nonnegative quadratic forms on every finite subset, and has summable real diagonal of sum one. Define by same-mode entries , , with other entries zero. Assume G=\begin{psmallmatrix}A&C\\C^{\mathsf T}&B\end{psmallmatrix} is symmetric and . Reorder into by putting all coordinate- entries before all coordinate- entries, and set \Omega=\begin{psmallmatrix}0&I\\-I&0\end{psmallmatrix}. The remaining Gaussian hypothesis is that for every real vector in this grouped order, with , the inner and outer series below are summable and satisfy
where is the product over both subsystems’ modes of
at the corresponding occupation indices. To define the iteration, call a block triple physical when its full block matrix is symmetric and its complexification minus times the corresponding -block sum is positive semidefinite. Let for non-Hermitian , and otherwise obtain by taking reciprocal eigenvalues with . Set as a triple when is not physical; otherwise set
Put , , and write , whose blocks are all on . The theorem asserts both implications
Here is its Euclidean operator norm, and “separable” means that for every , some finite convex combination of product kernels , with state kernels on , satisfies ; is the infimum in of over the summable expansions of described above. The existential iteration index includes , which refers to the first updated triple .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.