Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2

Open
QAlgorithms.Papers.Independent.Gap48.P18.entropy_under_H_convergence

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

prove2quantum

Let σ\sigmaσ have finite entropy, and let dc⁡(σ)=inf⁡{t>0:Tr⁡σt<∞}\operatorname{dc}(\sigma)=\inf\{t>0:\operatorname{Tr}\sigma^t<\infty\}dc(σ)=inf{t>0:Trσt<∞}. If dc⁡(σ)<1\operatorname{dc}(\sigma)<1dc(σ)<1, every sequence H-converging to σ\sigmaσ satisfies

D(ρn∥σ)→0⟹H(ρn)→H(σ).D(\rho_n\|\sigma)\to0\quad\Longrightarrow\quad H(\rho_n)\to H(\sigma).D(ρn​∥σ)→0⟹H(ρn​)→H(σ).

If dc⁡(σ)=1\operatorname{dc}(\sigma)=1dc(σ)=1, every h∈[H(σ),∞]h\in[H(\sigma),\infty]h∈[H(σ),∞] is the entropy limit of some finite-rank sequence H-converging to σ\sigmaσ. This characterizes the spectral obstruction to entropy continuity under H-convergence.

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

/-- 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
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 13, Proposition 2
Read-back

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

Let III be a countable nonempty label set, and let σ\sigmaσ be a state on III. A state here is a complex matrix XXX admitting an expansion Xij=∑aua(i)va(j)‾X_{ij}=\sum_a u_a(i)\overline{v_a(j)}Xij​=∑a​ua​(i)va​(j)​ with ua,va∈ℓ2(I;C)u_a,v_a\in\ell^2(I;\mathbb C)ua​,va​∈ℓ2(I;C) and ∑a∥ua∥2∥va∥2<∞\sum_a\|u_a\|_2\|v_a\|_2<\infty∑a​∥ua​∥2​∥va​∥2​<∞, whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum 111. For finite principal compressions Xs,YsX_s,Y_sXs​,Ys​, define

H(X)=sup⁡s finite[(ℜtr⁡Xs)log⁡(ℜtr⁡Xs)−ℜtr⁡(Xslog⁡Xs)]+,D(X∥Y)=sup⁡s finite{[ℜtr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+,ker⁡Ys⊆ker⁡Xs,+∞,otherwise,H(X)=\sup_{s\text{ finite}} \bigl[(\Re\operatorname{tr}X_s)\log(\Re\operatorname{tr}X_s) -\Re\operatorname{tr}(X_s\log X_s)\bigr]_+, \quad D(X\|Y)=\sup_{s\text{ finite}} \begin{cases} \bigl[\Re\operatorname{tr}(X_s\log X_s-X_s\log Y_s+Y_s-X_s)\bigr]_+, &\ker Y_s\subseteq\ker X_s,\\ +\infty,&\text{otherwise}, \end{cases}H(X)=s finitesup​[(ℜtrXs​)log(ℜtrXs​)−ℜtr(Xs​logXs​)]+​,D(X∥Y)=s finitesup​{[ℜtr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​,+∞,​kerYs​⊆kerXs​,otherwise,​

where [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0), and matrix logarithms use continuous functional calculus with the total natural logarithm. For real ttt, put

Tσ(t)=sup⁡s finite[ℜtr⁡(ft(σs))]+,ft(x)={0,x=0,xt,x≠0,d(σ)=inf⁡t∈Rt>0, Tσ(t)<+∞t,T_\sigma(t)=\sup_{s\text{ finite}} \left[\Re\operatorname{tr}\bigl(f_t(\sigma_s)\bigr)\right]_+, \qquad f_t(x)= \begin{cases}0,&x=0,\\x^t,&x\ne0,\end{cases} \qquad d(\sigma)=\inf_{\substack{t\in\mathbb R\\t>0,\ T_\sigma(t)<+\infty}}t,Tσ​(t)=s finitesup​[ℜtr(ft​(σs​))]+​,ft​(x)={0,xt,​x=0,x=0,​d(σ)=t∈Rt>0, Tσ​(t)<+∞​inf​t,

where ft(σs)f_t(\sigma_s)ft​(σs​) uses continuous functional calculus, and the infimum is in [0,∞][0,\infty][0,∞], with empty infimum +∞+\infty+∞. Suppose H(σ)<+∞H(\sigma)<+\inftyH(σ)<+∞. Two implications hold. First, if d(σ)<1d(\sigma)<1d(σ)<1, then every sequence of states ρn\rho_nρn​ satisfying D(ρn∥σ)→0D(\rho_n\|\sigma)\to0D(ρn​∥σ)→0 also satisfies H(ρn)→H(σ)H(\rho_n)\to H(\sigma)H(ρn​)→H(σ). Second, if d(σ)=1d(\sigma)=1d(σ)=1, then for every h∈[0,∞]h\in[0,\infty]h∈[0,∞] with H(σ)≤hH(\sigma)\le hH(σ)≤h, there exists a sequence of states ρn\rho_nρn​ such that D(ρn∥σ)→0D(\rho_n\|\sigma)\to0D(ρn​∥σ)→0 and H(ρn)→hH(\rho_n)\to hH(ρn​)→h, and, for each nnn, there are a natural number rnr_nrn​ and vectors vn,0,…,vn,rn−1∈ℓ2(I;C)v_{n,0},\ldots,v_{n,r_n-1}\in\ell^2(I;\mathbb C)vn,0​,…,vn,rn​−1​∈ℓ2(I;C) satisfying

(ρn)ij=∑a=0rn−1vn,a(i)vn,a(j)‾for every i,j.(\rho_n)_{ij}=\sum_{a=0}^{r_n-1}v_{n,a}(i)\overline{v_{n,a}(j)} \quad\text{for every }i,j.(ρn​)ij​=a=0∑rn​−1​vn,a​(i)vn,a​(j)​for every i,j.

All entropy and relative-entropy limits are in the usual topology of [0,∞][0,\infty][0,∞]; h=+∞h=+\inftyh=+∞ is allowed, no uniform bound on rnr_nrn​ is asserted, and the finite representation condition itself imposes no normalization or orthogonality on its vectors.

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