Remark 6
OpenQAlgorithms.Papers.Independent.Gap48.P18.bounded_entropy_zero_decrease_continuousLet be a nonempty closed convex set of states, each with zero decrease coefficient. Boundedness of entropy on implies
The Gaussian-state parenthesis in the source is an illustration, not an additional Gaussian theorem.
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
/-- Remark 6, arXiv:quant-ph/0510073v2, PDF pp.35.
-/
theorem bounded_entropy_zero_decrease_continuous {I : Type} [Countable I] [Nonempty I]
(A : Set (State I)) (hA : A.Nonempty) (hclosed : IsClosed A)
(hconvex : CoefficientConvexStates A) (hbounded : entropySup A < ⊤)
(hdecrease : ∀ rho ∈ A, decreaseCoefficient rho = 0) :
FiniteContinuousOn stateEntropyNats 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 a countable nonempty label set and a nonempty closed set of states on , with a specified nonemptiness witness, such that its coefficient matrices form a convex set over . A state is a complex matrix admitting an expansion , where and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Write for the infimum of those sums over all such expansions, with empty infimum ; the state topology is generated by the sets for states and . For a finite principal compression , define
where , the logarithm is natural with , and matrix logarithms use continuous functional calculus. Also define
where uses continuous functional calculus and an empty infimum in is . If and for every , then for every and is continuous in the stated state topology and the usual topology of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.