Lemma 28: lemma 28
ProvedQAlgorithms.Papers.Independent.Bridge50.P50.lemma_28Let be the density operators on a nonzero, finite-dimensional complex Hilbert space of dimension . Logarithms are in bits, is support-aware Umegaki relative entropy, and is relative entropy variance in bits squared. Let be arbitrary and fix a state with . Let be the centered absolute third moment of the log-likelihood ratio of the Nussbaum–Szkoła distributions. There is a finite real constant such that
This is a bound on a classical spectral-law moment, not a noncommutative absolute cube, and requires no closedness of .
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P50
noncomputable section
open scoped Topology BigOperators ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open MeasureTheory Filter Set
namespace QAlgorithms.Papers.Independent.Bridge50.P50
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted primitives; these names do not create local declarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat logTwo testingBeta normalCDF normalQuantile)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble ensembleAverage)
open QAlgorithms.Papers.Independent.Information100.P69 (entropy)
open QAlgorithms.Papers.Independent.Dependency50.P35 (Dominates)
open QAlgorithms.Papers.Independent.Dependency50.P36 (pairInformationVariance)
open QAlgorithms (vnEntropy traceDistance minEigenvalue)
attribute [local instance] QAlgorithms.Papers.Independent.Bridge50.P50.matrixBorelMeasurable
attribute [local instance] QAlgorithms.Papers.Independent.Bridge50.P50.matrixBorelSpace
/-- Lemma 28, PDF p.28: fixed full-rank sigma, no closedness assumption on S. -/
theorem lemma_28 {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
(S : Set (Mat I)) (hS : ∀ rho ∈ S, QAlgorithms.IsDensityMatrix rho)
(sigma : Mat I) (hsigma : QAlgorithms.IsDensityMatrix sigma) (hpos : 0 < minEigenvalue sigma) :
∃ T : ℝ, ∀ rho ∈ S, thirdMoment rho sigma ≤ T := by sorry
end QAlgorithms.Papers.Independent.Bridge50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite, nonempty type with decidable equality, let be any set of density matrices on , and let be a density matrix with strictly positive smallest eigenvalue. For each Hermitian matrix , take the selected spectral data consisting of its real eigenvalues and selected orthonormal eigenvectors ; for a non-Hermitian matrix the spectral-data definition instead assigns all eigenvalues and vector coordinates the value . Given the selected data for and for , put
Define if some has , and otherwise define it as . Let be its conversion to a real number, with converted to , and define
Division by and in these total real expressions have value . There exists a real such that for every . No nonemptiness, closedness, or finiteness assumption is imposed on , and no sign condition is imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.