Remark 1
OpenQAlgorithms.Papers.Independent.Gap48.P18.H_entropy_continuity_domainAmong finite-entropy density states , the maximal domain of sequential entropy continuity for H-convergence is exactly
Equivalently, every sequence with has if and only if . The finite-entropy domain is the one used in Proposition 2.
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 1, arXiv:quant-ph/0510073v2, PDF pp.14.
-/
theorem H_entropy_continuity_domain {I : Type} [Countable I] [Nonempty I]
(sigma : State I) (hfinite : stateEntropyNats sigma < ⊤) :
(∀ seq : ℕ → State I, HConverges seq sigma →
Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 (stateEntropyNats sigma))) ↔
decreaseCoefficient sigma < 1 := 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 state on , meaning a complex matrix with a representation , where and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . For finite principal compressions, define
Here , and logarithms use the total natural logarithm and matrix continuous functional calculus. Define
with functional calculus used for , and with the infimum taken in , where an empty infimum is . Assuming , the following are equivalent: every sequence of states with satisfies ; and . The limits are in , and the first condition quantifies over all sequences of states, without a rank bound or an additional convergence hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.