Lemma 27: lemma 27
ProvedQAlgorithms.Papers.Independent.Bridge50.P50.lemma_27Let 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. For any subset and , there is a finite real constant such that
No closedness is required of . The bound is uniform in both states; if the comparison-state domain is empty the universal conclusion is vacuous, as in the source.
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 27, PDF p.27: uniform in rho AND all sigma with the given positive eigenvalue
lower bound. S need not be closed. Empty feasible comparison sets are harmless. -/
theorem lemma_27 {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
(S : Set (Mat I)) (hS : ∀ rho ∈ S, QAlgorithms.IsDensityMatrix rho)
(l0 : ℝ) (hl0 : 0 < l0) :
∃ V : ℝ, ∀ rho ∈ S, ∀ sigma : Mat I, QAlgorithms.IsDensityMatrix sigma →
l0 ≤ minEigenvalue sigma → pairInformationVariance rho sigma ≤ V := 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, and let be any set of complex matrices indexed by , every member of which is positive semidefinite with trace ; need not be nonempty, closed, or finite. Let . For matrix functions interpreted by continuous functional calculus, put
Then there exists a real such that for every and every density matrix whose smallest eigenvalue is at least . Here the smallest eigenvalue is the first entry of the ascending eigenvalue list; the type is nonempty, so that entry exists. No positivity condition is asserted for , and the universal bound is vacuous if is empty or if no density matrix has smallest eigenvalue at least .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.