Lemma 20: lemma 20
ProvedQAlgorithms.Papers.Independent.Bridge50.P50.lemma_20Let 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 nonempty and closed. Write for its divergence radius, for its selected divergence center, for its peripheral states, and for the probability measures supported on with barycenter . Probability measures are Borel measures, with the weak topology. Fix , factors and . Let . If , there is such that
Both inequalities are strict. This extracts many components separated from the peripheral set.
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 20, PDF pp.20,30: both inequalities are strict and n is positive. -/
theorem lemma_20 {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
(S : Set (Mat I)) (hS : ClosedStateSet S) (n : ℕ) (hn : 1 ≤ n)
(rho : Fin n → Mat I) (hrho : ∀ i, rho i ∈ S)
(nu : ℝ) (hnu : 0 < nu ∧ nu < 1) (hbad : ¬ OmegaOne S nu rho) :
∃ Xi : Finset (Fin n), (n : ℝ) * nu / 2 < Xi.card ∧
∀ i ∈ Xi, nu/2 < peripheralDistance S (rho i) := 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 a nonempty, closed set of complex matrices indexed by , every member of which is positive semidefinite with trace . Write for the set of such density matrices. For matrices , define to be unless both are density matrices and ; otherwise, define it as the nonnegative part of , divided by , where and matrix functions use continuous functional calculus. Put and . Let be the selected density matrix satisfying , if any exists, and the zero matrix otherwise; define and
The square root here uses continuous functional calculus, and the real infimum is if its indexing set is empty. For every natural number , every family in , and every real , if it is false that , then there exists a set such that
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.