Separability is invariant at every positive iteration
OpenQAlgorithms.Papers.Independent.Intakenext100.P68.separabilityInvarianceLet 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.
Say that a bipartite covariance is separable when it is the covariance of some actual normalized separable Gaussian density, with arbitrary first moments. For every individual ,
The right-hand side includes validity as a physical covariance. This relates the constructed iterates to full state separability rather than defining separability by matrix witnesses.
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 immediately above Thm.1: separability of actual Gaussian densities
is invariant at every individual positive iteration, including physicality. -/
theorem separabilityInvariance {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
(g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) :
∀ k : ℕ, SeparableCM g ↔ SeparableCM (tail g k) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P68
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers and let be a real block triple of sizes . For each , let , and for a triple with modes let . Assume is symmetric and , using entrywise complexification. Define to be the Hermitian spectral functional calculus , with , or zero if is not Hermitian. Define , and define when is symmetric and , and otherwise. Set , . The separability condition on any such means the following explicit existence statement. There are a coefficient matrix indexed by and a real vector indexed by the two interleaved coordinates of every mode, such that is a density matrix, is symmetric, , and has the Gaussian characteristic function specified below and is approximable by finite convex combinations of product density matrices in the gauge specified below. A density matrix on an index set means a matrix admitting an expansion with and , such that every finite quadratic form is real and nonnegative, and the real diagonal is summable with sum . For any matrix , let be the infimum, over all such expansions of , of , valued in , with value when there is no expansion. The approximation requirement is that for every there is a finite convex combination of matrices , with density matrices on , such that . To specify the characteristic function, define
For an interleaved real vector , let be the product, over all first and second subsystem modes, of . For every , each inner sum and the outer sum in must be summable, and, writing , they must satisfy . With this meaning of the separability condition, the declaration says that for every natural number , including , the condition holds for if and only if it holds for , whose subsystem sizes are .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.