Proposition 2
OpenQAlgorithms.Papers.Independent.Gap48.P18.entropy_under_H_convergenceLet have finite entropy, and let . If , every sequence H-converging to satisfies
If , every is the entropy limit of some finite-rank sequence H-converging to . This characterizes the spectral obstruction to entropy continuity under H-convergence.
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 2, arXiv:quant-ph/0510073v2, PDF pp.13.
Finite support means finite operator rank, not finite coordinate support. Infinite target entropy is retained. -/
theorem entropy_under_H_convergence {I : Type} [Countable I] [Nonempty I]
(sigma : State I) (hfinite : stateEntropyNats sigma < ⊤) :
(decreaseCoefficient sigma < 1 → ∀ seq : ℕ → State I,
HConverges seq sigma → Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 (stateEntropyNats sigma))) ∧
(decreaseCoefficient sigma = 1 → ∀ h : ℝ≥0∞, stateEntropyNats sigma ≤ h →
∃ seq : ℕ → State I, (∀ n, PositiveFiniteRankState (seq n)) ∧ HConverges seq sigma ∧
Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 h)) := 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 let be a state on . A state here is a complex matrix admitting an expansion with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . For finite principal compressions , define
where , and matrix logarithms use continuous functional calculus with the total natural logarithm. For real , put
where uses continuous functional calculus, and the infimum is in , with empty infimum . Suppose . Two implications hold. First, if , then every sequence of states satisfying also satisfies . Second, if , then for every with , there exists a sequence of states such that and , and, for each , there are a natural number and vectors satisfying
All entropy and relative-entropy limits are in the usual topology of ; is allowed, no uniform bound on is asserted, and the finite representation condition itself imposes no normalization or orthogonality on its vectors.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.