Forward transport of physical local covariance witnesses
OpenQAlgorithms.Papers.Independent.Intakenext100.P68.forwardTransportLet 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.
For each , let and be local CMs of the corresponding block sizes: has modes and has modes at , or modes at . Then
This transports local witnesses forward, without requiring strict positivity or invertibility.
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, Proposition 1, for N=0 and N=k+1 respectively.
Both local witnesses are CMs; singular matrices are included. -/
theorem forwardTransport {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
(g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) :
(∀ (U : Cov n) (V : Cov m), IsCM U → IsCM V → DominatesLocalCovariances g U V →
DominatesLocalCovariances (covarianceStep g) U U) ∧
(∀ (k : ℕ) (U V : Cov n), IsCM U → IsCM V →
DominatesLocalCovariances (tail g k) U V → DominatesLocalCovariances (tail g (k + 1)) U U) := 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 all positive natural numbers , put , and let consist of real blocks with sizes . Define to have entries , , and zero otherwise. Assume
For any real square matrix on , write for the conjunction and . For a block triple of sizes , write
where this last positivity condition is for a real matrix. Define when is not Hermitian, and otherwise apply the reciprocal function to its eigenvalues, assigning zero to a zero eigenvalue. Define to be the zero triple if is not symmetric or is not positive semidefinite; otherwise, putting , define . Let and . The theorem asserts the conjunction
The second assertion includes , so it already applies between the first and second updated triples.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.