Proposition 2: equal determinant, positive-noise one-mode factors
OpenQAlgorithms.Papers.Independent.Support50.P28.equal_determinants_multiplicativeConsider finitely many complete bosonic modes, with no photon cutoff or energy constraint. Covariances use the interleaved coordinates , , and doubled vacuum covariance . A centered Gaussian channel is an actual completely positive trace-preserving map, with covariance action and , where are real, , and .
Write for the normalized centered Gaussian densities and, for real , put . For a finite channel family, multiplicativity means equality of the joint Gaussian-input supremum to the product of the factor suprema; joint inputs may be entangled.
Let and let be single-mode Gaussian channels. Assume that every is positive definite in the Loewner sense and that for all . Then for every real ,
The common determinant may be positive, negative, or zero. This extends multiplicativity from identical channels to different one-mode factors with equal determinants; no invertibility assumption is added.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P28
noncomputable section
open scoped BigOperators ENNReal ComplexOrder Matrix
namespace QAlgorithms.Papers.Independent.Support50.P28
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsTraceClassChannel rankOne)
open QAlgorithms.Papers.Independent.Claimed50.P47
(Occupation gaussianStateCharacteristic singleCharacteristic weylKernel)
open QAlgorithms.Papers.Independent.Claimed50.P30 (phiMinus)
/-- PDF pp.6--7, Proposition 2: strict Loewner positivity of every noise matrix
and equality of the REAL determinants; the common determinant may be zero or negative. -/
theorem equal_determinants_multiplicative {r : ℕ} (hr : 0 < r)
(E : Fin r → CenteredOscillatorChannel (Fin 1))
(hY : ∀ i, (E i).Y.PosDef) (hX : ∀ i j, (E i).X.det = (E j).X.det)
(p : ℝ) (hp : 1 < p) : GaussianPurityMultiplicative p E := by sorry
end QAlgorithms.Papers.Independent.Support50.P28
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let be real, and let , , be centered one-mode oscillator channels. Assume each real matrix is positive definite and for every ; the common determinant is allowed to be zero or negative. Here nuclear matrices on have representations with and , and states are nuclear matrices with real nonnegative finite quadratic forms and summable real diagonal of sum . For a finite mode set , let , , and
The set consists of states for which a real symmetric satisfies and, for every , the inner and outer characteristic series are summable and . A centered oscillator channel requires , , a matrix map preserving nuclear matrices and additive and complex homogeneous on them, and state preservation by every finite blockwise extension, with the size requirement vacuous. Its output assignment is state-valued with coefficients , summable output characteristic series, and
for every input state. Choose a bounded operator with coordinate coefficients if one exists, and otherwise, and put
using continuous functional calculus powers and in . On the combined mode set , let apply blocks successively in increasing order, with
Then the asserted conclusion is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.