Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7: continuity of cone entropy approximators

Open
QAlgorithms.Papers.Independent.Support50.P34.lemma7_coneApproximatorContinuous

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

prove2quantum

For an integer k≥1k\ge1k≥1 and a positive trace-class operator AAA, define the cone approximator using all countable positive rank-at-most-kkk ensembles with trace-norm average AAA:

Hk(A)=sup⁡{πi,Ai}: ∑iπiAi=A∑iπiH(Ai).H_k(A)=\sup_{\{\pi_i,A_i\}:\,\sum_i\pi_iA_i=A}\sum_i\pi_iH(A_i).Hk​(A)={πi​,Ai​}:∑i​πi​Ai​=Asup​i∑​πi​H(Ai​).

Then HkH_kHk​ is finite and continuous on the entire positive trace-class cone in trace norm, including its zero operator. This supplies continuous approximants on the unnormalized domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P34
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped ENNReal NNReal BigOperators

namespace QAlgorithms.Papers.Independent.Support50.P34

open QAlgorithms.Papers.Independent.Dependency50.P13
  (State PositiveTraceClass traceNormValue stateTraceNormTopology traceNormTopology
   operatorTrace IsPositive IsTraceClass stateEntropy relativeEntropy entropyWeight)

open QAlgorithms.Papers.Independent.Dependency50.P25 (extendedIntegral)

open QAlgorithms.Papers.Independent.Frontier18.P01 (binaryEntropy)

attribute [local instance] Classical.propDecidable Classical.decEq

section Operators

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

variable {I : Type*}

section Statements

variable [hsep : TopologicalSpace.SeparableSpace H] [hI : Countable I]

include hsep hI

/-- Lemma 7, arXiv:0904.1963v3, PDF p.18: cone approximators are finite and
trace-norm continuous, including the zero operator. -/
theorem lemma7_coneApproximatorContinuous (b : HilbertBasis I ℂ H)
    (k : ℕ) (hk : 0 < k) :
    FiniteEntropyContinuousOn (coneApproximator b k) Set.univ := by sorry

end Statements

end Operators

end QAlgorithms.Papers.Independent.Support50.P34

end
Source
Continuity of the von Neumann entropy, arXiv:0904.1963v3, PDF p. 18, Lemma 7: continuity of cone entropy approximators
Read-back

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

Let HHH be a complete complex inner product space, let b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ be a Hilbert basis, and let kkk be a positive natural number. An operator T:H→HT:H\to HT:H→H is called trace class here if it is continuous and complex linear and admits sequences (ur),(vr)(u_r),(v_r)(ur​),(vr​) such that ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞ and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every xxx. Write τ(T)\tau(T)τ(T) for the real conversion of the infimum, over these representations, of ∑rofReal⁡(∥ur∥∥vr∥)\sum_r\operatorname{ofReal}(\|u_r\|\|v_r\|)∑r​ofReal(∥ur​∥∥vr​∥), where ofReal⁡(a)=max⁡(a,0)\operatorname{ofReal}(a)=\max(a,0)ofReal(a)=max(a,0) regarded as an extended nonnegative real. Let C\mathcal CC consist of such operators satisfying T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx, with the topology generated by the functions T↦τ(T−S)T\mapsto\tau(T-S)T↦τ(T−S) for all trace-class SSS. Put tr⁡bT=∑i⟨bi,Tbi⟩\operatorname{tr}_bT=\sum_i\langle b_i,Tb_i\rangletrb​T=∑i​⟨bi​,Tbi​⟩, e(x)=−xlog⁡xe(x)=-x\log xe(x)=−xlogx, and

Eb(T)=ofReal⁡(t)∑iofReal⁡ ⁣(Re⁡⟨bi,e(t−1T)bi⟩),t=Re⁡tr⁡bT,E_b(T)=\operatorname{ofReal}(t)\sum_i\operatorname{ofReal}\!\left(\operatorname{Re}\langle b_i,e(t^{-1}T)b_i\rangle\right), \qquad t=\operatorname{Re}\operatorname{tr}_bT,Eb​(T)=ofReal(t)i∑​ofReal(Re⟨bi​,e(t−1T)bi​⟩),t=Retrb​T,

where e(t−1T)e(t^{-1}T)e(t−1T) uses continuous functional calculus and 0−1=00^{-1}=00−1=0. For T∈CT\in\mathcal CT∈C, define Eb,k(T)E_{b,k}(T)Eb,k​(T) as the supremum of ∑iofReal⁡(wi)Eb(Ti)\sum_i\operatorname{ofReal}(w_i)E_b(T_i)∑i​ofReal(wi​)Eb​(Ti​) over sequences Ti∈CT_i\in\mathcal CTi​∈C and nonnegative summable real weights wiw_iwi​ with ∑iwi=1\sum_iw_i=1∑i​wi​=1, such that each TiT_iTi​ has range contained in the span of kkk vectors and τ(∑i<nwiTi−T)→0\tau(\sum_{i<n}w_iT_i-T)\to0τ(∑i<n​wi​Ti​−T)→0. Then Eb,k(T)<∞E_{b,k}(T)<\inftyEb,k​(T)<∞ for every T∈CT\in\mathcal CT∈C, and T↦Eb,k(T)realT\mapsto E_{b,k}(T)^{\mathrm{real}}T↦Eb,k​(T)real is continuous on all of C\mathcal CC. The supremum of an empty family is 000; the zero operator is included, and the assertion excludes k=0k=0k=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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