Lemma 2 footnote2: H-limit and attainment
OpenQAlgorithms.Papers.Independent.Gap48.P18.entropy_maximizing_sequences_H_limit_and_attainmentLet be nonempty, closed, and convex with finite entropy supremum . All maximizing sequences have the same limit , and in fact
If for some , then : the common limit is the Gibbs maximizer. This is the explicit strengthening stated in Lemma 2's footnote.
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
/-- Lemma 2 footnote2: H-limit and attainment, arXiv:quant-ph/0510073v2, PDF pp.7.
-/
theorem entropy_maximizing_sequences_H_limit_and_attainment {I : Type}
[Countable I] [Nonempty I] (A : Set (State I)) (hA : A.Nonempty)
(hclosed : IsClosed A) (hconvex : CoefficientConvexStates A) (hfinite : entropySup A < ⊤) :
∃! omega : State I, omega ∈ A ∧
(∀ seq : ℕ → State I, (∀ n, seq n ∈ A) →
Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 (entropySup A)) →
Tendsto seq atTop (𝓝 omega) ∧ HConverges seq omega) ∧
((∃ t : ℝ, 0 < t ∧ t < 1 ∧ spectralPowerTrace omega t < ⊤) →
stateEntropyNats omega = entropySup 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 let be a nonempty closed set of states on , with a specified nonemptiness witness, whose coefficient matrices form a convex set over . A state is a complex matrix with a representation , where and , having real nonnegative finite quadratic forms and summable real diagonal of sum . Define as the infimum of these sums over all such representations, with empty infimum , and use the state topology generated by for states and . For finite principal compressions, put
where , and matrix logarithms use continuous functional calculus with the total natural logarithm. Suppose . There exists exactly one state satisfying the following conjunction: ; for every sequence of states with for every and , one has both in the stated state topology and ; and
Here uses continuous functional calculus, and entropy and relative-entropy limits take place in . The uniqueness applies to the entire stated conjunction, and the equality appears under the displayed additional hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.