Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 9

Open
QAlgorithms.Papers.Independent.Gap48.P18.convergent_entropy_unbounded_hull_example

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

There exists a trace-norm convergent sequence ρn→ρ∗\rho_n\to\rho_*ρn​→ρ∗​ of states on an infinite-dimensional separable Hilbert space such that every H(ρn)H(\rho_n)H(ρn​) is finite and

H(ρn)→H(ρ∗)<∞,sup⁡ρ∈co⁡‾{ρn}H(ρ)=∞.H(\rho_n)\to H(\rho_*)<\infty,\qquad\sup_{\rho\in\overline{\operatorname{co}}\{\rho_n\}}H(\rho)=\infty.H(ρn​)→H(ρ∗​)<∞,ρ∈co{ρn​}sup​H(ρ)=∞.

Convergence of individual entropies does not provide a bound on the entropy of the closed convex hull.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
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 9, arXiv:quant-ph/0510073v2, PDF pp.43.
 -/
theorem convergent_entropy_unbounded_hull_example {I : Type} [Countable I] [Infinite I] :
    ∃ (seq : ℕ → State I) (rho : State I), Tendsto seq atTop (𝓝 rho) ∧
      (∀ n, stateEntropyNats (seq n) < ⊤) ∧ stateEntropyNats rho < ⊤ ∧
      Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 (stateEntropyNats rho)) ∧
      entropySup (stateClosedConvexHull (Set.range seq)) = ⊤ := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 43, Remark 9
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let III be countable and infinite. A state is a complex matrix XXX admitting Xij=∑rar(i)br(j)‾X_{ij}=\sum_r a_r(i)\overline{b_r(j)}Xij​=∑r​ar​(i)br​(j)​ with ar,br∈ℓ2(I;C)a_r,b_r\in\ell^2(I;\mathbb C)ar​,br​∈ℓ2(I;C) and ∑r∥ar∥∥br∥<∞\sum_r\|a_r\|\|b_r\|<\infty∑r​∥ar​∥∥br​∥<∞, such that every finite quadratic form is real and nonnegative, its real diagonal is summable, and its real diagonal sum is 111. Write T(X)T(X)T(X) for the infimum of such representation sums, with value +∞+\infty+∞ if no representation exists, and give states the topology generated by T(Y−X)<εT(Y-X)<\varepsilonT(Y−X)<ε, for state centers XXX and real ε>0\varepsilon>0ε>0. Define

H(X)=sup⁡s⊆Is finite[rslog⁡rs−Re⁡tr⁡(Xslog⁡Xs)]+,rs=Re⁡tr⁡Xs,H(X)=\sup_{\substack{s\subseteq I\\s\text{ finite}}} \left[ r_s\log r_s-\operatorname{Re}\operatorname{tr}(X_s\log X_s) \right]_+,\qquad r_s=\operatorname{Re}\operatorname{tr}X_s,H(X)=s⊆Is finite​sup​[rs​logrs​−Retr(Xs​logXs​)]+​,rs​=RetrXs​,

where finite principal submatrices include the empty one, [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) takes values in [0,+∞][0,+\infty][0,+∞], and matrix logarithms use continuous functional calculus of the natural logarithm with its total value log⁡0=0\log0=0log0=0. For a state set SSS, let K(S)K(S)K(S) consist of states XXX for which every ε>0\varepsilon>0ε>0 admits a matrix YYY in the real convex hull of the coefficients of SSS with T(X−Y)<εT(X-Y)<\varepsilonT(X−Y)<ε. Then there exist states XnX_nXn​, for all n∈Nn\in\mathbb Nn∈N, and a state ρ\rhoρ, such that

Xn⟶ρ,H(Xn)<+∞ for every n,H(ρ)<+∞,H(Xn)⟶H(ρ),X_n\longrightarrow\rho,\qquad H(X_n)<+\infty\ \text{for every }n,\qquad H(\rho)<+\infty,\qquad H(X_n)\longrightarrow H(\rho),Xn​⟶ρ,H(Xn​)<+∞ for every n,H(ρ)<+∞,H(Xn​)⟶H(ρ),

but sup⁡X∈K({Xn:n∈N})H(X)=+∞\sup_{X\in K(\{X_n:n\in\mathbb N\})}H(X)=+\inftysupX∈K({Xn​:n∈N})​H(X)=+∞. Entropy convergence is in the topology of the extended nonnegative reals, and the final supremum permits individual infinite values.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me