Finite stopping under a strict local uncertainty margin
OpenQAlgorithms.Papers.Independent.Intakenext100.P68.strictMarginFiniteStoppingLet 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 physical local CMs satisfying . Assume and . Writing , there exists an integer such that
The strict cutoff is a real number, with the displayed retained. This is a finite stopping guarantee for the stated local margin, not for every separable boundary covariance.
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.3, Proposition 3: epsilon is positive as in the preceding paragraph.
The stopping index is N=k+1; the strict real bound and +1 in (8) are retained,
without rounding. Condition (6) is >=iJ, not the proof's >=0 typo. -/
theorem strictMarginFiniteStopping {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
(g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) (U : Cov n) (V : Cov m)
(hU : IsCM U) (hV : IsCM V) (hdom : DominatesLocalCovariances g U V)
(epsilon : ℝ) (hepsilon : 0 < epsilon)
(hmargin : (complexify U - Complex.I • complexify (interleavedJ n) -
(epsilon : ℂ) • (1 : Matrix (QuadratureIndex n) (QuadratureIndex n) ℂ)).PosSemidef) :
∃ k : ℕ, ((k + 1 : ℕ) : ℝ) <
(QAlgorithms.traceNorm (complexify g.A) - 2 * (n : ℝ)) / epsilon + 1 ∧
Uncertainty (lowerWitness (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 a real block triple of sizes . Write , , and embed real matrices entrywise into complex matrices. Assume is symmetric and . Let be real symmetric matrices of sizes satisfying , , and . Let and additionally assume . For a Hermitian matrix , define by spectral functional calculus with , taking , and set for non-Hermitian . For with modes, put and define when is symmetric and , and zero in all blocks otherwise. Set , , and , using the real Euclidean operator norm. Define , with the square root given by continuous functional calculus. Then there exists a natural number , possibly , such that
The bound on is strict.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.