Proposition 8
OpenQAlgorithms.Papers.Independent.Gap48.P18.optimal_measure_maximal_distanceLet be nonempty and closed with finite capacity. Every optimal Borel probability law on satisfies
For an optimal finite or countable ensemble, the same average identity holds, and the divergence equality holds for every positive-weight signal. This is the maximal-distance characterization; it does not assert equality at every point of the support.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
noncomputable section
open MeasureTheory Filter
open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator
open QAlgorithms.Papers.Independent.Dependency50.P33
(State PureState traceSize traceClosure IsTraceClassChannel productCoeff)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble HasFiniteSupport HasAverage averageCoefficients
extendedEntropyNats extendedRelativeEntropyNats
finiteEnsembleCapacity pureStates)
open QAlgorithms.Papers.Independent.Frontier18.P01 (traceFirst traceSecond)
namespace QAlgorithms.Papers.Independent.Gap48.P18
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Proposition 8, arXiv:quant-ph/0510073v2, PDF pp.39,40.
-/
theorem optimal_measure_maximal_distance {I : Type} [Countable I] [Nonempty I]
(A : Set (State I)) (hA : A.Nonempty) (hclosed : IsClosed A)
(hfinite : setChiCapacity A < ⊤) :
(∀ mu : GeneralizedEnsemble I, OptimalMeasure A mu →
probabilityAverage mu = optimalAverage A hA ∧
∀ᵐ rho ∂(mu : Measure (State I)), stateRelativeEntropyNats rho (optimalAverage A hA) = setChiCapacity A) ∧
(∀ (w : ℕ → ℝ≥0) (rho : ℕ → State I), HasSum w 1 →
(∀ n, rho n ∈ A) → measureHolevo (countableLaw w rho) = setChiCapacity A →
meanCoefficients (countableLaw w rho) = (optimalAverage A hA).coefficients ∧
∀ n, 0 < w n → stateRelativeEntropyNats (rho n) (optimalAverage A hA) = setChiCapacity A) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P18
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be an at most countable, nonempty index set. A state is a complex matrix admitting , with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Let be the infimum of these expansion costs in , with empty infimum ; state topology is generated by , , and measures below use its Borel sets. Define as the supremum over finite principal compressions , including the empty one, of if , and otherwise, where in and . For any measure , put and . Let be nonempty and closed, and suppose , where is the supremum of over probability measures with finite topological support contained in . Define by choosing a state satisfying for all , if one exists, and otherwise choosing a member of . Then every Borel probability measure with -almost every state in and satisfies and
where is supplied by a fixed chosen continuous state-valued barycenter map, with all entries integrable and . In addition, for every sequence of nonnegative real weights whose series sums to , and every sequence of states , if satisfies , then entrywise, and for every with . No corresponding assertion is imposed at indices of zero weight.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.